Sciweavers

174 search results - page 6 / 35
» Geometric Random Linear Codes in Sensor Networks
Sort
View
JCO
2006
234views more  JCO 2006»
13 years 7 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
ALGOSENSORS
2007
Springer
14 years 1 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
IDEAL
2010
Springer
13 years 6 months ago
Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
Carsten Elfers, Mirko Horstmann, Karsten Sohr, Ott...