Fair coding for inter‐session network coding in wireless mesh networks

Because of the broadcast and overhearing capability of wireless networks, network coding can greatly improve throughput in wireless networks. However, our investigation of existing inter‐session network coding protocols found that the short‐term unfairness that existed in 802.11‐based medium access control (MAC) protocols actually decreases the coding opportunity, which in turn compromises the throughput gain of network coding. To alleviate the negative impact of this unfairness, we propose a coding‐aware cross‐layer heuristic approach to optimize the coordination of network coding and MAC layer protocol, named FairCoding, which can significantly increase coding opportunities for inter‐session network coding through a fair short‐term traffic allocation for different coding flows. Experiment evaluation shows that the proposed mechanism can bring more coding opportunities and improve the total throughput of wireless mesh networks by up to 20%, compared with the coding mechanism, without considering the negative impact of the short‐term unfairness. Copyright © 2015 John Wiley & Sons, Ltd.     

A cross‐layer optimization for maximum‐revenue‐based multicast in multichannel multiradio wireless mesh networks

Given a video/audio streaming system installed on a multichannel multiradio wireless mesh network, we are interested in a problem concerning about how to construct a delay‐constrained multicast tree to support concurrent interference‐free transmissions so that the number of serviced mesh clients is maximized. In this paper, we propose a heuristic approach called cross‐layer and load‐oriented (CLLO) algorithm for the problem. On the basis of the cross‐layer design paradigm, our CLLO algorithm can consider application demands, multicast routing, and channel assignment jointly during the formation of a channel‐allocated multicast tree. The experimental results show that the proposed CLLO outperforms the layered approaches in terms of the number of serviced mesh clients and throughputs. This superiority is due to information from higher layers can be used to guide routing selection and channel allocation at the same time. As a result, the CLLO algorithm can explore more solution spaces than the traditional layered approaches. In addition to that, we also propose a channel adjusting procedure to enhance the quality of channel‐allocated multicast trees. According to our simulations, it is proved to be an effective method for improving the performance of the proposed CLLO algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

Cross‐layer MAC design for location‐aware wireless sensor networks

In this paper, we propose an optimization of MAC protocol design for wireless sensor networks, that accounts for cross‐layering information, in terms of location accuracy for nodes and residual energy levels. In our proposed solution we encode this cross‐layer information within a decreasing backoff function in the MAC. The protocol is optimized by appropriately selecting priority window lengths, and we have shown that accurate cross‐layer information plays a crucial role in achieving an optimal performance at the MAC layer level. The estimation accuracy can be characterized spatially using a location reliability probability distribution function. We show that this distribution function greatly influences the design of the optimal backoff window parameters, and the overall throughput performance of the MAC protocol. Copyright © 2010 John Wiley & Sons, Ltd.     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.     

A cross‐layer TCP for providing fairness in wireless mesh networks

The fair allocation of resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate‐limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as its recently proposed solution, the ‘Minimum Content Window’ policy based on IEEE 802.11e. It is found that the aggregate throughput degrades sharply because the effect of this policy on the TCP congestion mechanism has been overlooked. This paper proposes a priority‐based congestion control by using ‘Cross‐Layer Explicit Congestion Notification’. Analysis and simulation results demonstrate that our scheme can improve the fairness of TCP flows while the aggregate throughput is at least 20% higher than the ‘Minimum Content Window’ policy. Copyright © 2011 John Wiley & Sons, Ltd.     

A survey of cross‐layer protocols for IEEE 802.11 wireless multi‐hop mesh networks

There has been an escalation in deployment and research of wireless mesh networks by both the business community and academia in the last few years. Their attractive characteristics include low deployment cost, a low‐cost option to extend network coverage and ease of maintenance due to their self‐healing properties. Multiple routes exist between the sender and receiver nodes because of the mesh layout that ensures network connectivity even when node or link failures occur. Recent advances among others include routing metrics, optimum routing, security, scheduling, cross‐layer designs and physical layer techniques. However, there are still challenges in wireless mesh networks as discussed in this paper that need to be addressed. Cross‐layer design allows information from adjacent and non‐adjacent layers to be used at a particular layer for performance improvement. This paper presents a survey of cross‐layer protocol design approaches applied to the IEEE 802.11 standards for wireless multi‐hop mesh networks that have been proposed over the last few years for improved performance. We summarize the current research efforts in cross‐layer protocol design using the IEEE 802.11 standard in identifying unsolved issues that are a promising avenue to further research. Copyright © 2016 John Wiley & Sons, Ltd.     

