Sciweavers

101 search results - page 20 / 21
» An Adapting Random Walk for Ad Hoc and Sensor Networks
Sort
View
SASN
2005
ACM
13 years 12 months ago
On the security of group communication schemes based on symmetric key cryptosystems
Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secu...
Shouhuai Xu
PODC
2009
ACM
14 years 6 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
MOBIHOC
2008
ACM
14 years 6 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
SUTC
2008
IEEE
14 years 21 days ago
Hovering Information - Self-Organising Information that Finds Its Own Storage
A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geograph...
Alfredo A. Villalba Castro, Giovanna Di Marzo Seru...
ALGOSENSORS
2010
Springer
13 years 5 months ago
From Key Predistribution to Key Redistribution
One of crucial disadvantages of key predistribution schemes for ad hoc networks is that if devices A and B use a shared key K to determine their session keys, then any adversarial...
Jacek Cichon, Zbigniew Golebiewski, Miroslaw Kutyl...