Shortest‐path‐based back‐pressure routing with single‐FIFO queueing in ad hoc networks'. Issue 5 (1st September 2019)

• Record Type: Journal Article
• Authors: Wang, Nan; Zhao, Hai; Hai, Long
• Is Part Of: IET networks. Volume 8:Issue 5(2019)
• Page Start: 339
• Page End: 345
• Publication Date: 2019-09-01
• Subjects: telecommunication network routing -- telecommunication congestion control -- queueing theory -- scheduling -- routing protocols -- radio networks -- telecommunication traffic; shortest‐path‐based back‐pressure routeing -- single‐FIFO queueing -- ad hoc networks -- network resources -- network throughput -- network congestion -- increase network transmission efficiency -- optimal routeing strategy -- joint routeing -- multihop wireless networks -- inefficient routeing decision -- complex queueing management -- improved back‐pressure routeing algorithm -- first‐input–first‐output queueing structure -- shortest‐path decision -- shortest‐path knowledge -- feasible routes -- shortest path -- network load -- feasible paths -- back‐pressure routeing design -- single‐FIFO queue architecture -- packet queueing management -- back‐pressure algorithms; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2018.5085
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : Owing to the limited network resources in ad hoc networks, improving network throughput is the key to solve network congestion and increase network transmission efficiency. Back‐pressure routeing, as an optimal routeing strategy for throughput, has recently received substantial attention for joint routeing and scheduling over multi‐hop wireless networks. However, the inefficient routeing decision and complex queueing management of back‐pressure routeing make it unsuitable for practical applications. This study proposes an improved back‐pressure routeing algorithm with one first‐input–first‐output (FIFO) queueing structure using the shortest‐path decision. By making use of the shortest‐path knowledge, the feasible routes quickly converge to the shortest path when the network is lightly loaded. On the other hand, when the network load is heavy, the proposed algorithm remains optimal for exploring all the feasible paths between each source and destination. The back‐pressure routeing design based on a single‐FIFO queue architecture greatly simplifies the complexity of packet queueing management. The authors' results indicate that the proposed routeing algorithm achieves lower end‐to‐end delay than that of some other back‐pressure algorithms without reducing the network throughput performance.