Sciweavers

279 search results - page 10 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
IFIPTM
2009
127views Management» more  IFIPTM 2009»
13 years 5 months ago
A Risk Based Approach to Limit the Effects of Covert Channels for Internet Sensor Data Aggregators for Sensor Privacy
Effective defense against Internet threats requires data on global real time network status. Internet sensor networks provide such real time network data. However, an organization...
Camilo H. Viecco, L. Jean Camp
COMCOM
2006
147views more  COMCOM 2006»
13 years 7 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
ISCIS
2004
Springer
14 years 26 days ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
MST
2010
155views more  MST 2010»
13 years 2 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...
INFOCOM
2003
IEEE
14 years 23 days ago
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
— A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data ...
Seema Bandyopadhyay, Edward J. Coyle