Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 5 figues, submitted to Gamecomm 2011

Scientific paper

In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jamming the nodes of the other team. The agents have constraints on their total energy and instantaneous power usage. The cost function is the difference between the rates of erroneously transmitted bits of each team. We model the problem as a zero-sum differential game between the two teams and use {\it{Isaacs'}} approach to obtain the necessary conditions for the optimal trajectories. This leads to a continuous-kernel power allocation game among the players. Based on the communications model, we present sufficient conditions on the physical parameters of the agents for the existence of a pure strategy Nash equilibrium (PSNE). Finally, we present simulation results for the case when the agents are holonomic.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-648672

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.