What Is The Algorithm For Multi-Networking Clustering Algorithm

In the location-based routing, sensor nodes are distributed randomly in an interesting area. They are positioned mostly by utilizing of Global position system. The distance among the sensor nodes is evaluated by the signal strength obtained from those nodes and coordinates are computed by interchanging information among neighbouring nodes. Location-based routing networks are;

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 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.

The purpose of the CDSWS scheme introduced in [52], is to extend the life of the network while ensuring network coverage. This proposal divides the sensor nodes into clusters based on the sensitivity of the coverage metrics and allows more than one node in each cluster to maintain activity simultaneously through the dynamic node selection mechanism. The dynamic rejection scheme was also presented to overcome the failure problem during cluster combining process, which has not been studied in depth before. The simulation results show that CDSWS outperforms some of the other algorithms in terms of coverage assurance, algorithm efficiency and energy saving. However, this concept assumes that some resource-rich nodes are available and need to be synchronized, which means maintenance costs. In addition to the burdens caused by re-clustering and re - registration making the distributed directories concept less suitable for dynamic IP-enabled LLNs.

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:

LEACH-E [11] protocol would improve the CH selection process compared to LEACH protocol. As LEACH protocol; this improved version is divided into different rounds. All the sensor nodes would have the same probability to be CH of the cluster in the first round. After the first round of transmission the residual energy of each node would get different, The selection of a node as CH is based on residual energy which means the one which has the highest residual energy would be chosen as CH of the cluster and other nodes with less energy will represent the members of the cluster.

Power efficiency is the first factor that directly affects the performance of the nodes and hence of the overall sensor network. For better and desired performance, the nodes of a WSN must be efficient in terms of power which in simple words means that the duty cycle of the nodes must be made small [5]. The design considerations must take into account the sleeping mode of the nodes when there is no activity thereby reducing power consumption and contributing to performance enhancement. However, the sleep mode of nodes has the main disadvantage that if any of the nodes remains in the sleep mode for a significant chunk of time, it is likely that communication with neighbors nodes may come to a halt. Also, a reduced duty cycle for the network nodes leads to threatening the network reliability. The data as well as the control packets that maintain the routing and communication among the nodes of the sensor network will also have a delayed reception.

heterogeneous scheme in which all sensor nodes have a different amount of energy as each node is assigned with various task [20] such as SEP[21], DEEC[22]. In this paper, we propose and analyze a novel cluster head selection scheme based on the deployment of nodes in different regions for heterogeneous wireless sensor networks (HWSNs) which is named as RBETSSEP.

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 :- 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

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.

More precisely, as it is explained later on, the choice of the cluster heads in EEHCBF protocol is based on the residual energy as well as the maximum number of neighbors of the nodes. That is to say, the member of each cluster having the highest residual energy and maximum no of neibhbors is the one selected as the cluster head. The cluster heads which are close enough to the base station have the ability to communicate directly with the base station with reasonable power consumption. These cluster heads are considered to be the highest level cluster heads. Similarly, cluster heads which are located far away from the base station are considered to be lower level cluster heads.

The cluster head election mechanism victimization mathematical logic (CHEF) protocol [9] uses a mathematical logic approach to prolong the network lifespan of WSNs. It’s the same as the Gupta fuzzy protocol [8] however it doesn’t want the bottom station to gather info from all sensing element nodes. The operation in cook protocol is part into rounds, in each circular, each node picks an irregular range in the vicinity of zero and one. On the off chance that the arbitrary range is a littler sum than the predefined limit, at that point that node turns into a tentative CH.