ACM Home Page
Please provide us with feedback. Feedback
Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks
Full text PdfPdf (647 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing table of contents
Long Beach, CA, USA
Session: Sensor networks and energy management table of contents
Pages: 137 - 145  
Year of Publication: 2001
ISBN:1-58113-428-2
Authors
Michael J. McGlynn  Laboratory for Telecommunications Sciences, 2800 Powder Mill Road, Adelphi, MD
Steven A. Borbash  Laboratory for Telecommunications Sciences, 2800 Powder Mill Road, Adelphi, MD
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 72,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1145/501431.501435

ABSTRACT

In this paper, we address two problems associated with static ad hoc wireless networks; methods of saving energy during a deployment of the nodes, and efficient methods of performing adjacent neighbor discovery. To meet these goals we introduce a family of "birthday protocols"which use random independent transmissions to discover adjacent nodes. Various modes of the birthday protocol are used to solve the two problems. We provide a mathematical model and analysis of two modes of the protocol and are led to a third mode which is the probabilistic analog of the deterministic round robin scheduling algorithm. We show by analysis and simulation that the birthday protocols are a promising tool for saving energy during the deployment of an ad hoc network as well as an efficient and flexible means of having the nodes discover their neighbors


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D.B. Johnson and D.A. Maltz. Mobile Computing, chapter 5, Dynamic Source Routing in Ad Hoc Wireless Networks, pages 153-181. Kluwer Publishing Company, 1996.
 
2
 
3
Z.J. Haas and M.R. Pearlman. The zone routing protocol (zrp) for ad hoc networks. Internet Draft, Internet Engineering Task Force, November 1997.
 
4
 
5
Dennis J. Baker and Anthony Ephremides. The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications, COM-29 (11):1694-1701, November 19 1981.
 
6
Chunhung Richard Lin and Mario Gerla. Adaptive clustering for mobile wireless networks. IEEE J. Selected Areas of Communications, 15(7):1265-1275, Sept. 1997.
 
7
 
8
 
9
10
 
11
Bluetooth project, www.bluetooth.com, 1999.
 
12
S. Ramanathan and R. Rosales-Hain. ,topology control of multihop radio networks using transmit power adjustmenC. In Proc. IEEE Infocom 2000, Tel Aviv, Mar 2000.
 
13
K. Sohrabi and G. J. Pottie. Performance of a novel self-organization protocol for wireless ad-hoc sensor networks,. In IEEE Vehicular Technology Conference: 1999, volume 2, pages 1222-1226, Fall 1999.
 
14
Ya Xu, John Heidemann, and Deborah Estrin. Adaptive energy-conserving routing for multihop ad hoc networks. Research Report 527, USC/Information Sciences Institute, October 2000.
 
15
J. L. Bordim, J. Cui, T. Hayashi, K. Nakano, and S. Olariu. ,energy-efficient initialization protocols for ad-hoc radio networks". IEICE Trans. Fundamentals, E-83-A(9):1796-1803, Sept. 2000.
 
16
A. Chandrakasan. Low power wireless sensor networks. Mobicom 2000, Presentation on energy conservation methods.
 
17
Intersil Corporation. Hfa3683a data sheet. Technical report, Intersil, October 1999. File Number 4634.3.

CITED BY  14

Collaborative Colleagues:
Michael J. McGlynn: colleagues
Steven A. Borbash: colleagues