Skip to main content

A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks

  • Conference paper
Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3421))

Included in the following conference series:

Abstract

Mobile ad-hoc networks (MANET) is a distributed systems formed by wireless mobiles nodes, that can dynamically self organize into arbitrary and temporary networks with no pre-existing communication infrastructure. After initialization, one of a crucial issue in ad-hoc network, is how to transmit items held by the stations to their destinations called Permutation Routing. As mobiles devises are dependant on battery power, it is important that this permutation routing minimize their energy consumption. But, it can occur during the permutation routing that some stations develop faults and stop working. The existence of these faulty nodes can significantly affect the packets delivery rate. If a faulty node, participating in a permutation routing operations, drops packets, all these packets will be lost. Hence, the goal of a fault tolerant permutation routing is to provide certain packet delivery guarantee in spite of the presence of faulty stations.

The main contribution of this paper is to present a protocol that provided an adequate level of fault tolerant and minimized energy during the permutation routing. Unlike in [2], in this work, in presence of faulty nodes, items can be transmitted to their destinations without loss.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in Ad Hoc Networks. Distributed Computing 15, 27–38 (2002)

    Article  Google Scholar 

  2. Datta, A.: Fault-tolerant and Energy-efficient Permutation Routing Protocol for Wireless Networks. In: 17th IEEE Intern. Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France, pp. 22–26 (2003)

    Google Scholar 

  3. Datta, A., Celik, A., Kumar, V.: Broadcast protocols to support efficient retrieval from databases by mobile users. ACM Transact on Database Systems 24, 1–79 (1999)

    Article  Google Scholar 

  4. Dechter, R., Kleinrock, L.: Broadcast communication and distributed algorithms. IEEE Trans. Comput. 35, 210–219 (1986)

    Article  Google Scholar 

  5. Hameed, S., Vaidya, N.H.: Log-time algorithm for scheduling single and multiple channel data broadcast. In: Proc. ACM MOBICOM, pp. 90–99 (1997)

    Google Scholar 

  6. Hayashi, T., Nakano, K., Olariu, S.: Randomized Initialization Protocols for Ad-Hoc Networks. IEEE Trans. Parallel Distr. Syst. 11, 749–759 (2000)

    Article  Google Scholar 

  7. Hayashi, T., Nakano, K., Olariu, S.: Randomized Initialization Protocols for Packet Radio Networks. In: IPPS/SPDP (1999)

    Google Scholar 

  8. Karimou, D., Myoupo, J.F.: An Application of an Initialization Protocol to Permutation Routing in a Single-hop Mobile Ad-Hoc Networks. In: Proc. International Conferences on Wireless Networks (ICWN 2004), Las Vegas, USA, June 21-24, vol. II, pp. 975–981 (2004)

    Google Scholar 

  9. Malpani, N., Vaidya, N.H., Welch, J.L.: Distributed Token Circulation on Mobile ad-Hoc Networks. In: 9th Intern. Conf. Networks Protocols, ICNP (2001)

    Google Scholar 

  10. Myoupo, J.F.: Concurrent Broadcasts-Based Permutation Routing algorithms in Radio Networks. In: IEEE Symposium on Computers and Communications (ISCC 2003), Antalya, Turkey (2003)

    Google Scholar 

  11. Myoupo, J.F.: Dynamic Initialization Protocols for Mobile Ad-Hoc Networks. In: 11th IEEE Intern. Conf. On Networks (ICON 2003 ), Sydney, Australia, pp. 149–154 (2003)

    Google Scholar 

  12. Myoupo, J.F., Ravelomanana, V., Thimonier, L.: Average Case Analysis Based-Protocols to Initialize Packet Radio Networks. Wireless Communication and Mobile Computing 3, 539–548 (2003)

    Article  Google Scholar 

  13. Nakano, K., Olariu, S., Schwing, J.L.: Broadcast-Efficient protocols for Mobile Radio Networks. IEEE T.P.DS. 10, 12,1276–1289 (1999)

    Google Scholar 

  14. Prabhakara, K., Hua, K.A., Oh, J.H.: Multi-level multi-channel air cache designs for broadcasting in mobile environment. In: Proc. IEEE Intern. Conf. On Data Engineering, USA, pp. 167–176 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karimou, D., Myoupo, J.F. (2005). A Fault-Tolerant Permutation Routing Algorithm in Mobile Ad-Hoc Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31957-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25338-9

  • Online ISBN: 978-3-540-31957-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics