## Pattern Mutation in Wireless Sensor Deployment

Citations: | 1 - 1 self |

### BibTeX

@MISC{Bai_patternmutation,

author = {Xiaole Bai and Ziqiu Yun and Dong Xuan and Weijia Jia and Wei Zhao},

title = {Pattern Mutation in Wireless Sensor Deployment},

year = {}

}

### OpenURL

### Abstract

ohio-state.edu corresponding author Abstract—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 (rc) is relatively small compared with their sensing range (rs), 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 that pattern evolution is continuous. For example, we find mutation happens among the patterns for full-coverage and 3-connectivity when rc/rs = 1.0459, among the patterns for full-coverage and 4-connectivity when rc/rs =1.3903, and among the patterns for full-coverage and 5-connectivity when rc/rs =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. I.

### Citations

533 | Understanding packet delivery performance in dense wireless sensor networks
- Zhao, Govindan
(Show Context)
Citation Context ...Finally, the RF channel’s communication range is influenced by interference, reflections, scattering, and shadowing. In practice, the reliable communication range is often 60–80% of the claimed value =-=[25]-=-. The sensing range rs also varies greatly for different sensor types as well as upmarket and downmarket products. It can vary from several centimeters to tens of meters [19]–[22]. The study of optima... |

204 | Approximation schemes for covering and packing problems in image processing and VLSI
- Hochbaum, Maass
- 1985
(Show Context)
Citation Context ... be done. This problem is related to the covering problem in geometry. Much work has been done on the issue of covering points in a plane using a minimum number of given geometric bodies, e.g., disks =-=[10]-=-, [12], [15], [17], orthogonal rectangles [9], fat convex bodies [7], [18], etc. However, the computational geometry literature only considers coverage, not connectivity. This is understandable, as co... |

174 | On k-coverage in a mostly sleeping sensor network
- Kumar, TH, et al.
- 2004
(Show Context)
Citation Context ...alance efficiency in terms of the number of required sensor nodes and deployment convenience. The optimality proofs in this paper are based on the disc models that are also adopted by [2], [3], [11], =-=[13]-=-, [14], etc. As we know, to build theoretical foundations, abstraction is inevitable. However, it is also important to study patterns under more practical models. Fig. 3. Number of nodes needed by our... |

170 | Analyzing the Transition Region in Low Power Wireless Links
- Zuniga, Krishnamachari
- 2004
(Show Context)
Citation Context ...tion of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2010 proceedings This paper was presented as part of the main Technical Program at IEEE INFOCOM 2010. in =-=[24]-=-. This model established the function of the distance between the transmitter and the receiver and the communication link quality measured by the packet reception rate PRR. At distance d, the PRR can ... |

117 | et al. Exscal: Elements of an extreme scale wireless sensor network
- Arora
- 2005
(Show Context)
Citation Context ...mple, while the reliable communication range of the Extreme Scale Mote (XSM) platform is 30 m, the sensing range of the acoustics sensor for detecting an All Terrain Vehicle is 55 m, and rc/rs =0.545 =-=[1]-=-. In practice, the range of possible values of rc/rs can widely vary. The communication range rc can be affected by operating frequency, transmission power level, environment, etc. High frequencies wi... |

103 | Deploying Wireless Sensors to Achieve Both Coverage and Connectivity
- Bai, Kumary, et al.
- 2006
(Show Context)
Citation Context ...ased pattern can outperform it when rc = rs [11]. In 2006, the asymptotic optimality of strip-based patterns that achieve full coverage and 1- and 2-connectivity was proved in for all ranges of rc/rs =-=[2]-=-. In 2008, the asymptotically optimal pattern that achieve full coverage and 4-connectivity for rc/rs > √ 2 was proposed and proved to be optimal [4]. In [3], a complete set of deployment patterns for... |

90 |
The Number of Circles Covering a Set
- Kershner
- 1939
(Show Context)
Citation Context ...ound and Related Work Deployment is fundamental in the design and operation of wireless sensor networks (WSNs). For years, works in sensor deployment have heavily relied on a result presented in 1939 =-=[12]-=- that states that the regular triangular lattice pattern (triangle pattern for short) is asymptotically optimal in terms of the number of discs needed to achieve full coverage. When rc/rs ≥ √ 3, the t... |

69 | Barrier coverage with wireless sensors
- Kumar, Lai, et al.
(Show Context)
Citation Context ... efficiency in terms of the number of required sensor nodes and deployment convenience. The optimality proofs in this paper are based on the disc models that are also adopted by [2], [3], [11], [13], =-=[14]-=-, etc. As we know, to build theoretical foundations, abstraction is inevitable. However, it is also important to study patterns under more practical models. Fig. 3. Number of nodes needed by our new p... |

