Skip to main content
SpringerLink
Log in

Self-Configuring, Self-Organizing, and Self-Healing Schemes in Mobile Ad Hoc Networks

  • Chapter
  • First Online:
Guide to Wireless Ad Hoc Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

The evolution of technology, the expansion of the Internet, and the tendency of systems to become more software-dependent make computing environments and networks more complicated and less humanly controlled. In this chapter, we consider the problem of organizing a set of mobile nodes, with unique IDs, that communicate through a wireless medium, into a connected network, in order to obtain a self-configuring or self-organizing network. Additionally, we address the issue of how a reliable structure, once acquired by self-configuring, can be maintained when topological changes occur, due to node failure, node motion, or link failure, in order to obtain a self-healing network. We discuss these concepts and present a brief history of self-configuring or self-healing algorithms, respectively, for wireless mobile networks. We detail a number of representative algorithms used in practice. We then go on to address the current theoretical results on self-configuring networks for which we propose directions for future research.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

Institutional subscriptions

References

  1. Aldrich J, Sazawal V, Chambers C, Notkin D (2002) Architecture-centric programming for adaptive systems. Proc 1st Workshop on Self-healing Syst, 93–95

    Google Scholar 

  2. Alwan A, Bagrodia R, Bambos N, Gerla M, Kleinrock L, Short J, Villasenor J (1996) Adaptive mobile multimedia networks. IEEE Pers Comm 3(2):34–51

    Article  Google Scholar 

  3. Alzoubi KM, Wan P-J, Frieder O (2002) Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. Proc 3rd ACM Intl Symp on Mobile Ad Hoc Networking and Computing, 157–164

    Google Scholar 

  4. Baker DJ, Ephremides A (1981) A distributed algorithm for organizing mobile radio telecommunication networks. Proc 2nd Intl Conf Distrib Computing Syst

    Google Scholar 

  5. Baker DJ, Ephremides A (1981) The architectural organization of a mobile radio network via a distributed algorithm. IEEE Trans Commun 29:11

    Google Scholar 

  6. Bein D (2008) Fault-tolerant k-fold pivot routing in wireless sensor networks. Hawaii Intl Conf. Syst. Sci (HICSS), 245

    Google Scholar 

  7. Bharghavan V, Demers A, Shenker S, Zhang L (1994) MACAW: a media access protocol for wireless LAN’s. Proc Conf Comm Architectures, Protocols, and Applications, 212–225

    Google Scholar 

  8. Bhatnagar A, Robertazzi TG (1990) Layer Net: a new self-organizing network protocol. Mil Comm Conf (Milcom) 2:845–849

    Google Scholar 

  9. Dai F, Wu J (2005) On constructing k-connected k-dominating set in wireless networks. Proc IEEE Intl Parallel and Distributed Processing Symp (IPDPS)

    Google Scholar 

  10. Dai F, Wu J (2006) On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J Parallel Distrib Computing 66(7):947–958

    Article  MATH  Google Scholar 

  11. Dunbar JE, Grossman JW, Hattingh JH, Hedetniemi ST, McRae AA (1997) On weakly-connected domination in graphs. Discrete Math 167/168:261–269

    Article  MathSciNet  Google Scholar 

  12. Ephremides A, Baker DJ (1981) An alternative algorithm for the distributed organization of mobile users into connected networks. Conf Inf Sci Syst

    Google Scholar 

  13. Forrest S, Hofmeyr SA, Somyaji A (1997) Computer immunology. Comm ACM 40(10):88–96

    Article  Google Scholar 

  14. Gallager R (1985) A perspective on multiaccess channels. IEEE Trans Inf Theory 31(2):124–142

    Article  MathSciNet  MATH  Google Scholar 

  15. Gao J, Guibas LJ, Hershberger J, Zhang L, Zhu A (2001) Discrete Mobile Centers. Proc 7th Annual Symp on Computational Geom (SCG), 188–196

    Google Scholar 

  16. Gao J, Guibas LJ, Hershberger J, Zhang L, Zhu A (2001) Geometric spanner for routing in mobile networks. Proc 2nd ACM Intl Symp on Mobile Ad Hoc Networking and Computing (MobiHoc), 45–55

    Google Scholar 

  17. Gao J, Guibas LJ, Hershberger J, Zhang L, Zhu A (2003) Discrete mobile centers. Discrete Comput Geom 30(1):45–65

    Article  MathSciNet  MATH  Google Scholar 

  18. George S, Evans D, Marchette S (2003) A biological programming model for self-healing. 1st ACM Workshop on Survivable and Self-regenerative Syst, 72–81

    Google Scholar 

  19. Gerla M, Tsai JT-C (1995) Multicluster, mobile, multimedia radio network. Wireless Networks 1(3):255–265

    Article  Google Scholar 

  20. Ghosh D, Sharman R, Rao HR, Upadhyaya S (2007) Self-healing systems – survey and synthesis. Decis Support Syst 42:2164–2185

    Article  Google Scholar 

  21. Goodman DJ, Valenzuela RA, Gayliard KT, Ramamurthi B (1989) Packet reservation multiple access for local wireless communications. IEEE Trans Comm 37(8):885–890

    Article  Google Scholar 

  22. Grover WD (1987) The selfhealing network: a fast distributed restoration technique for networks using digital cross-connect machines. IEEE Globecom

    Google Scholar 

  23. Gui C, Mohapatra P (2003) SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks. Proc 4th ACM Intl Symp on Mobile Ad Hoc Networking and Computing (MobiHoc), 279–290

    Google Scholar 

  24. Hong Y, Chen D, Li L, Trivedi K S (2002) Closed loop design for software rejuvenation. Workshop on Self-healing, Adaptive and Self-managed Syst (SHAMAN), 159–170

    Google Scholar 

  25. Horn P (2001) Autonomic computing: IBM’s perspective on the state of information technology. http://www-1.ibm.com/industries/government/doc/content/bin/auto.pdf. Accessed 20 February 2008

  26. Huhns MN, Holderfield VT, Gutierrez RLZ (2003) Robust software via agent-based redundancy. Proc 2nd Intl Joint Conf on Autonomous Agents and Multiagent Syst (AAMAS), 1018–1019

    Google Scholar 

  27. IBM (2008) Autonomic computing: The 8 Elements. http://researchweb.watson.ibm.com/autonomic/overview/elements.html. Accessed 20 February 2008

  28. Kaiser G, Gross P, Kc G, Parekh J, Valeto G (2002) An approach to autonomizing legacy systems. Workshop on Self-healing, Adaptive and Self-managed Syst (SHAMAN)

    Google Scholar 

  29. Karn P (1990) MACA-a new channel access method for packet radio. 9th Computer Networking Conf- ARRL/CRRL Amateur Radio

    Google Scholar 

  30. Konstantinou AV, Florissi D, Yemini Y (2002) Towards self-configuring networks. Proc DARPA Active Networks Conf and Exposition (DANCE), 143

    Google Scholar 

  31. Kratochvil J (1995) Problems discussed at the Workshop on Cycles and Colourings, http://univ.science.upsj.sk/c&c/rhistory/cc95prob.htm, Accessed 20 February 2008

  32. Kratochvil J, Manuel P, Miller M, Proskurowski A (1998) Disjoint and fold domination in graphs. Australas J Combinatorics 18:277–292

    MathSciNet  MATH  Google Scholar 

  33. Krishnamachari B, Wicker S, Bejar R, Fernandez C (2003) On the complexity of distributed self-configuration in wireless networks. Telecomm Syst 22(1–4): 33–49

    Article  Google Scholar 

  34. Kuhn F, Moscibroda T, Wattendorf R (2006) Fault-tolerant clustering in ad hoc and sensor networks. Proc 26th IEEE Intl Conf on Distributed Computing Syst (ICDCS), 68

    Google Scholar 

  35. Kutten S, Peleg D (1998) Fast distributed construction of small k-dominating sets and applications. J Algorithms, 40–66

    Google Scholar 

  36. de Lemos R, Fiadeiro JL (2002) An architectural support for self-adaptive software for treating faults. Proc 1st Workshop on Self-healing Syst, 39–42

    Google Scholar 

  37. Li Q, Rus D (2000) Sending messages to disconnected users in disconnected ad hoc mobile networks. Proc 6th Annual ACM/IEEE Intl Symp on Mobile Computing and Networking (MobiCom), 44–55

    Google Scholar 

  38. Liao CS, Chang GJ (2003) k-tuple domination in graphs. Inf Processing Letters 87:45–50

    Article  MathSciNet  MATH  Google Scholar 

  39. Lin CR, Gerla M (1997) Adaptive clustering for mobile wireless networks. IEEE J Selected Areas of Comm 15:1265–1275

    Article  Google Scholar 

  40. Merideth MG, Narasimhan P (2003) Proactive containment of malice in survivable distributed systems. Proc Intl Conf on Security and Management, 3–9

    Google Scholar 

  41. Michiels S, Desmet L, Janssens N, Mahieu T, Verbaeten P (2002) Self-adapting concurrency: the DMonA architecture. Proc 1st Workshop on Self-healing Systems, 43–48

    Google Scholar 

  42. Morrow Jr. RK, Lehnert JS (1992) Packet throughput in slotted ALOHA DS/SSMA radio systems with random signature sequences. IEEE Trans Comm 40(7):1223–1230

    Article  MATH  Google Scholar 

  43. Nagpal R, Kodancs A, Chang C (2003) Programming methodology for biologically-inspired self-assembling systems. AAAI Spring Symp on Computational Synthesis

    Google Scholar 

  44. Penso LD, Barbosa VC (2004) A distributed algorithm to find k-dominating sets. Discrete Applied Math 141(1–3):243–253

    Article  MathSciNet  MATH  Google Scholar 

  45. Post MJ, Kershenbaum AS, Sarachik PE (1985) A distributed evolutionary algorithm for reorganizing network communications. Mil Comm Conf (Milcom)

    Google Scholar 

  46. Post MJ, Kershenbaum AS, Sarachik PE (1985) A biased greedy algorithm for scheduling multi-hop radio networks. Proc Conf Inf Sci Syst, 564–572

    Google Scholar 

  47. Rajendran V, Obraczka K, Garcia-Luna-Aceves JJ (2006) Energy-efficient, collision-free medium access control for wireless sensor networks. Wireless Networks 12(1):63–78

    Article  Google Scholar 

  48. Robertazzi TG, Sarachik PE (1986) Self-organizing communication networks. IEEE Comm Magazine 24(1):28–33

    Article  Google Scholar 

  49. Scott K, Bambos N (1997) Formation and maintenance of self-organizing wireless networks. 31st Asilomar Conf on Signals, Syst and Computers 1:31–35

    Google Scholar 

  50. Shakkottai S, Rappaport TS, Karlsson PC (2003) Cross-layer design for wireless networks. IEEE Comm Magazine 41(10):74–80

    Article  Google Scholar 

  51. Shaw M (2002) Self-healing: softening precision to avoid brittleness. Workshop on Self-Healing Syst (WOSS), 111–114

    Google Scholar 

  52. Sohrabi K, Pottie G (1999) Performance of a novel self-organizing protocol for wireless ad hoc sensor networks. Proc IEEE Vehicular Technology Conf, 1222–1226

    Google Scholar 

  53. Sousa ES, Silvester JA (1988) Spreading code protocols for distributed spread-spectrum packet radio networks. IEEE Trans Comm 36(3):272–281

    Article  Google Scholar 

  54. Storey JS, Tobagi FA (1989) Throughput performance of an unslotted direct-sequence SSMA packet radio network. IEEE Trans Comm 37(8):814–823

    Article  Google Scholar 

  55. Tobagi FA, Kleinrock L (1975) Packet switching in radio channels: Part II – The hidden terminal problem in carrier sense multiple access and the busy tone solution. IEEE Trans Comm 23:1417–1433

    Article  MATH  Google Scholar 

  56. Vazirani V (2001) Approximation Algorithms. Morgan Kaufmann Publishers, Springer Verlag

    Google Scholar 

  57. Wang FH, Chang JM, Wang YL, Huang SJ (2003) Distributed algorithms for finding the unique minimum distance dominating set in split-stars. J Parallel Distrib Comput 63:481–487

    Article  MATH  Google Scholar 

  58. Wikipedia (2008) ISO 9126. http://en.wikipedia.org/wiki/ISO_9126. Accessed 20 February

  59. Zhang H, Arora A. (2002) GS3: scalable self-configuration and self-healing in wireless sensor networks. 21st ACM Symp on Principles of Distributed Computing (PODC)

    Google Scholar 

  60. Zhang H, Arora A (2003) GS3: scalable self-configuration and self-healing in wireless sensor networks. Computer Networks 43(4):459–480

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 800 W. Campbell Road; MS EC31, Richardson, TX 75080, USA

    Doina Bein

Authors
  1. Doina Bein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Doina Bein .

Editor information

Editors and Affiliations

  1. School of Information Technology, Indian Institute of Technology, Kharagpur, India

    Sudip Misra PhD

  2. Department of Computer Science, Ryerson University, 350 Victoria St, Toronto, ON, Canada

    Isaac Woungang PhD

  3. Department of Industrial & Management Engineering, Indian Institute of Technology, Kanpur, India

    Subhas Chandra Misra PhD

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

Bein, D. (2009). Self-Configuring, Self-Organizing, and Self-Healing Schemes in Mobile Ad Hoc Networks. In: Misra, S., Woungang, I., Chandra Misra, S. (eds) Guide to Wireless Ad Hoc Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84800-328-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-328-6_2

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-327-9

  • Online ISBN: 978-1-84800-328-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation