Sciweavers

16 search results - page 3 / 4
» DRAND: : distributed randomized TDMA scheduling for wireless...
Sort
View
WIOPT
2006
IEEE
13 years 11 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
FSTTCS
2004
Springer
13 years 10 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICNP
2002
IEEE
13 years 10 months ago
Hybrid Channel Access Scheduling in Ad Hoc Networks
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
Lichun Bao, J. J. Garcia-Luna-Aceves
EURONGI
2006
Springer
13 years 9 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer
MOBICOM
2009
ACM
13 years 11 months ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew