Available Bandwidth Estimation and Prediction in Ad hoc Networks

Zhao, Haitao; Wei, Jibo; Wang, Shan; Yang, Xi

doi:10.5772/13110

Cited by 6 publications

(6 citation statements)

References 48 publications

(71 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the above equation, the transmission probability t depends on P col and P b . In (20), under saturated traffic conditions (q → 1) when m = 0, that is when no exponential backoff is considered and assuming the packet transmission errors are only because of collisions and P b =0,t reduces to…”

Section: Transmission Probability Tmentioning

confidence: 99%

Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

2013

View full text Add to dashboard Cite

IEEE 802.11 is the most popular wireless local area network (WLAN) standard in use. WLANs support broadband multimedia communication and hence providing quality of service requirements such as good throughput and minimum endto-end delay are the two main challenging issues in designing of WLAN protocols for supporting real-time applications. Until now, several Markov chain models have been developed to evaluate and to enhance the performance of the IEEE 802.11 distributed coordination function (DCF) protocol. However, these models cannot accurately predict the performance of the network. Also, the existing models suffer with high packet collisions resulting in degradation of throughput and end-to-end delay particularly under congested environments. This study proposes an exact Markov chain model to accurately predict the performance of the wireless networks. To alleviate the collisions and to avoid channel capture effect, the authors introduce a post-backoff stage to provide inter packet backoff (IPB) delay between successive packet transmissions. The analysis is carried out by considering the non-saturated traffic and the impact of channel errors because of Rayleigh fading. Results show significant improvement in throughput and reduction in delay using the proposed model when compared with the existing models.

show abstract

Section: Transmission Probability Tmentioning

confidence: 99%

Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

2013

View full text Add to dashboard Cite

show abstract

“…On the other hand, the network does not yield best performance at saturated condition and wide-ranging of research has been undertaken to avoid the network from saturation [13]. So by considering effects of q and the analysis is done to a random input rate, which creates a more challenging problem.…”

Section: Now the Equation For E[s T ] Can Be Written Asmentioning

confidence: 99%

Modeling IEEE 802.11 DCF with Finite Retry Limits

Praveen¹,

Madhavi²

2014

IOSRJECE

View full text Add to dashboard Cite

show abstract

“…In [4] Zhao et al have reviewed the existing approaches of available bandwidth estimation. They presented the efforts and challenges in estimation of bandwidth.…”

Section: Related Workmentioning

confidence: 99%

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Arif¹,

Shrivastav²

2012

IJCA

View full text Add to dashboard Cite

A Mobile Ad hoc Network (MANET) is a self-organized system comprised of mobile wireless nodes with peer relationships. MANETs can operate without fixed infrastructure and can survive rapid changes in the network topology. Due to multi-hop routing and absence of any trusted third party in open environment, MANETs are vulnerable to attacks by malicious nodes or unwanted packet forwarding through UDSDV (Un-trust Destination Sequence distance vector routing). In order to decrease the unwanted data flooding and routing misbehaviour from malicious nodes or UDSDV node, we introduce the concept of trust based destination sequence distance vector routing that is TDSDV module, if we apply TDSDV routing and same time UDSDV node presence in the network so TDSDV node protect through unwanted packet flooding of the network and increases network performance. In this paper we proposed TDSDV trust based destination sequence distance vector routing and analyze the behaviour on the network parameter like throughput, packet delivery ratio, end-to-end delay, routing overhead and energy consume via mobile nodes in all three cases DSDV, UDSDV and TDSDV routing.

show abstract

Available Bandwidth Estimation and Prediction in Ad hoc Networks

Cited by 6 publications

References 48 publications

Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

Modeling IEEE 802.11 DCF with Finite Retry Limits

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Contact Info

Product

Resources

About