On the Relevance of Node Isolation to the K-Connectivity of Wireless Optical Sensor Networks
Authors:
- 21 March 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 8 (10) , 1427-1440
Abstract
In designing wireless multihop sensor networks, determining system parameters that guarantee a reasonably connected network is crucial. In this paper, we investigate node isolation in wireless optical sensor networks (WOSNs) as a topology attribute for network connectivity. Our results pertain to WOSNs modeled as random-scaled sector graphs that employ directional broad-beamed free space optics for point-to-point communication. We derive a generalized analytical expression relating the probability that no node is isolated to the physical layer parameters of node density, transmitter radius, and angular beam width. Through simulations, we demonstrate that for probability values close to 1, dense networks, and increasing beam width, the probability that the WOSN is connected is tightly upper bounded by the probability that no isolated node exists. In addition, our study demonstrates conditions for probabilistic K-connectivity guarantees and provides empirical insights on the impact of clustering on connectivity by employing simulations to validate analytical derivations. Our analysis provides a methodology of practical importance to choosing physical layer parameter values for effective network level design.Keywords
This publication has 26 references indexed in Scilit:
- Large Connectivity for Dynamic Random Geometric GraphsIEEE Transactions on Mobile Computing, 2009
- High level communication functionalities for wireless sensor networksTheoretical Computer Science, 2008
- Interest dissemination with directional antennas for wireless sensor networks with mobile sinks2006
- Energy-efficient communication protocol for wireless microsensor networks2005
- Routing improvement using directional antennas in mobile ad hoc networks2005
- Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach2004
- The Number of Neighbors Needed for Connectivity of Wireless NetworksWireless Networks, 2004
- A random graph model for optical networks of sensorsIEEE Transactions on Mobile Computing, 2003
- Onk-connectivity for a geometric random graphRandom Structures & Algorithms, 1999
- Optimal Transmission Ranges for Randomly Distributed Packet Radio TerminalsIEEE Transactions on Communications, 1984