Learn More
One of the main goals of sensor networks is to provide accurate information about a sensing field for an extended period of time. This requires collecting measurements from as many sensors as possible to have a better view of the sensor surroundings. However, due to energy limitations and to prolong the network lifetime, the number of active sensors should(More)
— All data generated in wireless sensor networks may not be alike; some data may be more important than others and hence may have different delivery requirements. As deployment sizes and data rates grow, congestion arises as a major problem in these networks. This congestion leads to indiscriminate dropping of data, i.e. data of high importance might be(More)
Data generated in wireless sensor networks may not all be alike: some data may be more important than others and hence may have different delivery requirements. In this paper, we address differentiated data delivery in the presence of congestion in wireless sensor networks. We propose a class of algorithms that enforce differentiated routing based on the(More)
One practical limitation of structured peer-to-peer (P2P) networks is that they are frequently subject to Sybil attacks: malicious parties can compromise the network by generating and controlling large numbers of shadow identities. In this paper, we propose an admission control system that mitigates Sybil attacks by adaptively constructing a hierarchy of(More)
Sensor-mission assignment involves the allocation of sensor and other information-providing resources to missions in order to cover the information needs of the individual tasks in each mission. This is an important problem in the intelligence, surveillance, and reconnaissance (ISR) domain, where sensors are typically over-subscribed, and task requirements(More)
When a sensor network is deployed, it is typically required to support multiple simultaneous missions. Schemes that assign sensing resources to missions thus become necessary. In this article, we formally define the sensor-mission assignment problem and discuss some of its variants. In its most general form, this problem is NP-hard. We propose algorithms(More)
ƒ A sensor network may be tasked with multiple simultaneous missions, each requiring multiple sensors ƒ Missions can compete for sensing resources, ƒ We need scheme to decide which sensors should be assigned to which missions? Model: • Missions have demands and profits • Sensors have utilities to the different missions – contribute to demand • Utility is a(More)
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources,(More)
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplified models in which utility from multiple sensors is assumed to combine additively. In this paper we study more complex utility models, focusing on two particular applications:(More)
Ad-hoc sensor networks need to create their own network after deployment. Various schemes have been suggested for sensors to create a better coverage pattern than if they are randomly deployed. A better coverage pattern translates into a geometry of having disks cover an area completely and even redundantly. In this paper, we present two coverage(More)