Sciweavers

3009 search results - page 210 / 602
» On Communication Security in Wireless Ad-Hoc Sensor Networks
Sort
View
TON
2008
109views more  TON 2008»
15 years 7 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...
MDM
2010
Springer
188views Communications» more  MDM 2010»
15 years 5 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...
MOBIHOC
2005
ACM
16 years 6 months ago
Least privilege and privilege deprivation: towards tolerating mobile sink compromises in wireless sensor networks
Mobile sinks are needed in many sensor network applications for efficient data collection, data querying, localized sensor reprogramming, identifying and revoking compromised sens...
Wensheng Zhang, Hui Song, Sencun Zhu, Guohong Cao
PAAMS
2010
Springer
15 years 11 months ago
Mobile Agents in Vehicular Networks: Taking a First Ride
A vehicular ad hoc network (VANET) is a type of mobile network whose nodes are traveling cars which communicate with one another using short-range wireless communications. These ca...
Oscar Urra, Sergio Ilarri, Thierry Delot, Eduardo ...
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger