E-MEECP- DEVELOPING A DEPENDABLE ROUTING PROTOCOLS FOR HETEROGENEOUS WIRELESS NETWORKS

Transcription

1 E-MEECP- DEVELOPING A DEPENDABLE ROUTING PROTOCOLS FOR HETEROGENEOUS WIRELESS NETWORKS R.Narayana murthy #1,V.Ganesh Karthikeyan *2 and Dr.N.Chitra Devi *3 # PG Scholar, Dept. of CSE, Adithya Institute of Technology, Coimbatore, India *2 Asst. Professor, Dept. of CSE, Adithya Institute of Technology, Coimbatore, India. *3 Professor & Head, Dept. of CSE, Adithya Institute of Technology, Coimbatore, India. Abstract In wireless sensor networks, the target of utilizing sensor nodes to obtain low cost, high energy efficiency with low power consumption. Several monitoring techniques are developed for the applications such as Temperature monitoring, Healthcare monitoring, Traffic controls etc. The objective of the wireless sensor network is to share the data within lessened power utilization at reduced cost. The data is transferred and communicated with other nodes in the system via multi-hop wireless networks. With the advent of intermediate nodes, the communication between source and destination nodes are established. Simultaneously, it drain outs the energy of the nodes that reduces the lifespan of the WSN s nodes. Index Terms Wireless Sensor Networks, Energy efficiency, Power consumption, Multi-hop wireless networks and Intermediate nodes I. INTRODUCTION With the developments in multi-hop wireless networks, many real time applications such as data sharing, multimedia data transmission are advanced. It develops a path to communicate, allocate the task and shares the information. While the nodes are communicating, it is restricted with lessened bandwidth and energy. In DSR routing protocols [6], the nodes are dependent to each other nodes in the networks. A group of nodes forms the Wireless Sensor Networks. The event is sensed by the low power sensor node deployed in neighborhood and the sensed information is transmitted to a remote processing unit or base station. In data processing applications, wireless sensor networks works effectively with enhanced processing techniques. The ambient conditions in the environment are measured by sensors and then measurements are processed in order to assess the situation accurately in area around the sensors. Over a large geographical area large numbers of sensor nodes are deployed for accurate monitoring. Due to the limited radio range of the sensor nodes the increase in network size increases coverage of area but data transmission i.e. communication to the base station (BS) is made possible with the help of intermediate nodes. Relied upon the type of applications, the nodes in the Wireless Sensor Networks are deployed randomly or manually. Once the nodes are deployed, they self-organize themselves and communicate with each other.. Access to wireless sensor networks through internet is expected within years. Ad Hoc Network (MANET) is connected by various wireless links which is a self-configuring network of mobile nodes. The device move freely in any direction and links among these devices are changed frequently. A cooperative network organized by collection of sensor nodes is also sorts of wireless sensor network. Both of these networks fall into the category of infrastructureless wireless networks, as they do have any requirement regarding infrastructure during the deployment. Wireless Local Area Networks (WLANs) and cellular networks fall into the other category of wireless networks that require infrastructure during their deployment. Routing of information differentiate these networks from other ad-hoc networks. The study of wireless sensor network is done by performing simulation that can help in better understanding of behavior of various routing protocols. Fairness issue arises when a selfish node takes advantage from the cooperative nodes without contributing to them, and the cooperative nodes are unfairly overloaded. In multihop networks, these types of scenarios degrade the network performance. In addition, some nodes may break routes because they do not have sufficient energy to relay the source nodes packets and keep the routes connected. Because of this uncertainty in the nodes behavior, randomly selecting the intermediate nodes will degrade the routes stability. 10

