Sciweavers

6506 search results - page 473 / 1302
» Algorithmic models for sensor networks
Sort
View
PERCOM
2006
ACM
16 years 6 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
ADHOCNOW
2009
Springer
15 years 8 months ago
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplo...
PERCOM
2008
ACM
15 years 6 months ago
The sensor internet at work: Locating everyday items using mobile phones
We present a system for monitoring and locating everyday items using mobile phones. The system is based on phones which are enhanced with the capability to detect electronically t...
Christian Frank, Philipp Bolliger, Friedemann Matt...
DCOSS
2010
Springer
15 years 10 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos
IPPS
2009
IEEE
16 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader