A Number Of Studies And Researches Showing The Improvement Within The Protocol Of Wireless Sensor Networks

Geographic Adaptive Fidelity (GAF): Geographic Adaptive Fidelity is an energy-aware location based routing algorithm planned for mobile ad-hoc networks but has been used to WSNs. Geographic Adaptive Fidelity conserving energy by switching off redundant sensors nodes. In this routing protocol, the entire network is classified into number of static zones and a virtual grid is made for the covered region. Every node utilizes its GPS-indicated location to link itself with a point in the virtual grid. Nodes linked to the same point on the grid are assumed equivalent with respect to packet routing costs. Nodes within a zone cooperate by choosing one node to show the zone for a period of time whereas the rest of the nodes sleep. A sample situation is considered from

maximization of network lifetime [8]. This protocol is also divided into two phase: 1. Clustering and 2. Routing of aggregated data. In clustering phase, a fixed topological arrangement is done by sensor nodes. In the data aggregation phase, heuristic is proposed. The advantage is that it provides energy efficiency and network lifetime also be increased.

In this section, we present the details of proposed protocol. Our protocol implements the idea of probabilities for cluster heads selection based on initial energy and residual energy of sensor nodes as well as the average energy of the sensor network.

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

A WSN is a type of wireless networks that consists of collection sensor nodes which are tiny devices. Each sensor node of the network has different processing capability. It may contain multiple types of memory (program, data and flash memories), have a RF transceiver, have a power source (e.g., batteries and solar cells), and accommodate various sensors and actuators. The nodes communicate wirelessly and often self-organize after being deployed in an ad hoc fashion [13, 14]. Optimum need of each sensor node is to maximize its own utility function. Also the whole network requires resource assignments balance to perform in a useful and efficient way. This chapter presents a brief survey on WSNs showing its types, characterizing features, protocols and applications.

HEBM (Hierarchical Energy-Balancing Multipath routing protocol for Wireless Sensor Networks)[70],introduce a novel hierarchical approach. It is proposed to degrading the general network energy consumption and balancing the energy clearing away among the sensor nodes, consequently, prolong the lifetime of the network. In order to achieve these two valuable approaches, the cluster-heads are carefully designed and distributed appropriately over the area of interest which. Moreover, nodes radio is turned off periodically according to sleeping control rules,

LEACH-F could conceivably be given energy sparing and this protocol does not give the flexibility to sensor nodes mobility or sensor nodes being expelled or included from the sensor networks.

Several energy-aware routing protocols have been proposed in literature for heterogeneous WSNs. In \cite{Georgios2004}, the authors proposed SEP, a Stable Election Protocol, that improves homogenous LEACH protocol \cite{Heinzelman2000} by considering two levels of heterogeneity: normal nodes and advanced nodes, where the later are equipped with an extra amount of energy. The cluster head is selected based on a weighted probability according to the node initial energy in such a way that the nodes having a higher initial energy become cluster heads more times than the other nodes. The election probabilities for the normal and advanced nodes are given as follows:

Abstract :- Due to recent improvement technologies in wireless communication ,there has been a fastest growth in wireless sensor networks technologies during the past few years. Many different architectures as well as algorithms and applications have been determined and implemented. The efficiency of these wireless sensor networks is as much as dependent on routing protocol directly affecting the network life and in wireless sensor network every sensor has a limited transmission range of every sensor node to obtain the sensing data. Due to this limitation of wireless sensor network Clustering of node is most popular techniques preferred in routing operations. In this paper, cluster based energy efficient clustering technique based on artificial bee colony algorithm and genetic algorithm is presented to increase the network lifetime. The name of artificial bee colony algorithm is come from bees cause It has been inspired by collective behavior of Bees as seeking food. To minimize the energy consumption it is significant to plan a data collection path with the minimum length to complete the data collection work. So in this paper, we determine that this problem which can be solve as traveling salesman problem, it 's also called as

Authors in [58], introduced an algorithm that exploit the sensor redundancy in the same zone by dividing the network into clusters thus the maintaining of the backbone connectivity can be done by retaining an important set of working nodes and close the redundant ones. Regarding the communication RTCP denotes equivalent nodes based on the connectivity information of one-hop neighbors which causes in reducing the communication overhead and then the scheduling of the nodes is done based on that equivalence. RTCP allows only to the elected node to be active in each cluster. The simulation results reveal that the proposed algorithm outperforms some other existing algorithms in terms of power consumptions and

Abstract: Wireless Sensor Network is a collection of homogeneous/heterogeneous wireless devices used to monitor the changes in the surrounding of the wireless device. Each wireless device present in the network has the capability of sensing the changes in the surrounding environment. Homogeneous sensors are those which have same computational power, energy etc. Each node is battery powered which is used to transmit the sensed data over the network. So efficient transmission of data in Wireless Sensor Network is important and to transmit the data unaltered over the network to the receiver security is important

Wireless Sensor Network is a new technology consists of related distributed sensors to monitor physical or environmental condition. A basic wireless sensor network is shown in fig 1.1. A wireless sensor network (WSN) has many small sensor nodes deployed in large numbers to sense the physical world. WSN have many applications such as military and civilian usage.

Keywords—wireless sensor network, distributed wireless sensor network, hierarchical wireless sensor network, key distribution, key pre-distribution, pair-wise keys, group-wise key, network keying.

This algorithms segment the all nodes into clusters of unequal size, and clusters closer to the sink have littler sizes than those more wireless far from the sink. Therefore CHs nearer to the sink can preserved some vitality for the inter cluster data sending. Vitality devoured by cluster heads per round in EEUC much lower than that of LEACH standard yet like HEED protocol.

2 Clustering is an important method for increase the scalability and lifetime of wireless sensor network system. The sensor network is divided into clusters.