4th International ICST Conference on Wireless Internet

Research Article

Exploiting Parallel Networks Using Dynamic Channel Scheduling

Download273 downloads
  • @INPROCEEDINGS{10.4108/ICST.WICON2008.4969,
        author={Lara B.  Deek and Kevin C. Almeroth and Mike P.  Wittie and Khaled A.  Harras},
        title={Exploiting Parallel Networks Using Dynamic Channel Scheduling},
        proceedings={4th International ICST Conference on Wireless Internet},
        publisher={ICST},
        proceedings_a={WICON},
        year={2010},
        month={5},
        keywords={Performance Experimentation},
        doi={10.4108/ICST.WICON2008.4969}
    }
    
  • Lara B. Deek
    Kevin C. Almeroth
    Mike P. Wittie
    Khaled A. Harras
    Year: 2010
    Exploiting Parallel Networks Using Dynamic Channel Scheduling
    WICON
    ICST
    DOI: 10.4108/ICST.WICON2008.4969
Lara B. Deek1,*, Kevin C. Almeroth1,*, Mike P. Wittie1,*, Khaled A. Harras2,*
  • 1: Department of Computer Science, UC Santa Barbara, Santa Barbara, CA 93101
  • 2: Department of Computer Science, Carnegie Mellon University, Qatar
*Contact email: laradeek@cs.ucsb.edu, almeroth@cs.ucsb.edu, mwittie@cs.ucsb.edu, kharras@cs.cmu.edu

Abstract

Many researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mo- bile wireless technologies. If it is not already the case, it will soon be rare for a user to be in a situation where absolutely no network connection exists. In fact, through numerous devices, users will soon expect to be connected in all places at all times. Through the great variety and increase in the capabilities of these devices, it is not a surprise to find a single user with many connection opportunities. As a re- sult, we believe that the next major evolution of wireless mobile networks will be in the exploitation of multiple net- work connections in parallel. Due to network heterogene- ity, the major challenge in such situations is to determine the way that these networks can be utilized to better serve different network applications. In this work, we propose a dynamic channel scheduling mechanism that adapts to the state of the available channels to provide more efficient us- age of network connectivity. We do so by observing channel throughput, creating a set of channel usage combinations, and then choosing the most efficient combination. We eval- uate an implementation of the proposed mechanism using emulation. Our results show that under realistic conditions our dynamic approach greatly improves cost delay metrics, and the overall user-perceived performance compared to a more static approach.