Sciweavers

199 search results - page 13 / 40
» Analysis of Connectivity for Sensor Networks Using Geometric...
Sort
View
TON
2008
107views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
SPAA
2005
ACM
14 years 29 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
IPSN
2010
Springer
14 years 1 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
13 years 5 months ago
Asynchronous distributed optimization with minimal communication and connectivity preservation
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
Minyi Zhong, Christos G. Cassandras
GLOBECOM
2007
IEEE
14 years 1 months ago
Babel: Using a Common Bridge Node to Deliver Multiple Keys in Wireless Sensor Networks
— In Wireless Sensor Networks (WSNs), symmetric key schemes may be used to provide security. Recently, a class of random key pre-distribution techniques have been proposed and in...
Jing Deng, Yunghsiang S. Han