2 From their analysis, they depicted that there is a limited techniques suggested in the network lifetime. Further, we have developed a non-uniform, location-wise pre-determined node deployment strategy based on this principle leading to an increase in network lifetime. Finally exhaustive simulation is performed to substantiate our claim of energy balancing and subsequent enhancement of network lifetime. The results are compared with an existing work to prove the efficacy of our scheme. Typical sensor network consists of a large number of spatially distributed autonomous sensor devices. They studied about the sensor placement techniques in wireless sensor networks. The issues discovered are the required lifetime of a sensor network, the initial energy of each sensor node, and the area to be covered, what is the minimum number of nodes needed to construct such a network and what is the corresponding placement scheme used in placement. III. PROPOSED WORK Fig.1 WSN-Architecture The paper is organized into four parts: Section II describes the existing techniques carried out by various researchers. Section III explains about the proposed approach. Section IV justifies the proposed approach. Atlast concluded in Section V. II. RELATED WORKS In this section, we explain about the various techniques studied by the Experter s. In reputation based schemes, some nodes are negatively identified as the malicious nodes. It detects only when the node drop the packets in continuous manner. The packet drop happens because of congestion issue. To overcome from this issue, a threshold based mechanisms are emerged in order to lessen the rate of packet drop. Moreover, tolerant threshold enables the nodes with high packet dropping rate to participate in routes, and enables the malicious nodes to circumvent the scheme by dropping packets at a rate lower than the scheme s threshold. When a node s reputation value is above the threshold, it does not have incentive to relay packets because it does not bring more utility. The system proposed the concept that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fails. This is further solved by incorporating Dynamic Source Routing algorithm such as watchdog and path rater. The employment of watchdog is to identify the misbehaving nodes in the networks. The payment strategy makes use of the communication protocols from source to destination nodes with the intervention of public key cryptography operations [5]. Subirhalder et al lowered the rate of energy consumption with the use of probability density functions. A node deployment algorithm is also developed based on this PDF. Performance of the deployment scheme is evaluated in terms of coverage-connectivity, energy balance and network lifetime. In qualitative analysis, we have shown the extent to which our proposed PDF has been able to provide desired node density derived from the analysis on network lifetime. Dietrich I studied about the lifetime of wireless sensor networks. They surveyed about the sensor network lifetime. A. PROBLEM DEFINITION Energy consumption is the major issue in the Wireless Sensor Networks. To repair the network lifetime, the node density is estimated. This creates a greater impact on network lifetime and obtains the optimal parameter values for balance energy consumption. The problems exist in previous works are: a) The analysis on QoS parameters is not yet wellestablished. b) Owing to lack of access control and authentication process, the possibility rate of Intrusion action is high. c) Delay happens when network traffic is high. B. ENERGY AWARE COMMUNICATION PROTOCOL: The proposed S-EECP works in single hop communication between the cluster head and the Base station. The cluster head is selected by the election process. It is estimated from the formula given below: The nodes presented in both inter-cluster and intra-cluster communication is found. The nodes that possess higher energy are elected as the Cluster Head. 11

3 C. Advantages of E-MEECP: E-MEECP targets at: Reducing the network overhead Maintaining an equipped energy consumption Network lifetime is prolonged. The level of PDR is increased Lessened packet loss IV. EVALUATION RESULTS In this section, we discusses about the performance indices incorporated in E-MEECP design. The parameter settings are: PARAMETERS VALUES Fig.2. Formation of cluster head. Then, it is again tested in M-EECP design. It works similar to the S-EECP design. A shortest route path is established between Cluster head and Base station. It contains three types of sensor nodes with inclusive of variant energy: a) Normal Nodes b) Advanced Nodes c) Super nodes N( No of nodes) 53 nodes Routing Protocol LEACH Transmission UDP Protocol Antenna Omni-Directional Antenna Simulation Time 30s Channel Wireless Channel Network Size 1070*1070m Packet Size 1078bytes/ms Packet Rate 56kbps Traffic Type CBR Table 1. Parameter Settings Fig.3. Multi-hop wireless communication The neighborhood information is collected by the advent of nodes viz polling point and mobile collector. The use of polling point is to save the data from the cluster head. The role of mobile collector is to accumulate the data from polling points. Fig.5. Nodes are deployed in random manner. Fig.4. Working of E-MEECP 12

4 Fig.6. Formation of cluster heads Fig.10. Data is collected using mobile collector Fig.7. Node communication via single hop networks. Fig.11. Comparison chart of energy consumption in S-EECP, M-EECP and E-MEECP. Fig.8. Node communication via multi-hop networks Fig.12. Comparison chart of Residual Energy in S-EECP, M-EECP and E-MEECP Fig.9. E-MEECP design Fig.13. Estimation of packet loss in S-EECP 13

