ABSTRACT
Contents 21.1 Introduction and Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 503 21.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 505 21.3 Network Model and Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 507 21.4 Analysis of Connectivity for Two Adjacent Blocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 508
21.4.1 Geometrical Probability Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 508 21.4.2 CP of Two Adjacent Blocks with More Nodes. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 510 21.4.3 Connectivity Probability Derivation for Large Area. . . . . . . . . . . . . . . . . . . . . . . . . . . . 511 21.4.4 Simulation and Performance Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 514 21.4.5 CP of Two Adjacent Blocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 514 21.4.6 Performance Observation and Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 516
21.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 518 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
21.1 Introduction and Motivation Wireless sensor networks have recently emerged as a premier research topic. Sensor networks pose a number of new conceptual and optimization problems such as location, deployment, and tracking. Wireless sensors are self-creating, self-organizing, and self-administering [1,2]. The absence of fixed infrastructure means that nodes of a sensor network can communicate directly with one another in a peer-to-peer fashion. Sensors can be mobile in the area concerned or deployed in a certain location. A typical application for this “larger” kind of network concerns distributed
micro-sensors: Each sensor node of the network is capable of monitoring a given surrounding area (sensing), and coordinating with the other nodes to achieve a large sensing task [3]. In such an application, each node in the small area will connect with other nodes in the same area more frequently than in the different areas. A node may just roam in a given small area in a large network, such as sensor networks in which the sensor nodes may be deployed in a specific zone which are particularly useful in the hazardous areas for measuring critical and real-time data. In such situation, the nodes are distributed with local uniformity, which is discussed in detail in this chapter. Recent advances in processors, memory, and radio technology have made it possible to enable sensor networks with potentially very large number of small, lightweight, and low-cost nodes.
