Reconsidering wireless systems with multiple radios

Bahl, Paramvir; Adya, Atul; Padhye, Jitendra; Wolman, Alec

doi:10.1145/1039111.1039122

Cited by 282 publications

(178 citation statements)

References 20 publications

Supporting

Mentioning

176

Contrasting

Unclassified

Order By: Relevance

“…Many basic problems of standard wireless network optimisation can be reconsidered in such a setting [1], focusing in particular on issues related to routing [8] and network connectivity [6,9].…”

Section: Related Workmentioning

confidence: 99%

Exploiting multi-interface networks: Connectivity and Cheapest Paths

2009

View full text Add to dashboard Cite

Abstract. Let G = (V, E) be a graph which models a set of wireless devices (nodes V ) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at least one active interface. In general, every node holds a subset of all the possible k interfaces. Such networks are known as multi-interface networks. In this setting, we study two basic problems: Connectivity and Cheapest Path. The Connectivity problem corresponds to the well-known Minimum Spanning Tree problem in graph theory. In practice, we need to cover a subgraph of G of minimum cost which contains a spanning tree of G. The problem turns out to be APX -hard in general and for many restricted graph classes, however it is possible to provide approximation algorithms: a 2-approximation in general and a (2 − 1 k )-approximation for the unit cost interface case, i.e. when the cost of activating an interface is unitary for any interface. We also consider the problem in special graph classes, such as graphs of bounded degree, planar graphs, graphs of bounded treewidth, complete graphs. The Cheapest Path problem corresponds to the well-known Shortest Path problem in graph theory. In the multi-interface setting this problem is still polynomially solvable, and we point out a simple Dijsktra-based algorithm with O(k|E| + k|V | log(k + |V |)) runtime in general and O(k(|E| + |V |)) runtime for the unit cost interface case.

show abstract

Section: Related Workmentioning

confidence: 99%

Exploiting multi-interface networks: Connectivity and Cheapest Paths

2009

View full text Add to dashboard Cite

show abstract

“…al. [5] have pinpointed that the future solutions to achieve robust wireless system should not rely on requiring major breakthrough in radio technology, but instead combining the existing radio technologies in a way that uses their strengths constructively. Thus, they proposed a multi-radio framework that employs multiple radios in an integrated manner to accomplish a common task.…”

Section: Motivation and Related Workmentioning

confidence: 99%

On Separating Route Control and Data Flows in Multi-radio Multi-hop Ad Hoc Network

Wang

Franklin

Safaei

et al. 2007

2007 15th IEEE International Conference on Networks

View full text Add to dashboard Cite

Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels increase and the network becomes more heavily congested, there is an increased probability that these critical packets are lost, resulting in obsolete control information being used to make important decisions. This would further compound the problem of network congestion and lead to a very rapid loss of connectivity and throughput. Given this, we argue the solutions to these problems should not rely on putting extra bandwidth on a radio interface. Instead, we should exploit the use of multiple radios to ensure the route can be firmly established. In this paper, we propose a multiradio solution which reserves one radio channel exclusively for routing. Our simulation results have demonstrated that using a separate radio for routing protocol would dramatically improve reliability in heavily loaded ad hoc wireless networks, thereby effectively alleviating the impact of network congestion. Abstract-Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels increase and the network becomes more heavily congested, there is an increased probability that these critical packets are lost, resulting in obsolete control information being used to make important decisions. This would further compound the problem of network congestion and lead to a very rapid loss of connectivity and throughput. Given this, we argue the solutions to these problems should not rely on putting extra bandwidth on a radio interface. Instead, we should exploit the use of multiple radios to ensure the route can be firmly established. In this paper, we propose a multiradio solution which reserves one radio channel exclusively for routing. Our simulation results have demonstrated that using a separate radio for routing protocol would dramatically improve reliability in heavily loaded ad hoc wireless networks, thereby effectively alleviating the impact of network congestion. Disciplines Physical Sciences and Mathematics

show abstract

“…The other is asynchronous wake-up by external triggers. In this method, each node uses a low power wake-up radio (WuR) [4][5][6] to accept remote wake-up request, and activates its powerhungry parts on demand. Recently, the standardization of wake-up control for WLAN module was started as well [7].…”

Section: Introductionmentioning

confidence: 99%

Reducing false wake-up in contention-based wake-up control of wireless LANs

Tang

Obana

2018

Wireless Netw

View full text Add to dashboard Cite

This paper studies the potential problem and performance when tightly integrating a low power wake-up radio (WuR) and a power-hungry wireless LAN (WLAN) module for energy efficient channel access. In this model, a WuR monitors the channel, performs carrier sense, and activates its co-located WLAN module when the channel becomes ready for transmission. Different from previous methods, the node that will be activated is not decided in advance, but decided by distributed contention. Because of the wake-up latency of WLAN modules, multiple nodes may be falsely activated, except the node that will actually transmit. This is called a false wake-up problem and it is solved from three aspects in this work: (i) resetting backoff counter of each node in a way as if it is frozen in a wake-up period, (ii) reducing false wake-up time by immediately putting a WLAN module into sleep once a false wake-up is inferred, and (iii) reducing false wake-up probability by adjusting contention window. Analysis shows that false wake-ups, instead of collisions, become the dominant energy overhead. Extensive simulations confirm that the proposed method (WuR-ESOC) effectively reduces energy overhead, by up to 60% compared with state-of-the-arts, achieving a better tradeoff between throughput and energy consumption.

show abstract

Reconsidering wireless systems with multiple radios

Cited by 282 publications

References 20 publications

Exploiting multi-interface networks: Connectivity and Cheapest Paths

Exploiting multi-interface networks: Connectivity and Cheapest Paths

On Separating Route Control and Data Flows in Multi-radio Multi-hop Ad Hoc Network

Reducing false wake-up in contention-based wake-up control of wireless LANs

Contact Info

Product

Resources

About