AHSWN HomeIssue Contents

Directional Neighbor Selection Game in Wireless Ad Hoc Networks
Sajjad Zarifzadeh and Nasser Yazdani

In wireless ad hoc networks, nodes may behave selfishly in running network protocols to save their energy resources as much as possible. On the other hand, it has been shown that the topology of an ad hoc network has a significant impact on the energy usage of nodes. In this paper, we consider the “Directional Neighbor Selection” game in which each wireless node tries to selfishly choose its neighborhood such that its own energy consumption becomes optimized. Unlike all previous games, nodes are permitted to establish directional links to their neighbors. We propose a couple of distributed algorithms for finding stable topologies using two kinds of global and local connectivity information. The results of our simulations confirm that the capability of forming directional links can significantly help to achieve more efficient topologies in the presence of selfish nodes.

Keywords: Wireless ad hoc networks, energy efficiency, neighbor selection, game theory, selfish nodes, directional links

Full Text (IP)