Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs

Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

Proposed energy efficient clustering and routing for wireless sensor network

Wireless sensor network (WSN) is considered a growing research field that includes numerous sensor nodes used to gather, process, and broadcast information. Energy efficiency is considered one of the challenging tasks in the WSN. The clustering and routing are considered capable approaches to solve the issues of energy efficiency and enhance the network’s lifetime. In this research, the multi-objective-energy based black widow optimization algorithm (M-EBWOA) is proposed to perform the cluster-based routing over the WSN. The M-EBWOA-based optimal cluster head discovery is used to assure an energy-aware routing over the WSN. The main goal of this M-EBWOA is to minimize the energy consumed by the nodes while improving the data delivery of the WSN. The performance of the M-EBWOA is analyzed as alive and dead nodes, dissipated energy, packets sent to base station, and life expectancy. The existing research such as low-energy adaptive clustering hierarchy (LEACH), hybrid grey wolf optimizer-based sunflower optimization (HGWSFO), genetic algorithm-particle swarm optimization (GA-PSO), and energy-centric multi-objective Salp Swarm algorithm (ECMOSSA) are used to evaluate the efficiency of M-EBWOA. The alive nodes of the M-EBWOA are 100 for 2,500 rounds, which is higher than the LEACH, HGWSFO, GA-PSO, and ECMOSSA

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Genetic Algorithm based Cluster Head Selection for Optimimized Communication in Wireless Sensor Network

Wireless Sensor Network (WSNs) utilizes conveyed gadgets sensors for observing physical or natural conditions. It has been given to the steering conventions which may contrast contingent upon the application and system design. Vitality administration in WSN is of incomparable significance for the remotely sent vitality sensor hubs. The hubs can be obliged in the little gatherings called the Clusters. Clustering is done to accomplish the vitality effectiveness and the versatility of the system. Development of the group likewise includes the doling out the part to the hub based on their borders. In this paper, a novel strategy for cluster head selection based on Genetic Algorithm (GA) has been proposed. Every person in the GA populace speaks to a conceivable answer for the issue. Discovering people who are the best proposals to the enhancement issue and join these people into new people is a critical phase of the transformative procedure. The Cluster Head (CH) is picked using the proposed technique Genetic Algorithm based Cluster Head (GACH). The performance of the proposed system GACH has been compared with Particle Swarm Optimization Cluster Head (PSOCH). Simulations have been conducted with 14 wireless sensor nodes scattered around 8 kilometers. Results proves that GACH outperforms than PSOCH in terms of throughput, packet delivery ratio and energy efficiency

Genetical Swarm Optimization of Multihop Routes in Wireless Sensor Networks

In recent years, wireless sensor networks have been attracting considerable research attention for a wide range of applications, but they still present significant network communication challenges, involving essentially the use of large numbers of resource-constrained nodes operating unattended and exposed to potential local failures. In order to maximize the network lifespan, in this paper, genetical swarm optimization (GSO) is applied, a class of hybrid evolutionary techniques developed in order to exploit in the most effective way the uniqueness and peculiarities of two classical optimization approaches; particle swarm optimization (PSO) and genetic algorithms (GA). This procedure is here implemented to optimize the communication energy consumption in a wireless network by selecting the optimal multihop routing schemes, with a suitable hybridization of different routing criteria, confirming itself as a flexible and useful tool for engineering applications

Implementation and evaluation of a simulation system based on particle swarm optimisation for node placement problem in wireless mesh networks

With the fast development of wireless technologies, wireless mesh networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless internet connectivity. This paper implements a simulation system based on particle swarm optimisation (PSO) in order to solve the problem of mesh router placement in WMNs. Four replacement methods of mesh routers are considered: constriction method (CM), random inertia weight method (RIWM), linearly decreasing Vmax method (LDVM) and linearly decreasing inertia weight method (LDIWM). Simulation results are provided, showing that the CM converges very fast, but has the worst performance among the methods. The considered performance metrics are the size of giant component (SGC) and the number of covered mesh clients (NCMC). The RIWM converges fast and the performance is good. The LDIWM is a combination of RIWM and LDVM. The LDVM converges after 170 number of phases but has a good performance.Peer ReviewedPostprint (author's final draft