A survey on Routing Protocols in Wireless Sensor Networks

In ad-hoc WSN is a collection of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are changing on a continual basis. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to end communication. Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop nor neither direct reach ability is possible in case of WSNs. In order to facilitate communication within the network, a routing protocol is used. In this paper we have carried out an extensive survey on WSN protocols based on structure of network, routing protocol of network & clustering techniques of routing protocols

A survey on Routing Protocols in Wireless Sensor Networks

In ad-hoc WSN is a collection of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are changing on a continual basis. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to end communication.  Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop nor neither direct reach ability is possible in case of WSNs. In order to facilitate communication within the network, a routing protocol is used. In this paper we have carried out an extensive survey on WSN protocols based on structure of network, routing protocol of network & clustering techniques of routing protocols

Energy Efficiency in Two-Tiered Wireless Sensor Networks

We study a two-tiered wireless sensor network (WSN) consisting of $N$ access points (APs) and $M$ base stations (BSs). The sensing data, which is distributed on the sensing field according to a density function $f$, is first transmitted to the APs and then forwarded to the BSs. Our goal is to find an optimal deployment of APs and BSs to minimize the average weighted total, or Lagrangian, of sensor and AP powers. For $M=1$, we show that the optimal deployment of APs is simply a linear transformation of the optimal $N$-level quantizer for density $f$, and the sole BS should be located at the geometric centroid of the sensing field. Also, for a one-dimensional network and uniform $f$, we determine the optimal deployment of APs and BSs for any $N$ and $M$. Moreover, to numerically optimize node deployment for general scenarios, we propose one- and two-tiered Lloyd algorithms and analyze their convergence properties. Simulation results show that, when compared to random deployment, our algorithms can save up to 79\% of the power on average.Comment: 11 pages, 7 figure

Energy Efficient Clustered Routing Strategy For WSN

Wireless sensor network alludes in the route of a group of spatially dedicated sensors for screening, accumulating the normal information in distant zones and sending the gathered knowledge to a central region. In past a few methodologies that cut back the vitality utilization by actualizing efficient steering conventions had been presented. Every sensor hub detects learning and transmits it to its bunch head. Bunch head mix information from its group and transmit the gathered learning to the base station. A few vitality sparing gradable directing conventions are upheld inside the past like LEACH, HEED, PEGASIS, and TBC. TBC (Tree-based for the most part Clustering) convention is another change over HEED convention that executes intra-bunch correspondence to downsize vitality utilization. each bunch head go about as the root hub of the tree and every sensor hub transmit information to close hub that lies on the on account of the root hub. This convention circulates the vitality stack over all part hubs and thusly adjusts the general vitality utilization of the system. To draw out the system life, this work executes another tree-based bunch steering technique called Tree-Based Energy Efficient Clustering Protocol (TBEEC) (TBEEC). Amid this work, the hub having the lesser separation to the base station and preferable vitality over the contrary hubs of the bunch is hoisted as the group set out toward aspherical. All hubs of group forward their insight to the bunch head by exploitation elective halfway hubs that lie on the on account of the bunch head. Further, amid this work between bunch correspondence is authorized to downsize the vitality utilization. Each group head as opposed to sending blend information on to the base station appearance for halfway bunch head that untruths nearly the base station. This form information must go at the lesser separation that finishes in vitality sparing that delays the system life. The arranged convention beats the confinement of existing TBC convention. The reproduction comes about demonstrate that the arranged convention performs higher than the predominant directing conventions like LEACH, HEED, PEGASIS, and TBC

Energy Efficient Weighted Clustering Algorithm in Wireless Sensor Networks

