کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
431571 688586 2011 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
OLSR-aware channel access scheduling in wireless mesh networks
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
OLSR-aware channel access scheduling in wireless mesh networks
چکیده انگلیسی

Wireless mesh networks (WMNs) have emerged as a key technology having various advantages, especially in providing cost-effective coverage and connectivity solutions in both rural and urban areas. WMNs are typically deployed as backbone networks, usually employing spatial TDMA (STDMA)-based access schemes which are suitable for the high traffic demands of WMNs. This paper aims to achieve higher utilization of the network capacity and thereby aims to increase the application layer throughput of STDMA-based WMNs. The central idea is to use optimized link state routing (OLSR)-specific routing layer information in link layer channel access schedule formation. This paper proposes two STDMA-based channel access scheduling schemes (one distributed, one centralized) that exploit OLSR-specific information to improve the application layer throughput without introducing any additional messaging overhead. To justify the contribution of using OLSR-specific information to the throughput, the proposed schemes are compared against one another and against their non-OLSR-aware versions via extensive ns-2 simulations. Our simulation results verify that utilizing OLSR-specific information significantly improves the overall network performance both in distributed and in centralized schemes. The simulation results further show that OLSR-aware scheduling algorithms attain higher end-to-end throughput although their non-OLSR-aware counterparts achieve higher concurrency in slot allocations.

Research highlights
► We propose an OLSR-aware weighting scheme to improve application layer throughput.
► MPR-based weights in distributed/centralized STDMA channel access improve throughput.
► Increasing link concurrency does not necessarily maximize application layer throughput.
► Deterministic centralization is more concurrent than distributed pseudo-randomness.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Parallel and Distributed Computing - Volume 71, Issue 9, September 2011, Pages 1225–1235
نویسندگان
, , ,