Probabilistic method for energy efficiency routing with node compromised resistance

A wireless sensor network is basically a data communication system that consists of from several to thousands of tiny wireless sensor nodes. These battery powered sensor nodes work with each other to accomplish data transmission. Since the lifetime of wireless sensor network depends on such battery powered sensor nodes, hop counts and battery power have been taken as metrics in routing protocols. In wireless sensor network, energy efficiency is most critical issue that should be considered while transmitting information or data packet from source node to sink node. Some techniques can be used by attacker communities through getting the knowledge about efficiency and trust relationship among the nodes and then insert some unwanted packets in the path from source to sink. DRP, MTRP and EENC are some techniques that can be used to provide energy efficient transmission of data packets. EENC is energy efficiency routing with node compromised resistance. This technique is based on the ant colony optimization technique. Three parameters in this technique, energy, trust and hop count are considered here to find out the compromised node among the nodes and remove the path from source to sink containing that node.

[1]  Yuguang Fang,et al.  Location-based compromise-tolerant security mechanisms for wireless sensor networks , 2006, IEEE Journal on Selected Areas in Communications.

[2]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[3]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[4]  S. Singh,et al.  Routing Protocols in Wireless Sensor Networks - A Survey , 2010 .

[5]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[6]  Min Chen,et al.  Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[7]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[8]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[9]  José D. P. Rolim,et al.  Energy optimal data propagation in wireless sensor networks , 2005, J. Parallel Distributed Comput..

[10]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[11]  Shao-Shan Chiang,et al.  A Minimum Hop Routing Protocol for Home Security Systems Using Wireless Sensor Networks , 2007, IEEE Transactions on Consumer Electronics.

[12]  Davide Brunelli,et al.  Wireless Sensor Networks , 2012, Lecture Notes in Computer Science.

[13]  Wenjing Lou,et al.  LEDS: Providing Location-Aware End-to-End Data Security in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..