Increased connectivity at lower cost: The case for multi-radio nodes in multi-hop wireless networks

Authors:
Stefano Basagni;András Faragó;Maurizio A. Nanni;Dung T. Tran
Affiliations:
Northeastern University, Boston, MA;Univ. of Texas at Dallas, Richardson, TX;Northeastern University, Boston, MA;Univ. of Texas at Dallas, Richardson, TX
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 1

A simple min-cut algorithm

Journal of the ACM (JACM)
On Nearest-Neighbor Graphs

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Graphs and Hypergraphs

Graphs and Hypergraphs
Connectivity in wireless ad-hoc networks with a log-normal radio model

Mobile Networks and Applications
On the Fundamental Limits of Topology Control in Ad Hoc Networks

Algorithmica
ns2-MIRACLE: a modular framework for multi-technology and cross-layer support in network simulator 2

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Communication over a wireless network with random connections

IEEE Transactions on Information Theory

Network topology models for multihop wireless networks

ISRN Communications and Networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address multi-radio networks, i.e., wireless networks where the nodes are equipped with multiple air interfaces. We analyze, both analytically and via simulation, various gains that the multi-radio environment can provide. First we investigate the gain in network connectivity by modeling the topology of a multi-radio network by a multigraph. The gain is captured by introducing the novel graph theoretic concept of the multigraph advantage. It is the surplus of connectivity over the sum of the individual connectivities, as we put together several graphs to form a multigraph sum. We first prove that in the traditional random graph model it results in a strict super-additive behavior. We validate the theoretical results via simulations and show that similar phenomena occur in geometric random graph models. We then investigate, via ns2-based simulations, the nodal energy consumption as well as the end-to-end packet latency needed to route packets in a multi-radio network.