Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Infrastructure tradeoffs for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Cooperative negotiation for soft real-time distributed resource allocation
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Snapshot Queries: Towards Data-Centric Sensor Networks
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A Statistics-Based Sensor Selection Scheme for Continuous Probabilistic Queries in Sensor Networks
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Approximate Coverage in Wireless Sensor Networks
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
IEEE Communications Magazine
| Hi-index | 0.00 |
This paper proposes a sensor allocation technique that can be applied to a sensor network constructed of many sensor nodes having multiple sensors. First, after describing the sensor network model, the problem is formulated. The formulation can handle the following two cases: (1) a minimum number of sensor nodes, and (2) a maximum number of sensor nodes, each of which uses only one or a few of its sensors. The formulation is based on 0-1 Integer Linear Programming. A dedicated solver using a Binary Decision Diagram (BDD) is also described. The proposed method can deal with the sudden death of a sensor and can rapidly reproduce optimal solutions without the dead sensor. According to the experimental results, all optimal and feasible solutions are obtained within 5 seconds in the case of 100 sensors.