skip to main content
10.1145/1089803.1089974acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

Pheromone-aided robust multipath and multipriority routing in wireless MANETs

Published:10 October 2005Publication History

ABSTRACT

In this paper, we present an ant-based multipath routing protocol that considers both energy and latency. Energy efficiency is an important issue in mobile ad hoc networks (MANETs) since node energy supplies are stored in batteries. In order to increase the network lifetime it is important to maximize the minimum node energy along the path. As the network topology changes, failures may occur on active routes, resulting in the need for new route discoveries if only single routes per flow are maintained. Frequent new route discovery would, however, increase routing overhead and increase mean and peak packet latency. Using multiple routes simultaneously per flow can be a solution to these problems. In a multipath context, we consider mobile ad-hoc communication networks with dual-priority traffic: latency-critical and not latency-critical. For latency-critical traffic, energy-pheromone and delay-pheromone metrics are combined after being normalized so that their respective significance is preserved. For not latency-critical traffic, only energy-pheromone metrics are used.

References

  1. The network simulator-ns-2, http://www. isi.edu/nsnam/ns/.Google ScholarGoogle Scholar
  2. TR1000 radio datasheet, http://www.rfm.com/products/data/tr1000. pdf.Google ScholarGoogle Scholar
  3. P. Arabshahi, A. Gray, I. Kassabalidis, A. Das, S. Narayanan, M. El-Sharkawi, and R. M. II. Adaptive routing in wireless communication networks using swarm intelligence. In Proceedings of the 9th AIAA Int. Communications Satellite Systems Conf. pages 17--20, Toulouse, France, Apr. 2001.Google ScholarGoogle Scholar
  4. J. Cano and D. Kim. Investigating performance of power-aware routing protocols for mobile ad hoc networks. In Proc. of the International Mobility and Wireless Access Workshop pages 80--86, Forworth, Texas, USA, Oct 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. D. Caro and M. Dorigo. Mobile agents for adaptive routing. In Proceedings of HICSS Kohala Coast, HI, USA, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J.-H. Chang and L. Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM Tel-Aviv, Israel, Mar 2000.Google ScholarGoogle Scholar
  7. S. Chen and K. Nahrstedt. On finding multi-constrained paths. In Proceedings of IEEE ICC'98 pages 874--879, Atlanta, GA, USA, Jun 1998.Google ScholarGoogle Scholar
  8. S. Doshi, S. Bhandare, and T. Brown. An on-demand minimum energy routing protocol for a wireless ad hoc network. MC2R 6(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. Feng, K. Makki, N. Pissinou, andC. Doulgeris. An efficient approximate algorithm for delay-cost-constrained QoS routing. In Proceedings of ICCCN pages 395--400, Phoenix, AZ, USA, Oct 2001.Google ScholarGoogle ScholarCross RefCross Ref
  10. K. Fujita, A. Saito, T. Matsui, and H. Matsuo. An adaptive ant-based routing algorithm used routing history in dynamic networks. IPSJ SIGNotes MoBiLe computing and wireless communications 2001.Google ScholarGoogle Scholar
  11. M. Gunes, U. Sorges, and I. Bouazizi. ARA -the ant-colony based routing algorithm for MANETs. In Proceedings of ICPPW Vancouver, B. C. , Canada, Aug. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Jeon and G. Kesidis. Avoiding malicious packet dropping in ad hoc wireless networks using multipath routing. In Proceedings of the 43rd Annual Al lerton Conference on Communication, Control, and Computing Urbana, IL, USA, Sep. 2005.Google ScholarGoogle Scholar
  13. D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing volume 353, pages 153--181. Kluwer Academic Publishers, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. Kahn, R. Katz, and K. Pister. Next century challenges: Mobile networking for "smart dust ". In Proceedings of MOBICOM pages 271--278, Seattle, WA, USA, Aug 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. T. Korkmaz and M. Krunz. Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks. Modeling and Computer Simulation 10(4):295--325, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. J. La, J. H. Yoo, andM. Makowski. Convergence results for ant routing. In Proceedings of CISS University of Princeton, Princeton, NJ, Mar. 2004.Google ScholarGoogle Scholar
  17. S. J. Lee and M. Gerla. Split multipath routing with maximally disjoint paths in ad hoc networks. In ICC 2001 volume 10, pages 3201--3205, Jun 2001.Google ScholarGoogle ScholarCross RefCross Ref
  18. M. Marina and S. Das. On-demand multipath distance vector routing in ad hoc networks. In IEEE ICNP Riverside, CA, Nov 2001.Google ScholarGoogle Scholar
  19. M. Mauve, J. Widmer, and H. Hartenstein. A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine 15(6):30--39, Nov 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. R. Muraleedharan and L. Osadciw. Balancing the performance of a sensor network using an ant system. In 37th Annual Conference on Information Sciences and Systems Baltimore, MD, USA, Mar 2003.Google ScholarGoogle Scholar
  21. V. Park and M. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of IEEE INFOCOM Kobe, Japan, April 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. C. Perkins and E. Royer. Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications New Orleans, LA, Feb. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Roth and S. Wicker. Termite:Emergent ad-hoc networking. In Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks Mahdia, Tunisia, June 2003.Google ScholarGoogle Scholar
  24. A. Safwat, H. Hassanein, and H. Mouftah. Energy-aware routing in manets:Analysis and enhancements. In Proceedings of MSWiM Atlanta, GA, USA, Sep 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Singh and C. Raghavendra. Pamas:Power aware multi-access protocol with signaling for ad hoc networks. ACM SIGCOMM Computer Communication Review 26(3):5--25, Jul 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. A. Srinivas and E. Modiano. Minimum energy disjoint path routing in wireless ad-hoc networks. In Proceedings of MOBICOM SanDiego, CA, USA, Sep 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. D. Subramanian, P. Druschel, and J. Chen. Ants and reinforcement learning:A case study in routing in dynamic networks. In Proceedings of IJCAI Aug. 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. W. Ye, J. Heidemann, and D. Estrin. An energy-efficient mac protocol for wireless sensor networks. In Proceedings of IEEE INFOCOM New York, NY, USA, Jun 2002.Google ScholarGoogle Scholar
  29. Z. Ye, S. Krishnamurthy, and S. Tripathi. A framework for reliable routing in mobile ad hoc networks. In Proceedings of IEEE INFOCOM San Francisco, CA, Mar. 2003.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Pheromone-aided robust multipath and multipriority routing in wireless MANETs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      PE-WASUN '05: Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
      October 2005
      292 pages
      ISBN:1595931821
      DOI:10.1145/1089803

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 10 October 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate70of240submissions,29%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader