Scheduling algorithms and routing structures for efficient convergecast in wireless sensor networks

[[abstract]]Purpose – A primary task of wireless sensor networks is to measure environmental conditions. In most applications, a sink node is responsible for collecting data from the sensors through multihop communications. The communication pattern is called convergecast. However, radio congestion around the sink can easily become a bottleneck for the convergecast. The purpose of this paper is to consider both scheduling algorithms and routing structures to improve the throughput of convergecast. Design/methodology/approach – The paper addresses the issue from two perspectives. First by considering the transition scheduling that reduces radio interference to perform convergecast efficiently. Second, by studying the effects of routing structures on convergecast. A routing algorithm, called disjoint-strip routing, is proposed as an alternative to existing shortest-path routing. Findings – The paper shows that constructing a shortest-length conflict-free schedule is equivalent to finding a minimal vertex coloring. To solve the scheduling problem, a virtual-node expansion is proposed to handle relay operations and then coloring algorithms are utilized. Regarding the routing structures, a disjoint-strip algorithm is proposed to leverage possible parallel transmissions. Proposed algorithms are evaluated through simulations. Originality/value – This paper separates the problem for optimizing data-collection throughput into two stages: constructing a routing structure on a given deployment; and scheduling the activation time of each link. Determining routing topologies and communication schedules for optimal throughput are shown to be hard, so heuristics are applied in both stages. VNE is proposed, which makes traffic information visible to coloring algorithms. The advantage of VNE is verified through simulations. VNE can be applied to any coloring algorithm and any deterministic traffic pattern. It is shown that routing structures set a limit on the performance of scheduling algorithms. There are two possible ways in routing algorithms to improve convergecast throughput: first, by reducing the total number of transmissions during data collection; second, by transferring data in parallel. The shortest-path routing addresses the first point while DS addresses the second one. As expected, when the deployments are even and balanced, minimizing the number of transmissions is more effective than parallelizing them. On the other hand, when the deployments are unbalanced and conflicts are not strict, parallel transmissions can improve the throughput.[[fileno]]2030203010051[[department]]資訊工程學