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

Abstract

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.

MUSIKA: A multichannel multi-sink data gathering algorithm in wireless sensor networks

“…In [6], authors focus on time slot assignment in a multisink single hop UWB WSNs which is formulated as a linear programming problem. They also implement a heuristic to improve both throughput and fairness.…”

A resource allocation scheme to achieve fairness in TH-UWB sensor networks with near-far effects

“…In a network with N sensor sources, the general allocation problem is to find the value of {C 1 , C 2 , ..., C N } such that fairness is maximized. Existing work in the literature suggests that finding such solution is NP-hard [8]- [10]. The high complexity of the optimal solution motivates the use of a simple heuristics to provide an acceptable suboptimal solution.…”