Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Flooding-limited for multi-constrained quality-of-service routing protocol in mobile ad hoc networks

Flooding-limited for multi-constrained quality-of-service routing protocol in mobile ad hoc networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

  • Author(s): Y.-S. Yen 1 ; R.-S. Chang 2 ; H.-C. Chao 3
    • View affiliations
    • Affiliations: 1: Department of Informatics, Fo Guang University, I-Lan, Taiwan, Republic of China
      2: Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan, Republic of China
      3: Department of Electronic Engineering, National Ilan University, I-Lan, Taiwan, Republic of China
  • Source: Volume 2, Issue 7, August 2008, p. 972 – 981
    DOI:  10.1049/iet-com:20070471 , Print ISSN 1751-8628, Online ISSN 1751-8636
© The Institution of Engineering and Technology
Published

Multi-constrained quality-of-service (QoS) routing is used to find routes in a network to satisfy multiple independent QoS constraints. This problem is considered to be NP-complete, and most existing QoS routing algorithms are based on maintaining a global network state at every node. A multi-constrained, flooding-limited, QoS routing method to deal with limited available resources and minimum computation in a dynamic environment is proposed. The solution is based on decomposition of a routing area and a restriction in the exchange of routing information. It reduces the size of the control messages, restricts the amount of routing information, minimises the overhead from the flooding of control traffic and decreases the complexity of path selection. It is also proved that the flooding-limited-path heuristic can achieve very high performance by maintaining entries in each node, which indicates that the performance of the limited-path heuristic is not sensitive to the number of constraints. Simulation results show that this protocol provides better performance than other protocols, especially with regards to end-to-end delay, throughput and packet loss.

Inspec keywords: optimisation; ad hoc networks; quality of service; routing protocols; telecommunication traffic; mobile radio

Other keywords: multiconstrained quality-of-service; NP-complete problem; flooding-limited-path heuristic performance; traffic control; mobile ad hoc network; QoS routing protocol

Subjects: Protocols; Optimisation techniques; Mobile radio systems; Communication network design, planning and routing

References

    1. 1)
      • Morgan, Y.L., Kunz, T.: `Enhancing SWAN QoS model by adopting destination-based regulation (ESWAN)', Proc. WiOpt ‘04, March 2004, p. 112–121.
    2. 2)
      • Adjih, C., Baccelli, E., Jacquet, P.: `Link state routing in wireless ad hoc networks', IEEE Military Commun. Conf., October 2003, 2, p. 1274–1279.
    3. 3)
      • L. Villasenor-Gonzalez , G.E. Ying , L. Lament . HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks. Commun. Mag., IEEE , 7 , 118 - 125
    4. 4)
      • X. Yuan . Heuristic algorithms for multiconstrained quality-of-service routing. IEEE/ACM Trans. Netw. , 2 , 244 - 256
    5. 5)
      • Ma, Q., Steenkiste, P.: `Quality of service routing with performance guarantees', Proc. 4th Int. IFIP Workshop on QoS, May 1997.
    6. 6)
      • C.E. Perkins , E.M. Royer , S.R. Das . Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Pers. Commun. , 1 , 16 - 28
    7. 7)
      • Perkins, C.E., Bhagwat, P.: `Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers', Proc. ACM the SIGCOMM ‘94, October 1994, 24, p. 234–244, (4).
    8. 8)
      • Perkins, C.E., Belding-Royer, E.M., Das, S.R.: ` on-demand distance vector (AODV) routing', RFC 3561, July 2003.
    9. 9)
      • D. Reeves , H. Salama . A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Trans. Netw. , 2 , 239 - 250
    10. 10)
      • Korkmaz, T., Krunz, M.: `Multi-constrained optimal path selection', Proc. IEEE INFOCOM ‘01, April 2001, 2, p. 834–843.
    11. 11)
      • Johnson D.B., Maltz D.A., Hu Y.-C.: ‘The dynamic source routing protocol for mobile ad hoc networks’, IETF Internet Draft, draft-ietf-manet-dsr-10.txt, July 2004.
    12. 12)
      • D.B. Johnson , D.A. Maltz , C.E. Perkins . (2001) DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks.
    13. 13)
      • Q. Xue , A. Ganz . Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks. J. Parallel Distrib. Comput. , 154 - 165
    14. 14)
      • P. Mohapatra , J. Li , C. Gui . QoS in mobile ad hoc networks. IEEE Wirel. Commun. Mag. , 3 , 44 - 52
    15. 15)
      • G. Manimaran , H.S. Rahul , C. Sivaram Murthy . A new distributed route selection approach for channel establishment in real-time networks. IEEE/ACM Trans. Netw. , 5 , 698 - 709
    16. 16)
      • Y.-S. Chan , Y.-C. Tseng , J.-P. Sheu , P.-H. Kuo . An on-demand, link-state, multi-path QoS routing in a wireless mobile ad hoc network. Comput. Commun. , 1 , 27 - 40
    17. 17)
      • Song, J., Pung, H.K., Jacob, L.: `Multi-constrained distributed QoS routing algorithm', Proc. IEEE Int. Conf. Networks (ICON'00), September 2000, p. 165–171.
    18. 18)
      • Sheltami, T., Mouftah, H.: `A comparative study of on-demand and cluster-based routing protocols in MANETs', Proc. IEEE Int. Performance, Computing, and Communications Conf., April 2003, p. 291–295.
    19. 19)
      • Ghosh, S., Osbrough, S., Singh, S.: `A heuristic for low power QoS routing in ad hoc networks', IEEE TENCON ‘05, November 2005, p. 1–6.
    20. 20)
      • Ahn, G.-S., Campbell, A.T., Veres, A., Sun, L.-H.: `SWAN: service differentiation in stateless wireless ad hoc networks', Proc. IEEE INFOCOM ‘02, June 2002, 2, p. 457–466.
    21. 21)
      • Park, V.D., Corson, M.S.: `Temporally-ordered routing algorithm (TORA) version 1', IETF Internet Draft, draft-ietf-manet-tora-spec-03.txt, June 2001.
    22. 22)
      • Zhang, Y., Gulliver, T.A.: `Quality of service for ad hoc on-demand distance vector routing', IEEE WiMob ‘05, August 2005, 3, p. 192–196.
    23. 23)
      • Chiang, C.-C.: `Routing in clustered multi-hop mobile wireless networks with fading channel', Proc. IEEE SICON ‘97, April 1997, p. 197–211.
    24. 24)
      • R. Sivakumar , P. Sinha , V. Bharghavan . CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE J. Sel. Areas Commun. , 8 , 1454 - 1465
    25. 25)
      • Gozupek, D., Papavassiliou, S., Ansari, N., Yang, J.: `A power efficient QoS provisioning architecture for wireless ad hoc networks', IEEE Int. Conf. Communications (ICC ‘06), June 2006, 8, p. 3873–3878.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20070471
Loading

Related content

content/journals/10.1049/iet-com_20070471
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address