Joint Scheduling and Routing Tree Construction in IEEE 802.16 Wireless Mesh Networks

سال انتشار: 1392
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,121

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICEE21_620

تاریخ نمایه سازی: 27 مرداد 1392

چکیده مقاله:

we investigate joint scheduling and routing construction in IEEE 802.16 wireless mesh networks. We formulate the problem as a linear programming optimizationin which the objective is to maximize network throughput. In the proposed optimization problem we take into account re-useof frequency space and thus non-interfering nodes can be scheduled simultaneously. Furthermore, both Centralized traffic (i.e., the traffic from nodes to the BS and inverse) andmesh traffic (i.e., the traffic between nodes) are allowed. After solving the optimization problem which gives the optimumflow assignment, we propose a heuristic algorithm in order to obtain an approximation of the optimum routing tree. Our numerical study shows that the proposed routing trees lead to a better performance regarding to networks throughput in comparison to previous approaches next, we create a routingtree based on link flow. Thus, we get an approximation of the network optimal routing tree, which in turn lead to increased throughput and reduce overall delay in the network. Obtained results reveal that the proposed approach increases the network performance significantly for internal traffic compared to the previous works.

نویسندگان