There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
On k-connectivity for a geometric random graph
Random Structures & Algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Constructing minimum energy mobile wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Performance Evaluation of Wireless Networks
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
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
Hi-index | 0.00 |
Interference imposes a major challenge for efficient data communication in wireless networks. Increased level of interference may increase number of collisions, energy consumption and latency due to retransmissions of the interfered data. Interference of a link is the number of nodes interfered while a pair of nodes are communicating over a bi-directional link. Approaches have been proposed to reduce interference by dropping links that create high interference. However, dropping links make a network more susceptible to node failure/departure-a frequent phenomenon in ad hoc networks. Thus dropping high interference links while keeping the network significantly connected is an important goal to achieve. In this paper, we formulate the problem of constructing minimum interference path preserving and fault tolerant wireless ad hoc networks and then provide algorithms, both centralized and distributed with local information, to solve the problem. Moreover, for the first time in literature, we conceive the concept of fault tolerant interference spanner and provide a local algorithm to construct such spanner of a communication graph.