On Active Interval Scheduling in Static Sensor Networks

M.-H. Jin, Y.-C. Huang (Taiwan), D.F. Hsu (USA), C.-Y. Kao, Y.-R. Wu, and C.-K. Lee (Taiwan)


Sensor network, active interval, scheduling


Most wireless sensor networks base their design on an ad hoc (multi-hop) network technology that focus on organizing and maintaining a network formed by a group of moving objects with a communication device in an area with no fixed base stations or access points. Although ad hoc network technologies are capable of constructing a sensor network, the design and implementation of sensor networks for monitoring stationary nodes such as construction sites and nature disaster-prone areas can be furthered simplified to reduce power consumption and overhead. Based on the nature of immobile nodes, a hierarchical sensor network architecture (hierarchical SNA) and its associated communication protocols are proposed in this paper. In this proposed architecture, most elements in the sensor network are designed to be equipped with no functions for message forwarding or channel scheduling. The local control center (LLC) uses a centralized communication protocol to communicate with all the sensor nodes of the same cluster and forward the detection results from the sensor nodes to the global control center (GCC). To avoid the communication interference between adjacent clusters, a new scheduling scheme called the active interval scheduling scheme is proposed in this paper. In addition, two greedy algorithms are proposed to improve the report sensitivity for the networks maintenance. The experimental results show that the proposed greedy algorithms can both generate sensitive enough schedules.

Important Links:

Go Back