Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks

Ciullo, Delia; Martina, Valentina; Garetto, Michele; Leonardi, E.

doi:10.1109/infcom.2010.5461993

Cited by 48 publications

(43 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [30], Authors extended previous capacity scaling laws [29] for more wider class of wireless networks. In another extension of the same study [31], they also considered correlated movements of a group of nodes and assume fast mobility with an objective to maximize throughput of individual node. They discovered that correlated movement of wireless nodes have impact on delay and throughput of the network and at times can lead to better throughput performance as compared to independent node mobility.…”

Section: Related Workmentioning

confidence: 99%

Modeling packet loss probability and busy time in multi-hop wireless networks

Zeeshan

Ali

Anjum

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

Throughput imbalances among contending flows are known to occur when any carrier sense multiple access (CSMA)-based protocol is employed in multi-hop wireless networks. These imbalances may vary from slight difference in throughput to complete starvation in which some flows are unable to acquire channel accesses. The root cause of such imbalances is the lack of coordination when CSMA medium access control (MAC) protocols are employed in multi-hop wireless networks. In this paper, we accurately predict per-flow throughput in general multi-hop wireless networks while addressing CSMA's coordination problem. Unlike the previous work, our analytical throughput prediction model can clearly differentiate between links interfering from transmission range and carrier sensing range. Modeling of conditional packet loss probability and busy time sensed by each station is critical for per-flow throughput prediction in arbitrary networks. The calculation of both these parameters largely depends on MAC behavior due to geometrical configuration of interfering stations; we accurately compute conditional packet loss probability and busy time based on geometrical configuration of the interfering stations and predicted per-flow throughput. Our analytical results demonstrate improved accuracy, indicate throughput imbalances, and provide better understanding of CSMA-based protocol behavior in multi-hop wireless networks that can be used to design fair, scalable, and efficient MAC layer protocols.

show abstract

Section: Related Workmentioning

confidence: 99%

Modeling packet loss probability and busy time in multi-hop wireless networks

Zeeshan

Ali

Anjum

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…subject to Equation (2). Note that, due to QoS requirement, in our optimal solution a peer j may have multiple supplying parents in the constructed overlay.…”

Section: B Problem Formulationmentioning

confidence: 99%

“…In LocalTree, stable groups of users (e.g., connected users moving in similar direction with each other) are identified in a distributed manner, and then a local tree is constructed for each of such groups. (Indeed stable groups do exist in reality as observed in [1], [2], which show that mobile nodes often exhibit correlated physical movements.) For unstable peers and for inter-group stream distribution, LocalTree adapts unstructured algorithm to construct a streaming mesh.…”

Section: Introductionmentioning

confidence: 97%

LocalTree: An Efficient Algorithm for Mobile Peer-to-Peer Live Streaming

Chan

Cheung

et al. 2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-Mobile peer-to-peer (P2P) technique is a promising approach to provide live video streaming. In mobile P2P streaming, mobile devices relay their received packets in a multi-hop manner by means of broadcasting in a secondary channel (such as Wi-Fi or bluetooth). We consider the general scenario that both wireless channel and nodes may not be reliable, i.e., packets may be lost in channel transmission and a node may forward its received packets probabilistically (due to, for examples, its power and incentive concerns). Under this scenario, we study how to achieve broadcasting minimizing the energy consumption in the network while meeting a certain stream quality requirement (in terms of received packet loss rate). We first formulate the problem under study, and propose and study a distributed algorithm called LocalTree which addresses the problem. LocalTree takes advantage of stable clusters of users to optimize the construction of its streaming overlay. It combines the strengths of both tree-based and mesh-based algorithms, and is simple and effective. Simulation results show that LocalTree performs similar to tree-based algorithm for a rather stable network, and exhibits robustness similar to unstructured algorithm if the network is dynamic.

show abstract

“…We assume a time-scale of fast mobility [8] in this paper, i.e., the mobility of nodes is at the same time-scale as the data transmission. Thus, only one-hop transmissions are feasible during any single slot, and the total number of bits that can be transmitted in a time slot is a fixed constant independent of n. We normalize this constant to 1 here.…”

Section: A Network Modelmentioning

confidence: 99%

“…The delay and throughput trade-off has been further widely studied under different mobility models, like the i.i.d. mobility model [4], hybrid random walk and discrete random direction models [5], Brownian motion model [6], [7], and correlated mobility model [8]. These order sense results are helpful for us to understand the general scaling laws of delay and capacity in a 2-hop relay ad hoc mobile network, but they tell us a little about the real end-to-end delay and capacity of such networks.…”

Section: Introductionmentioning

confidence: 99%

Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms

Jiang

Nishiyama

et al. 2011

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-The 2-hop relay algorithm and its variants have been attractive for ad hoc mobile networks, because they are simple yet efficient, and more importantly, they enable the capacity and delay to be studied analytically. This paper considers the 2-hop relay with f -cast (2HR-f ) under i.i.d. mobility model, a general 2-hop relay algorithm that allows one packet to be delivered to at most f distinct relay nodes. The 2HR-f algorithm covers the available 2-hop relay algorithms (f = 1, √ n) as special cases. Closed-form analytical models rather than order sense ones are developed for the 2HR-f algorithm with a careful consideration of important medium contention and queuing delay issues, which enable an accurate delay and capacity analysis to be performed for ad hoc mobile networks employing 2HR-f . Based on our models and some typical settings of f (say, f = 1, √ n), one can easily derive the corresponding order sense results.

show abstract

Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks

Cited by 48 publications

References 25 publications

Modeling packet loss probability and busy time in multi-hop wireless networks

Modeling packet loss probability and busy time in multi-hop wireless networks

LocalTree: An Efficient Algorithm for Mobile Peer-to-Peer Live Streaming

Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms

Contact Info

Product

Resources

About