Cross‐layer design for energy efficient communication in wireless sensor networks

There is a plethora of recent research on high performance wireless communications using a cross‐layer approach in that adaptive modulation and coding (AMC) schemes at wireless physical layer are used for combating time varying channel fading and enhance link throughput. However, in a wireless sensor network, transmitting packets over deep fading channel can incur excessive energy consumption due to the usage of stronger forwarding error code (FEC) or more robust modulation mode. To avoid such energy inefficient transmission, a straightforward approach is to temporarily buffer packets when the channel is in deep fading, until the channel quality recovers. Unfortunately, packet buffering may lead to communication latency and buffer overflow, which, in turn, can result in severe degradation in communication performance. Specifically, to improve the buffering approach, we need to address two challenging issues: (1) how long should we buffer the packets? and (2) how to choose the optimum channel transmission threshold above which to transmit the buffered packets? In this paper, by using discrete‐time queuing model, we analyze the effects of Rayleigh fading over AMC‐based communications in a wireless sensor network. We then analytically derive the packet delivery rate and average delay. Guided by these numerical results, we can determine the most energy‐efficient operation modes under different transmission environments. Extensive simulation results have validated the analytical results, and indicates that under these modes, we can achieve as much as 40% reduction in energy dissipation. Copyright © 2008 John Wiley & Sons, Ltd.     

Distributed cross‐layer optimization for wireless regional area network‐based cognitive radio networks

This paper presents a study of a cross‐layer design through joint optimization of spectrum allocation and power control for cognitive radio networks (CRNs). The spectrum of interest is divided into independent channels licensed to a set of primary users (PUs). The secondary users are activated only if the transmissions do not cause excessive interference to PUs. In particular, this paper studies the downlink channel assignment and power control in a CRN with the coexistence of PUs and secondary users. The objective was to maximize the total throughput of a CRN. A mathematical model is presented and subsequently formulated as a binary integer programming problem, which belongs to the class of non‐deterministic polynomial‐time hard problems. Subsequently, we develop a distributed algorithm to obtain sub‐optimal results with lower computational complexity. The distributed algorithm iteratively improves the network throughput, which consists of several modules including maximum power calculation, excluded channel sets recording, base station throughput estimation, base station sorting, and channel usage implementation. Through investigating the impacts of the different parameters, simulation results demonstrates that the distributed algorithm can achieve a better performance than two other schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Cross‐layer scheduling for multi‐users in cognitive multi‐radio mesh networks

A wireless mesh network has been popularly researched as a wireless backbone for Internet access. However, the deployment of wireless mesh networks in unlicensed bands of urban areas is challenging because of interference from external users such as residential access points. We have proposed Urban‐X, which is a first attempt towards multi‐radio cognitive mesh networks in industrial, scientific, and medical bands. Urban‐X first controls network topology with a distributed channel assignment to avoid interference in large timescale. In such a topology, we develop a new link‐layer transmission‐scheduling algorithm together with source rate control as a small‐timescale approach, which exploits receiver diversity when receivers of multi‐flows can have different channel conditions because of varying interference. For this purpose, mesh nodes probe the channel condition of received mesh nodes using group Request to Send and group Clear to Send. In this study, we establish a mathematical Urban‐X model in a cross‐layer architecture, adopting a well‐known network utility maximization framework. We demonstrate the feasibility of our idea using a simulation on the model. Simulation results show improved network throughput from exploiting receiver diversity and distributed channel assignment under varying external user interference. Copyright © 2012 John Wiley & Sons, Ltd.     

Analytical model for approximating node throughputs in wireless mesh networks

This paper describes an analytical model and an associated algorithm for assessing the throughputs of each host in wireless mesh networks (WMNs). It provides a framework for studying WMNs, particularly when the performance and parameters in multiple protocol layers have to be jointly evaluated and optimized. From the point of the implementation, a simple recursive formula with N ? 1 iterations is used to obtain the throughput performance of N node WMNs. The produced expressions offer insights into understanding the performance of the individual nodes without referring to a specific medium access control layer or physical layer technology. The model serves as a general tool for capturing the characteristics of the WMNs. Using the model, the complexity of cross‐layer studies is reduced, thus allowing researchers to focus on the modelling of other associated layers. The paper explains the rationale behind the model and provides examples of scenarios for which it is suitable. It is validated using discrete event simulations in the OPNET network simulator. Copyright © 2012 John Wiley & Sons, Ltd.     

