157
AN ANALYSIS ON RELATION BETWEEN ROUTING PROTOCOLS AND WIRELESSSENSOR NETWORK Rajesh Shah
Christian Eminent College, Indore
Abstract - This paper discusses the analysis and evaluation of routing protocols in wireless sensor network, routing protocol for wireless sensor network based on the topology structure can be divided into planar and hierarchical. WSN communication protocol stack can be divided into physical layer, data link layer, network layer, transports layer and application layer. Finally, this paper introduces the typical algorithm for planar and hierarchical routing protocols and experiment and Simulation of routing protocol for wireless sensor networks.
Many routing protocols on clustering structure have been proposed in recent years.
In recent advances, achieving the energy efficiency, lifetime, deployment of nodes, fault tolerance, latency, in short higher liability and robustness have become the main research goals of wireless sensor network. Many routing protocols on clustering structure have been proposed in recent years based on heterogeneity. In this paper, we analyse various energy efficient routing protocols to improve the lifetime of wireless sensor networks.
WSNs are composed of a large number of sensor nodes which have limited energy. Energy conservation is a very critical issue to design energy efficient routing techniques in wireless sensor networks. The paper reviews the traditional energy efficient protocols to improve cluster head selection approach. A sensor node either communicates among its peers to collect the sensed data or sends the data to the base station. A base station connects the sensor networks to another network, applied protocols for sensor networks has to be energy aware to increase the network lifetime.
Keywords: Cluster Head Selection, Energy Efficiency, LEACH, Network Lifetime, Wireless Sensor Networks.
1 INTRODUCTION
Wireless sensor network is used to detect a variety of interest is measured data; its main purpose is to test data to obtain the detection area. In the process of the network design, the main consideration to how efficient processing of sensor data and the data is transmitted to the user node, therefore the characteristics of wireless sensor network is a data centric. Sensor networks usually consist of sensor nodes, sink nodes and management nodes. Sensor nodes are arbitrarily distributed in a monitored area, nodes in ad hoc form network, by multi hop relay monitoring data will be transmitted to the sink node, finally by Internet or other means of communication network will be monitoring information to the management node. Similarly, users can publish command through the management node;
inform the sensor nodes collect monitoring information. In the hierarchical structure, cluster head is responsible for forwarding data between clusters, and the cluster members is only responsible for data acquisition. This greatly reduces the routing control information, so it has good extensibility. The cluster head can be specified in advance can also be composed of nodes using clustering algorithm automatically elected. Because the cluster head can be elected at any time, so the hierarchical structure has a strong survivability.
Wireless sensor network is the network consisting of hundreds of compact and tiny sensor nodes which senses the physical environment in terms of temperature, humidity, light, sound, vibration, etc. These sensor nodes gather the data from the sensing field and send this information to the end user. These sensor nodes can be deployed on many applications. Current wireless sensor network is working on the problems of low-power communication, sensing, energy storage, and computation. Wireless Sensor Network (WSN), a distributed system consisting of a Base Station and large number of Sensor Nodes (SN) that integrate micro sensing, computing, and wireless communication capabilities, which are capable of detecting various events related to its surrounding environment such as speed, temperature, pressure, difference in displacement, light, etc. These nodes operate in ad-hoc manner and have limited hardware and energy recourses due to its small size. The
158
data sensed by the sensor node in the network gather data in form of electrical signals that are further converted to digital form and wirelessly transmitted to BS where the information can be accessed. As a new technology for information collecting and processing, there are wide range of applications of WSNs in military, health, commercial applications and soon.Nodes usually consist of power module, perception module, information processing module, storage module, data transmission module and software module of the several parts.
Energy modules required for normal work of electric energy for sensor. The sensing module is used to capture the data of interest information; information processing module is responsible for data information and facilitate the transmission nodes for the analog signal from the conversion, and the coordination of other modules, such as data to save the perception module captures the sense of memory modules in the interest of the energy module, energy control and management software; data transmission module responsible for communication with the adjacent node, sending and receiving the captured data of interest information, topological structure but also need to build in the monitoring area network; software module is to provide the necessary system to complete the various tasks for the network, including the routing protocolimplementation, the user order execution.
WSN does not need to be maintained between any two nodes in the network routing, it only needs to maintain between sensor nodes and the Sink routing, routing protocols can be simplified. But usually the resources of sensor nodes are subject to greater restrictions.
Sensor nodes with power limited, cannot be replaced, computation, communication, storage capacity is very limited, some WSN network node or even no identity.
2 ALGORITHM ANALYSIS PROTOCOL FOR WIRELESS SENSOR NETWORKS
In the flat routing protocols, all nodes are equal, by local operation and feedback information to generate routing. The advantages of flat routing protocol is simple, by extension, the disadvantage is the lack of standardized management of communication resources, each node needs to know to all other nodes, maintain the dynamic routing needs to control the amount of information. In the hierarchical routing protocol, the network is partitioned into clusters, each cluster consists of a cluster head and a cluster member nodes, cluster member node is responsible for collecting data, and to relay the collected data to the cluster head, cluster head node is responsible for internal cluster data receiving and data fusion, and then the data forwarding to the higher level cluster. Cluster member function is relatively simple; do not need to maintain routing information complex, nodes at different levels of different functions. Directed diffusion model of DD (Directed Diffusion) is a data centric communication protocol, sensor nodes running the DD use which based on naming attribute to describe the data,, directed diffusion algorithm in the operation process includes the following 3 basic processes, namely path establishment stage, stage and enhance the data transmission path stage. Path establishment stage: the convergence point to publish command information of all nodes in the network to broadcast, multi hop mode, command information containing task type, the data transmission rate, time stamp and other parameters of the interest description. Each node to obtain interest by recording the corresponding neigh bor nodes and it is data rate and time stamp to establish gradient. The wireless sensor network MAC protocol to pay more attention to the effective energy utilization, and it is channel design of sleep mechanism. At present for the different sensor network applications, research on MAC protocol of wireless sensor network is like a raging fire, multiple MAC protocol research results already exists, can be classified according to the distributed control and centralized control, using a single shared channel or multiple channels and a fixed distribution channel mode or random access channel. The traditional Internet routing protocol is not concerned about energy issues but focus on the quality of network service, and network equipment are more adequate electricity whenever and wherever possible, and can supplement the relevant, and wireless sensor network is just the opposite, the node energy is limited, therefore, routing protocol design must be effective use of node energy in the first place, and the service quality of network nodes, and the micro components cheaper, and the current technology, energy is very difficult to have the obvious promotion, typical wireless sensor network application to human unexplored places, as is shown by equation.
159
In the RS model, in addition to the base station (node is connected and fixed network), the network all the sensor nodes can be used as a data source, randomly chosen from the in. The simulation analysis, DD routing protocol has better energy efficiency and scalability characteristics, especially suitable for sensor node receives a data request, in a long time continuous transmission applications to sink data. This is not the way for only a few data in the case of receipt of the request, because of the need to spend big price to establish gradient. In directed diffusion algorithm is implemented in the correct path, a path when an error, the path or paths will be new beginning. Directed diffusion algorithm considering in this aspect, the data transmission is always can be achieved by fewer hops, while saving time searching for a new path of energy.Relative positioning is usually to some nodes in the network as a reference, the relative coordinate system to establish the whole network. Absolute positioning can provide a unique namespace for the network, the node mobility effects are smaller, more widespread application domain. But the study found, also can achieve somerouting protocols based on relative positioning, especially geographical location based routing (geo-routing), and relative positioning without beacon node. In the application of certain without a network node absolute position, can be used without beacon node localization algorithm to achieve the relative position of the whole network. LEACH is the different methods and constructing multiple clustering hierarchical routing algorithms is popular, PEGASIS the node structure into a chain, each node by its neighbor nodes transmit and receive data, and the chain is only one node and sink node or base station to communicate from one node to.
Another node continuity of the aggregation, fusion and transmit data to the base station. The chain path is using a greedy algorithm to construct. SPIN is a data centric routing protocol adaptive communication, its goal is through the use of inter node negotiation mechanism and resource adaptive mechanism, so as to solve the problem of overlapping phenomenon of explosion and flooding protocol data. Sensor nodes in the transmission of data to each other before consultation, consultation system can ensure the transmission of useful data. Nodes by sending the metadata and it are the data rather than the acquisition of the negotiation. The metadata size is less than the collection of data, so the transmission energy consumption is relatively less metadata.
2 ROUTING CHALLENGESIN WSNS
The design task of routing protocols for WSN is quite challenging because of multiple characteristics, which differentiate them, from wireless infrastructure-less networks. Several types of routing challenges involved in wireless sensor networks. Some of important challenges are mentioned below:
It is almost difficult to allocate a universal identifiers scheme for a big quantity of sensor nodes. So, wireless sensor motes are not proficient of using classical IP- based protocols.
The flow of detected data is compulsory from a number of sources to a specific base station. But this is not occurred in typical communication networks.
The created data traffic has significant redundancy in most of cases. Because many sensing nodes can generate same data while sensing. So, it is essential to exploit such redundancy by the routing protocols and utilize the available bandwidth and energy as efficiently as possible.
Moreover wireless motes are firmly restricted in relations of transmission energy, band-width, capacity and storage and on-board energy.
Due to such dissimilarities, a number of newrouting protocols have been projected in order to cope up with these routing challenges in wireless sensor networks.
160
3 DESIGN OF EXPERIMENTAL FOR WSN PROTOCOLCDMA layered PEGSIS protocol uses the hierarchical tree structure based approach, each layer selected node to node transmit data at higher level. Agreement requirements on the data acquisition process of each round, all nodes at a given layer to send the data to the additional neighbors, all data nodes are promoted to a layer of nodes. By analogy, the top layer is only one node is retained and become the first chain node. To illustrate the process of the protocol is for each round path. Sensor nodes in a variety of unusual or unexpected network environment (such as hardware failures, environmental interference and high load), the routing protocol should be able to help the system to correct the mistakes by automatically adjusting or automatic reconstruction (such as node maintains a plurality of the alternative Sink nodes by), as far as possible to ensure the network normal work, the system has high robustness and stability. Highlight the characteristics of wireless sensor network itself, such as limited energy, limited energy, network node characteristics and distribution etc.
Characteristic of self organization protocol and based on wireless sensor network, analyzes the characteristics of self-organizing wireless sensor networks, wireless sensor networks, because of limited energy of sensor nodes, energy or energy efficiency is an important issue to consider. So the wireless sensor network self-organization protocol to meet the characteristics of low energy consumption. Because of the actual test platform used in this paper is Imote2, Imote2 is working on 802.15.4, using CC2420 wireless transceiver chip, as is shown by equation (3).
The node number, hence the need for processing multi-level, many aspects of the collected data information, and also filtering, link, evaluation and the reorganization of the information, to improve the correct rate of gathering information, and with higher credibility and ensure the reliability and security of the data, in order to provide useful data for user and, at the same time, wireless sensor network is a data centric network, the ultimate goal is to monitor the user nodes within the area of data collection and processing, from this point of view, the data fusion technology can make the efficiency of this process is superior to the traditional method, so as to improve the usefulness of the information, improve the accuracy of sensing equipment. SPEED routing protocol is a routing protocol in real time, it realizes the transmission rate of end-to-end guarantee, network congestion control and load balancing mechanism in a certain extent. The SPEED protocol to transmit the first switching node delay and it is in order to get the network load conditions, as is shown by equation4.
Hierarchical PEGASIS is an extension to PEGASIS; the main work is in the processing delay of data packet transmission, the main aim is to find a balance between energy and delay. In order to reduce the time delay, theprotocol adopts information transmission at the same time. In order to avoid the collision and interference, and it is using the two methods. One is the using different code, for identification of data. Another method is, to transmit data at the same time only some nodes. NS has the characteristics of good openness, expansibility, suitable for Windows and Linux system platform, is an excellent study of network topology, network analysis and simulation tools. Compared with other NS network simulation tool, the simulation of energy corresponding to the data flow is particularly prominent. There are two kinds of division of different development language NS simulation environment: C++
and Otcl (ObjectTcl, Tclobject oriented extension). C++ describes the details of the network protocols, Otcl provides an object oriented interface, through a variety of parameter configuration simulation activities, framework of simulation, between C++ and OTCL
161
through the TclCL link. C++ run faster, make the simulation with high performance, as shown in figure 1.In the simulation experiment using NS-2 as the network simulation tool, it provides communication model, random topology and node mobile model generation tool. Used in the simulation scene file using the stochastic model of tool implementation. The simulation scenario is the following settings in the simulation. The Gossiping protocol is improved and proposed based on flooding protocol. Its dissemination of information through random selection of a neighbor node, and it is transmission of information selection in the same way random neighbor node information of the next node. This approach avoids information dissemination to broadcast the form of energy consumption, but at the expense of prolonging the time of information transmission. Although the Gossiping protocol to solve information implosion, but still overlap information.
4 DESIGN CHALLENGES
In WSNS There are some major design challenges in wireless sensor networks due to lack of resources such as energy, bandwidth and storage of processing. While designing new routing protocols, the following essentials should be fulfilled by a network engineer.
Energy efficiency: Wireless sensor networks are mostly battery powered.
Energy shortage is a major issue in these sensor networks especially in aggressive environments such as battlefield etc. The performance of sensor nodes is adversely affected when battery is fallen below a pre- defined battery threshold level. Energy presents a main challenge for designers while designing sensor networks. In wireless sensor network, there are millions of motes. Each node in this network has restricted energy resources due to partial amount of power.
So, the routing protocol should be energy efficient.
Complexity: The complexity of a routing protocol may affect the performance of the entire wireless network. The reason behind is that we have inadequate hardware competences and we also face extreme energy limitations in wireless sensor networks.
Scalability: As sensors are becoming cheaper day by day, hundreds or even thousands of sensors can be installed in wireless sensor network easily. So, the routing protocol must support scalability of network. If further nodes are to be added in the network any time, then routing protocol should not interrupt this.
Delay: Some applications require instant reaction or response without any substantial delay such as temperature sensor or alarm monitoring etc. So, the routing protocol should offer minimum delay. The time needed to transmit the sensed data is required to be as little as possible in above cited WSN applications.
Robustness: Wireless sensor networks are deployed in very crucial and loss environments frequently. Occasionally, a sensor node might be expiring or leaving the wireless sensor network. Thus, the routing protocol should be capable to accept all sorts of environments including severe and loss environments.
Data transmission and transmission models: There are four modes of data transmission depending on the applications in wireless sensor networks namely as
162
query driven, event driven and continuous type and hybrid type. A node begins to transmit the data only when sink creates the query or an event occurs in query driven model and event driven model. The data is sent out periodically in continuous transmission mode. The performance of the routing protocol is a function of network size and transmission media. So, transmission media of good quality enhances the network performance directly. Sensor location: Another major challenge that is faced by wireless sensor network designers is to correctly locate of the sensor nodes. Most routing protocols use some localization technique to obtain knowledge concerning their locations. Global positioning system (GPS) receivers are used in some scenario.
5 CATEGORIES OF ROUTING PROTOCOLS
In order to transmit data in sensor networks, there are two techniques being used. The one is referred to as Flooding and the other one is gossiping protocol. There is no need to use any routing algorithm and maintenance of topology. In the flooding protocol, upon reception of a data packet by sensor nodes, this data packet is broadcast to all other neighbours. The process of broadcasting is continued till any one of two following conditions is satisfied; the packet has reached successfully to its destination. And second condition is;
maximumnumber of hops of a packet has reached [4]. The main advantages of flooding are ease of implementation and simplicity. The drawbacks are blindness of resources and overlapping and implosion. The gossiping protocol is somewhat advanced version of flooding protocol. In gossiping protocol, the sensor node, which is getting a data packet, transmits it to the arbitrarily selected neighbour. At the next turn, the sensing nodes again randomly pick another nodes and sends data to it. This process is continued again and again. The broadcasting is not used in gossiping protocol as it was used in flooding. In this way, implosion issue can be avoided easily.
6 CONCLUSION
Finally, using OMNet++ simulation tool on the self organization protocol is simulated, the simulation tool OMNet++, the flooding tree (Flood Tree) protocol, the maximum independent set MIS connected dominating set of CDS protocol, FISCO protocol is simulated based on, put forward different structure may have different maintenance methods and energy consumption, initial structure stage small energy consumption may be in the maintenance phase of high energy consumption. The basic characteristics of WSN with open media, no center certification bodies, distributed collaboration; its security problem is more serious than the wired network. Routing protocol is the main target of attack, but the current routing protocols have been proposed rarely consider the security problem. How to use less cost, obtain routing better safety performance, may be the direction of future efforts.
From the comparative study of the existing research work, it has been concluded that there are various energy efficient techniques for WSNs which consists of fixed and mobile sensor nodes that improve the cluster head selection approach to extend the lifetime of WSNs. Hence, the issue of energy consumption will be addressed and investigated further by using the proposed methodology, to increase the performance of the WSNs in terms of reducing energy consumption and also average latency, by improving lifetime of sensor nodes, and by reducing bandwidth consumption. Similarly based on this formulation, the optimum clustering technique can further be developed to extend the lifetime of WSNs that significantly reduce the number of rounds for selecting optimal CH. Routing protocols plays a very significant part to produce interruption less and efficient communication between source and destination nodes. The performance, service and reliability of a network mostly depend on the selection of good routing protocol. Protocols being used in Wireless sensor networks and ad hoc networks must be round-free. The routing protocols in WSN are classified in many different ways.
REFERENCES
1. G Yin, G Yang, W Yang, B Zhang, W Jin.“An energy-efficient routing algorithm for wireless”.
In. International Conference on Internet Computing in Science and Engineering (ICICSE’08), IEEE, China; 2008.
2. Zang Z, Qi JD, Cao YJ. “A robust routingprotocol in wireless sensor networks”. In: IET
163
International Conference on Wireless Sensor Network. China: IET;2010.pp.276-279
3. Ehsan S, Hamdaoui B. “A survey on energy-efficient routing techniques with QoS assurances for wireless multimedia sensor networks”. IEEE Communications Surveys &
Tutorials. 2012; 14(2), PP. 265-278.
4. O. Younis, S. Fahmy, "HEED: A hybrid, energy efficient, distributed clustering approach for ad-hocsens or networks", IEEE Transactions on Mobile Computing vol3, no4, pp 660-669, 2004.
5. L. Qing, Q. Zhu, M. Wang, “Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks". ELSEVIER, Computer Communications29, 2006, pp2230-2237.
6. A. Manjeshwar and D. P. Agarwal, "TEEN: arouting protocol for enhanced efficiency in wireless sensor networks," In 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing,April2001.
7. A.Manjeshwar and D.P. Agarwal, "APTEEN: A hybrid protocol for efficient routing and comprehensive information retrieval in wirelesss ensor networks," Parallel and Distributed Processing Symposium., Proceedings International, IPDPS2002, pp.195-202.
8. W. R. Heinzelman, A. P. Chandrakasan, H. Balakrishnan, “An application specific protocol architecture for wireless micro sensor networks”, IEEE Transactions on Wireless
Communications 1(4) (2002) 660–670.
9. Elbhiri Brahim, Saadane Rachid, Alba-Pages Zamora, Driss About ajdine, “Stochastic Distributed Energy-Efficient Clustering (SDEEC) for heterogeneous wireless sensor networks”, ICGST-CNIR Journal, Volume 9, Issue 2, December 2009.
10. Yingchi Mao, Zhen Liu, Lili Zhang, Xiaofang Li, “An Effective Data Gathering Scheme in Heterogeneous Energy Wireless Sensor Networks”, International Conference on Computational Science and Engineering, 2009.
11. Dilip Kumar, Trilok C. Aseri, R. B. Patel, “EEHC: Energy efficient the terogeneous clustered scheme for wireless sensor networks”, ELSEVIER, Computer Communications, 32 (2009) 662–667.
12. K. Akkaya; M. Younis. Elsevier Ad Hoc Network Journal, 2005, 33: 25-349.
13. Akkaya K; Younis M. AdHoc Network, 2005, 3(3):325-349.
14. Guoan Zhao; Qilai Liang. Journal of Chemical and Pharmaceutical Research, 2014, 6(3), 774-778.
15. A. Sinha; A. Chandrakasan. IEEE Design & TEX of Computers, 2001, 18(2), 62-74.
16. O. Younis S. Fahmy Distributed Clustering in Ad Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach Proc, IEEE INFOCOM Hong Kong Mar. 2004.
17. Preeti Srivastava. Journal of Chemical and Pharmaceutical Research, 2014, 6(1), 570-579.
18. ZhiChuan. JDCTA, 2013, 7(3), 119 - 126.
