Research on Optimal Coverage Problem of Wireless Sensor Networks

In a wireless sensor network, the size of radio nodes has direct relation to the cost of total wireless sensor networks, and at the same time, the problem is closely connected to wireless sensor networks' performance, such as robust, fault-tolerance, and further more, it is considered at first as wireless sensor networks are designed. Therefore, the research on the size of radio nodes has significant meanings of theory and practice to design of wireless sensor networks. The paper simplifies complex coverage problem step by step. By means of math modeling, theoretical analysis and formula deducting, classical geometric theories and the method of mathematics induction are adopted, at last, the analysis formula of minimum number of nodes is theoretically educed under circumstances of entire and seamless coverage in WSN. In addition, it is worth mentioning that the conclusion is the full same with computing the number of communication nodes of wireless sensor networks.

[1]  Miodrag Potkonjak,et al.  Exposure in Wireless Sensor Networks: Theory and Practical Solutions , 2002, Wirel. Networks.

[2]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[3]  Michael Segal,et al.  Dynamic Coverage in Ad-Hoc Sensor Networks , 2005, Mob. Networks Appl..

[4]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[5]  Krishnendu Chakrabarty,et al.  A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.

[6]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[7]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[8]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Miodrag Potkonjak,et al.  Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure , 2001, MobiHoc '01.

[10]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[11]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[12]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[13]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

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