Sciweavers

1463 search results - page 264 / 293
» Securing Wireless Mesh Networks
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 9 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 3 months ago
Emulating End-to-End Losses and Delays for Ad Hoc Networks
— Ad hoc networks have gained place in the research area recently. There are many researches regarding different topics related to such networks, such as routing, media access co...
Alaa Seddik-Ghaleb, Yacine Ghamri-Doudane, Sidi-Mo...
CCS
2009
ACM
14 years 3 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
ICCCN
2008
IEEE
14 years 3 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz