Timeslot mechanism in neighborhood discovery for wireless sensor networks | Zendy

Shazirawati Mohd Puzi | Zendy; Shaharuddin Salleh | Zendy; Stephan Olariu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Timeslot mechanism in neighborhood discovery for wireless sensor networks

Author(s) -

Shazirawati Mohd Puzi,

Shaharuddin Salleh,

Stephan Olariu

Publication year - 2014

Publication title -

aip conference proceedings

Language(s) - English

Resource type - Conference proceedings

eISSN - 1551-7616

pISSN - 0094-243X

DOI - 10.1063/1.4887639

Subject(s) - wireless sensor network , node (physics) , computer science , computer network , wireless , process (computing) , sensor node , wireless network , task (project management) , key distribution in wireless sensor networks , engineering , telecommunications , structural engineering , systems engineering , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research