Sciweavers

1330 search results - page 185 / 266
» Node Connectivity Analysis in Multi-Hop Wireless Networks
Sort
View
CCS
2007
ACM
15 years 10 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
ADHOC
2006
97views more  ADHOC 2006»
15 years 4 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
ADHOCNOW
2008
Springer
15 years 11 months ago
Distributed Monitoring in Ad Hoc Networks: Conformance and Security Checking
Ad hoc networks are exposed more than traditional networks to security threats due to their mobility and open architecture aspects. In addition, any dysfunction due to badly congu...
Wissam Mallouli, Bachar Wehbi, Ana R. Cavalli
MOBIHOC
2004
ACM
16 years 4 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
137
Voted
DIALM
2005
ACM
100views Algorithms» more  DIALM 2005»
15 years 6 months ago
On the pitfalls of geographic face routing
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...