Elis Kulla

Impact of Source and Destination Movement on MANET Performance Considering BATMAN and AODV Protocols

In recent years, MANETs are continuing to attract the attention for their potential use in several fields such as military activities, rescue operations and time-critical applications. In this paper, we present the implementation and analysis of our implemented MANET testbed considering AODV and BATMAN protocols for wireless multi-hop networking. We investigate the effect of mobility and topology changing in MANET. We evaluate the performance of the routing protocols through experiments in real environment. In this work, we consider four scenarios: Static, Source Moving, Destination Moving and Source-Destination Moving. We assess the performance of our testbed in terms of throughput, number of dropped packets and delay. We found that, when routes are changing often, the BATMAN has better performance than AODV because it put the packets in a buffer. While, because AODV is a reactive protocol, it introduces some delay in the network.

Performance Evaluation of WMN Considering Number of Connections Using NS-3 Simulator

Wireless Mesh Networks (WMNs) are currently attracting a lot of attention due to their ability to provide cost-efficient broadband wireless connectivity. In this paper, we evaluate the performance of a WMN by simulations considering packet delivery ratio (PDR), throughput and delay. For simulations, we used ns-3 simulator and Hybrid Wireless Mesh Protocol (HWMP). We evaluate the performance of the WMN by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for higher values of transmission rate and 30 connections, the delay and jitter increased very much, so the real-time applications, like video streaming, become difficult.

A comparison study of Hill Climbing, Simulated Annealing and Genetic Algorithm for node placement problem in WMNs

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.

Evaluation of MANET protocols for different indoor environments: results from a real MANET testbed

A mobile ad hoc networks (MANETs) is a collection of wireless mobile terminals, which create a temporary network without relying on a fixed infrastructure. MANETs are attracting attention for their potential use in several fields such as collaborative computing and communications in small areas. Considering mobility of the terminals, routing is a key process for operation of MANETs. In this paper, we analyse the performance of optimised link state routing (OLSR) and better approach to mobile ad hoc networking (BATMAN) protocols, in an indoor horizontal topology for three different scenarios. We also analyse the performance of OLSR protocol in an indoor vertical topology for two scenarios. We compare the results for horizontal and vertical topology considering OLSR protocol. From our experiments, we found that the mobility and node distance affect more the throughput and packetloss in the vertical topology.

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.

Application of a MANET Testbed for horizontal and vertical scenarios: performance evaluation using delay and jitter metrics

Mobile ad hoc networks are attracting attention for their potential use in several fields such as collaborative computing and communications in indoor areas. Mobility and the absence of any fixed infrastructure make MANETs very attractive for mobility and rescue operations and time-critical applications. Considering mobility of the terminals, routing is a key process for operation of MANETs. In this paper, we analyze the performance of Optimized Link State Routing protocol in an indoor environment considering different scenarios for horizontal and vertical topologies. We evaluate the scenarios based on delay and jitter metrics. The experimental results show that for vertical topology the performance is affected more by mobility and number of hops, in comparison with the horizontal topology.

A simulation system for WMN based on SA: performance evaluation for different instances and starting temperature values

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.

MANET performance for source and destination moving scenarios considering OLSR and AODV protocols

Recently, a great interest is shown in MANETs potential usage and applications in several fields such as military activities, rescue operations and time-critical applications. In this work, we implement and analyse a MANET testbed considering AODV and OLSR protocols for wireless multi-hop networking. We investigate the effect of mobility and topology changing in MANET and evaluate the performance of the network through experiments in a real environment. The performance assessment of our testbed is done considering throughput, number of dropped packets and delay. We designed four scenarios: Static, Source Moving, Destination Moving and Source-Destination Moving. From our experimental results, we concluded that when the communicating nodes are moving and the routes change quickly, OLSR (as a proactive protocol) performs better than AODV, which is a reactive protocol.

P2P Solutions to Efficient Mobile Peer Collaboration in MANETs

P2P systems have shown useful to many types of distributed systems due to their features of efficient direct communication among peers. Although initially motivated by the need for efficient file sharing among large amount of peers, P2P techniques have found wide applicability to many domains within large scale distributed systems such as solving complex problems from science and engineering, data storage, etc. During the last years, P2P techniques have found their applicability to mobile computing, vehicular networking, MANETs, etc. In this paper we survey some P2P solutions to efficient management in MANETs. By using P2P techniques, MANETs can efficiently support collaboration among mobile peers as well as efficient data exchange.

Two Fuzzy-Based Systems for Selection of Actor Nodes inWireless Sensor and Actor Networks: A Comparison Study Considering Security Parameter Effect

A group of wireless devices with the ability to sense physical events (sensors) or/and to perform relatively complicated actions (actors), is referred to as Wireless Sensor and Actor Network (WSAN). In WSANs, sensors gather information about the physical events, while actors perform appropriate actions upon the environment, based on the sensed data shared by sensors. In order to provide effective sensing and acting, a distributed local coordination mechanism is necessary among sensors and actors. In this work, we propose and implement two Fuzzy Based Actor Selection Systems (FBASS): FBASS1 and FBASS2. We focus on actor selection problem and implement two fuzzy-based system. The systems decide whether the actor will be selected for the required job or not, based on data supplied by sensors and actual actor condition. We use three input parameters for FBASS1: Type of Required Action (TRA), Distance to Event (DE) and Remaining Power (RP). In FBASS2, we add the Security (SC) parameter as additional parameter. The output parameter for both systems is Actor Selection Decision (ASD). The simulation results show that the proposed systems decide the actor selection in order to have short delays, low energy consumption and proper task assignment. Comparing FBASS1 with FBASS2, the FBASS2 is more complex than FBASS1, because it has more rules in FRB. However, FBASS2 is able to decide secure actor nodes, which makes the system more secure.