Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks

Merlin, Simone; Vaidya, Nitin H.; Zorzi, Michele

doi:10.1109/infocom.2008.110

Cited by 73 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In grid deployment the maximal greedy algorithm performs close to optimal [20]. Performance of our centralized algorithm is close to that of maximal greedy (centralized) as seen in figure 2(a).…”

Section: Multiple Radio Multiple Bandsupporting

confidence: 53%

“…This greedy scheme continues until a maximal independent set is found. Under cross layer optimization framework this algorithm is shown to perform close to optimal in grid-like deployments [20].…”

Section: Multiple Radio Multiple Bandmentioning

confidence: 93%

“…3. Extensive Simulations: We have performed extensive simulations to compare our algorithms with a state of the art centralized algorithm for multi-radio multi-channel mesh networks [20]. We found our algorithm to perform 1.5 − 2× better than this algorithm in medium and heavily loaded networks when operated over diverse spectra.…”

Section: A Our Contributionsmentioning

confidence: 99%

See 2 more Smart Citations

Multiband wireless mesh networks: Frequency aware spectrum allocation and cross-layer optimization

Chatterjee

Deb²

2012

2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)

View full text Add to dashboard Cite

Recent advances in highly tunable radios, along with new spectrum policies have paved the way for design of mesh networks over spectrum that is non-contiguous, and has diverse propagation characteristics. Notable examples are multi-band WiMAX mesh, wireless mesh over digital TV white-spaces. The design of multihop wireless networks that can tune into any part of such large spectrum and adapt channel width presents certain unique challenges: (i) different communication neighbors of a node and different interference patterns in different bands, (ii) different spectral efficiencies in different bands and (iii) the interplay between different layer functions such as routing, scheduling as a result of this. In this paper, we solve the problem of frequency aware spectrum allocation to mesh nodes operating over diverse and fragmented spectrum. We show that, our solution has immediate application to jointly optimizing flow rate, routing, and scheduling. Our algorithms have provable performance guarantees and are amenable to distributed implementation. Simulations over a 25 node grid topology under proportional fair allocation show 1.8x-2.5x (depending on the number of radios per node) throughput gains compared to a frequency-unaware scheme.

show abstract

Section: Multiple Radio Multiple Bandsupporting

confidence: 53%

Section: Multiple Radio Multiple Bandmentioning

confidence: 93%

See 1 more Smart Citation

Multiband wireless mesh networks: Frequency aware spectrum allocation and cross-layer optimization

Chatterjee

Deb²

2012

2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)

View full text Add to dashboard Cite

show abstract

“…Most recent studies on channel allocation for multi‐radio mesh networks tend to jointly solve channel allocation and routing problem. Centralized solutions find the best combination of routes, channel assignments, and transmission schedules on all channels under a given network topology and traffic pattern. However, these optimization algorithms often fail to provide practical solutions for coordinating topology measurement and disseminating a channel assignment.…”

Section: Related Workmentioning

confidence: 99%

An end‐to‐end channel allocation scheme for a wireless mesh network

Tsao

Huang

et al. 2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYCo-channel interference seriously influences the throughput of a wireless mesh network. This study proposes an end-to-end channel allocation scheme (EECAS) that extends the radio-frequency-slot method to minimize co-channel interference. The EECAS first separates the transmission and reception of packets into two channels. This scheme can then classify the state of each radio-frequency-slot as transmitting, receiving, interfered, free, or parity. A node that initiates a communication session with a quality of service requirement can propagate a channel allocation request along the communication path to the destination. By checking the channel state, the EECAS can determine feasible radio-frequency-slot allocations for the end-to-end path. The simulation results in this study demonstrate that the proposed approach performs well in intra-mesh and inter-mesh communications, and it outperforms previous channel allocation schemes in end-to-end throughput.

show abstract

“…Given the number of channels among other inputs, the method is then used to develop a channel assignment for MRMC WMNs such that the number of links in the communications graph that can be active simultaneously is maximized. In [17], maximal weighted independent set solutions are used to develop an algorithm for link scheduling in multi-radio multi-channel multi-hop wireless networks. A polynomial computing method in [18] searches for the critical maximal independent set that needs to be scheduled for optimal resource allocation.…”

Section: Related Workmentioning

confidence: 99%

On the number of channels required for interference-free wireless mesh networks

Chaudhry

Chinneck

Hafez

2013

J Wireless Com Network

View full text Add to dashboard Cite

We study the problem of achieving maximum network throughput with fairness among the flows at the nodes in a wireless mesh network, given their location and the number of their half-duplex radio interfaces. Our goal is to find the minimum number of non-overlapping frequency channels required to achieve interference-free communication. We use our existing Select x for less than x topology control algorithm (TCA) to build the connectivity graph (CG), which enhances spatial channel reuse to help minimize the number of channels required. We show that the TCA-based CG approach requires fewer channels than the classical approach of building the CG based on the maximum power. We use multi-path routing to achieve the maximum network throughput and show that it provides better network throughput than the classical minimum power-based shortest path routing. We also develop an effective heuristic method to determine the minimum number of channels required for interference-free channel assignment.

show abstract

Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks

Cited by 73 publications

References 12 publications

Multiband wireless mesh networks: Frequency aware spectrum allocation and cross-layer optimization

Multiband wireless mesh networks: Frequency aware spectrum allocation and cross-layer optimization

An end‐to‐end channel allocation scheme for a wireless mesh network

On the number of channels required for interference-free wireless mesh networks

Contact Info

Product

Resources

About