A congestion control scheme based on probabilistic packet acceptance and drop in delay‐tolerant networks. (27th January 2015)

• Record Type: Journal Article
• Authors: An, Ying; Luo, Xi; Liu, Yao; Huang, Jiawei; Min, Geyong; Wang, Jianxin; Limet, Sébastien; Smari, Waleed W.; Spalazzi, Luca; Hu, Jia; Gao, Jianliang
• Is Part Of: Concurrency and computation. Volume 27:Number 13(2015:Sep.)
• Page Start: 3429
• Page End: 3445
• Publication Date: 2015-01-27
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3455
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3455-abs-0001"> <title>Summary</title> <p id="cpe3455-para-0001">Message replication is often used to improve the delivery ratio in delay‐tolerant networks because of the short‐lived wireless connectivity environment. However, packet replication may easily incur large resource consumption and finally result in network congestion. This paper proposes a probabilistic packet acceptance and drop algorithm (PAD), which adaptively controls congestion for delay‐tolerant networks. In PAD algorithm, the queue length and the input/output rate are combined to detect congestion. Based on the congestion state, each node determines the probability of accepting or dropping packets to obtain a good trade‐off between high delivery ratio and low overhead. Furthermore, based on the birth–death model, we construct the continuous‐time Markov chain to analyze the delivery ratio of a packet. Theory analysis and simulation results show that PAD increases the delivery ratio by more than 130% with least overhead. Meanwhile, it also achieves the shortest average end‐to‐end delay when the buffer of a node is severely limited. Copyright © 2015 John Wiley &amp; Sons, Ltd.</p> </abstract>