On k-connectivity for a geometric random graph
Random Structures & Algorithms
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
Denial of service resilience in ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Topology Control in Ad Hoc Wireless Networks Using Cooperative Communication
IEEE Transactions on Mobile Computing
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
In this paper, we study the problem of how to design overlay topologies in multi-hop wireless networks such that the overlays achieve perfect resilience, in terms of all cooperative nodes included but misbehaving nodes excluded, and preserve the k-connectivity with high probability. To address this problem, we propose a new distributed topology control protocol called PROACtive. By using PROACtive, every node pro-actively selects its cooperative adjacent nodes as neighbors by mutually exchanging neighbor request and reply messages. As a result, the union of all neighbor sets forms a resilient overlay for a given network. Our analysis finds that the PROACtive protocol is light-weighted with the message complexity of only O(m), where m is the number of links in the original network. Our simulation results validate the effectiveness of PROACtive and show that the overlays generated by our protocol preserve the k-connectivity with high probability ( 90%) and low false positive ratio (