What Is NS-2 ( Network Simulator Version 2?

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

Proposed algorithm consider three types of nodes every type have different initial energy level. normal nodes have E_0 energy. m advanced nodes have a times energy more than normal nodes with E_0 (1+a) energy level. m_0 super nodes have b times energy more than normal nodes with E_0 (1+b) energy level, where a and b are energy factors. As N is the number of total nodes in network, then for number of normal nodes, advanced nodes and super nodes N(1-m) , Nm〖(1-m〗_0) and Nmm_0 in the network, respectively.

3.2.18 MST-PSO: Minimum Spanning Tree-PSO Authors proposed a base spreading over tree-PSO based clustering algorithm of the weighted chart of the WSNs. The optimized route between the nodes and its cluster heads is looked from the whole ideal tree on the premise of energy consumption.

Kułakowski, P., Calle, E., & Marzo, J. L. (2013). Performance study of wireless sensor and actuator networks in forest fire scenarios. International journal of communication systems, 26(4), 515-529.

In wireless two popular multicast schemes: shortest past multicast and core based tree. The shortest path multicast tree always select the shortest path from every source to every destination and source node need to build a root tree as itself. Hence, in core based multicast tree, shortest path from the source node to the destination node cannot be guaranteed, but only one tree would be needed to connect the set of the source nodes to a set of the receiver nodes. And many MANET has limited energy resources (battery), and each node operates in unattended manner. So energy efficient is an import design consideration for these networks. So we proposed energy efficient paper using multicast routing protocol according to distance from source to destination in a network.

The approach of dividing the networks into small controllable units is called as clustering. The clustering technique advances the scalability of network through ease of implementation and results energy efficient routing within the sensor networks. The clustering approach has some other advantages also like conserving communication bandwidth, avoiding redundant message transfer, localizing energy efficient route setup etc. LEACH, HEED, DECA, etc. are the energy efficient routing protocols based on clustering technique.

Abstract -- The efficiency of sensor networks depends on the coverage of the target area. Although, in general, a sufficient number of sensors are used to ensure a certain degree of redundancy in coverage, a good sensor deployment method is still necessary to balance the workload of sensors in target area. In a sensor network sensors can move around to self-deploy. The deployment deals with moving sensors from an initial unbalanced state to balanced state. Therefore, several optimization problems can be defined to minimize different parameters such as total moving distance, number of moves, communication cost. There is a unique problem called communication holes in sensor networks, areas not covered by any node.

M. Younis, et al [13] in this proposal, exhibited an approach for vitality mindful and setting mindful routing protocol of data. The researchers for the most part centered around the modification of topology and the routing component. Data is routed through numerous hops in order to preserve transmission energy.

Routing in WSN is different form the routing in the fixed networks. Routing protocols proposed for WSNs are divided into seven categories. They are given in Table.1. The routing protocols in the table are explained well by Shio Kumar Singh, M P Singh in [37]. Many routing algorithms were developed for wireless networks. These are categorized into seven parts and are explained in provided in the reference list.

The nodes can communicate inside of the system at whatever time. Along these lines the connection can be set up between each nodes to different nodes in the system. VANET goes under infrastructure-aided system. A system utilizing the infrastructure point interfaces the vehicles on the road. Those points are Roadside Units. They are same like the Access point in a PC system, which acts a state of communication between the system and the vehicles. Vehicular ad hoc networks consist of a number of nodes to associate between them and the mobility of the nodes are well maintained. Vehicular ad hoc systems are utilized in Intelligent Transport Systems (ITS). This framework utilizes GPS for following the accurate position

Abstract—In wireless sensor network (WSN), many novel architectures, protocols, algorithms and applications have been proposed and implemented for energy efficiency. The efficiency of these networks is highly dependent on routing protocols which directly affecting the network life-time. Cluster formation in sensor network is one of the most popular technique for reducing the energy consumption and expand the lifetime of the sensor network. There are various cluster formation techniques used in wireless sensor network. In which, Particle Swarm Optimization (PSO) is simple and efficient optimization algorithm, which is used to form the energy efficient clusters with optimal selection of cluster head. The comparison is made with the well-known cluster based protocols developed for WSN, LEACH (Low Energy Adaptive Clustering Hierarchy) and LEACH-C as well as the traditional K-means clustering algorithm. A comparative analysis shown in the paper and come to the conclusion based on some parameters.

Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networks or cellular networks. Due to the relatively large number of sensor nodes, it is not possible to build a global addressing scheme for the deployment of a large number of sensor nodes as the overhead of ID maintenance is high. Thus they require careful resource management. This paper describes various routing protocols and their comparison and working of LEACH protocol and enhanced LEACH protocol.

A Wireless Sensor Network can be composed of large number of tiny of sensor nodes spread in a wide area and communicating with each other either directly or through routing mechanisms to the other nodes. One or more of the nodes are the base station with uninterrupted battery source than the other nodes. Since the devices in WSN are often tiny devices with small form factor the computational power of these devices is usually small because there will not support large amount of hardware. Furthermore as the devices are wireless they need to obtain their energy from an inbuilt battery which in the end needs to be recharged or replaced. If the battery of a device is depleted it needs an immediate substitution to function further .

First, the heads of clusters are identified locally according to the predetermined probability rather than voting. Second, the transmission load and the duration of the clustering are reduced as long as the connectivity can be achieved. Thus, the retransmissions and ACKs are eliminated. Moreover, the proposed model is lightweight and completely distributed. The Performance results reveals that the ICP significantly outperforms the existing clustering methods in terms of degradation the consumption of time and energy. However, considering the cluster topology, the Cluster Head (CH) works as an agent between the Gateway (GW) and the Cluster Member (CM), creating a bottleneck between them and lead to what is known as the "energy hole" problem, which drains energy strongly.

Energy efficient routing algorithm can be categorized as follows: data centric routing algorithm, location based routing algorithm and hierarchical routing algorithm . Data centric routing algorithm uses meta data to find the route from source to destination before any actual data transmission to eliminate redundant data transmission Location based routing algorithm requires actual location information for every sensor node. Hierarchical routing algorithm divides the network into clusters. Cluster head (CH) is elected in