Sciweavers

2149 search results - page 184 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
PODC
2009
ACM
16 years 2 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
INFOCOM
2002
IEEE
15 years 6 months ago
Optimizing the Topology of Bluetooth Wireless Personal Area Networks
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
Marco Ajmone Marsan, Carla-Fabiana Chiasserini, An...
ICPADS
2007
IEEE
15 years 8 months ago
Access point selection algorithms for maximizing throughputs in wireless LAN environment
In wireless LAN technology, access point selection at each station is a critical problem in order to obtain satisfactory throughputs. The current protocol for access point selecti...
Akihiro Fujiwara, Yasuhiro Sagara, Masahiko Nakamu...
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 1 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
ICC
2008
IEEE
109views Communications» more  ICC 2008»
15 years 8 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang