A Survey on Classification of Routing Protocols in Wireless Sensor Networks

Late progressions in remote innovation has prompted gigantic development in organization of Wireless Sensor Networks (WSNs). WSNs are involved sensors and actuators hubs, thickly conveyed over some geographic area to detect, gather, handle and send information remotely to focal information authority. The correspondence among various remote sensor hubs is controlled by directing conventions; consequently the execution of WSN exceedingly relies on upon embraced steering strategy. Numerous such vitality proficient and quality steering conventions have been outlined throughout the years so as to build the execution of correspondence in WSNs. In this paper, a comprehensive survey and scientific classification of steering conventions is talked about on the premise of system structures and information transmission procedures. This review will help WSN framework fashioners to choose fitting directing convention for specific application

DISTRIBUTED MULTI-HOP ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS

In a Wireless Sensor Network (WSN), routing is the process of finding a cost-effective route in terms of power consumption. As an evaluation criterion for the WSN performance, network lifetime is directly affected by the routing method. In a wide variety of WSNs, different techniques are used as routing methods, such as shortest distance path. In this paper, we propose a novel algorithm, optimizing power consumption in WSN nodes, based on the shortest path algorithm. In this approach, the energy level of nodes and their geographical distance from each other contribute to the weight of the connecting path. The proposed algorithm is used as a data dissemination method in WSNs with randomly scattered nodes. We also apply Dijkstra’s shortest path algorithm to the same networks. The results showed that the proposed algorithm increases the network lifetime up to 30 % by preventing nodes with low charge levels from early disconnection

Energy Proficient and Security Protocol for WSN: AODV

Wireless sensor network is extensively used technology now a day in real time application. It consists of a number of autonomous sensor nodes which are organized in various areas of interest to accumulate data and jointly convey that data back to a base station. But the sensor node has limited battery energy and it is also found that the WSN more vulnerable to severe kinds of security threats such as denial of service (DOS), Sybil, hello flood attack etc. In this, we proposed group communication using election algorithm to make the network most energy efficient and also make the network secure. The simulation of the proposed methodology is done between different network parameter such as PDR, end-to-end delay, throughput and energy consumption using the network simulator NS-2.34

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

Retransmission Reduction using Checkpoint based Sub-Path Routing for Wireless IoT

Wireless IoT has been one of the major breakthroughs of the current decade. It has improved the quality of life and has also aided in several improvements in domains like healthcare. Effective routing and energy conservation has been the major challenges in creating and maintaining a successful IoT network. This work presents a checkpoint based routing model, CSPR, to improve the transmission efficiency by reducing retransmission. This work selects checkpoints in the network prior to transmission. The checkpoints are used to build the final path. This process ensures that the routes created are dynamic and reactive, leading to improved security and increased path reliability. Comparison with existing routing model shows improved network lifetime and reduced selection overhead levels, exhibiting the high efficiency of CSPR

Multiprocessor System-on-Chips based Wireless Sensor Network Energy Optimization

Wireless Sensor Network (WSN) is an integrated part of the Internet-of-Things (IoT) used to monitor the physical or environmental conditions without human intervention. In WSN one of the major challenges is energy consumption reduction both at the sensor nodes and network levels. High energy consumption not only causes an increased carbon footprint but also limits the lifetime (LT) of the network. Network-on-Chip (NoC) based Multiprocessor System-on-Chips (MPSoCs) are becoming the de-facto computing platform for computationally extensive real-time applications in IoT due to their high performance and exceptional quality-of-service. In this thesis a task scheduling problem is investigated using MPSoCs architecture for tasks with precedence and deadline constraints in order to minimize the processing energy consumption while guaranteeing the timing constraints. Moreover, energy-aware nodes clustering is also performed to reduce the transmission energy consumption of the sensor nodes. Three distinct problems for energy optimization are investigated given as follows: First, a contention-aware energy-efficient static scheduling using NoC based heterogeneous MPSoC is performed for real-time tasks with an individual deadline and precedence constraints. An offline meta-heuristic based contention-aware energy-efficient task scheduling is developed that performs task ordering, mapping, and voltage assignment in an integrated manner. Compared to state-of-the-art scheduling our proposed algorithm significantly improves the energy-efficiency. Second, an energy-aware scheduling is investigated for a set of tasks with precedence constraints deploying Voltage Frequency Island (VFI) based heterogeneous NoC-MPSoCs. A novel population based algorithm called ARSH-FATI is developed that can dynamically switch between explorative and exploitative search modes at run-time. ARSH-FATI performance is superior to the existing task schedulers developed for homogeneous VFI-NoC-MPSoCs. Third, the transmission energy consumption of the sensor nodes in WSN is reduced by developing ARSH-FATI based Cluster Head Selection (ARSH-FATI-CHS) algorithm integrated with a heuristic called Novel Ranked Based Clustering (NRC). In cluster formation parameters such as residual energy, distance parameters, and workload on CHs are considered to improve LT of the network. The results prove that ARSH-FATI-CHS outperforms other state-of-the-art clustering algorithms in terms of LT.University of Derby, Derby, U