Pattern Mutation in Wireless Sensor Deployment

In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors' communication range (r_c) is relatively low compared with their sensing range (r_s), and prove their optimality among regular patterns. In this study, we discover a surprising and interesting phenomenon - pattern mutation. This phenomenon contradicts the conjecture presented in a previous work that there exists a universal elemental pattern among optimal pattern evolution and the pattern evolution is continuous. For example, we find mutation happens among the patterns for full-coverage and 3-connectivity when r_c/r_s = 1.0459, among the patterns for full-coverage and 4-connectivity when r_c/r_s = 1.3903, and among the patterns for full-coverage and 5-connectivity when r_c/r_s = 1.0406. To the best of our knowledge, this is the first time that mutation in pattern evolution has been discovered. Also, our work further completes the exploration of optimal patterns in WSNs.

[1]  Weijia Jia,et al.  Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks , 2008, MobiHoc '08.

[2]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Koushik Kar,et al.  Low-coordination topologies for redundancy in sensor networks , 2005, MobiHoc '05.

[4]  Weijia Jia,et al.  Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[5]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[6]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[7]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[8]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

[9]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[10]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[11]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[12]  Dong Xuan,et al.  Pattern Mutation in Wireless Sensor Deployment , 2010, INFOCOM.

[13]  Gábor Fejes Tóth.  Covering with Fat Convex Discs , 2005, Discret. Comput. Geom..

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

[15]  Weijia Jia,et al.  Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[16]  P. C. Schuur,et al.  Improved Coverings of a Square with Six and Eight Equal Circles , 1996, Electron. J. Comb..

[17]  Ai Chen,et al.  Local Barrier Coverage in Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[18]  Tarek F. Abdelzaher,et al.  Analysis of Target Detection Performance for Wireless Sensor Networks , 2005, DCOSS.

[19]  Weijia Jia,et al.  Optimal Deployment Patterns for Full Coverage and $k$-Connectivity $(k \leq 6)$ Wireless Sensor Networks , 2010, IEEE/ACM Transactions on Networking.

[20]  Chen Zhang,et al.  ExScal: elements of an extreme scale wireless sensor network , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[21]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[22]  K. Nurmela,et al.  COVERING A SQUARE WITH UP TO 30 EQUAL CIRCLES , 2000 .

[23]  Kenneth L. Clarkson,et al.  Improved Approximation Algorithms for Geometric Set Cover , 2005, Discret. Comput. Geom..