Multi‐channel power‐controlled directional MAC for wireless mesh networks

Wireless Mesh Networks (WMNs) have emerged recently as a technology for providing high‐speed last mile connectivity in next‐generation wireless networks. Several MAC protocols that exploit multiple channels and directional antennas have been proposed in the literature to increase the performance of WMNs. However, while these techniques can improve the wireless medium utilization by reducing radio interference and the impact of the exposed nodes problem, they can also exacerbate the hidden nodes problem. Therefore, efficient MAC protocols need to be carefully designed to fully exploit the features offered by multiple channels and directional antennas. In this paper we propose a novel Multi‐Channel Power‐Controlled Directional MAC protocol (MPCD‐MAC) for nodes equipped with multiple network interfaces and directional antennas. MPCD‐MAC uses the standard RTS‐CTS‐DATA‐ACK exchange procedure. The novel difference is the transmission of the RTS and CTS packets in all directions on a separate control channel, while the DATA and ACK packets are transmitted only directionally on an available data channel at the minimum required power, taking into account the interference generated on already active connections. This solution spreads the information on wireless medium reservation (RTS/CTS) to the largest set of neighbors, while data transfers take place directionally on separate channels to increase spatial reuse. Furthermore, power control is used to limit the interference produced over active nodes. We measure the performance of MPCD‐MAC by simulation of several realistic network scenarios, and we compare it with other approaches proposed in the literature. The results show that our scheme increases considerably both the total traffic accepted by the network and the fairness among competing connections. Copyright © 2010 John Wiley & Sons, Ltd.     

Cross‐layer error recovery in wireless access networks: The ARQ proxy approach

Wireless networks are being increasingly employed to provide mobile access to network services. In most existing standards, reliable transmission on the wireless medium is achieved through the introduction of ARQ schemes at MAC layer, a strategy which is also employed by TCP for reliable end‐to‐end data delivery. The paper proposes an approach to overcome the performance degradation deriving from the duplicate ARQ strategies implemented at the transport and MAC layers by introducing a cross‐layer solution to reduce un‐necessary transmissions on the wireless medium. Furthermore, the paper describes how the proposed scheme, called ARQ Proxy, can be deployed in three different wireless technologies (3G Long‐Term Evolution, Wi‐Fi, and WiMAX) and provides extensive validation of the achievable improvement through simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

Link optimization for energy‐constrained wireless networks with packet retransmissions

With the objective to minimize the energy consumption for packet based communications in energy‐constrained wireless networks, this paper establishes a theoretical model for the joint optimization of the parameters at the physical layer and data link layer. Multilevel quadrature amplitude modulation (MQAM) and automatic repeat request (ARQ) techniques are considered in the system model. The optimization problem is formulated into a three dimensional nonlinear integer programming (NIP) problem with the modulation order, packet size, and retransmission limit as variables. For the retransmission limit, a simple search method is applied to degenerate the three dimensional problem into a two dimensional NIP problem, for which two optimization algorithms are proposed. One is the successive quadratic programming (SQP) algorithm, combining with the continuous relaxation based branch‐and‐bound method, which can obtain the global optimal solution since the continuous relaxation problem is proved to be hidden convex. The other is a low‐complexity sub‐optimal iterative algorithm, combining with the nearest‐neighboring method, which can be implemented with a polynomial complexity. Numerical examples are given to illustrate the optimization solution, which suggests that the joint optimization of the physical/data link layer parameters contributes noticeably to the energy saving in energy‐constrained wireless networks. Copyright © 2010 John Wiley & Sons, Ltd.     

Cross‐layer optimized routing in wireless sensor networks with duty cycle and energy harvesting

