Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Effect of Selfish Node Behavior on Efficient Topology Design
IEEE Transactions on Mobile Computing
Maximizing network lifetime based on transmission range adjustment in wireless sensor networks
Computer Communications
A game theoretical algorithm for joint power and topology control in distributed WSN
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
A Game Theoretic Framework for Power Control in Wireless Sensor Networks
IEEE Transactions on Computers
Energy-efficient distributed clustering in wireless sensor networks
Journal of Parallel and Distributed Computing
Design and analysis of an MST-based topology control algorithm
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Neighbor Selection Game in Wireless Ad Hoc Networks
Wireless Personal Communications: An International Journal
Joint Algorithm of Channel Allocation and Power Control in Multi-channel Wireless Sensor Network
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In topology control (TC), game theory is an efficient approach to analyze the conflicting objectives of nodes to enable the topology with certain global properties in the presence of selfish nodes. But in many existing game-based TC algorithms, every node has to make others aware of its changes by transmitting the control information repeatedly, which results in much unnecessary energy waste and network lifetime reduction. To solve the problem, the concept of virtual game is introduced, which virtualizes the game process to avoid the repeated information exchange in the game process. In addition, considering that unbalanced distribution of energy consumption also restricts the network lifetime, a distributed Virtual Game-based Energy Balanced TC algorithm (VGEB) with incomplete information is proposed, which is mathematically analyzed. The analysis results show that the TC virtual game is a potential game and the virtual game algorithm can converge to the state of Nash Equilibrium, which is Pareto Optimal. Moreover, VGEB can easily construct the topology with a low information complexity of O(n) and the induced topology can maintain the network connectivity, where n is the number of nodes in network. Simulation results demonstrate that VGEB can effectively balance the nodes' energy consumption, greatly reduce the energy waste in the game process and has many other attractive topological features.