Sciweavers

5901 search results - page 773 / 1181
» Algorithms for Wireless Sensor Networks
Sort
View
INFOCOM
2010
IEEE
15 years 2 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
ICNSC
2007
IEEE
15 years 11 months ago
Improved estimation for object localization via sensor networks
The paper addresses object localization via a distributed sensor network. A centralized estimation approach is undertaken along with a selective node activation strategy to ensure...
Alessio Benavoli, Luigi Chisci
JDA
2007
135views more  JDA 2007»
15 years 4 months ago
Cache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
Bin Tang, Himanshu Gupta
MOBIHOC
2010
ACM
15 years 2 months ago
Security-capacity trade-off in large wireless networks using keyless secrecy
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
Sudarshan Vasudevan, Dennis Goeckel, Donald F. Tow...
DCOSS
2007
Springer
15 years 8 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev