Sciweavers

364 search results - page 61 / 73
» Shortest-path network interdiction
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
WSNA
2003
ACM
14 years 27 days ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
TKDE
2010
195views more  TKDE 2010»
13 years 6 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
MOBISYS
2007
ACM
14 years 7 months ago
Energy-efficient multi-hop medical sensor networking
Abstract-- Wireless sensor networks represent a key technology enabler for enhanced health care and assisted living systems. Recent standardization efforts to ensure compatibility ...
Antonio G. Ruzzelli, Raja Jurdak, Gregory M. P. O'...
GLOBECOM
2007
IEEE
13 years 11 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo