Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks

In this report, we study the issue of delay optimization and energy efficiency in grid wireless sensor networks (WSNs). We focus on STDMA (Spatial Reuse TDMA)) scheduling, where a predefined cycle is repeated, and where each node has fixed transmission opportunities during specific slots (defined by colors). We assume a STDMA algorithm that takes advantage of the regularity of grid topology to also provide a spatially periodic coloring ("tiling" of the same color pattern). In this setting, the key challenges are: 1) minimizing the average routing delay by ordering the slots in the cycle 2) being energy efficient. Our work follows two directions: first, the baseline performance is evaluated when nothing specific is done and the colors are randomly ordered in the STDMA cycle. Then, we propose a solution, ORCHID that deliberately constructs an efficient STDMA schedule. It proceeds in two steps. In the first step, ORCHID starts form a colored grid and builds a hierarchical routing based on these colors. In the second step, ORCHID builds a color ordering, by considering jointly both routing and scheduling so as to ensure that any node will reach a sink in a single STDMA cycle. We study the performance of these solutions by means of simulations and modeling. Results show the excellent performance of ORCHID in terms of delays and energy compared to a shortest path routing that uses the delay as a heuristic. We also present the adaptation of ORCHID to general networks under the SINR interference model

Simulation based Evaluation of Attribute Aware Scheduling in Heterogeneous Wireless Sensor Networks

In many applications of sensor networks, it is required to sense multiple physical parameters of the same region. So multiple different types of sensors are deployed. Such networks are known as heterogeneous networks. In tree based heterogeneous networks, complete aggregation is not possible at every node. The reason is that parent and child node may be of different types. The term Attribute is used to refer to type of packet. When objective is to maximize aggregation, parent selection should be done such that packet sent by given node should be aggregated as soon as possible in its path towards the sink. This approach would result in reduction in schedule length of the tree. Such an algorithm is known as Attribute Aware Scheduling Algorithm. In this work, one such algorithm is evaluated through simulations. It is found that Attribute Aware Scheduling results in better aggregation, smaller schedule length, and reduction in energy consumption. The reduction in schedule length means smaller latency and reduction in energy consumption means extended network lifetime