Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking &Amp; Computing - MobiHoc '01 2001
DOI: 10.1145/501416.501435
|View full text |Cite
|
Sign up to set email alerts
|

Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
139
0
18

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 131 publications
(159 citation statements)
references
References 0 publications
2
139
0
18
Order By: Relevance
“…"Birthday protocols" [6], is probabilistic approach for asynchronous neighbor discovery in static wireless networks. Basically, for every single node, Birthday sets different probabilities for sending packets, receiving packets and going to sleep.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…"Birthday protocols" [6], is probabilistic approach for asynchronous neighbor discovery in static wireless networks. Basically, for every single node, Birthday sets different probabilities for sending packets, receiving packets and going to sleep.…”
Section: Related Workmentioning
confidence: 99%
“…For instance, "Birthday" [6] is a typical probabilistic protocol, which determines whether turning the radio on or shutting it down based on probabilities defined in priori. Usually, probabilistic protocols perform well in a static network with large numbers of devices.…”
Section: Introductionmentioning
confidence: 99%
“…The transmission probability does not change over time. The optimal value of p which has been shown in [11] [12] is 1 n , where n denotes the size of the network. Sudarshan Vasudevan et al [13] have proved the time complexity of synchronous operation is ( ln ) O n n .…”
Section: Introductionmentioning
confidence: 99%
“…Birthday Protocol is the first asynchronous energy-efficient discovery protocol which uses a randomized mechanism for enabling nodes to transit between sleep, listen, and transmission states during the neighbor discovery process [31]. Although using probabilistic approaches for changing nodes' state from transmit to listen or sleep mode can reduce the network energy consumption, it will yield unpredictable neighbor discovery latency.…”
Section: Introductionmentioning
confidence: 99%
“…Galluzzi and Herman give an overview on the neighbor discovery in wireless sensor networks without considering link quality measurement issues at the initialization phase [3]. The main purpose of their work was to present some background concepts on the wake-up problem in neighbor discovery and a brief comparison study on the discovery length of a number of existing neighbor discovery protocols (i.e., Birthday protocol [31], Quorum [33], Disco [34], and U-connect protocol [43]). The presented comparison study is restricted to comparing the discovery latency of the existing protocols, which have been developed to handle the neighbor discovery problem without paying attention to the link layer issues.…”
Section: Introductionmentioning
confidence: 99%