In this paper, we propose a cross‐layer optimized geographic node‐disjoint multipath routing algorithm, that is, two‐phase geographic greedy forwarding plus. To optimize the system as a whole, our algorithm is designed on the basis of multiple layers' interactions, taking into account the following. First is the physical layer, where sensor nodes are developed to scavenge the energy from environment, that is, node rechargeable operation (a kind of idle charging process to nodes). Each node can adjust its transmission power depending on its current energy level (the main object for nodes with energy harvesting is to avoid the routing hole when implementing the routing algorithm). Second is the sleep scheduling layer, where an energy‐balanced sleep scheduling scheme, that is, duty cycle (a kind of node sleep schedule that aims at putting the idle listening nodes in the network into sleep state such that the nodes will be awake only when they are needed), and energy‐consumption‐based connected k‐neighborhood is applied to allow sensor nodes to have enough time to recharge energy, which takes nodes' current energy level as the parameter to dynamically schedule nodes to be active or asleep. Third is the routing layer, in which a forwarding node chooses the next‐hop node based on 2‐hop neighbor information rather than 1‐hop. Performance of two‐phase geographic greedy forwarding plus algorithm is evaluated under three different forwarding policies, to meet different application requirements. Our extensive simulations show that by cross‐layer optimization, more shorter paths are found, resulting in shorter average path length, yet without causing much energy consumption. On top of these, a considerable increase of the network sleep rate is achieved. Copyright © 2014 John Wiley & Sons, Ltd.     

Network infrastructure extension using 802.1D‐based wireless mesh networks

Ubiquitous Internet access is becoming a major requirement for end‐users due to the increasing number of services and applications supported over the Internet. Extending the coverage of current Wi‐Fi infrastructures installed in companies, universities and cities, has been considered a solution to help in fulfilling this requirement, namely when it comes to wireless and nomadic Internet access. This paper describes and analyses a new and simple solution, called Wi‐Fi network Infrastructure eXtension (WiFIX), aimed at extending current Wi‐Fi infrastructures. WiFIX is based on standard IEEE 802.1D bridges and a single‐message protocol that is able to self‐organize the network, and it only requires software changes in IEEE 802.11 access points (APs); no changes to IEEE 802.11 stations are needed. Overhead analysis and experimental results show both the higher efficiency of the solution compared to the IEEE 802.11s draft standard and its good performance as far as data throughput, delay and packet loss are concerned. Copyright © 2010 John Wiley & Sons, Ltd.     

Multi‐cost routing for energy and capacity constrained wireless mesh networks

We propose a class of novel energy‐efficient multi‐cost routing algorithms for wireless mesh networks, and evaluate their performance. In multi‐cost routing, a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calculated using appropriate operators. In the end these parameters are combined in various optimization functions, corresponding to different routing algorithms, for selecting the optimal path. We evaluate the performance of the proposed energy‐aware multi‐cost routing algorithms under two models. In the network evacuation model, the network starts with a number of packets that have to be transmitted and an amount of energy per node, and the objective is to serve the packets in the smallest number of steps, or serve as many packets as possible before the energy is depleted. In the dynamic one‐to‐one communication model, new data packets are generated continuously and nodes are capable of recharging their energy periodically, over an infinite time horizon, and we are interested in the maximum achievable steady‐state throughput, the packet delay, and the energy consumption. Our results show that energy‐aware multi‐cost routing increases the lifetime of the network and achieves better overall network performance than other approaches. Copyright © 2011 John Wiley & Sons, Ltd.     

Power control for multicell CDMA wireless networks: A team optimization approach

