Skip to main content

Self-Organization of Sensor Networks with Heterogeneous Connectivity

  • Chapter
  • First Online:

Part of the book series: Signals and Communication Technology ((SCT))

Abstract

Most research on wireless sensor networks has focused on homogeneous networks where all nodes have identical transmission ranges. However, heterogeneous networks, where nodes have different transmission ranges, are potentially much more efficient. In this chapter, we study how heterogeneous networks can be configured by distributed self-organization algorithms where each node selects its own transmission range based on local information. We define a specific performance function, and show empirically that self-organization based on local information produces networks that are close to optimal, and that including more information provides only marginal benefit. We also investigate whether the quality of networks configured by self-organization results from their generic connectivity distribution (as is argued for scale-free networks) or from their specific pattern of heterogeneous connectivity, finding the latter to be the case. The study confirms that heterogeneous networks outperform homogeneous ones, though with randomly deployed nodes, networks that seek homogeneous out-degree have an advantage over networks that simply use the same transmission range for all nodes. Finally, our simulation results show that highly optimized network configurations are as robust as non-optimized ones with respect to random node failure, but are much more susceptible to targeted attacks that preferentially remove nodes with the highest connectivity, confirming the trade-off between optimality and robustness postulated for optimized complex systems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Reference

  1. D. Braha, A.A. Minai, and Y. Bar-Yam, Eds., Complex Engineered Systems: Science Meets Technology, Springer/NECSI, New York, 2006.

    MATH  Google Scholar 

  2. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks”, Science, vol.286, pp. 509–511, 1999.

    Article  MathSciNet  Google Scholar 

  3. A.-L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks”, Physica A, vol. 272, pp. 173–187, 1999.

    Article  Google Scholar 

  4. R. Albert and A.-L. Barabási, “Topology of evolving networks: Local events and universality”, Physical Review Letters, vol. 85, pp. 5234–5237, 2000.

    Article  Google Scholar 

  5. R. Albert and A.L. Barabási, “Statistical mechanics of complex networks”, Reviews of Modern Physics, vol. 74, pp. 47–97, 2002.

    Article  MathSciNet  Google Scholar 

  6. D.J. Watts and S.H. Strogatz, “Collective dynamics of ‘small-world‘ networks”, Nature, vol. 393, pp. 440–442, 1998.

    Article  Google Scholar 

  7. R. Albert, H. Jeong, and A.-L. Barabási, “Error and attack tolerance of complex networks”, Nature, vol. 406, pp. 378–382, 2000.

    Article  Google Scholar 

  8. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, “Random graphs with arbitrary degree distribution and their applications”, Physical Review E, vol. 64, pp. 026118, 2001.

    Article  Google Scholar 

  9. B. Shargel, H. Sayama, I.J. Epstein, and Y. Bar-Yam, “Optimization of robustness and connectivity in complex networks”, Physical Review Letters, vol. 90, pp. 168701, 2003.

    Article  Google Scholar 

  10. A.X.C.N. Valente, A. Sarkar, and H.A. Stone, “Two-peak and three-peak optimal complex networks”, Physical Review Letters, vol. 92, pp. 118702, 2004.

    Article  Google Scholar 

  11. G. Paul, T. Tanizawa, S. Havlin, and H. E. Stanley, “Optimization of robustness of complex networks”, European Physical Journal B, vol. 38, pp. 187–191, 2004.

    Google Scholar 

  12. T. Tanizawa, G. Paul, R. Cohen, S. Havlin, and H. E. Stanley, “Optimization of network robustness to waves of targeted and random attacks”, Physical Review E, vol. 1, no. 4, pp. 047101, Apr. 2005.

    Article  Google Scholar 

  13. A. Beygelzimer, G. Grinstein, R. Linsker, and I. Rish, “Improving network robustness by edge modification”, Physica A, vol. 357, pp. 593–612, 2005.

    Article  Google Scholar 

  14. J. Doyle and J.M. Carlson, “Power laws, highly optimized tolerance, and generalized source coding”, Physical Review Letters, vol. 84, pp. 5656–5659, 2000.

    Article  Google Scholar 

  15. J.M. Carlson and J. Doyle, “Highly optimized tolerance: Robustness and design in complex systems”, Physical Review Letters, vol. 84, pp. 2529–2532, 2000.

    Article  Google Scholar 

  16. J.M. Carlson and J. Doyle, “Complexity and robustness”, Proceedings of the National Academy of Sciences USA, vol. 99 Suppl. 1, pp. 2539–2545, 2002.

    Article  Google Scholar 

  17. L. Li, D. Alderson, R. Tanaka, J.C. Doyle, and W. Willinger, “Towards a theory of scale-free graphs: Definition, properties, and implications (extended version)”, Tech. Rep. CIT-CDS-04 –006, Engineering and Applied Science, California Institute of Technology, 2005.

    Google Scholar 

  18. J.C. Doyle, D.L. Alderson, L. Li, M. Roughan, S. Shalunov, R. Tanaka, and W. Willinger, “The ‘robust yet fragile’ nature of the internet”, Proceedings of the National Academy of Sciences USA, vol. 102, pp. 14497–14502, 2005.

    Article  Google Scholar 

  19. R. Nagpal, “Engineering amorphous systems, using global-to-local compilation”, in Complex Engineered Systems: Science Meets Technology, D. Braha, A.A. Minai, and Y. Bar-Yam, Eds., pp. 291–306. Springer/NECSI, New York, 2006.

    Google Scholar 

  20. A.A. Minai, D. Braha, and Y. Bar-Yam, “Complex engineered systems: A new paradigm”, in Complex Engineered Systems: Science Meets Technology, D. Braha, A.A. Minai, and Y. Bar-Yam, Eds., pp. 1–21. Springer/NECSI, New York, 2006.

    Google Scholar 

  21. E. Bonabeau, M. Dorigo, and G. Theraulaz, Eds., Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, Oxford, 1999.

    MATH  Google Scholar 

  22. R. Albert, H. Jeong, and A.-L. Barabási, “Diameter of the world wide web”, Nature, vol. 401, pp. 130–131, 1999.

    Article  Google Scholar 

  23. S.-H. Yook, H. Jeong, and A.-L. Barabási, “Modeling the internet‘s large-scale topology”, Proceedings of the National Academy of Sciences USA, vol. 99, pp. 13382–13386, 2002.

    Article  Google Scholar 

  24. A. Van Ooyen and J Van Pelt, “Activity-dependent outgrowth of neurons and overshoot phenomena in developing neural networks”, Journal of Theoretical Biology, vol. 167, pp. 27–43, 1994.

    Article  Google Scholar 

  25. L. Kleinrock and J. Sylvester, “Optimum transmission radii for packet radio networks or why six is a magic number”, in NTC ‘78; National Telecommunications Conference, Birmingham, Ala., December 3–6, 1978, Conference Record. Volume 1. (A79–40501 17–32) Piscataway, NJ, Institute of Electrical and Electronics Engineers, Inc., 1978, p. 4.3.1–4.3.5., 1978, pp. 431–435.

    Google Scholar 

  26. L. Takagi and H. Kleinrock, “Optimal transmission ranges for randomly distributed packet radio terminals”, IEEE Transactions on Communications, vol. 32, no. 3, pp. 246–257, 1984.

    Article  Google Scholar 

  27. J. Ni and S.A.G. Chandler, “Connectivity properties of a random radio network”, IEE Proceedings – Communications, vol. 141, pp. 289–296, 1994.

    Article  Google Scholar 

  28. 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, 2004.

    Article  Google Scholar 

  29. O. Ferrari and G. Tonguz, “Minimum number of neighbors for fully connected uniform ad hoc wireless networks”, in Proceedings of IEEE International Conference on Communications, June, pp. 4331–4335, 2004.

    Google Scholar 

  30. Y.-C. Cheng and T.G. Robertazzi, “Critical connectivity phenomena in multihop radio models”, IEEE Transactions on Communications, vol. 37, pp. 770–777, 1989.

    Article  Google Scholar 

  31. P. Santi, “The critical transmitting range for connectivity in mobile ad hoc networks”, IEEE Transactions on Mobile Computing, vol. 4, no. 3, pp. 310–317, 2005.

    Article  Google Scholar 

  32. D. Stauffer and A. Aharony, Introduction to Percolation Theory, Taylor & Francis, London, UK, 1994.

    Google Scholar 

  33. C. Bettstetter, “On the minimum node degree and connectivity of a wireless multihop network”, in MobiHoc ‘02: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 80–91, 2002.

    Google Scholar 

  34. C. Bettstetter, “On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment”, in Proceedings of the IEEE Vehicular Technology Conference, 2002.

    Google Scholar 

  35. E. Duarte-Melo and M. Liu, “Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks”, in Proceedings of IEEE GLOBECOM 2002, November 2002.

    Google Scholar 

  36. R. Ramanathan and R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment”, in Proceedings of IEEE INFOCOM 2000, pp. 404–413, 2000.

    Google Scholar 

  37. S. Borbash and E. Jennings, “Distributed topology control algorithm for multihop wireless networks”, in Proceedings of the 2002 World Congress on Computational Intelligence, 2002.

    Google Scholar 

  38. N. Li and J.C. Hou, “Localized topology control algorithms for heterogeneous wireless networks”, IEEE/ACM Transactions on Networking, vol. 13, pp. 1313–1324, 2005.

    Article  Google Scholar 

  39. G Srivastava, P. Boustead, and J. Chicharo, “Connected fixed node degree based topologies in ad hoc networks”, in Proceedings of the 12th IEEE International Conference on Networks (ICON 2004), pp. 1330–1340, 2006.

    Google Scholar 

  40. P. Ranganathan, A. Ranganathan, A. Minai, and K. Berman, “A self-organizing heuristic for building optimal heterogeneous ad hoc sensor networks”, in Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control (ICNSC ‘06), pp. 774–779, 2006.

    Google Scholar 

  41. P. Ranganathan, A. Ranganathan, K. Berman, and A. Minai, “Discovering adaptive heuristics for ad-hoc sensor networks by mining evolved optimal configurations”, in Proceedings of the 2006 IEEE International Conference on Evolutionary Computation (CEC‘06), pp. 3064–3070, 2006.

    Google Scholar 

  42. A. Venuturumilli and A.A. Minai, “Obtaining robust wireless sensor networks through selforganization of heterogeneous connectivity”, in Proceedings of the 6th International Conference on Complex Systems, 2006.

    Google Scholar 

  43. Y. Wang, X. Wang, D.P. Agrawal, and A.A. Minai, “Impact of heterogeneity on coverage and broadcast reachability in wireless sensor networks”, in Proceedings of the 15th International Conference on Computer Communications and Networks, pp. 63–67, 2006.

    Google Scholar 

  44. D.J. Felleman and D.C. Van Essen, “Distributed hierarchical processing in the primate cerebral cortex”, Cerebral Cortex, vol. 1, pp. 1–47, 1991.

    Article  Google Scholar 

  45. O. Sporns, G. Tononi, and G.M. Edelman, “Theoretical neuroanatomy: Relating anatomical and functional connectivity in graphs and cortical connection matrices”, Cerebral Cortex, vol. 10, pp. 127–141, 2000.

    Article  Google Scholar 

  46. O. Sporns and G. Tononi, “Classes of network connectivity and dynamics”, Complexity, vol. 7, pp. 28–38, 2002.

    Article  MathSciNet  Google Scholar 

  47. V. Raghunathan, C. Schurgers, S. Park, and M.B. Srivastava, “Energy-aware wireless microsensor networks”, IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 40–50, 2002.

    Article  Google Scholar 

  48. I.F. Akyildiz, W. Su, Y. Sankaasubramaniam, and E. Cayrici, “A survey on sensor networks”, IEEE Communications Magazine, vol. 40, no. 8, pp. 102–114, 2002.

    Article  Google Scholar 

  49. W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks”, in Proceedings of the Hawaii International Conference on System Science, Maui, 2000.

    Google Scholar 

  50. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “SPAN: An energy-efficient coordination algorithm for topology maintenance in ad-hoc wireless networks”, in Mobile Computing and Networking, pp. 85–96, 2001.

    Google Scholar 

  51. N. Patwari, J.N. Ash, S. Kyperountas, A.O. Hero, R.L. Moses, and N.S. Correal, “Locating the nodes: Cooperative localization in wireless sensor networks”, IEEE Signal Processing Magazine, vol. 22, pp. 54–69, 2005.

    Article  Google Scholar 

  52. S. Gezici, Z. Tian, G.B. Giannakis, H. Kobayashi, A.F. Molisch, H.V. Poor, and Z. Sahinoglu, “Localization via ultra-wideband radios”, IEEE Signal Processing Magazine, vol. 22, pp. 70–84, 2005.

    Article  Google Scholar 

  53. S. Kim, A.P. Brown, T. Pals, R.A. Iltis, and H. Lee, “Geolocation in ad hoc networks using DS-CDMA and generalized successive interference cancellation”, IEEE Journal on Selected Areas in Communications, vol. 23, pp. 984–998, 2005.

    Article  Google Scholar 

  54. D. Reynolds, J.M. Carlson, and J. Doyle, “Design degrees of freedom and mechanisms of complexity”, Physical Review E, vol. 66, pp. 016108, 2005.

    Article  Google Scholar 

  55. M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, Cambridge, MA, 1998.

    MATH  Google Scholar 

  56. H. Zhang and A. Arora, “gs3: Scalable self-configuration and self-healing in wireless networks”, Computer Networks, vol. 43, pp. 459–480, 2003.

    Article  MATH  Google Scholar 

  57. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated coverage and connectivity configuration in wireless sensor networks”, in Proceedings of SenSys‘03, Los Angeles, CA, November 2003.

    Google Scholar 

  58. B. Krishnamachari, S. Wicker, R. Bejar, and C. Fernandez, “On the complexity of distributed self-configuration in wireless networks”, Telecommunication Systems, vol. 22, pp. 33–59, 2003.

    Article  Google Scholar 

  59. H. Gupta, S.R. Das, and Q. Gu, “Connected sensor cover: Self-organization of sensor networks for efficient query execution”, in Proceedings of MobiHoc‘03, Annapolis, MD, June 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arun Prasath .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Prasath, A., Venuturumilli, A., Ranganathan, A., Minai, A.A. (2010). Self-Organization of Sensor Networks with Heterogeneous Connectivity. In: Ferrari, G. (eds) Sensor Networks. Signals and Communication Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01341-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01341-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01340-9

  • Online ISBN: 978-3-642-01341-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics