Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Traffic management genetic algorithm supporting data mining and qos in sensor networks
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
| Hi-index | 0.01 |
Sensor networks are expected to be used for spatial cognition in harsh environments. When an event happens, there will be several sensors detect it and send their reports to a sink, but these data are neither integrated nor reliable. Therefore, it is reasonable to make use of data fusion on intermediate nodes to achieve deeper knowledge on an event and cut down the total traffic at the same time. However, a node needs to decide in what order it send packets to its neighbors, which is called traffic scheduling. In sensor networks with data fusion, bad traffic scheduling results in remarkable delay, because an intermediate node must wait for all incoming data to arrive before it can perform data fusion. In order to prolong the network lifetime, we apply traffic scheduling to reduce the energy that consumed by such idle listening.