Neighborhood discovery in a wireless sensor networks

Authors:
Shazirawati Mohd Puzi;Shaharuddin Salleh;Ruzana Ishak;Stephan Olariu
Affiliations:
Universiti Teknologi Malaysia, Skudai, Johor, Malaysia;Universiti Teknologi, Malaysia, Skudai, Johor, Malaysia;UTMSPACE, UTM International Campus, Kuala Lumpur, Malaysia;University, Norfolk, VA
Venue:
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Year:
2011

Citing 4
Cited 0

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

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Radio-Triggered Wake-Up Capability for Sensor Networks

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
An asynchronous neighbor discovery algorithm for wireless sensor networks

Ad Hoc Networks
Neighbor discovery in wireless networks and the coupon collector's problem

Proceedings of the 15th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neighborhood discovery (ND) in a wireless sensor network is a process of identifying the sensors that a given node can communicate directly. In this paper, our main contribution is to model the ND protocol in a wireless sensor network. In ND task, each node is assigned its own N timeslots, with equal slot intervals. In each slot, each node chooses either to transmit or listen, with probabilities p and 1 -- p. Our objectives are to analyze the optimal value of p, and model the formulation of N by mapping the problem into the coupon's collector problem. The simulation results show close match to the theoretical results.