We study power control in multicell CDMA wireless networks as a team optimization problem where each mobile attains at the minimum its individual fixed target SIR level and beyond that optimizes its transmission power level according to its individual preferences. We derive conditions under which the power control problem admits a unique feasible solution. Using a Lagrangian relaxation approach similar to [10] we obtain two decentralized dynamic power control algorithms: primal and dual power update, and establish their global stability utilizing both classical Lyapunov theory and the passivity framework [14]. We show that the robustness results of passivity studies [8, 9] as well as most of the stability and robustness analyses in the literature [10] are applicable to the power control problem considered. In addition, some of the basic principles of call admission control are investigated from the perspective of the model adopted in this paper. We illustrate the proposed power control schemes through simulations. Tansu Alpcan was with the University of Illinois at Urbana-Champaign during this research. X. Fan, M. Arcak, J. T. Wen: Research supported in part by the RPI Office of Research through an Exploratory Seed Grant. John Wen is supported by the China NSFC two-bases project under grant no. 60440420130. T. Başar: Research supported in part by the NSF Grant ITR 00-85917. Tansu Alpcan received the B.S. degree in electrical engineering from Bogazici University, Istanbul, Turkey in 1998. He received the M.S. and Ph.D. degrees in electrical and computer engineering from University of Illinois at Urbana-Champaign (UIUC) in 2001 and 2006, respectively. His research interests include game theory, control and optimization of wired and wireless communication networks, network security, and intrusion detection. He has received Fulbright scholarship in 1999 and best student paper award in IEEE Conference on Control Applications in 2003. He first authored more than 20 journal and conference articles and was an associate editor for IEEE Conference on Control Applications (CCA) in 2005. Tansu is the recipient of the Robert T. Chien Research Award from the UIUC Department of Electrical and Computer Engineering and Ross J. Martin Research Award from the UIUC College of Engineering in 2006. Tansu Alpcan is a (student) member of IEEE since 1998. Currently, he is a post-doctoral research scientist in Deutsche Telekom Laboratories, which is part of Technische Universitat Berlin, in Germany. Xingzhe Fan received the B.E. and M.E. degrees from Tsinghua University, Beijing, China, and the Ph.D. degree from the Electrical, Computer, and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, NY, in 1998, 2000, and 2004, respectively. He is currently a visiting assistant professor in Universifty of Miami, Miami, FL. His research interests are in nonlinear control and distributed optimization. Tamer Başar is with the University of Illinois at Urbana-Champaign (UIUC), where he holds the positions of the Fredric G. and Elizabeth H. Nearing Endowed Professor of Electrical and Computer Engineering, Center for Advanced Study Professor, and Research Professor at the Coordinated Science Laboratory. He received the B.S.E.E. degree from Robert College, Istanbul, in 1969, and the M.S., M.Phil, and Ph.D. degrees from Yale University during the period 1970–1972. He joined UIUC in 1981 after holding positions at Harvard University and Marmara Research Institute (Turkey). He has published extensively in systems, control, communications, and dynamic games, and has current research interests in modeling and control of communication networks; control over heterogeneous networks; resource allocation, management and pricing in networks; mobile computing; security issues in computer networks; and robust identification, estimation and control. Dr. Basar is the Editor-in-Chief of Automatica, Editor of the Birkhauser Series on Systems & Control, Editor of the Annals of the International Society of Dynamic Games (ISDG), and member of editorial and advisory boards of several international journals in control, wireless networks, and applied mathematics. He has received several awards and recognitions over the years, among which are the Medal of Science of Turkey (1993); Distinguished Member Award (1993), Axelby Outstanding Paper Award (1995), and Bode Lecture Prize (2004) of the IEEE Control Systems Society (CSS); Millennium Medal of IEEE (2000); Tau Beta Pi Drucker Eminent Faculty Award of UIUC (2004); the Outstanding Service Award (2005) and the Giorgio Quazza Medal (2005) of the International Federation of Automatic Control (IFAC); and the Richard E. Bellman Control Heritage Award of the American Automatic Control Council (2006). He is a member of the National Academy of Engineering (of USA), a member of the European Academy of Sciences, a Fellow of IEEE, a Fellow of IFAC, a past president of CSS, and the founding president of ISDG. Murat Arcak is an associate professor of Electrical, Computer and Systems Engineering at the Rensselaer Polytechnic Institute in Troy, NY. He was born in Istanbul, Turkey in 1973. He received the B.S. degree in Electrical and Electronics Engineering from the Bogazici University, Istanbul, in 1996, and the M.S. and Ph.D. degrees in Electrical and Computer Engineering from the University of California, Santa Barbara, in 1997 and 2000, under the direction of Petar Kokotovic. He joined Rensselaer in 2001. Dr. Arcak’s research is in nonlinear control theory and its applications, with particular interest in robust and observer-based feedback designs and in analysis and design of large-scale systems. In these areas he has published over eighty journal and conference papers, and organized several technical workshops. He is a member of SIAM, a senior member of IEEE, and an associate editor for the IFAC journal Automatica. He received a CAREER Award from the National Science Foundation in 2003, and the Donald P. Eckman Award from the American Automatic Control Council in 2006. John Ting-Yung Wen received B.Eng. from McGill University in 1979, M.S. from University of Illinois in 1981, and Ph.D. from Rensselaer Polytechnic Institute in 1985, all in Electrical Engineering. From 1981–1982, he was a system engineer at Fisher Controls where he developed a plant-wide coordination control system for pulp and paper plants. From 1985–1988, he was a member of technical staff at the Jet Propulsion Laboratory where he developed new modeling and control algorithms for large space structures and space robots. Since 1988, he has been with Rensselaer Polytechnic Institute where he is currently a professor in the Department of Electrical, Computer, and Systems Engineering with a joint appointment in the Department of Mechanical, Aerospace, and Nuclear Engineering. Since July 2005, he has been the Director of the Center for Automation Technologies and Systems, a multi-disciplinary research center supported by the New York State. Dr. Wen was an ASEE/NASA Summer Faculty Fellow in 1993, a Japan Society for the Promotion of Science (JSPS) Senior Visiting Scientist in 1997, and has received eleven NASA Tech Brief Awards. His research interest lies in the general area of modeling and control of high performance motion systems, model reduction for complex dynamical systems, and network based control including congestion regulation and multi-robot coordination. Dr. Wen is a Fellow of IEEE.     

