An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks

We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objective is to enable energy-efficient data communication, relayed between arbitrary nodes on the network. We develop a distributed algorithm which minimizes the power required for neighbor discovery.Initially nodes do not have deterministic knowledge of the location of their neighbors, and we model the distribution of the nodes as a two-dimensional Poisson process with known intensity. This corresponds to a situation in which a large number of nodes are randomly distributed over a given area. The process of neighbor discovery is modeled as a Markov decision process, and the resulting control policy is a finite automaton, driven by the underlying probability distribution, that minimizes the average power consumed. This policy can be computed offline and stored in each node with very low requirements for online memory and processor capability.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[3]  Xiangyang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MobiHoc '01.

[4]  Arie Hordijk,et al.  Markov Decision Chains , 1996 .

[5]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[6]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[7]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[9]  Cyrus Derman,et al.  Finite State Markovian Decision Processes , 1970 .

[10]  L. A. Zadeh,et al.  Optimal Pursuit Strategies in Discrete-State Probabilistic Systems , 1962 .

[11]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Donald L. Snyder,et al.  Random Point Processes in Time and Space , 1991 .

[13]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[14]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[15]  W. D. Cairns.  THE MATHEMATICAL ASSOCIATION OF AMERICA. , 1917, Science.

[16]  Joseph Y. Halpern,et al.  Minimum-energy mobile wireless networks revisited , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[17]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

[18]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[19]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[20]  Gregory J. Pottie,et al.  Instrumenting the world with wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[21]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[22]  A. F. Veinott.  Discrete Dynamic Programming with Sensitive Discount Optimality Criteria , 1969 .

[23]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[24]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..