Sciweavers

99 search results - page 19 / 20
» An Efficient Scheme for Establishing Pairwise Keys for Wirel...
Sort
View
TON
2008
109views more  TON 2008»
13 years 6 months ago
Efficient routing in intermittently connected mobile networks: the single-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...
TON
2008
107views more  TON 2008»
13 years 6 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...
ADHOC
2010
135views more  ADHOC 2010»
13 years 1 months ago
Efficient broadcast for wireless ad hoc networks with a realistic physical layer
In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consum...
Hui Xu, J. J. Garcia-Luna-Aceves
ADHOCNOW
2009
Springer
13 years 7 months ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
CIIT
2004
111views Communications» more  CIIT 2004»
13 years 7 months ago
Scalable ant-based routing algorithm for ad-hoc networks
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
Yoshitaka Ohtaki, Naoki Wakamiya, Masayuki Murata,...