TITLE

Utilization-Based Dynamic Scheduling Algorithm for Wireless Mesh Networks

AUTHOR(S)
Kas, Miray; Korpeoglu, Ibrahim; Karasan, Ezhan
PUB. DATE
January 2010
SOURCE
EURASIP Journal on Wireless Communications & Networking;2010, Special section p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Channel access scheduling is one of the key components in the design of multihop wireless mesh networks (WMNs). This paper addresses the allocation/demand mismatch problem observed in oblivious WMN channel access scheduling schemes and proposes Utilization-Based Scheduling (UBS). UBS is a Spatial-TDMA- (STDMA-) based dynamic channel access scheduling scheme designed with the aim of increasing the application-level throughput. In UBS, each node has a weight, which is dynamically adjusted in accordance with the node's slot usage history and packet-queue occupancy. UBS is a fully distributed algorithm, where each node adjusts its own weight and makes pseudorandom transmission attempts using only the locally available information. To demonstrate the performance improvements of the dynamic weight adjustment, the performance of UBS is compared against other channel access scheduling schemes through extensive ns-2 simulations under both uniform and nonuniform traffic patterns.
ACCESSION #
57314086

 

Related Articles

  • Time-stepped approach for accelerated simulation of mobile ad hoc networks. Lu, S.; Schormans, J. A. // IET Communications;May2008, Vol. 2 Issue 5, p609 

    Model abstraction techniques have been widely used to accelerate simulations in the context of homogeneous wired networks. However, the application of these techniques to wireless networks is rare. The authors investigate how model abstraction techniques can be applied to simulations of mobile...

  • OPTIMAL CHANNEL ALLOCATION WITH DYNAMIC POWER CONTROL IN CELLULAR NETWORKS. Xin Wu; Jaekel, Arunita; Bari, Ataul // International Journal of Computer Networks & Communications;Mar2011, Vol. 3 Issue 2, p83 

    Techniques for channel allocation in cellular networks have been an area of intense research interest for many years. An efficient channel allocation scheme can significantly reduce call-blocking and call-dropping probabilities. Another important issue is to effectively manage the power...

  • NS-2 based simulation environment for performance evaluation of UMTS Architecture. Abbas, Waseem; Abbas, Nasim; Malik, Muhammad Asim // International Journal of Advanced Research in Computer Science;Nov/Dec2013, Vol. 4 Issue 11, p40 

    The paper presents our work in the performance evaluation of enhanced UMTS and proposes new simulator that supports wireless 3G networks. Existing network simulators are implemented using time based link level simulations and integrate system level and link level simulators. Our proposed network...

  • Mobile terminal grouping module. Holland, O.; Pangalos, P.; Aghvami, A. H. // Electronics Letters;2/16/2006, Vol. 42 Issue 4, p228 

    A novel mobile terminal ‘grouping module’ for cellular networks is presented, which is able to detect whether terminals are moving in a group such as occurs in a public transportation scenario. The module is useful for a number of purposes. The grouping module algorithm is described...

  • Normalised frequency-domain soft constraint satisfaction multimodulus blind algorithm. Akande, K.; Iqbal, N.; Zerguine, A.; Chambers, J. // Electronics Letters;2/4/2016, Vol. 52 Issue 3, p239 

    A frequency-domain implementation of the soft constraint satisfaction multimodulus blind algorithm is proposed. This leads to a significant reduction in the computational complexity, thus making it suitable for broadband wireless systems. The convergence of the developed algorithm is then...

  • (QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS. BERENBRINK, PETRA; FRIEDETZKY, THOMAS; MAŇUCH, JÁN; STACHO, LADISLAV // Journal of Interconnection Networks;Jun2005, Vol. 6 Issue 2, p63 

    We introduce a notion of t-quasi-spanner as an alternative to classical t-spanners. Our motivation for quasi-spanner comes from a problem of computing a sparse backbone for ad hoc wireless networks with fixed transmission ranges. We study computational complexity of the problem of computing...

  • CHANNEL ALLOCATION FOR DIRECT SEQUENCE SPREAD SPECTRUM USING VERTEX MERGE ALGORITHM. Ahmad, Noraziah; Alla, Ahmed N. Abd. // International Journal of Computer Science & Information Technolo;Feb2011, Vol. 3 Issue 1, p139 

    This paper presents a new algorithm namely Vertex Merge Algorithm(VMA) for channel allocation in Direct Sequence Spread Spectrum(DSSS). VMA try to solve channel allocation based on graph theory. Results from the simulation study reveal that the new graph model can provide reduce the channel...

  • A Handoff Algorithm of Dynamic Decisions with Extenics for Wireless Cellular Networks. Chen-Feng Wu // Journal of Electrical & Computer Engineering;2010, p1 

    A traditional handoff algorithm always adopts stationary channel preservation schemes that cause the increase of call blocking probability (CBP) and the decrease of system utilization to reduce the call dropping probability (CDP) for handoff call. In this paper, the extension theory is...

  • Layer-2 Protocol Adaptation Method to Improve Fast Handoff for Mobile IPv6 Vertical Handoffs. Solouk, Vahid; Ali, Borhanuddin M.; Khatun, Sabira; Wong, K. Daniel; Mahdi, M. Adzir // Journal of Communications;Jul2009, Vol. 4 Issue 6, p396 

    Inter-technology roaming is known as one of the interesting challenges toward fourth generation of mobile and wireless communication. While FMIPv6 standardizes the fast handoff solutions in IP layer, the issues of media independency are being investigated through IEEE802.21 project. The...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics