Throughput-Guaranteed Distributed Channel Assignment and Scheduling Algorithms with Low Complexity for Multichannel Wireless Sensor Networks

Abstract EN

In wireless sensor networks, an improved throughput capacity region can be achieved by equipping multiple channels.

However, such approach inevitably brings the issue of solving the coupled channel assignment and scheduling problem.

This paper put forward a low-complexity distributed channel assignment and scheduling policy for multichannel wireless sensor networks with single-hop traffic flows, named LDCS, as well as its multihop multipath extension.

Under the proposed algorithms, random access and backoff time techniques are introduced to keep the complexity low and independent of the number of links and channels.

Through theoretical analysis and simulation experiments, it is proved that the proposed algorithms are throughput guaranteed, and in some network scenarios, the achieved capacity region can be larger than that of other comparable distributed algorithms.