Cover Image

Timeslot mechanism in neighborhood discovery for wireless sensor networks

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 probabilit...

Full description

Saved in:
Bibliographic Details
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
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.63693
record_format eprints
spelling my.utm.636932017-06-15T02:41:34Z http://eprints.utm.my/id/eprint/63693/ Timeslot mechanism in neighborhood discovery for wireless sensor networks Mohd. Puzi, Shazirawati Salleh, Shaharuddin Olariu, Stephan Q Science (General) 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. 2013 Conference or Workshop Item PeerReviewed Mohd. Puzi, Shazirawati and Salleh, Shaharuddin and Olariu, Stephan (2013) Timeslot mechanism in neighborhood discovery for wireless sensor networks. In: 21st National Symposium on Mathematical Sciences: Germination of Mathematical Sciences Education and Research Towards Global Sustainability, 6-8 Nov, 2013, Penang, Malaysia. http://dx.doi.org/10.1063/1.4887639
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic Q Science (General)
spellingShingle Q Science (General)
Mohd. Puzi, Shazirawati
Salleh, Shaharuddin
Olariu, Stephan
Timeslot mechanism in neighborhood discovery for wireless sensor networks
description 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.
format Conference or Workshop Item
author Mohd. Puzi, Shazirawati
Salleh, Shaharuddin
Olariu, Stephan
author_facet Mohd. Puzi, Shazirawati
Salleh, Shaharuddin
Olariu, Stephan
author_sort Mohd. Puzi, Shazirawati
title Timeslot mechanism in neighborhood discovery for wireless sensor networks
title_short Timeslot mechanism in neighborhood discovery for wireless sensor networks
title_full Timeslot mechanism in neighborhood discovery for wireless sensor networks
title_fullStr Timeslot mechanism in neighborhood discovery for wireless sensor networks
title_full_unstemmed Timeslot mechanism in neighborhood discovery for wireless sensor networks
title_sort timeslot mechanism in neighborhood discovery for wireless sensor networks
publishDate 2013
url http://eprints.utm.my/id/eprint/63693/
http://dx.doi.org/10.1063/1.4887639
_version_ 1643655759079145472
score 13.160551

Similar Items