5 decreased with untrusted nodes. In future work provide security for each packet, so that the intruders can t able to get or damage the packets. VI. CONCLUSION A conclusion section is not required. Although a conclusion may review the main points of the paper, do not replicate the abstract as the conclusion. A conclusion might elaborate on the importance of the work or suggest applications and extensions. REFERENCES Fig.14. Estimation of packet loss in M-EECP Fig.15. Packet loss in E-MEECP Fig.16. Estimation of Packet Delivery Ratio for S-EECP, M-EECP and E-MEECP V. CONCLUSION The proposed E-MEECP utilizes the trust based and energy aware routing protocol systems. The aim of the system is to maintain the stability of the nodes. If any node misbehaves in the networks, by correcting their energy level, the chance of misbehaving is reduced. The cluster head is formed by the decisional factors such as route length, the route reliability based on previous node s behavior and lifetime of the sensor nodes. Performance evaluation is done based on the results of the simulation done using ns2. From the results it is proved that the route reliability and packet delivery ratio has been improved using this protocol. The security of packet is [1] Dilip Kumar, Performance analysis of energy efficient clustering protocols for maximising lifetime of wireless sensor networks Published in IET Wireless Sensor Systems, IET Wirel. Sens. Syst., (2014), Vol. 4, Iss. 1, pp [2] Abbasi, A.A., Younis, M., A survey on clustering algorithms for wireless sensor networks, Elsevier Comput. Commun., (2007), 30, (14 15), pp [3] Akyildiz I.F, Su W., Sankarasubramaniam Y. and Cayirci E., Wireless sensor networks: A survey, Comput. Netw., Vol. 38, No. 4, pp , (2002). [4] Akkaya K. and Younis M., A survey on routing protocols for wireless sensor networks, Ad Hoc Netw., Vol. 3, No. 3, pp , (2005). [5] Anastasi, G., Conti, M., Francescoa, M.D., Passarella, A., Energy conservation in wireless sensor networks, Elsevier Ad Hoc Netw. J7 (3), pp , (2009). [6] Ashfaq Ahmad, NadeemJavaid- Member IEEE, Zahoor Ali Khan-Member IEEE, UmarQasim and Turki Ali Alghamdi, Routing Scheme to Maximize Lifetime and Throughput of Wireless Sensor Networks, (2014). [7] Aslam M., Javaid N., Rahim A., Nazir U., Bibi A. and Khan Z., Survey of extended LEACH-based clustering routing protocols for wireless sensor networks, in Proc. 9th IEEE Int. Conf. Embedded Softw. Syst., Proc. 14th Int. Conf. High Perform. Comput. Commun. (HPCC-ICESS), pp , (2002). [8] Asis Kumar Tripathy and SuchismitaChinara., Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network, International Scholarly Research Network ISRN Sensor Networks Volume (2012). [9] Bestavros A., Smaragdakis G., Matta I., SEP: A stable election protocol for clustered heterogeneous wireless sensor networks, Dept. Comput. Sci., Boston Univ.,Boston, MA, USA, Tech. Rep. BUCS-TR , (2004). [10] Dilip Kumar and R. B. Patel., Multi-Hop Data Communication Algorithm for Clustered Wireless Sensor Networks, International Journal of Distributed Sensor Networks Volume (2011). [11] Enrique J. Duarte-Melo, Mingyan Liu., Analysis of Energy Consumption and Lifetime of Heterogeneous Wireless Sensor Networks, Proc. Int. Conf. IEEE Global Telecommunications, Taipei, Taiwan, November (2002), Vol. 1, pp [12] Heinzelman W.R., Chandrakas A. and Balakrishnan H., Energy efficient communication protocol for wireless microsensor networks, in Proc. 33rd Annu. Hawaii Int. Conf. Syst. Sci., (2000). [13] Kumar D., Aseri T.C., Patel R.B., EEHC: energy efficient heterogeneous clustered scheme for wireless sensor networks, Elsevier Comput. Commun., (2009), 32, (4), pp [14] MeenaKowshalya.A, Sukanya.A., Clustering Algorithms for Heterogeneous Wireless Sensor Networks A Brief Survey, International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.2, No.3, September (2011). [15] Mhatre V., Rosenberg C., Homogeneous vs. heterogeneous clustered sensor networks: a comparative study. Proc. Int. Conf. IEEE Communications, Vol. 6, pp , (2004). [16] NaumanIsrar and I. U. Awan., Multilyer Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Networks International Journal of Distributed Sensor Networks, 4: ,(2008). [17] Nikolidakis A. and Rahim A., Multipath routing protocols in wireless sensor networks: A survey, IEEE Commun. Surveys Tuts., Vol. 15, (2011). 14

6 [18] Zeadally S., Khan S. U. and Chilamkurti N., Energy-efficient networking: past, present, and future, Supercomput., Vol. 62, No. 3, pp , (2012). AUTHOR DETAILS First Author R.Narayana murthy PG Scholar Adithya Institute of Technology, Sathy Road, Kurumbapalayam, Coimbatore Tamilnadu, India. Second Author V.Ganesh Karthikeyan, B.E IT., M.E CSE., (Ph.D)., Asst. Professor/ Department of Computer Science and Engineering, Adithya Institute of Technology, Sathy Road, Kurumbapalayam, Coimbatore Tamilnadu, India. Third Author Dr.N.Chitra Devi,B.E., M.E., Ph.D Professor & Head, Department of Computer Science and Engineering, Adithya Institute of Technology, Sathy Road, Kurumbapalayam, Coimbatore Tamilnadu, India. 15