Sciweavers

229 search results - page 17 / 46
» A Distributed Greedy Algorithm for Connected Sensor Cover in...
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 1 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
INFOCOM
2006
IEEE
14 years 1 months ago
Locating Sensors in Concave Areas
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
Chen Wang, Li Xiao
ALGOSENSORS
2006
Springer
13 years 9 months ago
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks
Abstract. This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least onc...
Volker Turau
ICNP
2006
IEEE
14 years 1 months ago
A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas
Abstract— In many energy-rechargeable wireless sensor networks, sensor nodes must both sense data from the environment, and cooperatively forward sensed data to data sinks. Both ...
Chun Zhang, Jim Kurose, Yong Liu, Donald F. Towsle...
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia