Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks

Authors:
Mohsen Bahramgiri;Mohammadtaghi Hajiaghayi;Vahab S. Mirrokni
Affiliations:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;MIT Department of Mathematics, Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge;MIT Department of Mathematics, Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge
Venue:
Wireless Networks
Year:
2006

Citing 9
Cited 10

Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Sparse communication networks and efficient routing in the plane (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks

Proceedings of the 9th annual international conference on Mobile computing and networking
InterPlaNetary internet: state-of-the-art and research challenges

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient topology control for ad-hoc wireless networks with non-uniform transmission ranges

Wireless Networks
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Brief announcement: minimum spanning trees and cone-based topology control

Proceedings of the 28th ACM symposium on Principles of distributed computing
Deploying sensor networks with guaranteed fault tolerance

IEEE/ACM Transactions on Networking (TON)
Distributed fault-tolerant topology control in wireless multi-hop networks

Wireless Networks
G-STAR: Geometric STAteless Routing for 3-D wireless sensor networks

Ad Hoc Networks
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control

Architecting dependable systems VII
Fault tolerant interference-aware topology control for ad hoc wireless networks

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A GIS based wireless sensor network coverage estimation and optimization: a voronoi approach

Transactions on Computational Science XIV
Distributed k-connected fault-tolerant topology control algorithms with PSO in future autonomic sensor systems

International Journal of Sensor Networks
MQ-Routing: Mobility-, GPS- and energy-aware routing protocol in MANETs for disaster relief scenarios

Ad Hoc Networks
Darwinian swarm exploration under communication constraints: Initial deployment and fault-tolerance assessment

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The topology of a multi-hop wireless network can be controlled by varying the transmission power at each node. The lifetime of such networks depends on battery power at each node. This paper presents a distributed fault-tolerant topology control algorithm for minimum energy consumption in multi-hop wireless networks. This algorithm is an extension of cone-based topology control algorithm [19, 12]. The main advantage of this algorithm is that each node decides on its power based on local information about the relative angle of its neighbors and as a result of these local decisions, a fault-tolerant connected network is formed on the nodes. It is done by preserving the connectivity of a network upon failing of, at most, k nodes (k is a constant) and simultaneously minimize the transmission power at each node to some extent. In addition, simulations are studied to support the effectiveness of this algorithm. Finally, it is shown how to extend this algorithm to 3-dimensions.