Contact Project Developer Ashish D. Tiwari [astiwz@gmail.com]
Download Synopsis Abstract

Code-Based Neighbor Discovery Protocols in MobileWireless Networks

In mobile wireless networks, the emerging proximity-based applications have led to the need for highly effectiveand energy-efficient neighbor discovery protocols.
Abstract-Synopsis-Documentation

Abstract

In mobile wireless networks, the emerging proximity-based applications have led to the need for highly effectiveand energy-efficient neighbor discovery protocols. However,existing works cannot realize the optimal worst-case latency inthe symmetric case, and their performances with asymmetricduty cycles can still be improved. In this paper, we investigateasynchronous neighbor discovery through a code-based approach,including the symmetric and asymmetric cases. We derive thetight worst-case latency bound in the case of symmetric duty cycle.We design a novel class of symmetric patterns called Diff-Codes,which is optimal when the Diff-Code can be extended from a perfectdifference set. We further consider the asymmetric case anddesign ADiff-Codes. To evaluate (A)Diff-Codes, we conduct bothsimulations and testbed experiments. Both simulation and experimentresults show that (A)Diff-Codes significantly outperformexisting neighbor discovery protocols in both the median caseand worst case. Specifically, in the symmetric case, the maximumworst-case improvement is up to 50%; in both symmetric andasymmetric cases, the median case gain is as high as 30%.


View



Comment is Only Available for registered users! Create Account or Login Now!