On the resilient overlay topology formation in multi-hop wireless networks

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 (< 5%). © IFIP International Federation for Information Processing 2007.

Cite

CITATION STYLE

APA

Xing, F., & Wang, W. (2007). On the resilient overlay topology formation in multi-hop wireless networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free