A shortest-path-based topology control algorithm in wireless multihop networks

Authors:
Yao Shen;Yunze Cai;Xiaoming Xu
Affiliations:
Shanghai Jiaotong University, Shanghai, China;Shanghai Jiaotong University, Shanghai, China;Shanghai Jiaotong University, Shanghai, China
Venue:
ACM SIGCOMM Computer Communication Review
Year:
2007

Citing 7
Cited 3

Unidirectional links prove costly in wireless ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Localized algorithms for energy efficient topology in wireless ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localized topology control algorithms for heterogeneous wireless networks

IEEE/ACM Transactions on Networking (TON)
A minimum-energy path-preserving topology-control algorithm

IEEE Transactions on Wireless Communications
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications
Localized Delaunay triangulation with application in ad hoc wireless networks

IEEE Transactions on Parallel and Distributed Systems

An emerging technology for improved building automation control

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Energy-aware self-adjusted topology control algorithm for heterogeneous wireless ad hoc networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a shortest-path-based algorithm, called local shortest path(LSP), for topology control in wireless multihop networks. In this algorithm, each node locally computes the shortest paths connecting itself to nearby nodes based on some link weight function, and then it selects all the second nodes on the shortest paths as its logical neighbors in the final topology. Any energy model can be employed in LSP to design the link weight function whose value represents the power consumption required in the transmission along a link. We analytically prove that such a simple algorithm maintains network connectivity and guarantees that the minimal energy path between any two nodes is preserved in the final topology. Simulation results show that LSP can reduce the energy consumption, especially in heterogenous network.