3,745 research outputs found
Performance evaluation considering iterations per phase and SA temperature in WMN-SA system
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.Peer ReviewedPostprint (published version
A GA-based simulation system for WMNs: comparison analysis for different number of flows, client distributions, DCF and EDCA functions
In this paper, we compare the performance of Distributed Coordination Function (DCF) and Enhanced Distributed Channel Access (EDCA) for normal and uniform distributions of mesh clients considering two Wireless Mesh Network (WMN) architectures. As evaluation metrics, we consider throughput, delay, jitter and fairness index metrics. For simulations, we used WMN-GA simulation system, ns-3 and Optimized Link State Routing. The simulation results show that for normal distribution, the throughput of I/B WMN is higher than Hybrid WMN architecture. For uniform distribution, in case of I/B WMN, the throughput of EDCA is a little bit higher than Hybrid WMN. However, for Hybrid WMN, the throughput of DCF is higher than EDCA. For normal distribution, the delay and jitter of Hybrid WMN are lower compared with I/B WMN. For uniform distribution, the delay and jitter of both architectures are almost the same. However, in the case of DCF for 20 flows, the delay and jitter of I/B WMN are lower compared with Hybrid WMN. For I/B architecture, in case of normal distribution the fairness index of DCF is higher than EDCA. However, for Hybrid WMN, the fairness index of EDCA is higher than DCF. For uniform distribution, the fairness index of few flows is higher than others for both WMN architectures.Peer ReviewedPostprint (author's final draft
Evolving SDN for Low-Power IoT Networks
Software Defined Networking (SDN) offers a flexible and scalable architecture
that abstracts decision making away from individual devices and provides a
programmable network platform. However, implementing a centralized SDN
architecture within the constraints of a low-power wireless network faces
considerable challenges. Not only is controller traffic subject to jitter due
to unreliable links and network contention, but the overhead generated by SDN
can severely affect the performance of other traffic. This paper addresses the
challenge of bringing high-overhead SDN architecture to IEEE 802.15.4 networks.
We explore how traditional SDN needs to evolve in order to overcome the
constraints of low-power wireless networks, and discuss protocol and
architectural optimizations necessary to reduce SDN control overhead - the main
barrier to successful implementation. We argue that interoperability with the
existing protocol stack is necessary to provide a platform for controller
discovery and coexistence with legacy networks. We consequently introduce
{\mu}SDN, a lightweight SDN framework for Contiki, with both IPv6 and
underlying routing protocol interoperability, as well as optimizing a number of
elements within the SDN architecture to reduce control overhead to practical
levels. We evaluate {\mu}SDN in terms of latency, energy, and packet delivery.
Through this evaluation we show how the cost of SDN control overhead (both
bootstrapping and management) can be reduced to a point where comparable
performance and scalability is achieved against an IEEE 802.15.4-2012 RPL-based
network. Additionally, we demonstrate {\mu}SDN through simulation: providing a
use-case where the SDN configurability can be used to provide Quality of
Service (QoS) for critical network flows experiencing interference, and we
achieve considerable reductions in delay and jitter in comparison to a scenario
without SDN
FastM: Design and Evaluation of a Fast Mobility Mechanism for Wireless Mesh Networks
Although there is a large volume of work in the literature in terms of mobility approaches for Wireless Mesh Networks, usually these approaches introduce high latency in the handover process and do not support realtime services and applications. Moreover, mobility is decoupled from routing, which leads to inefficiency to both mobility and routing approaches with respect to mobility. In this paper we present a new extension to proactive routing protocols using a fast mobility extension, FastM, with the purpose of increasing handover performance in Wireless Mesh Networks. With this new extension, a new concept is created to integrate information between neighbor wireless mesh routers, managing locations of clients associated to wireless mesh routers in a certain neighborhood, and avoiding packet loss during handover. The proposed mobility approach is able to optimize the handover process without imposing any modifications to the current IEE 802.11 MAC protocol and use unmodified clients. Results show the improved efficiency of the proposed scheme: metrics such as disconnection time, throughput, packet loss and control overhead are largely improved when compared to previous approaches. Moreover, these conclusions apply to mobility scenarios, although mobility decreases the performance of the handover approach, as expected
Performance evaluation of WMN-GA for different mutation and crossover rates considering number of covered users parameter
Node placement problems have been long investigated in the optimization field due to numerous applications in location science and classification. Facility location problems are showing their usefulness to communication networks, and more especially from Wireless Mesh Networks (WMNs) field. Recently, such problems are showing their usefulness to communication networks, where facilities could be servers or routers offering connectivity services to clients. In this paper, we deal with the effect of mutation and crossover operators in GA for node placement problem. We evaluate the performance of the proposed system using different selection operators and different distributions of router nodes considering number of covered users parameter. The simulation results show that for Linear and Exponential ranking methods, the system has a good performance for all rates of crossover and mutation.Peer ReviewedPostprint (published version
An evaluation of two distributed deployment algorithms for Mobile Wireless Sensor Networks
Deployment is important in large wireless sensor networks (WSN), specially because nodes may fall due to failure or battery issues. Mobile WSN cope with deployment and reconfiguration at the same time: nodes may move autonomously: i) to achieve a good area coverage; and ii) to distribute as homogeneously as possible. Optimal distribution is computationally expensive and implies high tra c load, so local, distributed approaches may be preferable. This paper presents an experimental evaluation of role-based and behavior based ones. Results show that the later
are better, specially for a large number of nodes in areas with obstacles.Universidad de Málaga. Campus de Excelencia Internacional AndalucĂa Tech
- …