ECN-Based Congestion Probability Prediction over Hybrid Wired-Wireless Networks

Ye, Jin; Huang, Jiawei; Wang, Jianxin; Zhang, Shigeng; Zhang, Zhenrong

doi:10.1155/2014/134620

Cited by 5 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 11 for a given number of VoIP conversations, is higher when using BEDCA as compared to EDCA. The reason lies in that the STA's contention window of the AC VO is fixed at (3,7) in EDCA while that is varied with the network conditions in BEDCA which is always larger than 7 in the experiments. That is to say, BEDCA performs a less aggressive behavior compared with EDCA in the mixed flows scenario and gives the data flows higher throughput.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Boosting VoIP Capacity via Service Differentiation in IEEE 802.11e EDCA Networks

Dong

Wang

et al. 2015

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

This paper considers the performance problem of VoIP over 802.11e WLANs caused by the unfairness between uplink and downlink as well as the inefficient EDCA. A novel medium access control scheme named BEDCA (Balanced EDCA) is presented, which provides service differentiation between the access point (AP) and the mobile stations (STAs) to enhance VoIP capacity. In BEDCA, the expression of AP's contention window is obtained which is a relative constant value independent of the participating STAs. The minimum contention window of the STAs is traffic-aware based on the proposed algorithm. The performance improvement of BEDCA is verified through intensive simulations and the results show the capacity improvement of 82.1% compared to EDCA.

show abstract

Section: Resultsmentioning

confidence: 99%

“…The above VoIP over WLAN performance issues have inspired a number of research studies both at the TCP layer [4][5][6][7][8] and the MAC layer. In the paper, we focus on the latter.…”

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

Boosting VoIP Capacity via Service Differentiation in IEEE 802.11e EDCA Networks

Dong

Wang

et al. 2015

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…Generally, since the main reason of message loss is the buffer overflow [25][26][27], various congestion control schemes are proposed [28][29][30]. In DTN, how to design buffer management schemes becomes very important for the multiple-copy routing performance.…”

Section: Buffer Managementmentioning

confidence: 99%

Mobility Similarity-Based Routing in Buffer-Limited Delay Tolerant Networks

Liu

Huang

Wang

et al. 2015

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

In delay tolerant networks (DTNs), multiple-copy routing is often adopted to improve the probability of successful message delivery but causes more traffic loads. The excessive increase in multiple messages copies often exhausts the network resources and deteriorates its performance significantly. To solve this problem, a mobility similarity-based routing (SBR) algorithm is proposed in this paper. On one hand, destination similarity is used to help the message carrier node find the appropriate relay nodes with the higher opportunity to meet the destination node in order to improve the delivery ratio. On the other hand, carrier similarity is adopted to avoid sending the same copy to the nodes with mobility similarity so as to reduce the number of message copies. Furthermore, inspired by the law of diminishing marginal utility in economics, a buffer management scheme based on the message transmission status is proposed. Experimental results show that the proposed SBR routing algorithm combined with the buffer management scheme can improve the delivery ratio and has the lower overhead ratio compared to other routing algorithms.

show abstract

A congestion control scheme based on probabilistic packet acceptance and drop in delay‐tolerant networks

Luo

Liu

et al. 2015

Concurrency and Computation

View full text Add to dashboard Cite

SummaryMessage 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 & Sons, Ltd.

show abstract

ECN-Based Congestion Probability Prediction over Hybrid Wired-Wireless Networks

Cited by 5 publications

References 27 publications

Boosting VoIP Capacity via Service Differentiation in IEEE 802.11e EDCA Networks

Boosting VoIP Capacity via Service Differentiation in IEEE 802.11e EDCA Networks

Mobility Similarity-Based Routing in Buffer-Limited Delay Tolerant Networks

A congestion control scheme based on probabilistic packet acceptance and drop in delay‐tolerant networks

Contact Info

Product

Resources

About