Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

APNOMS
2007
Springer

favoriteEmaildiscussreport

78views Computer Networks» more APNOMS 2007»

Scheduling Management in Wireless Mesh Networks

13 years 10 months ago

Scheduling Management in Wireless Mesh Networks

Download networking.khu.ac.kr

We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in scheduling to prevent some border nodes from starvation. We evaluate our algorithm through extensive simulation and the results show that our algorithm can achieve better aggregate throughput and fairness performance than 802.11 standard.

Nguyen H. Tran, Choong Seon Hong

Real-time Traffic

APNOMS 2007 | Better Aggregate Throughput | Computer Networks | Greedy Algorithm | Physical Interference Model |

claim paper

Related Content

» Batteryaware router scheduling in wireless mesh networks

» NetworkWide Resource Optimization of Wireless OFDMA Mesh Networks with Multiple Radios

» Crosslayer adaptive control for wireless mesh networks

» Modelling and performance analysis of the distributed scheduler in IEEE 80216 mesh mode

» Connection admission control and grade of service for QoS routing in mesh networks

» RODEO Robust and rapidly deployable TDM mesh with QoS differentiation

» Improving the Performance of the Distributed Scheduler in IEEE 80216 Mesh Networks

» Management Issues on Wireless Mesh Networks

» Scheduling and Dynamic Relocation for IEEE 80211s Mesh Deterministic Access

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	APNOMS
Authors	Nguyen H. Tran, Choong Seon Hong

Comments (0)