Timeslot mechanism in neighborhood discovery for wireless sensor networks

• Main Authors: Mohd. Puzi, Shazirawati, Salleh, Shaharuddin, Olariu, Stephan
• Format: Conference or Workshop Item
• Published: 2013
• Subjects: Q Science (General)
• Online Access: http://eprints.utm.my/id/eprint/63693/; http://dx.doi.org/10.1063/1.4887639
• Institution: Universiti Teknologi Malaysia

Neighborhood discovery (ND) in a wireless sensor network is a process of identifying the sensors that a given node can communicate directly. 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 respectively. Our objectives are to analyze the optimal value of p, and model the formulation of N by mapping the problem to the occupancy problem, i.e one of the popular problem in probability theory. A number of simulations are performed and the results are compared to the theoretical formulation.