BlindDate: A Neighbor Discovery Protocol

Wang, Keyu; Mao, Xufei

doi:10.1109/icpp.2013.21

Cited by 11 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…According to real-world results, B-Nihao is faster than Birthday [5], Disco [12], U-Connect [17] and SearchLight [13], for duty-cycles of 1% and 5% and achieves the lowest latency bound. As for G-Nihao it presents better latency than Disco, U-Connect, SearchLight and BlindDate [18], for duty-cycles of 1% and 5%.…”

Section: A Probabilistic Protocolsmentioning

confidence: 97%

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

2022

View full text Add to dashboard Cite

Section: A Probabilistic Protocolsmentioning

confidence: 97%

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

2022

View full text Add to dashboard Cite

“…According to experimental results, B-Nihao is significantly faster than Birthday [7], Disco [21], U-Connect [26] and SearchLight [22], for both duty cycles of 1% and 5% with the lowest latency bound. G-Nihao is faster than Disco, U-Connect, SearchLight and BlindDate [27], for duty cycles of 1% and 5%, since it has the lowest worst-case latency.…”

Section: Related Workmentioning

confidence: 99%

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

et al. 2021

View full text Add to dashboard Cite

Neighbor discovery represents a first step after the deployment of wireless ad hoc networks, since the nodes that form them are equipped with limited-range radio transceivers, and they typically do not know their neighbors. In this paper two randomized neighbor discovery approaches, called CDH and CDPRR, based on collision detection for static multi-hop wireless ad hoc networks, are presented. Castalia 3.2 simulator has been used to compare our proposed protocols against two protocols chosen from the literature and used as reference: the PRR, and the Hello protocol. For the experiments, we chose five metrics: the neighbor discovery time, the number of discovered neighbors, the energy consumption, the throughput and the number of discovered neighbors vs packets sent ratio. According to the results obtained through simulation, we can conclude that our randomized proposals outperform both Hello and PRR protocols in the presence of collisions regarding all five metrics, for both one-hop and multi-hop scenarios. As novelty compared to the reference protocols, both proposals allow nodes to discover all their neighbors with probability 1, they are based on collision detection and know when to terminate the neighbor discovery process. Furthermore, qualitative comparisons of the existing protocols and the proposals are available in this paper. Moreover, CDPRR presents better results in terms of time, energy consumption and number of discovered neighbors vs packets sent ratio. We found that both proposals achieve to operate under more realistic assumptions. Furthermore, CDH does not need to know the number of nodes in the network.

show abstract

“…• The third class, Searchlight, proposed in [4] and a number of follow-up schemes [23], [28], employs two kinds of wake-up slots, termed as anchor and probe slots, to achieve both lower worst-case and average discovery delay. One drawback of existing deterministic protocols is the failure to support all duty cycles due to their limited choices on either primes or power-multiples, and consequently only a limited choices of energy conservation levels can be supported.…”

Section: Related Workmentioning

confidence: 99%

“…major work in this category [4], [8], [13], [14], [16], [19], [26], [28], [32]). In deterministic protocols, each node wakes up according to its neighbor discovery schedule carefully tuned to ensure that each pair of two wake-up schedules overlap in at least one active slot.…”

Section: Related Workmentioning

confidence: 99%

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Chen¹,

Bian²,

Zheng³

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Neighbor discovery is of paramount importance in mobile sensing applications and is particularly challenging if the operating frequencies of mobile devices span multiple channels. In this paper, we formulate the multi-channel neighbor discovery problem and establish a theoretical framework of it, under which we derive the performance bound of any neighbor discovery protocol guaranteeing discovery. We then develop a multi-channel discovery protocol that achieves guaranteed discovery with orderminimum worst-case discovery delay and fine-grained control of energy conservation levels.

show abstract

BlindDate: A Neighbor Discovery Protocol

Cited by 11 publications

References 14 publications

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

Analytical models for randomized neighbor discovery protocols based on collision detection in wireless ad hoc networks

Randomized neighbor discovery protocols with collision detection for static multi-hop wireless ad hoc networks

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Contact Info

Product

Resources

About