Network capacity of UWB-based sensor networks

Authors:
Yi Shi;Y. Thomas Hou
Affiliations:
Virginia Polytechnic Institute and State University, Blacksburg, VA;Virginia Polytechnic Institute and State University, Blacksburg, VA
Venue:
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Year:
2007

Citing 8
Cited 0

An on-demand minimum energy routing protocol for a wireless ad hoc network

ACM SIGMOBILE Mobile Computing and Communications Review
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Proceedings of the 9th annual international conference on Mobile computing and networking
A Scheduling Framework for UWB & Cellular Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Introduction to ultra wideband communication systems, an

Introduction to ultra wideband communication systems, an
Capacity regions for wireless ad hoc networks

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Ultra-wideband for multiple access communications

IEEE Communications Magazine
Optimal power control, scheduling, and routing in UWB networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ultra-wideband (UWB) has great potential for wireless communications in emerging applications such as sensor networks. This paper studies the following fundamental problems for UWB-based sensor networks: For a given network instance, what is the maximum data rate (network capacity) that can be received at the base-station (i.e., sink node)? What is the network capacity bound among arbitrary network instances? We show that these problems can be cast into a cross-layer formulation with joint consideration of routing, scheduling, power control, and rate assignment. For a given network instance, we find a closed-form network capacity as well as corresponding optimal routing, scheduling, power control, and rate assignment. We also find a network capacity bound among arbitrary network instances.