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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Published: |
American Institute of Physics Inc.
2014
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/63091/ http://dx.doi.org/10.1063/1.4887639 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Teknologi Malaysia |
id |
my.utm.63091 |
---|---|
record_format |
eprints |
spelling |
my.utm.630912017-06-14T03:13:22Z http://eprints.utm.my/id/eprint/63091/ Timeslot mechanism in neighborhood discovery for wireless sensor networks Mohd. Puzi, Shazirawati Salleh, Shaharuddin Olariu, Stephan Q Science 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. American Institute of Physics Inc. 2014 Article PeerReviewed Mohd. Puzi, Shazirawati and Salleh, Shaharuddin and Olariu, Stephan (2014) Timeslot mechanism in neighborhood discovery for wireless sensor networks. AIP Conference Proceedings, 1605 . pp. 500-505. ISSN 0094-243X http://dx.doi.org/10.1063/1.4887639 DOI: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 |
spellingShingle |
Q Science 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 |
Article |
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 |
publisher |
American Institute of Physics Inc. |
publishDate |
2014 |
url |
http://eprints.utm.my/id/eprint/63091/ http://dx.doi.org/10.1063/1.4887639 |
_version_ |
1643655616248414208 |