Sciweavers

375 search results - page 15 / 75
» Probabilistic quorum systems in wireless ad hoc networks
Sort
View
DCOSS
2011
Springer
12 years 7 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
MOBIHOC
2005
ACM
14 years 7 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...
BROADNETS
2007
IEEE
14 years 2 months ago
Goodput optimization in CSMA/CA wireless networks
—Packet based wireless networks have provided high data rates, and the desire for ubiquitous wireless computing is growing rapidly. To accommodate these demands, wireless systems...
Yusun Chang, Christopher P. Lee, John A. Copeland
NETWORK
2007
187views more  NETWORK 2007»
13 years 7 months ago
Cooperative and opportunistic transmission for wireless ad hoc networks
Moving toward 4G, wireless ad hoc networks receive growing interest due to users’ provisioning of mobility, usability of services, and seamless communications. In ad hoc network...
Qian Zhang, Qing Chen, Fan Yang, Xuemin Shen, Zhis...
ICDCS
2006
IEEE
14 years 1 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer