CHAPTER 2
LITERATURE SURVEY
This chapter presents the technological background for the proposed system, working of routing protocol in wireless sensor network, brief regarding all Existing systems.
2.1 Routing Protocols in Wireless Sensor Network [1]
Due to the difference of wireless sensor networks from different up to date communication. And wireless ad hoc networks routing could be very difficult task in WSNs. For the deployed sheer number of sensor nodes it is impractical to build a global scheme for them IP-based protocols cannot be applied to these networks [1]. All applications of sensor networks have the requirement of sending the sensed data from multiple points to a common destination called sink. Resource management is required in sensor nodes regarding transmission power, storage, on board energy and processing capability.
There are numerous routing protocols that have been proposed for routing data in wireless sensor networks due to such issues. The proposed mechanisms of routing consider the architecture and applications requirements along with the characteristics of sensor nodes. There are few distinct routing protocols that are based on quality of service awareness or network flow whereas all other routing protocols can be classified as hierarchical or location based and data centric.
The routing protocols which are centric are based on query and depend on naming of desired data due to which redundant transmission are eliminated. The clustering of nodes in
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
The Hierarchical Power Aware Routing (HPAR) is a power aware routing protocol that divides the network into a group of sensors called zones [12]. In this, the cluster zones are formatted, then the decision is made that how message is routed so the battery life can be maximized. This protocol provides an approximation algorithm called max-min ZPmin algorithm. In this algorithm by applying Dijkshtra algorithm the path who consumes less power is found. Then the second path is found that maximizes the minimal residual power. The advantage is that it provides both transmission power and maximizes battery
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
routing. In this chapter, we introduce some popular routing protocols in each of the three
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.
Fundamental sorts of ad hoc routing algorithms can be single-hop and multihop, based on distinct hyperlink layer attributes and routing protocols. single-hop MANET is less difficult than multihop in phrases of structure and implementation, with the lesser price of functionality and applicability. whilst turning in records packets from a source to its destination out of the direct wireless transmission variety, the packets have to be forwarded thru one or extra intermediate nodes.
A Wireless Sensor Network usually is formed by numerous wireless sensor devices. Routing is an important mechanism which will help the data to get forwarded to the right destination. Internet Protocol is an important protocol which helps in routing process. Generally the nodes in a Wireless Sensor Network are integrated and routing using IP version 4 is difficult as the address space is limited. IP version 4 uses 32 bit addressing mechanism which is not sufficient to complete the routing process. The other option is the use of Internet Protocol version 6.
The B-MAC is proposed to meet these goals, a configurable MAC protocol for WSNs. It is simple in both for implementation and design. MAC protocol support a wide variety of sensor network workloads by factoring out some functionality and exposing control to higher services. In contrast to the classic monolithic MAC protocol this minimalist model of MAC protocol is designed [1].
S. Yi, et al [7] in this thesis, proposed PEGASIS (Power- efficient gathering in sensor data networks), a greedy protocol for expanding the network lifetime of the WSNs. Clustering protocols enable sensor nodes to lessen data packets by data aggregation on WSN.
Wireless sensor network consist of a large number of sensor node with limited resource of energy, transmission power, network power, network bandwidth, and computation power. Each sensor node is able to perform some processing and sensing task independently. Each sensor node is able to communicate with each others to forward the sensing information. Sensor network can be consist of three subsystem namely sensor
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.
In many application areas, the wireless sensor network must be able to operate for long periods of time, and the energy consumption of both individual sensor nodes and the sensor network as a whole is most important. Thus energy consumption is an important issue for wireless sensor networks. Figure 1 shows the architecture of wireless sensor network. It consists of one sink node (or base station) and a (large) number of sensor nodes deployed over a
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
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].