Entire network load-aware cooperative routing algorithm for video streaming over mobile ad hoc networks

• Published in: Wireless communications and mobile computing Vol. 13; no. 12; pp. 1135 - 1149
• Main Authors: Kwon, Oh Chan, Oh, Hyung Rai, Lee, Zae-Kwun, Lee, GyeongCheol, Park, Youngho, Song, Hwangjun
• Format: Journal Article
• Language: English
• Published: Blackwell Publishing Ltd 25.08.2013
• Subjects: Ad hoc networks; Algorithms; Computer networks; Congestion; cooperative routingalgorithm; entire network load-aware; IEEE 802.11 multi-rate service; mobile ad hocnetworks; Networks; Routing (telecommunications); Stress concentration; video streaming; Wireless communication
• ISSN: 1530-8669; 1530-8677
• DOI: 10.1002/wcm.1169

ABSTRACTIn this paper, we present an entire network load‐aware cooperative routing algorithm based on IEEE 802.11 multi‐rate for video streaming over mobile ad hoc networks. The proposed routing algorithm is designed to minimize the consumed time slots while guaranteeing the required time slots at all the pairs of adjacent nodes over the route and the contention neighbors of these nodes to support the route. Furthermore, the proposed routing algorithm can distribute the network loads well over the entire network. This technology is essential because video streaming applications require stringent quality of service and even larger network resources compared with traditional data services, and these demands may dramatically increase the entire network load and/or cause network congestion. Finally, experimental results are provided to show a performance of the proposed routing algorithm. Copyright © 2011 John Wiley & Sons, Ltd. In this paper, we present an entire network load‐aware cooperative routing algorithm based on IEEE 802.11 multi‐rate for video streaming over mobile ad hoc networks. The proposed routing algorithm is designed to minimize the consumed timeslots while guaranteeing the required timeslots at all the pairs of adjacent nodes over the route and the contention neighbors of these nodes to support the route. Experimental results are provided to show a performance of the proposed routing algorithm.