Sciweavers

2571 search results - page 113 / 515
» Approximation schemes for wireless networks
Sort
View
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ADHOCNOW
2005
Springer
16 years 12 days ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
JDA
2007
97views more  JDA 2007»
15 years 6 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia

Publication
145views
15 years 3 months ago
Wireless Client Puzzles in IEEE 802.11 Networks: Security by Wireless
Resource-depletion attacks against IEEE 802.11 access points (APs) are commonly executed by flooding APs with fake authentication requests. Such attacks may exhaust an AP’s memor...
Ivan Martinovic, Frank A. Zdarsky, Matthias Wilhel...
ICC
2008
IEEE
126views Communications» more  ICC 2008»
16 years 1 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn