Introduction to algorithms
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A power control MAC protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
CDMA-based MAC protocol for wireless ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Localized topology control algorithms for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Truthful Topology Control inWireless Ad Hoc Networks with Selfish Nodes
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Strategyproof mechanisms towards dynamic topology formation in autonomous networks
Mobile Networks and Applications
A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Efficient construction of network topology to conserve energy in wireless ad hoc networks
Computer Communications
Effect of Selfish Node Behavior on Efficient Topology Design
IEEE Transactions on Mobile Computing
Joint range assignment and routing to conserve energy in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analyzing selfish topology control in multi-radio multi-channel multi-hop wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The price of ignorance: distributed topology control in cognitive networks
IEEE Transactions on Wireless Communications
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Neighbor Selection Game in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In wireless ad hoc networks there is no fixed infrastructure or centralized controller to enforce cooperation between nodes. Therefore, nodes may act selfishly in running network protocols for conserving their own energy resources. In this paper, we consider the ''topology control (TC) game'' as the problem of creating an energy-efficient topology in wireless ad hoc networks in the presence of selfish nodes. We define a new TC game in which nodes are able to dynamically adjust their transmission power in a per-packet manner, and try to minimize their energy usage through considering both traffic load and transmission power parameters. After analyzing the problem, we propose several algorithms to find stable topologies in an environment composed of selfish nodes, using two types of global and local connectivity information. Finally, we evaluate the performance of the proposed algorithms by simulations. Our simulation results show that using appropriate local information can interestingly result in more efficient topologies than global information.