|
Title:
|
PERFORMANCE EVALUATION OF DIFFERENT MINIMUM SPANNING TREES SCHEMES FOR SCHEDULING IN WMNS |
|
Author(s):
|
Yaser Khamayseh , Wail Mardini , Muneer Bani Yasin |
|
ISBN:
|
978-972-8924-97-3 |
|
Editors:
|
Hans Weghorn and Pedro Isaías |
|
Year:
|
2009 |
|
Edition:
|
V II, 2 |
|
Keywords:
|
Minimum Spanning trees, Wireless mesh networks, Fair scheduling, Kruskals algorithm, Prims algorithm |
|
Type:
|
Short Paper |
|
First Page:
|
160 |
|
Last Page:
|
164 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Fair scheduling is a key component in wireless mesh networks operations. In this context, scheduling is used to maximize
the number of concurrent transmission and to achieve fairness among users. Minimum spanning tree is used as the core of
some scheduling algorithms to construct an optimal scheduler. Various algorithms are used to build the minimum
spanning trees. In this paper, we investigate the effect of using two different techniques for obtaining the minimum
spanning tree. The performance of the scheduling algorithm is evaluated using simulation. |
|
|
|
|
|
|
