COORDINATED DISTRIBUTED SCHEDULING IN WIRELESS MESH NETWORK
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 3
Abstract
IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive Applications. According to IEEE 802.16 MAC protocol, there are three scheduling algorithms for assigning TDMA slots to each network node: centralized and distributed the distributed is further divided into two operational modes coordinated distributed and uncoordinated distributed. In coordinated distributed scheduling algorithm, network nodes have to transmit scheduling message in order to inform other nodes about their transfer schedule. In this paper a new approach is proposed to improve coordinated distributed scheduling efficiency in IEEE 802.16 mesh mode, with respect to three parameter Throughput, Average end to end delay and Normalized Overhead. For evaluating the proposed networks efficiency, several extensive simulations are performed in various network configurations and the most important system parameters which affect the network performance are analyzed
Authors and Affiliations
Usha Kumari, Udai Shankar
Keywords
Related Articles
- EP ID EP649830
- DOI 10.24297/ijct.v3i3a.2940
- Views 79
- Downloads 0
FROM GRID COMPUTING TO CLOUD INFRASTRUCTURES
As a consequence of the economic crisis, the funds allocated for the development of the IT&C infrastructure in all domains become scarcer, whilst the need for computing services increases day by day and becomes a key...
The Optimal q-Homotopy Analysis Method (Oq-HAM)
In this paper, an optimal q-homotopy analysis method (Oq-HAM) is proposed. We present some examples to show the reliability and efficiency of the method. It is compared with the one-step optimal homotopy analysis method....
An Improved Min-Min Task Scheduling Algorithm with Grid Utilization and Minimized Makespan
Grid computing is hardware and software infrastructure which offers a economical, distributable, coordinated and credible access to strong computational abilities [1]. For optimal use of the abilities of large distribute...
A Preview on Subspace Clustering of High Dimensional Data
When clustering high dimensional data, traditional clustering methods are found to be lacking since they consider all of the dimensions of the dataset in discovering clusters whereas only some of the dimensions are relev...
Evaluation of an Intelligent Approach for Semantic Web
The semantic web is a vision which captures information from the web and makes it possible to help machines to understand complex human requests. Such intelligence based understanding requires important sources of inform...