Sciweavers

3009 search results - page 574 / 602
» On Communication Security in Wireless Ad-Hoc Sensor Networks
Sort
View
IPPS
2009
IEEE
15 years 6 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
LCN
2006
IEEE
15 years 5 months ago
Privacy-Preserving Quick Authentication in Fast Roaming Networks
Vehicular networks will become an important component for information accesses in one’s daily life. A vehicular network provides a vehicular user not only chances to communicate...
Jun Liu, Xiaoyan Hong, Qunwei Zheng, Lei Tang
JPDC
2006
134views more  JPDC 2006»
14 years 11 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»
14 years 12 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
95
Voted
IPSN
2007
Springer
15 years 6 months ago
Object tracking in the presence of occlusions via a camera network
This paper describes a sensor network approach to tracking a single object in the presence of static and moving occluders using a network of cameras. To conserve communication ban...
Ali Ozer Ercan, Abbas El Gamal, Leonidas J. Guibas