کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
448819 693605 2011 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels
چکیده انگلیسی

The performance of wireless mesh networks (WMNs) can be improved significantly with the increase in number of channels and radios. Despite the availability of multiple channels in several of the current wireless standards, only a small fraction of them are non-overlapping and many channels are partially overlapped. In this paper, we formulate the joint channel assignment and flow allocation problem for multi-channel multi-radio WMNs as a Mixed Integer Linear Program (MILP). Unlike most of the previous studies, we consider the case when both non-overlapped and partially overlapped channels are being used. We consider an objective of maximizing aggregate end-to-end throughput and minimizing queueing delay in the network, instead of the sum of link capacities, since the traffic characteristics of a multi-hop WMN are quite different from a single hop wireless network. Our static channel assignment algorithm incorporates network traffic information, i.e., it is load aware. Our formulation takes into consideration several important network parameters such as the transmission power of each node, path loss information, the signal to interference plus noise ratio at a node, and the frequency response of the filters used in the transmitter and receiver. We show by simulations that our MILP formulation makes efficient use of the spectrum, by providing superior channel assignments and flow allocations with the addition of partially overlapped channels, without the use of any additional spectrum. We also justify the need to consider alternative objective functions such as, minimizing average queueing in the network. We also propose a polynomially bounded heuristic algorithm to scale the proposed algorithm to bigger network topologies.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Communications - Volume 34, Issue 15, 15 September 2011, Pages 1858–1869
نویسندگان
, , ,