WLC07-4: Spanning Tree Backbone in Multihop Wireless Networks

Author

Hira, Mukesh M. ; Tobagi, Fouad A.

Author_Institution

Dept. of Electr. Eng., Stanford Univ., Stanford, CA

fYear

2006

fDate

Nov. 27 2006-Dec. 1 2006

Firstpage

1

Lastpage

6

Abstract

In this paper, we present an approach to routing critical data in multihop wireless networks over the most reliable links in the network. We present the concept of a maximum SNR spanning tree (MSST) in multihop wireless networks, a spanning tree with the maximum sum of signal to noise ratios of links that form the tree. We show that such a backbone has certain properties that would be of interest in multihop wireless network deployments where reliability of links over which data is routed is of critical concern. The minimum SNR along the path on the MSST between any pair of nodes is the highest among all paths between the pair of nodes. Also, the minimum value of SNR among the SNRs of links that form the MSST is the highest among all spanning trees of the network.

Keywords

radio networks; telecommunication network reliability; telecommunication network routing; trees (mathematics); maximum SNR spanning tree backbone; multihop wireless network routing; reliable link; Fading; Propagation losses; Quantum computing; Routing protocols; Signal to noise ratio; Spine; Spread spectrum communication; Wireless communication; Wireless networks; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Conference_Location

San Francisco, CA

ISSN

1930-529X

Print_ISBN

1-4244-0356-1

Electronic_ISBN

1930-529X

Type

conf

DOI

10.1109/GLOCOM.2006.654

Filename

4151284