HAWK: Real-World Implementation of High-Performance Heterogeneous Wireless Network for Internet Access

Cao, Jiannong; Xie, Kun; Wu, Weigang; Liu, Chuda; Yao, Gang; Feng, Wei; Yang, Zhen; Wen, Junhai; Zhang, Chisheng; Xiao, Xiangning; Li, Xuan; Yan, Ye

doi:10.1109/icdcsw.2009.29

Cited by 19 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have deployed a P2P application called CTorrent in our wireless mesh networks testbed [14]. From the experimental results of real deployment, we observe that if we build the P2P streaming system in a traditional way in which every MC acts as the peer that obtains service from other MCs as well as provides service to other MCs, the video dissemination will not be efficient.…”

Section: System Modelmentioning

confidence: 99%

User Density Sensitive P2P Streaming in Wireless Mesh Networks

Wen¹,

Cao²,

Xie³

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

Self Cite

View full text Add to dashboard Cite

Link rate allocation is very important for supporting high video playback rate in Peer-to-Peer video streaming. Although many studies can be found on resource allocation in P2P streaming in wired networks, very few studies have studied the problem in wireless networks, especially in Wireless Mesh Networks(WMNs), which is still challenging. To maximize the users' satisfaction of P2P streaming in WMNs, this paper focuses on link rate allocation problem and proposes a fully distributed algorithm to efficiently utilize the upload and download bandwidth of wireless mesh nodes. We firstly design an efficient P2P streaming system based on the experimental results coming from real deployment of our wireless mesh testbed. Due to non-uniform geographic distribution of the mobile users in typical deployments of WMNs, we formulate the link rate allocation problem into a network utility maximization problem and use user density as an important weight parameter in the problem. The simulation experiments demonstrate the significant performance enhancement by using the proposed rate allocation algorithm in WMNs.This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE "GLOBECOM" 2009 proceedings.

show abstract

Section: System Modelmentioning

confidence: 99%

User Density Sensitive P2P Streaming in Wireless Mesh Networks

Wen¹,

Cao²,

Xie³

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…Wireless mesh networks (WMNs) have attracted significant attentions in recent years as an avenue to provide cost-effective last-mile network access and wireless Internet services to a large coverage area with a low infrastructure cost [1,2,3]. Meanwhile, the bloom of the advanced wireless applications drives the increasing requirements on providing high performance continuous Internet access for mobile users.…”

Section: Introductionmentioning

confidence: 99%

Pre-scheduled handoff for service-aware and seamless internet access

et al. 2016

Self Cite

View full text Add to dashboard Cite

Existing handoff techniques connect a user to a nearby access point whenever it is available along the user's moving path. If the path is not fully Wi-Fi covered, the user may suffer from frequent disconnections. In this work, we propose a pre-scheduled handoff scheme, which determines a quality-aware path so a mobile user can move across an Urban Wi-Fi Mesh network with uninterrupted Internet access at a required data rate. This scheme has several novel techniques. Firstly, by concurrently considering the received signal strength at mobile users and the load of mesh routers (MRs), we design two path finding metrics, contact weight and handoff count, according to the coverage information. Secondly, to measure the path metric in a practical mesh network with irregular and dynamic MR coverage, we propose a lightweight Bloom-filter-based polling algorithm to discover the mobile stations (called STAs) covered in MR, and a Bloom-filter-based probabilistic algorithm to estimate the degree of coverage overlapping among MRs. Thirdly, based on the path metrics, our proposed scheme supports flexible rate requirements from mobile users through a fully distributed multi-service-class path finding algorithm. Our pre-scheduled scheme considers both mobility and connection requirement, so that the mobile user can continuously access the Internet with the expected data rate. To our best knowledge, this is the first work to ensure seamless Internet access with rate consideration by finding a Wi

show abstract

“…We claim our contributions as follows: Aiming at handoff seamlessness, which is an essential requirement, also the big obstacle to mobile services over wireless networks, we propose and implement a practical and lightweight secure and fast handoff framework V2V . We conduct extensive experiments and analysis on our real‐world wireless network testbed HAWK [10]. To our best knowledge, we are the first to achieve such a performance of end‐to‐end secure and fast handoff considering the address configuration in the multi‐domain scenario. The proposed V2V framework is compatible with the current specification, such as 802.11i and DHCP, and it does not compromise the security during the fast handoff process. The remainder of this paper is organised as follows.…”

Section: Introductionmentioning

confidence: 99%