The interactive core of a random wireless sensor network model

For large scale wireless sensor networks, it is a fundamental challenge to extend the lifetime when the energy supply is limited. In this paper, we proposed a random-based wireless sensor network model which composed of sensor nodes and relay nodes as region heads upgraded from sensor nodes. In order to maximize the network lifetime, we present this optimal placement of relay nodes problem with a spin-glass model of minimal upgrading set of wireless sensor network with random-graph topology. By introducing the concept of interactive core, we study the statistical approach to estimate the solutions of the objective problem such that the maximal network lifetime can be achieved. As a further study of this model, we propose, from the theoretical point of view, a scheme to determine the key relay nodes while the minimum number of relay nodes has been determined by the first step. Our results show that the strategy to deal with the maximum lifetime problem of two-tied network model for large scale case from statistical physics can be help to design more efficient wireless sensor networks with random located sensors.

[1]  S. Venkatesan,et al.  Energy efficient sensor, relay and base station placements for coverage, connectivity and routing , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[2]  Konstantinos Kalpakis,et al.  Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[3]  Haijun Zhou,et al.  Ground-state entropy of the random vertex-cover problem. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Michael J. Neve,et al.  Optimisation strategy for wireless communications system planning using linear programming , 2001 .

[5]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Maytham Safar,et al.  Modeling the Communication Problem in Wireless Sensor Networks as a Vertex Cover , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[7]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[8]  Pramod K. Varshney,et al.  Distributed Detection and Fusion in a Large Wireless Sensor Network of Random Size , 2005, EURASIP J. Wirel. Commun. Netw..

[9]  M. Bauer,et al.  Core percolation in random graphs: a critical phenomena analysis , 2001, cond-mat/0102011.

[10]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[12]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[13]  Yuan Ping,et al.  Particle swarm optimization for base station placement in mobile communication , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[14]  Piotr Berman,et al.  Power efficient monitoring management in sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[15]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.