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.

Abstract— the data aggregation is mostly used energy efficient mechanism in Wireless Sensor Networks (WSN). Preserving data security is a challenging problem in wireless sensor networks. Because of the resource characteristic, security & privacy issues there in assume critical investigation. Many aspects of investigation, one has been the design of a secure clustering protocol in which a sensed data or information to be delivered to an appropriate receiver securely and efficiently with least amount of energy consumption. Different methods are used to solve problem of security. We shows that different technique and method in this paper.

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.

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

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,

Wireless Sensor networks are defined as the distribution of the sensors in the irregular manner. It is a heterogeneous system. The range of sensors used in the network may be from few hundreds to thousands. These sensors will have limited resources like power, storage, communication and processing capability.

LEACH-B: Authors proposed decentralized algorithms of cluster formation in which sensor node just thinks about possess position and position of definite beneficiary and not the position of all sensor nodes. Filter B works in following stages: Cluster head selection algorithm, Cluster development and data transmission with numerous gets to. Every sensor node picks its CH by assessing the vitality scattered in the way between conclusive recipient and itself. It gives preferred energy efficiency over LEACH.

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

Cluster based Wireless Sensor Network (CWSN) has been researched in order to minimize the network consumption for transmitting data and increasing the wireless devices lifetime by maximizing the battery lifetime of the device. In CWSN the nodes are arranged in a cluster, based on algorithms

Wireless sensor networks (WSNs) are presented their abilities in many vital applications such as wildlife tracking, checking heart rates of human, military applications, traffic monitoring, etc, [1]. Wireless sensors have limited resources, including limited storage, limited processing facility, and communication capability. In addition, each sensor node is powered by a battery, which has a finite size and cannot be recharged or replaced due to environmental conditions [2-5]. Actually, Sensor nodes depend on their finite resources to survive. Due to these reasons, it is important to enhance the energy efficiency of nodes to improve the quality of the application service REF. The first problem of WSNs is to minimize energy consumption in

Single-hop or multi-hop protocols are used to further transmit collected data to one or more base stations or sink [9]. An enormous amount of structured and unstructured data known as big data is generated rapidly that requires a flexible and reliable storage infrastructure [10]. Sensor nodes transfer the obtained useful information from a defined network either directly or via a chain of CHs to the BS [11]. In designing a routing protocol for WSN the main concern is the energy efficiency [12]. Thus, energy depletion of one node may vary from other, i.e., nodes near the BS or sink have more energy depletion than the other nodes. This results in the creation of energy holes near the sink [13].