With the advancement in communication and internet technologies, recently there have been many research efforts in the area of Wireless Sensor Networks (WSNs) to conserve energy. Clustering mechanisms have been applied to WSNs to enhance the network performance while reducing the necessary energy consumption. The goal of Weighted Clustering Algorithm (WCA) is to determine the cluster heads dynamically based on a combined weight metric that includes one or more parameters such as node degree, distances with respect to a nodes neighbors, node speed and the time spent as a cluster head. In this work, we have proposed a refined and improved version of WCA known as Energy Efficient Weighted Clustering Algorithm (EEWCA) to prolong the network lifetime by reducing energy consumption. EEWCA is designed and simulated with additional constraint on energy for the selection of cluster heads. Both the WCA and EEWCA schemes have been simulated using MATLAB. The proposed EEWCA behaves better than WCA for longer system lifetime. The proposed work is simulated and performance is tested for number of clusters and average execution time. Simulation results show that the EEWCA outperforms WCA in terms of both the number of clusters formed and the execution time

Mobility based energy efficient and multi-sink algorithms for consumer home networks

With the fast development of the Internet, wireless communications and semiconductor devices, home networking has received significant attention. Consumer products can collect and transmit various types of data in the home environment. Typical consumer sensors are often equipped with tiny, irreplaceable batteries and it therefore of the utmost importance to design energy efficient algorithms to prolong the home network lifetime and reduce devices going to landfill. Sink mobility is an important technique to improve home network performance including energy consumption, lifetime and end-to-end delay. Also, it can largely mitigate the hot spots near the sink node. The selection of optimal moving trajectory for sink node(s) is an NP-hard problem jointly optimizing routing algorithms with the mobile sink moving strategy is a significant and challenging research issue. The influence of multiple static sink nodes on energy consumption under different scale networks is first studied and an Energy-efficient Multi-sink Clustering Algorithm (EMCA) is proposed and tested. Then, the influence of mobile sink velocity, position and number on network performance is studied and a Mobile-sink based Energy-efficient Clustering Algorithm (MECA) is proposed. Simulation results validate the performance of the proposed two algorithms which can be deployed in a consumer home network environment

Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks

With the fast development of wireless communications, ZigBee and semiconductor devices, home automation networks have recently become very popular. Since typical consumer products deployed in home automation networks are often powered by tiny and limited batteries, one of the most challenging research issues is concerning energy reduction and the balancing of energy consumption across the network in order to prolong the home network lifetime for consumer devices. The introduction of clustering and sink mobility techniques into home automation networks have been shown to be an efficient way to improve the network performance and have received significant research attention. Taking inspiration from nature, this paper proposes an Ant Colony Optimization (ACO) based clustering algorithm specifically with mobile sink support for home automation networks. In this work, the network is divided into several clusters and cluster heads are selected within each cluster. Then, a mobile sink communicates with each cluster head to collect data directly through short range communications. The ACO algorithm has been utilized in this work in order to find the optimal mobility trajectory for the mobile sink. Extensive simulation results from this research show that the proposed algorithm significantly improves home network performance when using mobile sinks in terms of energy consumption and network lifetime as compared to other routing algorithms currently deployed for home automation networks

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

An improved modified LEACH-C algorithm for energy efficient routing in Wireless Sensor Networks

Wireless Sensor Networks (WSN) is mainly characterized by its limited power supply. Hence the need for Energy efficient infrastructure is becoming increasingly more important since it impact in network lifetime. Here the focus of this paper on Hierarchy clustering because multi-hope short range communication between wireless sensor nodes is energy efficient compared to Single-hope long range communication. In Hierarchy clustering, there are many Protocols but this paper talk about the well-known Low-Energy Adaptive Clustering Hierarchy (LEACH)[1].Centralized Low-Energy Adaptive Clustering Hierarchy (LEACH-C) and Advanced Low-Energy Adaptive Clustering Hierarchy(ALEACH) are energy efficient clustering routing protocol and they are belonging to hierarchy routing. In this paper we proposed Modified LEACH-C to upgrade the execution of existing Leach-C in such sort of Topology where Leach-C not performs so well. By Applying Method of Distance calculation between CH (cluster-head) to Member node and BS (base-station) to Member node. Making non-overlapping cluster using assigning proper ID while creating clusters. This makes the routing protocol more energy effective and delays life-time of a wireless sensor network. Simulation results demonstrate that Modified LEACH-C enhances network life-time contrasted with LEACH-C algorithm

A Distance-Based Energy Aware Routing Algorithm for Wireless Sensor Networks

Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms