Sciweavers

250 search results - page 38 / 50
» Distributed Algorithms for Coloring and Domination in Wirele...
Sort
View
AINA
2010
IEEE
14 years 28 days ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...
TSP
2010
13 years 3 months ago
Statistics of Co-Channel Interference in a Field of Poisson and Poisson-Poisson Clustered Interferers
Abstract--With increasing spatial reuse of radio spectrum, cochannel interference is becoming a dominant noise source and may severely degrade the communication performance of wire...
Kapil Gulati, Brian L. Evans, Jeffrey G. Andrews, ...
MOBIHOC
2006
ACM
14 years 8 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 3 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
OPODIS
2010
13 years 6 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas