Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks

Li, H.; Cheng, Yu; Zhou, Chi; Zhuang, Weihua

doi:10.1109/infcom.2009.5061905

Cited by 92 publications

(78 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As is typical of many random access protocols [24], [25], we make the following assumption: within the contention window, a certain link and all its interfering links have the same probability of wining the access to a certain channel j ∈ C. Following the methods provided in [29]- [31], we can obtain an approximate expression for the expected contention delay within one hop, which characterizes the expected waiting time before flow F k gets the opportunity to transmit one packet in channel j over link e:…”

Section: E Cost Modelmentioning

confidence: 99%

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Liang

Wang

Tian

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In Cognitive Radio Networks (CRNs), Secondary Users (SUs) can flexibly access Primary Users' (PUs') idle spectrum bands but such spectrum opportunities are dynamic due to PUs' uncertain activity patterns. In a multi-hop CRN consisting of SUs as relays, such spectrum dynamics will further cause the invalidity of pre-determined routes. In this paper, we investigate spectrum-mobility-incurred route-switching problems in both spatial and frequency domains for CRNs, where spatial switching determines which relays and links should be re-selected and frequency switching decides which channels ought to be re-assigned to the spatial routes. The proposed route-switching scheme not only avoids conflicts with PUs but also mitigates spectrum congestion. Meanwhile, tradeoffs between routing costs and channel switching costs are achieved. We further formulate the route-switching problem as the Route-Switching Game which is shown to be a potential game and has a pure Nash Equilibrium (NE). Accordingly, efficient algorithms for finding the NE and the ϵ−NE are proposed. Then we extend the proposed game to the incomplete-information scenario and provide a method to compute the Bayesian NE. Finally, we prove that the price of stability of the proposed game has a deterministic upper bound.

show abstract

Section: E Cost Modelmentioning

confidence: 99%

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Liang

Wang

Tian

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…In the same way as EER, this work assumes that the cost of a path does not only rely on the quality of individual links but also on their relative position on the path. Finally, EED/WEED [31] is another approach that was designed as a link/path metric to select paths with minimum end-to-end delay and high network throughput but considering load balancing of routing. In any case, there is no work concerning prediction of path quality in a Wireless Mesh Community Network.…”

Section: Link Quality Prediction In Community Networkmentioning

confidence: 99%

Tracking and Predicting End-to-End Quality in Wireless Community Networks

Millan

Molina

Dimogerontakis

et al. 2015

2015 3rd International Conference on Future Internet of Things and Cloud

View full text Add to dashboard Cite

Abstract-Community networks are an emergent model with mottos like "a free net for everyone is possible" or "don't buy the network, be the network". Their social impact is measurable, as the community is provided with the right and opportunity of communication. The combination of wired and wireless links in these networks, and the unreliable nature of the wireless medium, poses several challenges to the routing protocol. End-toEnd quality tracking helps the routing layer to select paths that maximize the delivery rate and minimize traffic congestion. We believe that End-to-End quality prediction can be a technique that surpasses End-to-End quality tracking by foreseeing which paths are more likely to change quality. In this work, we focus on End-to-End quality prediction by means of time-series analysis. We apply this prediction technique in the routing layer of largescale, distributed, and decentralized networks. We demonstrate that it is possible to accurately predict End-to-End Quality with an average Mean Absolute Error of just 2.4%. Particularly, we analyze the path properties and path ETX behavior to identify the best prediction algorithm. Moreover, we analyze the EtEQ prediction accuracy some steps ahead in the future and also its dependency of the time of the day.

show abstract

“…Accounting for the impact of link positions, a new metric ETOP is developed to further improve ETX [19]. Incorporating achievable bandwidth using multiple radios into end-to-end delay, the weighted expected end-to-end delay metric better captures the effect of interference and channel diversity [7]. However, existing metrics are not readily applicable to cognitive radio networks because they do not consider the time-varying spectrum availability.…”

Section: Related Workmentioning

confidence: 99%

“…Existing routing metrics [7] [8] which are proposed for wireless networks with fixed operating channel sets do not consider the spectrum dynamics, and hence are not suitable for cognitive radio networks. As spectrum handover caused by the appearance of primary users happens frequently in cognitive ad hoc networks, path breakage happens frequently to the cognitive nodes.…”

Section: Introductionmentioning

confidence: 99%

Coolest Path: Spectrum Mobility Aware Routing Metrics in Cognitive Ad Hoc Networks

Huang

et al. 2011

2011 31st International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

Abstract-Cognitive Radio (CR) emerges as a promising solution to current unbalanced spectrum utilization. The cognitive ad hoc network can take advantage of dynamic spectrum access and spectrum diversity over wide spectrum. It could achieve higher network capacity compared to traditional ad hoc networks, thus supporting bandwidth-demanding applications. A cognitive radio operates over wide spectrum with unpredictable channel availability. Moreover, the transmission opportunity of a cognitive node is not guaranteed due to the presence of primary users (PUs). These two unique features define new routing problems in cognitive ad hoc networks. To better characterize the unique features of cognitive radio networks, we propose new routing metrics, including accumulated spectrum temperature, highest spectrum temperature, and mixed spectrum temperature to account for the timevarying spectrum availability. The proposed metrics favor the "coolest" path, or the path with the most balanced and/or the lowest spectrum utilization by the primary users. We also study the computational complexity of the routing algorithm in cognitive ad hoc networks. Experiment results on our USRP-2 testbed show that the proposed metrics are capable of capturing the fluctuation of spectrum availability and suitable for cognitive ad hoc networks.

show abstract

Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks

Cited by 92 publications

References 23 publications

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework

Tracking and Predicting End-to-End Quality in Wireless Community Networks

Coolest Path: Spectrum Mobility Aware Routing Metrics in Cognitive Ad Hoc Networks

Contact Info

Product

Resources

About