Sciweavers

955 search results - page 2 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 4 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
DCOSS
2005
Springer
13 years 10 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
IJSNET
2007
101views more  IJSNET 2007»
13 years 4 months ago
Some problems of directional sensor networks
Abstract: Wireless sensor networks are often based on omni-sensing and communication models. In contrast, in this paper, we investigate sensor networks with directional sensing and...
Huadong Ma, Yonghe Liu
IJSNET
2006
110views more  IJSNET 2006»
13 years 4 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 4 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...