Show simple item record

dc.contributor.authorDeek, Lara B.
dc.contributor.authorAlmeroth, Kevin C.
dc.contributor.authorWittie, Mike P.
dc.contributor.authorHarras, Khaled A.
dc.identifier.citationLara B. Deek, Kevin C. Almeroth, Mike P. Wittie, Khaled A. Harras, "Exploiting Parallel Networks Using Dynamic Channel Scheduling," in The Fourth International Wireless Internet Conference (WICON), 2008.en_US
dc.descriptionPermission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. WICON’08, November 17-19, 2008, Maui, Hawaii, USA. Copyright 2008 ICST 978-963-9799-36-3.en_US
dc.description.abstractMany researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mobile 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 result, we believe that the next major evolution of wireless mobile networks will be in the exploitation of multiple network connections in parallel. Due to network heterogeneity, 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 usage 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 evaluate 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.en_US
dc.publisherWireless Internet Conference (WICON)en_US
dc.subjectComputer Scienceen_US
dc.subjectAccess schemesen_US
dc.titleExploiting Parallel Networks Using Dynamic Channel Schedulingen_US
mus.citation.conferenceWireless Internet Conference (WICON)
mus.citation.journaltitleProceedings of the 4th Annual International Conference on Wireless Internet
mus.identifier.categoryEngineering & Computer Science
mus.relation.collegeCollege of Engineering
mus.relation.departmentComputer Science.en_US
mus.relation.universityMontana State University - Bozemanen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.