The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recent research results have shown that channel width is an important control knob that can be easily adapted through software and can be used for achieving higher system throughput and better energy efficiency. In this paper we address the problem of joint routing and transmission scheduling in a multichannel wireless mesh network with variable-width channel allocation. While narrower bands split...
Compared with cellular networks, wireless mesh networks (WMNs) need more careful design for resource allocation. To this end, we develop a clique-based proportional fair scheduling (CBPFS) algorithm for WMNs. Furthermore, we obtain a closed-form model to quantify the throughput of connection links and traffic flows in multi-hop transmissions. We use the derived analytical framework to estimate the...
We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest...
The proportional fair scheduling (PFS) problem is studied in the paper. PFS is considered an attractive bandwidth allocation criterion in wireless networks for supporting high resource utilization while maintaining good fairness among network flows. The most challenge of a PFS problem is the lack of an analytic expression. By rigorously mathematical derivation, we obtain a closed-form expression for...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.