Showing papers on "Wireless mesh network published in 2014"
••
TL;DR: This article discusses the evolution of the multihop ad hoc networking paradigm by building on the lessons learned from the IETF MANET research, and analyzes four successful networking paradigms, mesh, sensor, opportunistic, and vehicular networks, that emerged from the MANET world as a more pragmatic application.
Abstract: In this article we discuss the state of the art of (mobile) multihop ad hoc networking. This paradigm has often been identified with the solutions developed inside the IETF MANET working group, and for this reason it is called the MANET paradigm. However, they do not coincide, and in the last decade they clearly diverged. In this article, we start from the reasons why the MANET paradigm did not have a major impact on computer communications, and we discuss the evolution of the multihop ad hoc networking paradigm by building on the lessons learned from the MANET research. Specifically, we analyze four successful networking paradigms, mesh, sensor, opportunistic, and vehicular networks, that emerged from the MANET world as a more pragmatic application of the multihop ad hoc networking paradigm. We also present the new research directions in the multihop ad hoc networking field: peoplecentric networking, triggered by the increasing penetration of the smartphones in everyday life, which is generating a people-centric revolution in computing and communications.
427 citations
••
TL;DR: A novel design paradigm toward lightweight and tolerant authentication for service-oriented WMNs, named Variable Threshold-value Authentication (VTA) architecture, which can not only overcome the disadvantage of those static threshold value schemes, but also largely increase system cost comparing to the schemes not equipped with threshold mechanism.
Abstract: Wireless Mesh Networks (WMNs) play a very important role on "the last mile" in a variety of wireless network access with infrastructure support. It is necessary to provide guaranteed security while minimizing WMNs topology change by considering both rapid authentication of mobile terminals and demand for fast switch between different wireless networks. In this paper, we propose a novel design paradigm toward lightweight and tolerant authentication for service-oriented WMNs, named Variable Threshold-value Authentication (VTA) architecture. On one hand, VTA's intrusion-tolerant ability is ensured to design a series of node activated mechanisms to remain threshold values t and n of system private key unchanged. On the other hand, VTA changes threshold values t and n when nodes leave/join authentication server group. Analysis and simulation results show that VTA can not only overcome the disadvantage of those static threshold value schemes, but also largely increase system cost comparing to the schemes not equipped with threshold mechanism for WMNs.
298 citations
••
TL;DR: The approach is to classify existing contemporary wireless intrusion detection system (IDS) techniques based on target wireless network, detection technique, collection process, trust model and analysis technique.
183 citations
••
TL;DR: A general survey of multicast routing protocols in Mobile adhoc Networks (MANETs) is given, which plays an important role in MANETs to provide group communication.
Abstract: There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categories- multicast routing based on application independence and multicast routing based on application dependence. Multicast routing protocols plays an important role in MANETs to provide group communication. Multicasting is one of the major communication technologies primarily designed for bandwidth conservation and an efficient way of transferring data to a group of receivers in wireless mesh networks.
173 citations
•
TL;DR: It is shown that the concept of a covert acoustical mesh network renders many conventional security concepts useless, as acoustICAL communications are usually not considered.
Abstract: Covert channels can be used to circumvent system and network policies by establishing communications that have not been considered in the design of the computing system. We construct a covert channel between different computing systems that utilizes audio modulation/demodulation to exchange data between the computing systems over the air medium. The underlying network stack is based on a communication system that was originally designed for robust underwater communication. We adapt the communication system to implement covert and stealthy communications by utilizing the ultrasonic frequency range. We further demonstrate how the scenario of covert acoustical communication over the air medium can be extended to multi-hop communications and even to wireless mesh networks. A covert acoustical mesh network can be conceived as a meshed botnet or malnet that is accessible via inaudible audio transmissions. Different applications of covert acoustical mesh networks are presented, including the use for remote keylogging over multiple hops. It is shown that the concept of a covert acoustical mesh network renders many conventional security concepts useless, as acoustical communications are usually not considered. Finally, countermeasures against covert acoustical mesh networks are discussed, including the use of lowpass filtering in computing systems and a host-based intrusion detection system for analyzing audio input and output in order to detect any irregularities.
152 citations
•
24 Oct 2014
TL;DR: In this paper, a dynamic wireless aerial mesh network is proposed to provide real-time persistent wide area communications service to provide communications in response to an incident, where the area services is a wide area that is physically inaccessible via ground transportation.
Abstract: Embodiments include a dynamic wireless aerial mesh network having aerial nodes that provides real-time persistent wide area communications service to provide communications in response to an incident. Typically, the area services is a wide area that is physically inaccessible via ground transportation. In addition, embodiments include the formation of a decentralized mesh supernetwork comprising two or more dynamic wireless aerial mesh networks where each dynamic wireless aerial mesh network is owned by a different agency (e.g., a secure community). A member of a first dynamic wireless aerial mesh network may send a request to a member of a second dynamic wireless aerial mesh network for the first dynamic wireless aerial mesh network to join the second dynamic wireless aerial mesh network to form a mesh supernetwork, and receive an acceptance from the member of the second dynamic wireless aerial mesh network.
148 citations
••
TL;DR: This paper proposes a queuing system that relied on traffic model for WMNs and presents the intelligent and adaptive model, which is precise in modeling the features of traffic loads in WMNs.
Abstract: In mesh networks architecture, it should be permitted to visit the mobile client points. Whereas in mesh networks environment, the main throughput flows usually communicate with the conventional wired network. The so-called gateway nodes can link directly to traditional Ethernet, depending on these mesh nodes, and can obtain access to data sources that are related to the Ethernet. In wireless mesh networks WMNs, the quantities of gateways are limited. The packet-processing ability of settled wireless nodes is limited. Consequently, throughput loads of mesh nodes highly affect the network performance. In this paper, we propose a queuing system that relied on traffic model for WMNs. On the basis of the intelligent adaptivenes, the model considers the influences of interference. Using this intelligent model, service stations with boundless capacity are defined as between gateway and common nodes based on the largest hop count from the gateways, whereas the other nodes are modeled as service stations with certain capacity. Afterwards, we analyze the network throughput, mean packet loss ratio, and packet delay on each hop node with the adaptive model proposed. Simulations show that the intelligent and adaptive model presented is precise in modeling the features of traffic loads in WMNs. Copyright © 2013 John Wiley & Sons, Ltd.
135 citations
••
TL;DR: A novel technique which measures and models the relative clock drift between neighbor motes, thereby reducing the effective drift rate, and reduces the minimum achievable duty cycle of an idle network by a factor of 10, which in turn lowers the mote power consumption and extends the network lifetime.
Abstract: Industrial low-power wireless mesh networks are shifting towards time-synchronized medium access control (MAC) protocols which are able to yield over 99.9% end-to-end reliability and radio duty cycles well below 1%. In these networks, motes use time slots to communicate, and neighbor motes maintain their clocks' alignment, typically within 1 ms. Temperature, supply voltage, and fabrication differences cause the motes' clocks to drift with respect to one another. Neighbor motes need to re-synchronize periodically through pairwise communication. This period is typically determined a priori, based on the worst case drift. In this paper, we propose a novel technique which measures and models the relative clock drift between neighbor motes, thereby reducing the effective drift rate. Instead of resynchronizing at a preset rate, neighbor motes resynchronize only when needed. This reduces the minimum achievable duty cycle of an idle network by a factor of 10, which in turn lowers the mote power consumption and extends the network lifetime. This Adaptive Synchronization is implemented as part of IEEE802.15.4e in the OpenWSN protocol stack and is validated through extensive experimentation.
111 citations
•
29 Sep 2014TL;DR: In this article, a mesh network of wired and/or wireless nodes is described in which a centralized controller provides seamless end-to-end service from the edge of the mesh network to mesh nodes located proximate to subscriber devices.
Abstract: A mesh network of wired and/or wireless nodes is described in which a centralized controller provides seamless end-to-end service from the edge of the mesh network to mesh nodes located proximate to subscriber devices. The controller operates to provide a central configuration point for configuring forwarding planes of the mesh nodes of the mesh network, so as to set up transport data channels to transport traffic from the edge nodes via the mesh nodes to the subscriber devices.
106 citations
••
TL;DR: The problem of network-wide energy consumption minimization under the network throughput constraint is formulates as a mixed-integer nonlinear programming problem by jointly optimizing routing, rate control, and power allocation and the min-max fairness model is applied to address the fairness issue.
Abstract: The increasing demand for wireless services has led to a severe energy consumption problem with the rising of greenhouse gas emission. While the renewable energy can somehow alleviate this problem, the routing, flow rate, and power still have to be well investigated with the objective of minimizing energy consumption in multi-hop energy renewable wireless mesh networks (ER-WMNs). This paper formulates the problem of network-wide energy consumption minimization under the network throughput constraint as a mixed-integer nonlinear programming problem by jointly optimizing routing, rate control, and power allocation. Moreover, the min-max fairness model is applied to address the fairness issue because the uneven routing problem may incur the sharp reduction of network performance in multi-hop ER-WMNs. Due to the high computational complexity of the formulated mathematical programming problem, an energy-aware multi-path routing algorithm (EARA) is also proposed to deal with the joint control of routing, flow rate, and power allocation in practical multi-hop WMNs. To search the optimal routing, it applies a weighted Dijkstra's shortest path algorithm, where the weight is defined as a function of the power consumption and residual energy of a node. Extensive simulation results are presented to show the performance of the proposed schemes and the effects of energy replenishment rate and network throughput on the network lifetime.
85 citations
••
10 Jun 2014TL;DR: This paper presents a new DoS attack, called puppet attack, which can result in denial of service in AMI network, and results show that puppet attack is a serious and packet deliver rate goes down to 20%-10%.
Abstract: Advanced Metering Infrastructure (AMI) is the core component in a smart grid that exhibits a highly complex network configuration. AMI shares information about consumption, outages, and electricity rates reliably and efficiently by bidirectional communication between smart meters and utilities. However, the numerous smart meters being connected through mesh networks open new opportunities for attackers to interfere with communications and compromise utilities assets or steal customers private information. In this paper, we present a new DoS attack, called puppet attack, which can result in denial of service in AMI network. The intruder can select any normal node as a puppet node and send attack packets to this puppet node. When the puppet node receives these attack packets, this node will be controlled by the attacker and flood more packets so as to exhaust the network communication bandwidth and node energy. Simulation results show that puppet attack is a serious and packet deliver rate goes down to 20%-10%.
••
TL;DR: The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways to minimize WMN network costs while satisfying quality of service.
Abstract: Mesh clients, mesh routers and gateways are components of Wireless Mesh Network (WMN). In WMN, gateways connect to Internet using wireline links and supply Internet access services for users. Multiple gateways are needed, which take time and cost budget to set up, due to the limited wireless channel bit rate. WMN is a highly developed technology that offers to end users a wireless broadband access. It offers a high degree of flexibility contrasted to conventional networks; however, this attribute comes at the expense of a more complex construction. Therefore, a challenge is the planning and optimization of WMNs. This paper concentrates on the challenge using a genetic algorithm and simulated annealing. The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways. Experimental results proved that the performance of the genetic algorithm and simulated annealing in minimizing WMN network costs while satisfying quality of service. The proposed models are presented to significantly outperform the existing solutions.
•
14 Jan 2014TL;DR: In this paper, a method comprises identifying, by an apparatus, a plurality of wireless network clusters by receiving wireless synchronization messages from one or more member devices of each of the plurality of WSNs.
Abstract: Embodiments enable discovery of networks in a wireless communications medium. In example embodiments, a method comprises identifying, by an apparatus, a plurality of wireless network clusters by receiving wireless synchronization messages from one or more member devices of each of the plurality of wireless network clusters; calculating, by the apparatus, a cluster grade for each of the plurality of identified wireless network clusters based on information of the received wireless synchronization messages; selecting, by the apparatus, a wireless network cluster from the plurality of identified wireless network clusters, having a highest cluster grade for joining and operating in said wireless network cluster; and ranking, by the apparatus, non-selected wireless network clusters based on predefined criteria applied to information received by the apparatus characterizing the non-selected wireless network clusters.
••
TL;DR: An in-depth survey of the existing literature in the area, detailing the various approaches and their efficacy in addressing the problem of hidden and exposed nodes and offering a comparison of the techniques, by evaluating the models, limitations, assumptions, and performance gains.
Abstract: This survey provides a comprehensive review of existing physical carrier sensing enhancements for IEEE 802.11 wireless networks. The original physical carrier sensing mechanism, used by wireless stations to gain access to the medium, is limited. Consequently, IEEE 802.11 networks are vulnerable to the presence of hidden and exposed nodes. Such nodes can significantly decrease system performance by increasing the collision rate and decreasing the channel spatial reuse. The value of the physical carrier sensing threshold is a key factor influencing the presence of hidden and exposed nodes in a wireless network. Several enhancements have been proposed in the literature, which attempt to mitigate the loss in performance caused by the limited carrier sensing. Firstly, the notion of an optimum carrier sensing threshold has been studied, and results indicate that it can be tuned to an optimum value. Building on the positive early results, further work was performed to develop mechanisms that dynamically adjust the threshold according to varying network conditions. This article presents an in-depth survey of the existing literature in the area, detailing the various approaches and their efficacy in addressing the problem of hidden and exposed nodes (and consequently increasing performance). It offers a comparison of the techniques, by evaluating the models, limitations, assumptions, and performance gains.
••
TL;DR: This work compares Hill Climbing, Simulated Annealing and Genetic Algorithm by simulations for node placement problem to find the optimal distribution of router nodes in order to provide the best network connectivity and provide thebest coverage in a set of randomly distributed clients.
Abstract: One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. There are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we compare Hill Climbing (HC), Simulated Annealing (SA) and Genetic Algorithm (GA) by simulations for node placement problem. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of randomly distributed clients. From the simulation results, all algorithms converge to the maximum size of Giant Component (GC). However, according to the number of covered mesh clients, HC and SA converge faster.
••
01 Sep 2014TL;DR: This paper investigates the utilization of low-altitude aerial mesh networks composed by Small Unmanned Aerial Vehicles in order to re-enstablish connectivity among isolated end-user devices located on the ground, and proposes a distributed mobility algorithm, based on the virtual spring model, through which the SUAV-based mesh node can self-organize into a mesh structure.
Abstract: Guaranteeing network connectivity in post-disaster scenarios is challenging yet crucial to save human lives and to coordinate the operations of first responders. In this paper, we investigate the utilization of low-altitude aerial mesh networks composed by Small Unmanned Aerial Vehicles (SUAVs) in order to re-enstablish connectivity among isolated end-user (EU) devices located on the ground. Aerial ad-hoc networks provide the advantage to be deployable also on critical scenarios where terrestrial mobile devices might not operate, however their implementation is challenging from the point of view of mobility management and of coverage lifetime. In this paper, we address both these issues with three novel research contributions. First, we propose a distributed mobility algorithm, based on the virtual spring model, through which the SUAV-based mesh node-called also Repairing Units (RUs) in this study- can self-organize into a mesh structure by guaranteeing Quality of Service (QoS) over the aerial link, and connecting the maximum number of EU devices. Second, we evaluate our scheme on a realistic 3D environment with buildings, and we demonstrate the effectiveness of the aerial deployment compared to a terrestrial one, in terms of coverage and wireless link reliability. Third, we address the problem of energy lifetime, and we propose a distributed charging scheduling scheme, through which a persistent coverage of RUs can be guaranteed over the emergency scenario.
••
06 Apr 2014
TL;DR: OpenNet is developed, which connects Mininet to ns3 to enjoy both Mininet's advantage of controller compatibility and ns-3's ability in the wireless/mobility modeling, and complements ns- 3 by adding probe mechanism, which is missing in the current ns-2 implementation.
Abstract: This study is motivated by a plan to install a software-defined wireless local area network (SDWLAN) on campus, which possesses a desired property that both data flow and device behaviors can be software-definable. Because the installation involves hundreds of access points, we must conduct simulations beforehand to verify the design and scalability of the target system. However, existing SDN simulator like Mininet does not support modeling of wireless channel and mobility. On the other hand, common network simulator like ns-3 only has limited support for software-defined controllers and does not fully implement handover process. We thus develop OpenNet, which connects Mininet to ns3 to enjoy both Mininet's advantage of controller compatibility and ns-3's ability in the wireless/mobility modeling. OpenNet also complements ns-3 by adding probe mechanism, which is missing in the current ns-3 implementation. Our simulation result demonstrates the effectiveness of OpenNet.
••
TL;DR: By considering the first and second order statistics of the energy charging and discharging processes at each mesh AP, it is demonstrated that the proposed schemes outperform some existing state-of-the-art solutions.
Abstract: There is a growing interest in the use of renewable energy sources to power wireless networks in order to mitigate the detrimental effects of conventional energy production or to enable deployment in off-grid locations. However, renewable energy sources, such as solar and wind, are by nature unstable in their availability and capacity. The dynamics of energy supply hence impose new challenges for network planning and resource management. In this paper, the sustainable performance of a wireless mesh network powered by renewable energy sources is studied. To address the intermittently available capacity of the energy supply, adaptive resource management and admission control schemes are proposed. Specifically, the goal is to maximize the energy sustainability of the network, or equivalently, to minimize the failure probability that the mesh access points (APs) deplete their energy and go out of service due to the unreliable energy supply. To this end, the energy buffer of a mesh AP is modeled as a G/G/1(/N) queue with arbitrary patterns of energy charging and discharging. Diffusion approximation is applied to analyze the transient evolution of the queue length and the energy depletion duration. Based on the analysis, an adaptive resource management scheme is proposed to balance traffic loads across the mesh network according to the energy adequacy at different mesh APs. A distributed admission control strategy to guarantee high resource utilization and to improve energy sustainability is presented. By considering the first and second order statistics of the energy charging and discharging processes at each mesh AP, it is demonstrated that the proposed schemes outperform some existing state-of-the-art solutions.
••
06 Apr 2014TL;DR: Experimental performance results with commercially available quadrocopters communicating via IEEE 802.11a illustrate that changes are required in the mesh mode to support applications demanding high throughput with low jitter.
Abstract: Small-scale multicopters operating as autonomous teams in the air are envisioned for aerial monitoring and transport of goods in a variety of applications, including disaster management and environmental monitoring. For such applications to become reality, a high-throughput wireless network is needed. This paper presents experimental performance results with commercially available quadrocopters communicating via IEEE 802.11a. In particular, we compare the infrastructure and mesh modes of 802.11 for one-hop and two-hop communications, thus analyzing network layer versus MAC layer relaying. Results illustrate that changes are required in the mesh mode to support applications demanding high throughput with low jitter.
•
04 Dec 2014-World Academy of Science, Engineering and Technology, International Journal of Electronics and Communication Engineering
TL;DR: In this paper, the authors used a genetic algorithm and simulated annealing to enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways.
Abstract: Mesh clients, mesh routers and gateways are components of Wireless Mesh Network (WMN). In WMN, gateways connect to Internet using wireline links and supply Internet access services for users. Multiple gateways are needed, which take time and cost budget to set up, due to the limited wireless channel bit rate. WMN is a highly developed technology that offers to end users a wireless broadband access. It offers a high degree of flexibility contrasted to conventional networks; however, this attribute comes at the expense of a more complex construction. Therefore, a challenge is the planning and optimization of WMNs. This paper concentrates on the challenge using a genetic algorithm and simulated annealing. The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways. Experimental results proved that the performance of the genetic algorithm and simulated annealing in minimizing WMN network costs while satisfying quality of service. The proposed models are presented to significantly outperform the existing solutions.
•
07 Jan 2014TL;DR: An apparatus and method for a multi-tier wireless home mesh network is described in this paper, where each node is configured to forward data to other nodes and assigned to a particular tier based on the node's performance capabilities.
Abstract: An apparatus and method for a multi-tier wireless home mesh network is described. The method may include formation of an infrastructure-less wireless home mesh networking environment comprising a collection of nodes that operate as a decentralized, ad hoc wireless network with multiple sub-networks or tiers that are responsible for different functions within the network. Each node of the multi-tier network is configured to forward data to other nodes and is assigned to a particular tier based on the node's performance capabilities. A further embodiment includes identification of a wireless home mesh network. Once identified, one or more proprietary messages may be exchanged in a secure manner to establish connections with a home electronics device as either a mobile node or a stationary node of the home network. A home electronics device may wirelessly communicate to route data within one or more nodes of the wireless home mesh network. Other embodiments are described and claimed.
••
TL;DR: A new class of ad-hoc network called Autonomous Mobile Mesh Network (AMMNET), which is capable of following the mesh clients in the application terrain, and organizing themselves into a suitable network topology to ensure good connectivity for both intra- and intergroup communications.
Abstract: Mobile ad hoc networks (MANETs) are ideal for situations where a fixed infrastructure is unavailable or infeasible. Today's MANETs, however, may suffer from network partitioning. This limitation makes MANETs unsuitable for applications such as crisis management and battlefield communications, in which team members might need to work in groups scattered in the application terrain. In such applications, intergroup communication is crucial to the team collaboration. To address this weakness, we introduce in this paper a new class of ad-hoc network called Autonomous Mobile Mesh Network (AMMNET). Unlike conventional mesh networks, the mobile mesh nodes of an AMMNET are capable of following the mesh clients in the application terrain, and organizing themselves into a suitable network topology to ensure good connectivity for both intra- and intergroup communications. We propose a distributed client tracking solution to deal with the dynamic nature of client mobility, and present techniques for dynamic topology adaptation in accordance with the mobility pattern of the clients. Our simulation results indicate that AMMNET is robust against network partitioning and capable of providing high relay throughput for the mobile clients.
••
TL;DR: It is shown that the joint design scheme can accommodate double the traffic load, or achieve half the delay compared to the disjoint methods, as well as the performance gains compared to other design methods.
Abstract: This paper studies the joint design of routing and resource allocation algorithms in cognitive radio based wireless mesh networks. The mesh nodes utilize cognitive overlay mode to share the spectrum with primary users. Prior to each transmission, mesh nodes sense the wireless medium to identify available spectrum resources. Depending on the primary user activities and traffic characteristics, the available spectrum resources will vary between mesh transmission attempts, posing a challenge that the routing and resource allocation algorithms have to deal with to guarantee timely delivery of the network traffic. To capture the channel availability dynamics, the system is analyzed from a queuing theory perspective, and the joint routing and resource allocation problem is formulated as a non-linear integer programming problem. The objective is to minimize the aggregate end-to-end delay of all the network flows. A distributed solution scheme is developed based on the Lagrangian dual problem. Numerical results demonstrate the convergence of the distributed solution procedure to the optimal solution, as well as the performance gains compared to other design methods. It is shown that the joint design scheme can accommodate double the traffic load, or achieve half the delay compared to the disjoint methods.
••
TL;DR: A solution to increase the network lifetime based on a new Energy-Aware Objective Function used to design a Routing Protocol for Low-Power and Lossy Networks and reduces the peaks of energy consumption by 12%.
••
01 Feb 2014TL;DR: In this paper, a general way of solving the max-min fairness (MMF) traffic objective for wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots.
Abstract: The paper is devoted to modeling wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots. Such MIP models are formulated for several cases of the modulation and coding schemes (MCS) assignment. We present a general way of solving the max-min fairness (MMF) traffic objective for WMN using the formulated capacity models. Thus the paper combines WMN radio link modeling with a non-standard way of dealing with uncertain traffic, a combination that has not, to our knowledge, been treated so far by exact optimization models. We discuss several ways, including a method based on the so called compatible or independent sets, of solving the arising MIP problems. We also present an extensive numerical study that illustrates the running time efficiency of different solution approaches, and the influence of the MCS selection options and the number of time slots on traffic performance of a WMN. Exact joint optimization modeling of the WMN capacity and the MMF traffic objectives forms the main contribution of the paper.
••
TL;DR: An improved version of gravitational search algorithm (IGSA) is proposed to solve CA problems; a local operator is combined with the gravitational search algorithms to find the best solution.
•
07 Feb 2014TL;DR: In this article, the authors describe methods and apparatuses that facilitate mesh network communication by a millimeter wave base stations (mBs) or WTRUs as nodes of a directional mesh network with other nodes of the directional mesh networks.
Abstract: Methods and apparatuses are described herein that facilitate mesh network communication by a millimeter wave base stations (mBs) or WTRUs as nodes of a directional mesh network with other nodes of the directional mesh network. The mB or WTRU may include a directional antenna configured to transmit and receive signals in specific directions during the mesh network communication to define a directional mesh network. The mBs or WTRUs may transmit transmission request messages to neighbor nodes, wherein the transmission request messages include transmission slot allocation bitmaps and channel quality indicator information (CQI). Then response messages from the neighbor nodes may be received, wherein the response messages include receive slot allocation bitmaps and resource allocation decisions. The mBs or WTRUs may then update their transmission slot allocation bitmaps based on the received response messages and transmit data packets in specific directions based on the updated transmission slot allocation bitmap.
••
TL;DR: This work considers Simulated Annealing Algorithm (SA) temperature and Iteration per phase for the router node placement problem in WMNs to find the optimal distribution of router nodes in order to provide the best network connectivity and provide thebest coverage in a set of Normal distributed clients.
Abstract: One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. There are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we consider Simulated Annealing Algorithm (SA) temperature and Iteration per phase for the router node placement problem in WMNs. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of Normal distributed clients. From simulation results, we found how to optimize both the size of Giant Component and number of covered mesh clients. When the number of iterations per phase is big, the performance is better in WMN-SA System. From for SA temperature, when SA temperature is 0 and 1, the performance is almost same. When SA temperature is 2 and 3 or more, the performance decrease because there are many kick ups.
••
TL;DR: This work uses the WMN-SA system to find the optimal distribution of router nodes in order to provide the best network connectivity and the best coverage for distributed mesh clients.
Abstract: With the emergence of wireless networking paradigm, several optimisation problems are showing their usefulness to the efficient design of such networks. These problems are related, among others, to optimising network connectivity, coverage and stability. The resolution of these problems turns out to be crucial for optimised network performance. In the case of wireless mesh networks (WMN), such problems include computing placement of nodes (mesh router nodes, gateways and distribution of mesh client notes), so that network performance is optimised. Previously, we have proposed and implemented a simulation system, which uses simulated annealing (SA) algorithm, to optimise network performance by computing mesh routers’ positions in wireless mesh networks (WMNs). We consider different temperature values and different instances in our simulations. In this work, we use the WMN-SA system to find the optimal distribution of router nodes in order to provide the best network connectivity and the best coverage for distributed mesh clients. From simulation results, we found that when the size of the instance increases, the size of GC and NCMC decrease. Moreover, the larger instances are affected more by higher temperatures.
••
TL;DR: The authors apply their proposed WMN-SA simulation system in a realistic scenario of the distribution of mesh clients considering Itoshima City, Fukuoka Prefecture, Japan and found many insights that can be very important for real deployment of WMNs.
Abstract: One of the key advantages of Wireless Mesh Networks WMNs is their importance for providing cost-efficient broadband connectivity. In WMNs, there are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, the authors consider the router node placement problem in WMNs. The objective is to find the optimal distribution of router nodes in order to provide the best network connectivity the maximal number of connected routers and coverage maximal number of covered clients. The authors apply their proposed WMN-SA simulation system in a realistic scenario of the distribution of mesh clients considering Itoshima City, Fukuoka Prefecture, Japan. From simulation results, they found many insights that can be very important for real deployment of WMNs.