A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Tree multicast strategies in mobile, multishop wireless networks
Mobile Networks and Applications
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Kansei: a testbed for sensing at scale
Proceedings of the 5th international conference on Information processing in sensor networks
Kansei: A High-Fidelity Sensing Testbed
IEEE Internet Computing
The core-assisted mesh protocol
IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
To enable multimedia broadcasting services in mesh networks, it is critical to optimize the broadcast traffic load. Traditionally, users associate with access points (APs) with the strongest signal strength. We explore the concept of dual-association, where the AP for unicast traffic and the AP for broadcast traffic are independently chosen by exploiting overlapping coverages that are typical in mesh networks. The goal of our proposed solution is to optimize the overall network load by exploiting the flexibility provided by independent selection of unicast and broadcast APs. We propose a novel cost metric based on ETT (Expected Transmission Time) and the number of nodes in range of the APs, that are advertised in the beacons from the APs. Users periodically scan and associate with the AP which has the lowest cost metric. The proposed approach reduces the number of APs that handle the broadcast traffic resulting in a heavy reduction in control and data packet overhead. This leads to higher packet delivery rate and enhanced video quality measured in terms of PSNR. Our approach allows the freed up resources at APs to increase the unicast throughput. We compare the performance of our approach with traditional signal strength based association using extensive simulations and real experiments on an indoor testbed of 180 IEEE 802.11b based devices.