This Article 
 Bibliographic References 
 Add to: 
On the Relevance of Node Isolation to the K-Connectivity of Wireless Optical Sensor Networks
October 2009 (vol. 8 no. 10)
pp. 1427-1440
Unoma Ndili Okorafor, Texas A & M University, College Station
Deepa Kundur, Texas A & M University, College Station
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.

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp. 102-114, Aug. 2002.
[2] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, Birkhäuser, 1998.
[3] R. Ramanathan, “On the Performance of Ad Hoc Networks with Beamforming Antennas,” Proc. ACM MobiHoc, June 2001.
[4] A. Saha and D. Johnson, “Routing Improvement Using Directional Antennas in Mobile Ad Hoc Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '04), 2004.
[5] K. Sudaresan and R. Sivakumar, “On the Medium Access Control Problem in Ad-Hoc Networks with Smart Antennas,” Proc. ACM MobiHoc, June 2003.
[6] Y. Wu, L. Zhang, Y. Wu, and Z. Niu, “Interest Dissemination with Directional Antennas for Wireless Sensor Networks with Mobile Sinks,” Proc. Fourth Int'l Conf. Embedded Networked Sensor Systems (Sensys '06), 2006.
[7] J. Díaz, J. Petit, and M. Serna, “A Random Graph Model for Optical Networks of Sensors,” IEEE Trans. Mobile Computing, vol. 2, no. 3, pp. 186-196, July-Sept. 2003.
[8] Random Geometric Graphs, M.D. Penrose, ed. Oxford Univ. Press, 2003.
[9] P. Erdos and A. Renyi, “On the Evolution of Random Graphs,” Math. Inst. of Hungary Academy of Science, vol. 5, pp. 17-61, 1960.
[10] C. Bettstetter, “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 80-91, Oct. 2002.
[11] C. Bettstetter, “On the Connectivity of Ad Hoc Networks,” The Computer J., vol. 47, no. 4, pp. 432-447, 2004.
[12] C. Àlvarez, J. Díaz, J. Petit, J. Rolim, and M. Serna, “High Level Communication Functionalities for Wireless Sensor Networks,” Theoretical Computer Science, vol. 406, no. 3, pp. 240-247, Oct. 2008.
[13] P. Santi and D. Blough, “The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 25-39, Jan.-Mar. 2003.
[14] L. Kleinrock and J. Silvester, “Optimum Transmission Radii for Packet Radio Networks or Why Six Is a Magic Number,” Proc. IEEE Nat'l Telecomm. Conf., Dec. 1978.
[15] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Comm., vol. COM-32, no. 3, pp. 246-257, Mar. 1984.
[16] F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10, no. 2, pp. 169-181, Oct. 2004.
[17] S. Song, D.L. Goeckel, and D. Towsley, “An Improved Lower Bound to the Number of Neighbors Required for the Asymptotic Connectivity of Ad Hoc Networks,” IEEE Trans. Information Theory, 2005.
[18] M.D. Penrose, “On K-Connectivity for a Geometric Random Graph,” Wiley Random Structures and Algorithms, vol 15, no. 2, pp.45-164, 1999.
[19] C. Bettstetter, “Connectivity of Wireless Multihop Networks in a Shadow Fading Environment,” Proc. Sixth ACM Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems, Sept. 2003.
[20] D. Kundur, W. Luh, U.N. Okorafor, and T. Zourntos, “Security and Privacy for Distributed Multimedia Sensor Networks,” Proc. IEEE, special issue on recent advances in distributed multimedia comm., vol. 96, no. 1, pp. 112-130, Jan. 2008.
[21] D. Kundur and U.N. Okorafor, “A Secure Integrated Routing and Localization Scheme for Broadband Mission Critical Networks,” Proc. IEEE INFOCOM Workshop Mission Critical Networks, pp. 1-6, Apr. 2008.
[22] Introduction to the Theory of Coverage Processes, P. Hall, ed. John Wiley & Sons, 1988.
[23] Statistics for Spatial Data, N. Cressie, ed. John Wiley & Sons, 1991.
[24] S. Trisno, “Design and Analysis of Advanced Free Space Optical Communication Systems,” PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of Maryland, June 2006.
[25] T. Ernst and W. Dabbous, “A Circuit-Based Approach for Routing in Unidirectional Links Networks,” INRIA Research Report RR-3292, Nov. 1997.
[26] J.M. Kahn, R.H. Katz, and K.S.J. Pister, “Next Century Challenges: Mobile Networking for ‘Smart Dust’,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking, pp. 271-278, Aug. 1999.
[27] S. Bandyopadhyay and E.J. Coyle, “An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2003.
[28] B. Liu and D. Towsley, “A Study of the Coverage of Large-Scale Sensor Networks,” Proc. First IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems, Oct. 2004.
[29] The Design and Analysis of Computer Algorithms, A.V. Aho, J.E.Hopcroft, and J.D. Ullman, eds. Addison-Wesley, 1974.
[30] Introduction to Algorithms, T. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, eds., second ed. MIT press, 2001.
[31] A. Amis and R. Prakash, “Load-Balancing Clusters in Wireless AdHoc Networks,” Proc. Third IEEE Symp. Application-Specific Systems and Software Eng. Technology, pp. 25-32, Mar. 2000.
[32] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC '97), vol. 1, pp. 376-380, June 1997.
[33] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Communication Protocols for Wireless Microsensor Networks,” Proc. Hawaiian Int'l Conf. Systems Science, Jan. 2000.
[34] O. Younis and S. Fahmy, “Distributed Clustering in Ad-Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach,” Proc. IEEE INFOCOM, 2004.
[35] J. Díaz, D. Mitsche, and X. Perez, “Dynamic Random Geometric Graphs,” Discrete Math., Apr. 2007.

Index Terms:
Wireless optical sensor networks, node isolation, K-connectivity, hierarchical random-scaled sector graph.
Unoma Ndili Okorafor, Deepa Kundur, "On the Relevance of Node Isolation to the K-Connectivity of Wireless Optical Sensor Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 10, pp. 1427-1440, Oct. 2009, doi:10.1109/TMC.2009.57
Usage of this product signifies your acceptance of the Terms of Use.