Sciweavers

1557 search results - page 272 / 312
» Security and Cooperation in Wireless Networks
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 8 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
JPDC
2006
134views more  JPDC 2006»
13 years 8 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
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...
JNW
2008
103views more  JNW 2008»
13 years 8 months ago
Avoidance Mechanism of Redundant Transmissions in Content Cruising System
"Content Cruising System (CCS)" is developed as a decentralized and autonomous distribution system for location-based contents. The content put into CCS carries itself to...
Takaaki Ishida, Keijiro Ehara, Seiichiro Toda, Yas...
TSP
2008
100views more  TSP 2008»
13 years 8 months ago
Time-Slotted Round-Trip Carrier Synchronization for Distributed Beamforming
Transmit beamforming is an energy-efficient wireless communication technique that allows a transmitter with two or more antennas to focus its bandpass signal in an intended directi...
D. Richard Brown III, H. Vincent Poor