57 | Improved approximation algorithms for geometric set cover - Clarkson, Varadarajan |

49 | Analysis of target detection performance for wireless sensor networks
- Cao, Yan, et al.
(Show Context)
Citation Context ...t possible distance between the sensor and the target. This distance is considered the sensing range rs. In some cases, the sensing area is non-disc even after a threshold has been set. Cao et al. in =-=[8]-=- suggest the sensing capability roughly follows a Gaussian distribution over different directions. We study by simulation the impact from such sensing irregularity on coverage in our optimal deploymen... |

35 | Lowcoordination Topologies for Redundancy in Sensor Networks
- Iyengar, Kar, et al.
- 2005
(Show Context)
Citation Context ...e of the art. All these works assume a disc model for both sensing and communication. In 2005, the triangle pattern was shown to be non-optimal; the strip-based pattern can outperform it when rc = rs =-=[11]-=-. In 2006, the asymptotic optimality of strip-based patterns that achieve full coverage and 1- and 2-connectivity was proved in for all ranges of rc/rs [2]. In 2008, the asymptotically optimal pattern... |

31 |
Covering a set of points in multidimensional space
- Gonzalez
- 1991
(Show Context)
Citation Context ...ing problem in geometry. Much work has been done on the issue of covering points in a plane using a minimum number of given geometric bodies, e.g., disks [10], [12], [15], [17], orthogonal rectangles =-=[9]-=-, fat convex bodies [7], [18], etc. However, the computational geometry literature only considers coverage, not connectivity. This is understandable, as connectivity is a typical networking requiremen... |

23 | Complete optimal deployment patterns for full-coverage and kconnectivity (k ≤ 6) wireless sensor networks
- Bai, Xuan, et al.
(Show Context)
Citation Context ... evolution as rc/rs decreases. The trend of such variation is to enlarge the area of the hexagon with decreasing rc and while maintaining full coverage at the same time. This trend was conjectured in =-=[3]-=- to continue for all ranges of rc/rs. However, our new patterns show that mutation occurs at the point of rc/rs =1.0459. The aforementioned trend is stopped by a new pattern shown in Fig. 5(d). In thi... |

16 | Deploying Four-Connectivity And Full-Coverage Wireless Sensor Networks. (available on line) accepted by
- Bai, Yun, et al.
- 2008
(Show Context)
Citation Context ... the case where all P as have 4 edges. When 1 < rc/rs < √ 2, the maximum area occurs when P as are squares. As rc/rs further increases, the maximum area occurs as P as are rhombuses. It was proved in =-=[4]-=-, the pattern shown in Fig. 6(a) and (b) are optimal when rc/rs > √ 2. We then consider the case where there are P as with n edges (n >4). By our assumption, each n-sided P a must be paired with n − 4... |

16 | Covering a square with up to 30 equal circles
- Nurmela, Ostergard
- 2000
(Show Context)
Citation Context ...blem is related to the covering problem in geometry. Much work has been done on the issue of covering points in a plane using a minimum number of given geometric bodies, e.g., disks [10], [12], [15], =-=[17]-=-, orthogonal rectangles [9], fat convex bodies [7], [18], etc. However, the computational geometry literature only considers coverage, not connectivity. This is understandable, as connectivity is a ty... |

13 | Improved coverings of a square with six and eight equal circles
- Melissen, Schuur
- 1996
(Show Context)
Citation Context ...is problem is related to the covering problem in geometry. Much work has been done on the issue of covering points in a plane using a minimum number of given geometric bodies, e.g., disks [10], [12], =-=[15]-=-, [17], orthogonal rectangles [9], fat convex bodies [7], [18], etc. However, the computational geometry literature only considers coverage, not connectivity. This is understandable, as connectivity i... |

10 |
Sensor Deployment and Target Localization Based on Virtual Force
- Zhou, Charkrabarty
- 2003
(Show Context)
Citation Context ... are not necessarily globally optimal. This is an intriguing direction for our future work. B. Other Practical Considerations In reality, the sensing range may follow certain statistical models [16], =-=[23]-=-. The disc model can be obtained from these models by first setting a desirable threshold for sensing quality or probability, and then exploiting this threshold to determine the largest possible dista... |

9 |
Covering with fat convex discs
- TOTH
- 2005
(Show Context)
Citation Context ...h work has been done on the issue of covering points in a plane using a minimum number of given geometric bodies, e.g., disks [10], [12], [15], [17], orthogonal rectangles [9], fat convex bodies [7], =-=[18]-=-, etc. However, the computational geometry literature only considers coverage, not connectivity. This is understandable, as connectivity is a typical networking requirement. In recent years, some prog... |