Issues in data stream management
ACM SIGMOD Record
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Fjording the Stream: An Architecture for Queries Over Streaming Sensor Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Real-Time Monitoring of Uncertain Data Streams Using Probabilistic Similarity
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
A real-time message scheduler support for dual-sink mobile ad-hoc sensor networks
Proceedings of the 2009 ACM symposium on Applied Computing
Design of a Reliable Communication System for Grid-Style Traffic Light Networks
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
MANNA: a management architecture for wireless sensor networks
IEEE Communications Magazine
Intelligent ubiquitous sensor network for agricultural and livestock farms
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Power-Constrained actuator coordination for agricultural sensor networks
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
Middleware integration for ubiquitous sensor networks in agriculture
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.00 |
This paper first presents an intelligent ubiquitous sensor network implementation for agricultural and livestock farms and designs an efficient cyclic routing scheme for network management messages, aiming at improving productivity and profit in those industries. Instead of multiple point-to-point message transmissions for status indication collection, our management message traverses the specific set of nodes of interest one by one. The management application collects routing information from the neighbor table commonly available in the current sensor protocol to calculate the communication cost between each pair of target nodes. Based on this topology view, a genetic algorithm solver decides the traversal sequence of a cyclic management path. The experiment result discovers that the multithreaded version, in which each thread runs its own initial population, can find a much better solution, efficiently escaping local traps.