Sciweavers

109 search results - page 9 / 22
» Faulty Random Geometric Networks
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 10 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
2008
IEEE
127views Communications» more  ICC 2008»
14 years 4 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
MSWIM
2006
ACM
14 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
INFOCOM
2010
IEEE
13 years 8 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
ICDCS
2008
IEEE
14 years 4 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi