Browsing by Subject "Wireless mesh networks (WMN)"

Now showing 1 - 4 of 4

Open Access
Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks
(Springer, 2016) Ulucinar, A. R.; Korpeoglu, I.
Equipping mesh nodes with multiple radios that support multiple wireless channels is considered a promising solution to overcome the capacity limitation of single-radio wireless mesh networks. However, careful and intelligent radio resource management is needed to take full advantage of the extra radios on the mesh nodes. Flow-radio assignment and channel assignment procedures should obey the physical constraints imposed by the radios as well as the topological constraints imposed by routing. Varying numbers of wireless channels are available for the channel assignment procedure for different wireless communication standards. To further complicate the problem, the wireless communication standard implemented by the radios of the wireless mesh network may define overlapping as well as orthogonal channels, as in the case of the IEEE 802.11b/g family of standards. This paper presents Distributed Flow-Radio Channel Assignment, a distributed joint flow-radio and channel assignment scheme and the accompanying distributed protocol in the context of multi-channel multi-radio wireless mesh networks. The scheme’s performance is evaluated on small networks for which the optimal flow-radio and channel configuration can be computed, as well as on large random topologies.
Open Access
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
(Elsevier, 2017) Gokbayrak, K.; Yıldırım, E. A.
Wireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the problem of gateway node selection for connecting the network to the Internet along with operational problems such as routing, wireless transmission capacity allocation, and transmission power control for efficient use of wired and wireless resources. Under the assumption that each node of the WMN has a fixed traffic rate, our goal is to allocate capacities to the nodes in proportion to their traffic rates so as to maximize the minimum capacity-to-demand ratio, referred to as the service level. We adopt a time division multiple access (TDMA) scheme, in which a time frame on the same frequency channel is divided into several time slots and each node can transmit in one or more time slots. We propose two mixed integer linear programming formulations. The first formulation, which is based on individual transmissions in each time slot, is a straightforward extension of a previous formulation developed by the authors for a related problem under a different set of assumptions. The alternative formulation, on the other hand, is based on sets of noninterfering wireless transmissions. In contrast with the first formulation, the size of the alternative formulation is independent of the number of time slots in a frame. We identify simple necessary and sufficient conditions for simultaneous transmissions on different links of the network in the same time slot without any significant interference. Our characterization, as a byproduct, prescribes a power level for each of the transmitting nodes. Motivated by this characterization, we propose a simple scheme to enumerate all sets of noninterfering transmissions, which is used as an input for the alternative formulation. We also introduce a set of valid inequalities for both formulations. For large instances, we propose a three-stage heuristic approach. In the first stage, we solve a partial relaxation of our alternative optimization model and determine the gateway locations. This stage also provides an upper bound on the optimal service level. In the second stage, a routing tree is constructed for each gateway node computed in the first stage. Finally, in the third stage, the alternative optimization model is solved by fixing the resulting gateway locations and the routing trees from the previous two stages. For even larger networks, we propose a heuristic approach for solving the partial relaxation in the first stage using a neighborhood search on gateway locations. Our computational results demonstrate the promising performance of our exact and heuristic approaches and the valid inequalities
Open Access
Joint routing, gateway selection, scheduling and power management optimization in wireless mesh networks
(Institute of Industrial Engineers, 2012-05) Uzunlar Onur; Gökbayrak, Kağan; Yıldırım, E. A.
The third generation (3G) wireless communications technology delivers user traffic in a single step to the wired network via base station; therefore it requires all base stations to be connected to the wired network. On the other hand, in the fourth generation (4G) communication systems, it is planned to have the base stations set up so that they can deliver each other's traffic to a small number of base stations equipped with wired connections. In order to improve system resiliency against failures, a mesh structure is preferred. The most important issue in Wireless Mesh Networks (WMN) is that the signals that are simultaneously transmitted on the same frequency channel can interfere with each other to become incomprehensible at the receiver end. It is possible to operate the links at different times or at different frequencies, but this also lowers capacity usage. In this paper, we tackle the planning problems of WMN, using 802.16 (Wi-MAX) protocol, such as deploying a given number of gateway nodes along with operational problems such as routing, management of power used by nodes and scheduling while maximizing the minimum service level provided. In order to be able to apply our results to real systems, we work with optimization models based on realistic assumptions such as physical interference and single path routing. We propose heuristic methods to obtain optimal or near optimal solutions in reasonable time. The models are applied to some cities in Istanbul and Ankara provinces.
Open Access
Utilization-based dynamic scheduling algorithm for wireless mesh networks
(SpringerOpen, 2010-10) Kas, M.; Korpeoglu, I.; Karasan, E.
Channel access scheduling is one of the key components in the design of multihop wireless mesh networks (WMNs). This paper addresses the allocation/demand mismatch problem observed in oblivious WMN channel access scheduling schemes and proposes Utilization-Based Scheduling (UBS). UBS is a Spatial-TDMA- (STDMA-) based dynamic channel access scheduling scheme designed with the aim of increasing the application-level throughput. In UBS, each node has a weight, which is dynamically adjusted in accordance with the node's slot usage history and packet-queue occupancy. UBS is a fully distributed algorithm, where each node adjusts its own weight and makes pseudorandom transmission attempts using only the locally available information. To demonstrate the performance improvements of the dynamic weight adjustment, the performance of UBS is compared against other channel access scheduling schemes through extensive ns-2 simulations under both uniform and nonuniform traffic patterns. © 2010 Miray Kas et al.