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.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1063/1.4887639
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | sustainable development, wireless telecommunication systems |
| Subjects: | Q Science > Q Science (General) |
| Divisions: | Science |
| ID Code: | 63693 |
| Deposited By: | Siti Nor Hashidah Zakaria |
| Deposited On: | 15 Jun 2017 02:41 |
| Last Modified: | 15 Jun 2017 02:41 |
Repository Staff Only: item control page
