A Resource Allocation Scheme for TH-UWB Networks with Multiple Sinks

Abstract—In this work, we study the time-slot allocation problem in a multi-sink single-hop TH-UWB network scenario, where the traffic from a sensor node is anycasted via a single hop to any one of multiple sinks. The slot allocation problem is formulated as an optimization problem and shown to be NP-hard. We then present a heuristic to increase network throughput and fairness as compared to a random allocation. In the proposed heuristic, nodes that are of similar distances to any sinks are grouped together to utilize the same set of TH slots for transmissions. Simulations show that the proposed heuristic improves both throughput and fairness, scales with multiple sinks and can be used as a simple admission control mechanism.

• Type: Conference
• Year: 2008
• Where: WCNC
• Authors: Hwee-Xian Tan, Mun-Choon Chan, Peng Yong Kong, Chen-Khong Tham
• Keywords: Allocation Problem, Multiple Sinks, Time-slot Allocation Problem, WCNC 2008, Wireless Networks