Optimal real-time sampling rate assignment for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Real-time multimedia processing in video sensor networks
Image Communication
Cross-Layer Collaborative In-Network Processing in Multihop Wireless Sensor Networks
IEEE Transactions on Mobile Computing
A Collaborative Model for Wireless Sensor Networks Applied to Museums' Environmental Monitoring
CDVE '08 Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering
A collaborative model for representing wireless sensor networks' entities and properties
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Game theoretic power allocation in sparsely distributed clusters of wireless sensors (GPAS)
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Die-hard sensor network: robust wireless sensor network dedicated to disaster monitoring
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A survey on service-oriented middleware for wireless sensor networks
Service Oriented Computing and Applications
Comparison of Hyper-DAG based task mapping and scheduling heuristics for wireless sensor networks
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Improving users' manipulation and control on WSNs through collaborative sessions
International Journal of Knowledge and Web Intelligence
Dynamic Function Alternation to Realize Robust Wireless Sensor Network
International Journal of Handheld Computing Research
| Hi-index | 0.00 |
Traditional real-time resource allocation algorithms assume that the available resources in a system such as total CPU and network bandwidth do not change over time. However, in wireless sensor networks, the amount of available resources on the devices and the communication channel may not be constant for all times: for instance, a node can be turned off in some time intervals to increase its battery lifetime. Since sensor networks have limited network capacity and computational capabilities, it is crucial to optimally assign the available resources among all the active tasks.In this paper, we propose a fast a fast online resource allocation algorithm (CoRAl) to dynamically reconfigure a sensor network whenever a new hot spot occurs (e.g., a new intruder is detected) or a node's activity changes (i.e., sleep vs. active mode). Our experimental results show that CoRAl provides always near-optimal resource allocation while keeping its online overhead low.