A Novel Approach on Greedy Maximal Scheduling Algorithm on Embedded Networks

N. Kumaresan, N.Arun Prasath


There has been a significant amount of work done in developing low-complexity scheduling schemes to achieve high performance in  wireless networks. A centralized sub-optimal scheduling policy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. However, its distributed realization requires high complexity, which becomes a major obstacle for practical implementation. In this paper, we develop simple distributed greedy algorithms for scheduling in  wireless networks in embedded. we propose greedy algorithms for scheduling,  with better  performance and  lower  complexity  and  reduce delay .We reduce the complexity by relaxing the global ordering requirement of GMS, up to near-zero. Simulation results show that the new algorithms approximate the performance of GMS, and  improved method to reduce packet loss and enhance the total output. This algorithm also reduce larger queue length on the wireless networks.

Keywords:linux fedora-8 OS, Network Stimulator,Ns-2.


Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email: NCS@iiste.org

ISSN (Paper)2224-610X ISSN (Online)2225-0603

Please add our address "contact@iiste.org" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright © www.iiste.org