An efficient mesh router nodes placement in wireless mesh networks based on moth-flame optimization algorithm

One of the most challenging tasks is deploying a wireless mesh network backbone to achieve optimum client coverage. Previous research proposed a bi-objective function and used a hierarchical or aggregate weighted sum method to find the best mesh router placement. In this work, to avoid the fragmented network scenarios generated by previous formulations, we suggest and evaluate a new objective function to maximize client coverage while simultaneously optimizing and maximizing network connectivity for optimal efficiency without requiring knowledge of the aggregation coefficient. In addition, we compare the performance of several recent meta-heuristic algorithms: Moth-Flame Optimization (MFO), Marine Predators Algorithm (MPA), Multi-Verse Optimizer (MVO), Improved Grey Wolf Optimizer (IGWO), Salp Swarm Algorithm (SSA), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Harris Hawks Optimization (HHO), Particle Swarm Optimization (PSO), Sine Cosine Algorithm (SCA), and Slime Mould Algorithm (SMA). We empirically examined the performance of the proposed function using different settings. The results show that our proposed function provides higher client coverage and optimal network connectivity with less computation power. Also, compared to other optimization algorithms, the MFO algorithm gives higher coverage to clients while maintaining a fully connected network.     

Simulation and analysis of node throughput using smart antenna in wireless mesh networks

Smart antenna technology is introduced to wireless mesh networks. Smart antennas based wider-range access medium access control (MAC) protocol (SWAMP) is used as MAC protocol for IEEE 802.11 mesh networks in this study. The calculation method of node throughput in chain and arbitrary topology is proposed under nodes fairness guarantee. Network scale and interference among nodes are key factors that influence node throughput. Node distribution pattern near the gateway also affects the node throughput. Experiment based on network simulator-2 (NS-2) simulation platform compares node throughput between smart antenna scenario and omni-antenna scenario. As smart antenna technology reduces the bottle collision domain, node throughput increases observably.     

Ant‐inspired level‐based congestion control for wireless mesh networks

The ever increasing presence of services over wireless networks utilizing large bandwidth necessitates the constant quest for developing efficient and dependable services, capable of providing support to a wide and variety of applications. Wireless mesh networks can provide such reliable and scalable solutions addressing the requirements of the services utilizing large bandwidth. The current focus is on the interesting and challenging issue of channel access for different services with assured bandwidth guarantees. The problem of bandwidth, constantly encountered by the wireless mesh networks, is studied in this paper with due thrust on the issues pertaining to congestion control mechanisms. A novel ant colony‐based approach called ant‐inspired level‐based congestion control (AILCC) is developed in order to effectively manage the issues of bandwidth. The versatility of the AILCC includes its capacity for service differentiation in addressing a range of requests, such as applications of real‐time and nonreal‐time. The primary focus of AILCC is on providing an efficient congestion control mechanism that can meet numerous bandwidth demands of various applications. The performance of AILCC in terms of the ratio of packet delivery and end‐to‐end delay is evaluated through relevant simulations. The results obtained demonstrate greater levels of performance of AILCC over the other methods in existence. Copyright © 2014 John Wiley & Sons, Ltd.