Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

Alicherry, Mansoor; Bhatia, Randeep; Li, Li Erran

doi:10.1109/jsac.2006.881641

Cited by 270 publications

(204 citation statements)

References 10 publications

Supporting

Mentioning

204

Contrasting

Order By: Relevance

“…Noticing the above fact, we model power consumption as a general function φ e,j (r k ) (and φ k e,j for short), which neatly captures the influence of flow rates, channel quality and geographical conditions on power consumption. Note that φ k e,j can be of different forms, depending on the features of wireless networks 6 . Then, the energy costs of flow F k are shown as:…”

Section: E Cost Modelmentioning

confidence: 99%

“…In this paper, we assume the overall switching costs γ are incurred only in the OFF→ON transition. 6 For example, a possible expression of φ k e,j is based on Shannon Formula in the presence of AWGN, i.e.,…”

Section: E Cost Modelmentioning

confidence: 99%

“…The interference range of each node is 60m. The number of radios equipped by each SU is a random integer following the uniform distribution between [1,6]. Flow rates and packet sizes are uniformly distributed in [0.8,1.2]Mbps and [600,800]Bytes, respectively.…”

Section: A Simulation Settingsmentioning

confidence: 99%

See 2 more Smart Citations

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%

Section: E Cost Modelmentioning

confidence: 99%

See 1 more Smart Citation

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

“…The problem of transmission constraints has also been studied in [4], [12] and [16]. (We will denote the particular constraint considered at a time as (T )).…”

Section: Routing and Scheduling Aggregate Trafficmentioning

confidence: 99%

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

Sharma

Kumar

Sandeep

et al. 2008

2008 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-We consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. We first obtain an optimal and fair routing and scheduling policy for aggregate demands for different sourcedestination pairs. We then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. Our algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. We have verified our algorithms via extensive simulations.

show abstract

“…Both centralized and decentralized approximations have been proposed for static or slow-varying networks. Centralized approaches reduce the problem into a graphcoloring problem [1], [5], [6], [9] and focus on heuristics based approximations performed at a central server. Alternative approaches apply device coordination to resolve conflict and refine channel assignment locally, significantly reducing communication and computation complexity without relying on any central servers.…”

Section: B Existing Spectrum Management Solutionsmentioning

confidence: 99%

Group-Mobility-Aware Spectrum Management for Future Digital Battlefields

2006

View full text Add to dashboard Cite

Abstract-Efficient access to spectrum is critical to maintain reliable and robust communication in military networks, especially for ground vehicles on the move. High mobility and frequent topology variations make spectrum management in battlefields challenging. In this paper, we present a decentralized, hierarchical approach to assign spectrum channels among vehicles in a fair and efficient manner. Making use of group mobility, we propose a low-complexity allocation scheme with minimum communication and computation overhead. Experimental results demonstrate that the proposed algorithm can reduce the overhead by 10+ fold with maintaining reasonable spectrum utilization.

show abstract

Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

Cited by 270 publications

References 10 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

Providing QoS to Real and Data Applications in WiMAX Mesh Networks

Group-Mobility-Aware Spectrum Management for Future Digital Battlefields

Contact Info

Product

Resources

About