By Topic

Efficient node distribution techniques in mobile ad hoc networks using game theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Kusyk, J. ; Grad. Center, City Univ. of New York, New York, NY, USA ; Umit Uyar, M. ; Sahin, C.S. ; Urrea, E.
more authors

Self deployment of nodes in mobile ad hoc networks (MANETs) is a challenging task due to the characteristics of a MANET such as dynamically changing topology, lack of centralized authority, decentralized architecture and heterogeneous nodes. In military applications where the deployed nodes, due to their limited communication ranges and hostile environment, may act selfishly with conflicting individual interests among their neighbors, game-theoretic approaches become relevant. Using our distributed game (NSPG-G1) for MANET nodes to position themselves in an unknown geographical terrain to maximize the area coverage, we show that, combined with a distributed genetic algorithm (GA) to determine the next best location to move, NSPG-G1 can provide a near uniform node spreading. In this distributed and scalable game participated by the neighboring nodes autonomously, the decisions about node movements are solely based on localized data about the neighboring nodes while requiring a limited synchronization among a player's closest neighbors.

Published in:

Military Communications Conference, 2009. MILCOM 2009. IEEE

Date of Conference:

18-21 Oct. 2009