Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
ACM SIGMAP Bulletin
Non-interfering Multipath Geographic Routing for Wireless Multimedia Sensor Networks
MINES '09 Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01
SENSORCOMM '10 Proceedings of the 2010 Fourth International Conference on Sensor Technologies and Applications
SNEE: a query processor for wireless sensor networks
Distributed and Parallel Databases
A half-key key management scheme for wireless sensor networks
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
A novel key management scheme for wireless embedded systems
ACM SIGAPP Applied Computing Review
An algorithmic strategy for in-network distributed spatial analysis in wireless sensor networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Wireless Sensor Networks (WSN) have recently been in the limelight for many domains. WSN are useful in data collection, event detection or entity tracking applications. The characteristics of sensor networks have imposed various restrictions on their system designs. Since sensor nodes usually are developed by low-cost hardware, one major challenge in the development of many sensor-network applications is to provide high-security features with limited resources. In this paper, we propose a path generation framework with deadline considerations for real-time query processing. To meet the deadline, the framework will assign the time budget to the routing path, and then, derive a feasible path with the assigned time budget.