Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the Random Waypoint model (RWP), Random Direction model (RD), Nomadic Community model (NC), and the Reference Point Group Model (RPGM) with a low as well as high random range mobility of the nodes. Moreover, BonnMotion Software and Network simulator NS-3 used to implement the simulation scenarios. Further, the performance of the OLSR protocol analyzed and evaluated based on latency, routing overhead, and packet loss ratio metrics. According to the results, the OLSR protocol provides the best performance over the RWP model in a low mobility environment, whereas the Nomadic mobility model is suitable for OLSR protocol in a high mobility environment.
I n this paper ,we 'viii consider the density questions associC;lted with the single hidden layer feed forward model. We proved that a FFNN with one hidden layer can uniformly approximate any continuous function in C(k)(where k is a compact set in R11 ) to any required accuracy.
However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function non-dense, then we need more hidden layers. Also, we have shown that there exist localized functions and that there is no t
... Show MoreThe issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r
... Show MoreDensely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si
... Show More