Timeslot Mechanism In Neighborhood Discovery For Wireless Sensor Networks

被引：0

作者：

Puzi, Shazirawati Mohd ^{[1
]}

Salleh, Shaharuddin ^{[1
]}

Olariu, Stephan ^{[2
]}

机构：

[1] Univ Teknol Malaysia, Dept Math Sci, Fac Sci, Johor Baharu, Malaysia

[2] Old Dominion Univ, Dept Comp Sci, Norfolk, VA 23529 USA

来源：

PROCEEDINGS OF THE 21ST NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM21): GERMINATION OF MATHEMATICAL SCIENCES EDUCATION AND RESEARCH TOWARDS GLOBAL SUSTAINABILITY | 2014年 / 1605卷

关键词：

Neighborhood discovery; timeslots; occupancy problem; wireless communications; sensor networks;

D O I：

10.1063/1.4887639

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：500 / 505

页数：6

共 9 条

[1] Angelosante D., 2007, ACOUSTICS SPEECH SIG, V3, P169
[2] [Anonymous], P 6 ACM C EMB NETW S
[3] An asynchronous neighbor discovery algorithm for wireless sensor networks
Borbash, Steven A.
Ephremides, Anthony
McGlynn, Michael J.
[J]. AD HOC NETWORKS, 2007, 5 (07) : 998 - 1016
[4] A RESTRICTED OCCUPANCY PROBLEM
FANG, KT
[J]. JOURNAL OF APPLIED PROBABILITY, 1982, 19 (03) : 707 - 711
[5] NOTE ON ASYMPTOTIC NORMALITY OF DISTRIBUTION OF NUMBER OF EMPTY CELLS IN OCCUPANCY PROBLEMS
HARRIS, B
PARK, CJ
[J]. ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 1971, 23 (03) : 507 - 513
[6] Johnson N.L., 1977, Urn Models and Their Application: An Approach to Modern Discrete Probability Theory
[7] Kuhn F., 2004, P 10 ANN INT C MOBIL, P260
[8] McGlynn M. J., 2001, MOBIHOC 2001. Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing, P137, DOI 10.1145/501416.501435
[9] Thomas G.T., 2005, Thomas' Calculus, V11th Edition.

← 1 →