A Survey on Trust Based Secure Routing in WSN A ...

IJEEMF International Journal of Electrical, Electronics and Mechanical Fundamentals, Vol. 06, Issue 01, May 2013 WWW.IJEEMF.COM ISSN: 2278-3989

A Survey on Trust Based Secure Routing in WSN

Suneyna1, Bhavneesh Malik2

1

2

M. Tech Student, ECE Department, VCE, M.D.U Rohtak, Haryana, India [email protected]

Assistant Professor, ECE Department, VCE, M.D.U Rohtak, Haryana, India [email protected]

compromised nodes can successfully authenticate bogus reports to their neighbors, which have no way to distinguish false data from legitimate ones [4]. In either case, to differentiate false data from legal ones is an essential process for a normal and effective function of sensor networks, because false reports can drain out the finite amount of energy resources in a battery-powered sensor networks, and even a small amount of compromised nodes can influence the whole sensor networks critically [5].

Abstract The domain of Wireless Sensor Networks (WSNs) applications is increasing widely over the last few years. As this new type of networking is characterized by severely constrained node resources, limited network resources and the requirement to operate in an ad hoc manner, implementing security functionality to protect against adversary nodes becomes a challenging task. In this paper, we review on trust-based routing protocol and their importance in WSN which protects the WSN against routing attacks, and also supports large-scale WSNs deployments.

Keywords: Architecture.

Wireless sensor network, Routing,

Time synchronization service in WSN has to meet challenges which are substantially different from those in infrastructure based networks. For instance, as each sensor has a finite battery source and communication is expensive in terms of energy, an important issue of WSN is energy efficiency. In addition, WSN show a higher failure probability over the time than in traditional networks due to battery depletion or destruction of the sensors, and changes in the environment can dramatically affect radio propagation causing frequent network topology changes and network partitions. Moreover, at high densities WSN become much more likely to suffer communication failures due to contention for their shared communication medium. These elements lead to strong energy efficiency, self configuration and robustness requirements.

Introduction Wireless Sensor Networks suggest potentially beneficial solutions for various applications including climate and temperature monitoring, freeway traffic analyzing, people’s heart rates sensing, and many other military applications [1]. A major feature of these systems is that sensor nodes in networks assist each other by passing data, in network process and control packets from one node to another. It is often termed an infrastructure-less, self-organized, or spontaneous network [2]. However, sensor networks tend to be organized in open environment, thus some false data broadcasted from irrespective nodes might be injected into the networks regardless of their intention. In addition, sensor networks are susceptible to a variety of attacks, for example node capture, eavesdropping, denial of services, wormhole, and sybil attack [3]. So, a certain amount of sensor nodes can be compromised by adversaries, and the

Architecture Most common architecture for WSN follows the OSI Model. Basically in sensor network we need five layers: application layer, transport layer, network IJEEMF www.ijeemf.com 21


layer, data link layer and physical layer. Added to the five layers are the three cross layers planes as shown in Fig. 1 [6].

2.

Figure 1. Typical Architecture of WSN The three cross planes or layers are; power management plane, mobility management plane and task management plane. These layers are used to manage the network and make the sensors work together in order to increase the overall efficiency of the network [6]. • Mobility management plane: detect sensor nodes movement. Node can keep track of neighbors and power levels (for power balancing). • Task management plane: schedule the sensing tasks to a given area. Determine which nodes are off and which ones are on.

3.

WSN OSI Layers 1.

Transport layer: The function of this layer is to provide reliability and congestion avoidance where a lot of protocols designed to provide this function are either applied on the upstream (user to sink, ex: ESRT, STCP and DSTN), or downstream (sink to user, ex: PSFQ and GARUDA). These protocols use different mechanisms for loss detection ((ACK, NACK, and Sequence number)) and loss recovery ((End to End or Hop by Hop)) [7, 8]. This layer is specifically needed when

a system is organized to access other networks. In general, Transport protocols can be divided into: a. Packet driven: ‘all packets sent by source must reach destination’ [7]. b. Event driven: ‘the event must be detected, but it is enough that one notification message reaches the sink’ [7]. Network layer: The major function of this layer is routing. This layer has a lot of challenges depending on the application but apparently, the major challenges are in the power saving, limited memory and buffers, sensor does not have a global ID and have to be self organized. This is unlike computer networks with IP address and central device for controlling [6, 9]. The basic idea of the routing protocol is to define a reliable path and redundant paths according to a certain scale called metric, which differs from protocol to protocol. There is a lot of routing protocols available for this layer, they can be divide into; flat routing (for example, direct diffusion) and hierarchal routing (for example, LEACH) or can be divided into time driven, query driven and event driven. In continuous time driven protocol, the data is sent periodically and time driven for applications that need a periodic monitoring. In event driven and query driven protocols, the sensor responds according to action or user query [10, 11]. Data link layer [8]: Responsible for multiplexing data streams, data frame detection, MAC, and error control, ensures reliability of point–point or point– multipoint. Errors or unreliability comes from [12, 13]: • Co- channel interference at the MAC layer and this problem is solved by MAC protocols. • Multipath fading and shadowing at the physical layer and this problem is solved by forward error correction (FEC) and automatic repeat request (ARQ). ARQ: not popular in WSN because of additional re-transmission cost and overhead. ARQ is not efficient to frame error detection so all the IJEEMF www.ijeemf.com

22


4.

5.

• Pollution study 3. Health Applications[18,20,21] • Providing interfaces for the disabled • Integrated patient monitoring • Administration in hospitals • Tele-monitoring of human physiological data • Tracking and monitoring doctors and patients inside a hospital 4. Commercial Applications[18,20,22,23] • Managing inventory • Monitoring product quality • Robot control and guidance in automatic manufacturing environments • Interactive museums • Monitoring disaster area • Smart structures with sensor nodes embedded inside • Vehicle tracking and detection

frame has to retransmit if there is a single bit error [9]. FEC: decreases the number of retransmission by adding redundant data on each message so the receiver can detect and correct errors. By that we can avoid retransmission and wait for ACK [8]. Physical Layer [8]: Can provide an interface to transmit a stream of bits over physical medium. Responsible for frequency selection, carrier frequency generation, signal detection, Modulation and data encryption. Application layer: Responsible for traffic management and provide software for different applications that translate the data in an understandable form or send queries to obtain certain information. Sensor networks deployed in various applications in different fields, for example; military, medical, environment, agriculture fields [6, 11].

Routing protocols in WSN Applications

•

WSNs have different applications; most of them are critical mission applications, for example: 1. Military Applications [14,15] • Monitoring friendly forces, equipment and ammunition • Battlefield surveillance • Reconnaissance of opposing forces and terrain • Targeting guidance • Battle damage assessment • Nuclear, biological and chemical (NBC) attack detection and reconnaissance. 2. Environmental Applications [16,17,18,19] • Tracking the movements of birds, small animals, and insects • Monitoring environmental conditions that affect irrigation • Earth, and environmental monitoring in marine, soil, and atmospheric contexts • Forest fire detection • Meteorological or geophysical research • Flood detection

•

Data centric Routing: Data-centric routing protocols have an architecture in which there is a sink that communicates with certain regions to collect data from the sensors located in the selected regions [24]. An example of such protocols is SPIN (Sensor Protocols for Information via Negotiation) [25] which is the first data-centric protocol that considers data negotiation between nodes in order to eliminate redundant data and save energy. Another famous example is Directed Diffusion [26]. In this protocol data is diffused through sensor nodes by using a naming scheme for the data. An enhanced version of Directed Diffusion is Rumor routing [27] that routes the queries to the nodes that have observed a particular event rather than flooding the entire network to retrieve information about the occurring events. Hierarchical Routing: Hierarchical routing attempts to efficiently maintain the energy consumption of sensor nodes by involving them in multi-hop communication within a particular cluster. Data is then aggregated and fused in order to decrease the number of transmitted messages to the sink [24]. IJEEMF www.ijeemf.com

23


•

•

LEACH (Low Energy Adaptive Clustering Hierarchy) [28] is one of the first hierarchical routing approaches for sensors networks in which clusters of the sensor nodes are formed based on the received signal strength. The cluster-heads are then used as routers to the sink. This will save energy since the transmissions will only be done by such cluster heads rather than all the sensor nodes. Other protocols are mainly inspired by this protocol, such as TEEN (Threshold sensitive Energy Efficient sensor Network protocol) [29] that are designed to be responsive to sudden changes in the sensed attributes such as temperature. QoS-based Routing: QoS-aware protocols consider end-tuned delay requirements while setting up the paths in the sensor network [24]. One famous example is SPEED protocol [30]. The main goal of SPEED is to provide soft real-time end-to-end guarantees. The protocol works by making each node maintain information about its neighbors and uses geographic forwarding to find the paths. In addition, SPEED strives to ensure a certain speed for each packet in the network so that each application can estimate the end-to-end delay for the packets by dividing the distance to the sink by the speed of the packet before making the admission decision. Location-based Routing: Most of the routing protocols for sensor networks require location information for sensor nodes. In most cases, location information is needed in order to calculate the distance between two particular nodes so that energy consumption can be estimated. Since, there is no addressing scheme for sensor networks like IP-addresses and they are spatially deployed on a region, location information can be utilized in routing data in an energy efficient way [24]. One example of such protocols is GPSR [31], which is a greedy protocol. In this protocol, every node selects the next hop as the closest neighbour to the destination. In case when the node of concern is farther to the destination than all its neighbors (such a case is called the void region case), it uses perimeter forwarding based on the planar graphs concept. This research work adopts another interesting

protocol under this category, i.e. GEAR [32].

Secure Routing Problem Routing is a fundamental operation in almost all types of networks because of the introduction of inter-domain communication. Ensuring routing security is a necessary requirement to guarantee the success of routing operation. When we talk about secure routing, we are concerned with security problems that may occur due to improper actions from an assumed router. These undesired actions can be related either to the router identity or the router behavior. If the router has an undesirable identity or authorization, it is considered as an intruder who might perform serious attacks. Such attacks can be avoided by providing security services that validate the routers’ identities. On the other hand, a router that misbehaves in the network by performing undesirable routing operations also contributes to the routing security problem. However, the attacks caused by misbehaving routers can be avoided by mechanisms that validate and evaluate the router behavior in the network. In WSN, secure routing is more demanding due to the nature of the routing operation in WSN. Since WSN lacks an infrastructure, nodes depend on the cooperation among each other to route their packets. Thus, a router in WSN is simply any node that offers a routing service. This “any node” should be selected such that it will be the most secure choice to route the packet. To come up with a proper routing decision we need to understand first what security goals we are targeting.

Secure Routing Goals Security problems in WSN at the network layer can be related to router identity or router behavior. These two issues highlight two main tasks when we would like to design a secure routing solution [33, 34]. • Securing Packet Content: This task is concerned with identity related security problems. The goal of this task is to assure that the packet is not accessed by unauthorized nodes as it travels from the source to the destination. This task can be achieved by provide the following services: Data Confidentiality: In this service, only the destination node IJEEMF www.ijeemf.com

24


•

should be able to access the packet content initiated from the source node. Any intermediate router must not have any access to such information. As we can see here, the access of the packet is restricted to the destination node. Thus, if a node other than the destination accesses the packet, it means that the destination identity has been compromised. Data Integrity: When a destination node receives a message from a source, the destination should be able to detect any change that could occur in the message. Securing packet content is obtained usually based on the idea of identity trust in which a routing decision is made after verifying that the selected node is authorized and has an acceptable identity according to certain criteria. This is achieved in literature by using crypto-based systems. However, any solution must obey WSN constraints of processing capacity, memory limits and energy consumption. Securing Packet Delivery: This task deals mainly with behavior related security problems. Its objective is to guarantee that any packet transmitted will be ultimately received at the target destination. Thus, a misbehaving router node should not be able to drop a packet, misroute a packet or deny the ability of routing of other nodes by denial of service attacks. This task can be interpreted in terms of a security service called data availability. Data Availability: If a node A is authorized to get information from another node B, then node A should acquire this information at any time and without unreasonable delay. Trust aware routing: A trust aware routing protocol is a routing protocol in which a node incorporates in the routing decision its

opinion about the behavior of a candidate router. This opinion is quantified and called the trust metric. Trust metric should reflect how much a router is expected to behave, for example, forward a packet when it receives it from a previous node. Obtaining the trust metric is a problem by itself since it requires several operational tasks on observing nodes behavior, exchanging nodes’ experience and opinions as well as modeling the acquired observations and exchanged knowledge to reflect nodes trust values. A system that provides these tasks to ultimately output a “rating” or a trust value on nodes is called a reputation system.

Importance Trust aware routing in WSN is important for both securing obtained information as well as protecting the network performance from degradation and network resources from unreasonable consumption. Most WSN applications carry and deliver very critical and secret information like in military and health applications. A WSN network infected by misbehaving nodes can misroute packets to wrong destinations leading to misinformation or do not forward packets to their destination leading to loss of information. Such critical application can be very sensitive to these attacks. Having a trust aware routing protocol can protect data exchange, secure information delivery and maintain and protect the value of the communicated information. Node misbehavior can cause performance degradation as well. For example, non forwarding attacks decrease the system throughput since packets will be retransmitted many times and they are not delivered. Denial of service attacks can increase the packet delay since some nodes acting as routers will be busy in responding to the attack and enforced to delay the processing of other packets. An infected WSN network can be partitioned into different parts that cannot communicate among each other due to non forwarding attacks. This leads to the demand of increasing the number of sensors or changing the node deployment to return network connectivity. This is very expensive, however, can be avoided if a good secure routing solution is adopted. Network resources are also affected by misbehaving nodes. For example, Denial of service attacks affects IJEEMF www.ijeemf.com

25


resource availability, whether we consider an offended node as a resource for routing or we consider the availability of data itself. Also, this attack forces offended nodes to consume unnecessary energy on packet reception and processing. The information value and the network performance are directly affected by the security level provided by trust awareness of the routing operation in WSN.

symmetric and asymmetric cryptography was made efficiently. T.Zahariadi, H. Leligou [39]: A trust-aware location-based routing protocol was introduced which protects the WSN against routing attacks, and also supports large-scale WSNs deployments. The proposed solution has been shown to efficiently detect and avoid malicious nodes and has been implemented in state-of-the-art sensor nodes for a real-life test-bed. Here author concentrated on the assessment of the implementation cost and on the lessons learned through the design, implementation and validation process.

Related work S. Marti, T. Giuli presented Trust-aware Dynamic Source Routing[35]: To secure the Dynamic Source Routing (DSR) protocol, a mechanism involving the “watchdog” and “pathrater” modules has been designed and incorporated in the routing protocol .The Watchdog is responsible for detecting selfish nodes that do not forward packets. To do so, each node in the network buffers every transmitted packet for a limited period. The Pathrater assigns different ratings to the nodes based upon the feedback that it receives from the Watchdog. These rating are then used to select routes consisting of nodes with the highest forwarding rate. The dynamic source routing (DSR) protocol that has been proposed to discover routes in wireless ad-hoc networks has been extended by Pirzada et. al [36] to also take into account the trust levels (reputations) of the nodes. Exactly as happens in trusted AODV, it improves the achieved security although it cannot deal with all the possible attacks.

P. Samundiswary and P.Dananjayan [40]: A secure routing protocol named secured ad hoc on demand distance vector routing (S-AODV) is proposed for mobile sensor networks by incorporating trust based mechanism in the existing AODV. Zigbee hardware prototype is also implemented and tested by increasing the sizes of data and distances in indoor and outdoor environment. Janani.C, P.Chitra [41]: TARF designed and implemented a robust trust-aware routing framework for dynamic WSNs. This project provides trustworthy, time efficient and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both implementation and empirical experiments on large-scale.

S. Tanachaiwiwat, P.Dave proposed TRANS (Trust Routing for Location aware Sensor Networks)[37]: TRANS is a routing protocol that selects routes among nodes based mainly on trust information and not on hop-count or other metric to avoid insecure locations [37]. The protocol relies on the assumptions that the sensors know their (approximate) locations and that geographic routing (e.g., GPSR) are used. For TRANS, a trusted neighbor is a sensor that can decrypt the request and has enough trust value (based on forwarding history as recorded by the sink and other intermediate nodes).

Ahmad Abed Alhameed Alkhatib, Gurvinder Singh Baicher proposed Wireless Sensor Network Architecture [42]: Wireless sensor networks are becoming very popular technology, it is very important to understand the architecture for this kind of networks before deploying it in any application. This work explores the WSN architecture according to the OSI model with some protocols in order to achieve good background on the wireless sensor networks and help readers to find a summary for ideas, protocols and problems towards an appropriate design model for WSNs.

Raquel Lacuesta Gilaberte and Lourdes Penalver Herrero [38]: A secure routing protocol based on trust was introduced. In this research to equip the routing protocol with security, use of certificates,

Theodore Zahariadis, Helen Leligou, Panagiotis Karkazis, Panagiotis Trakadas, Ioannis Papaefstathiou, Charalambos Vangelatos, Lionel Besson[43]: Design and Implimentation of a Trust IJEEMF www.ijeemf.com

26


Aware Routing Protocol for large WSNs was introduced. The domain of Wireless Sensor Networks (WSNs) applications is increasing widely over the last few years. As this new type of networking is characterized by severely constrained node resources, limited network resources and the requirement to operate in an ad hoc manner, implementing security functionality to protect against adversary nodes becomes a challenging task. In this paper, we present a trust-aware, location-based routing protocol which protects the WSN against routing attacks, and also supports large-scale WSNs deployments. The proposed solution has been shown to efficiently detect and avoid malicious nodes and has been implemented in state-of-the-art sensor nodes for a real-life test-bed. This work focuses on the assessment of the implementation cost and on the lessons learned through the design, implementation and validation process.

based on securing the routing information from unauthorized users. Even though routing protocols of this category are already proposed, they are not efficient, in the sense that, they use the same kind of encryption algorithms for every bit of routing information they pass from one intermediate node to another in the routing path. This consumes lot of energy or power as well as time. Our routing algorithm basically behaves depending upon the trust one node has on its neighbor. The trust factor and the level of security assigned to the information flow decide what level of encryption is applied to the current routing information at a source or intermediate node. In other words, above a certain level of trust level, there is no need for the source or intermediate node to perform high level encryption on the routing information as it completely trusts the neighboring node. So based on level of trust factor, the routing information will be low-level, medium level, high level encrypted, the low-level being normal AODV. This not only saves the node‘s power by avoiding unnecessary encoding, but also in terms of time, which is very much valuable in cases of emergencies where the information is as valuable as the time.

Guoxing Zhan, Weisong Shi, and Julia Deng [44]: Multi-hop routing in wireless sensor networks (WSNs) offers little protection against deception through replaying routing information. This defect can be taken advantage of by an adversary to misdirect significant network traffic, resulting in disastrous consequences. It cannot be solved solely by encryption or authentication techniques. To secure multi-hop routing in WSNs against intruders exploiting the replay of routing information, we propose TARF, a trust aware routing framework for WSNs. Not only does TARF significantly reduce negative impacts from these attackers, it is also energy-efficient with acceptable overhead. It incorporates the trustworthiness of nodes into routing decisions and allows a node to circumvent an adversary misdirecting considerable traffic with a forged identity attained through replaying. Both our empirical and simulated experimental results indicate that TARF satisfactorily performs routing and is resilient against attacks by exploiting the replay of routing information.

Md. Shafiqul Islam, M.A. Hannan, Hasan Basri [46]: An application of Sterio Matching Algorithm for Waste Bin Level Estimation was introduced. Region based stereo matching algorithms are developed for extraction depth information from two color stereo image pair of waste bin. Depth calculation technique from a disparity map is a key part of this study. A filter eliminating unreliable disparity estimation was used for increasing reliability of the disparity map. Global Error Energy has calculated from the stereo images and smoothing function has developed within the error energy matrix. Depth has calculated from the disparity map. A technique for depth estimation and various application of this algorithm has discussed, various algorithms for depth feature extraction are also discussed. GUI has developed using Matlab for classifying the waste bin. It obtained results by algorithms were presented and compared.

K.Seshadri Ramana, A.A. Chari, Prof. N.Kasiviswanath [45]: A Trust-Based Secured Routing Protocol for Mobile Ad hoc Networks was proposed. In wireless ad hoc networks, all nodes are mobile and can be connected dynamically in an arbitrary manner for packet type communications. All nodes behave as routers and take part in discovery and maintenance of routes to other nodes in the network. They proposed a routing protocol that is

Conclusion We have studied various trust based routing protocols in WSN. Trust based routing is more secure as IJEEMF www.ijeemf.com

27


compared with other routing techniques.We can enhance the performance of trust based routing protocols in WSN by deciding the cluster head on the basis of distance and energy and the trust values of the node.

[13] Gunn, M., Simon, G., Koo, M., A comparative study of medium access control protocols for wireless sensor networks. Department of Mathematics and Computer Science, University of San Diego: San Diego, USA. p. 695-703, 2009. [14] Djenouri, D.; Khelladi, L.; Badache, A.N. “A survey of security issues in mobile ad hoc and sensor networks”, Communications Surveys & Tutorials, IEEE.Volume 7, Issue 4, Fourth Quarter 2005 Page(s):2 – 28. [15] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci,”Wireless sensor networks: a survey”, Computer Networks 38 (2002) 393–422. [16] A. Cerpa, J. Elson, M. Hamilton, J. Zhao, “Habitat monitoring: application driver for wireless communications technology”, ACM SIGCOMM’2000, Costa Rica, April 2001. [17] C. Jaikaeo, C. Srisathapornphat, C. Shen, “Diagnosis of sensor networks”, IEEE International Conference on Communications ICC’01, Helsinki, Finland, June 2001. [18] B. Warneke, B. Liebowitz, K.S.J.Pister, “Smart dust: communicating with a cubic millimeter computer”,IEEE Computer (January2001) 2–9. [19] http://www.fao.org/sd/EIdirect/EIre0074.htm [20] J.M. Kahn, R.H. Katz, K.S.J. Pister, “Next century challenges: mobile networking for smart dust”, Proceedings of the ACM MobiCom’99, Washington, USA, 1999, pp. 271–278. [21] N. Noury, T. Herve, V. Rialle, G. Virone, E. Mercier, G. Morey, A. Moro, T. Porcheron, “Monitoring behavior in home using a smart fall sensor”, IEEE-EMBS Special Topic Conference on Microtechnologies in Medicine and Biology, October 2000, pp. 607–610. [22] D. Estrin, R. Govindan, J. Heidemann, “Embedding the Internet”, Communication ACM 43 (2000) 38–41. [23] N. Priyantha, A. Chakraborty, H. Balakrishnan, “The cricket location-support system”,Proceedings of ACM MobiCom’00, August 2000, pp. 32–43. [24] Kemal Akkaya, Mohamed Younis, “A Survey on Routing Protocols for Wireless Sensor Networks”, Department of Computer Science and Electrical Engineering. University of Maryland. [25] W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks”, Proceedings of the 5th Annual ACM/IEEE

References [1] H. Chan and A. Perrig, Security and Privacy in Sensor Networks, IEEE Computer 2003. [2] A. Pirzada, C. McDonald, Establishing Trust In Pure Ad-hoc Networks, Proceedings of the 27th conference on Australasian computer science, 2004. [3] C. Karlof, D. Wagner, Secure Routing in Wireless Sensor Networks Attacks and Countermeasures, NEST 2003. [4] A. Perrig, J. Stankovic, D.Wagner, Security in Wireless Sensor Networks, Communication of the ACM, June 2004. [5] David Wagner, Resilient Aggregation in Sensor Networks, ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN ‘04), October 25, 2004. [6] Akyildiz, I.F., Su, W., Sankarasubramaniam, y., Cyirci, E., Wireless sensor networks: a survey. Computer Networks, Vol. 38 no.4: p. 393-422, 2002. [7] Pereira, P., Grielo, A., Rocha,F., Nunes, M., Casaca, C., Almsrtrom, P., Johansson, M., EndTo-End Reliability In Wireless Sensor Networks: Survey and Research Challenges. in EuroFGI Workshop on IP QoS and Traffic Control, Lisbon. 2007. [8] Koubaa, A., Alves, M., Tovar , E., Lower Protocol Layers for Wireless Sensor Networks. A Survey. IPPHURRAY Technical Report, HURRAY-TR-051101. 2005. [9] Akyildiz, I.F., Melodia, T., and. Chowdhury, K., A survey on wireless multimedia sensor networks. Computer Networks,vol.51, issue4: p. 921-960, 2007.. [10] Kazi , R., A Survey on Sensor Network. JCIT, vol.1, issue 1. 2010 [11] Yick, J., Biswanath, M., Ghosal, D., Wireless Sensor Network Survey, Computer Networks, vol.52, issue 12: p.2292-2330, 2008. [12] Bachir, A., Dohler, M., Watteyne, T., Leung, K., MAC Essentials for Wireless Sensor Networks. Communications Surveys & Tutorials, IEEE. Vol.12, issue 2: p. 222-248.

IJEEMF www.ijeemf.com

28


International Conference on Mobile Computing and Networking (MobiCom’99),Seattle, WA, August 1999. [26] C. Intanagonwiwat, R. Govindan and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks", Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'00), Boston, MA, August 2000. [27] D. Braginsky and D. Estrin, "Rumor Routing Algorithm for Sensor Networks", Proceedings of the First Workshop on Sensor Networks and Applications (WSNA), Atlanta, GA, October 2002. [28] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless sensor networks", in the Proceeding of the Hawaii International Conference System Sciences, Hawaii, January 2000. [29] A. Manjeshwar and D. P. Agrawal, “TEEN : A Protocol for Enhanced Efficiency in Wireless Sensor Networks", in the Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, San Francisco, CA, April 2001. [30] T. He et al., “SPEED: A stateless protocol for real-time communication in sensor networks”, in the Proceedings of International Conference on Distributed Computing Systems, Providence, RI, May 2003. [31] B. Karp and H. T. Kung. “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000. [32] Y. Yu, R. Govindan, and D. Estrin, “Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks”, Technical Report UCLA/CSD-TR-01-0023, May 2001. [33] A. R. Naseer, I.K. Maarouf , and M. Ashraf, “Routing Security in Wireless Sensor Networks”, Book Chapter published in Handbook of Research on Wireless Security, Publisher: Idea Group Reference, USA, 2008. [34] Yang Xio, et al. “Security and Routing in wireless Networks”, Chapter 4. Nova Science Publishers, Inc. 2005. [35] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad hoc Networks,” in Proceedings of the Sixth

Annual International Conference on Mobile Computing and Networking (MobiCom). ACM Press, pp. 255–265, 2000. [36] Asad Amir Pirzada Amitava Dattaa and Chris McDonald, “Incorporating trust and reputation in the DSR protocol for dependable routing’’. Computer Communications Volume 29, Issue 15, Pages 2806-2821,2006. [37] S. Tanachaiwiwat, P. Dave, R. Bhindwale, A. Helmy “Location-centric Isolation of Misbehavior and Trust Routing in Energyconstrained Sensor Networks” IEEE International Conference on Performance, Computing, and Communications,2004. [38] Raquel Lacuesta Gilaberte, Lourdes Peñalver Herrero, “A secure routing protocol for ad hoc networks based on trust,” Third International Conference on Networking and Services (ICNS'07), IEEE 2007. [39] T. Zahariadi, H. Leligou, P. Karkazis , “Design And Implementation Of A trust-Aware Routing Protocol For Large Wsns”, International Journal Of Network Security & Its Applications (Ijnsa), Vol.2, No.3, July 2010. [40] Janani.C, Mrs. P.Chitra “Trust Evaluation Based Security In Wireless Sensor Network”,(Ijitr) International Journal Of Innovative Technology And Research Volume No. 1, Issn 2320 –5547, Issue No. 1,2010. [41] P. Samundiswary and P.Dananjayan “Performance Analysis of Trust Based AODV for Wireless Sensor Networks”, International Journal of Computer Applications (0975 – 8887), Volume 4– No.12, August 2010. [42] Ahmad Abed Alhameed Alkhatib, Gurvinder Singh Baicher, “Wireless Sensor Network Architecture”, 2012. [43] Theodore Zahariadis, Helen Leligou, Panagiotis Karkazis, Panagiotis Trakadas, Ioannis Papaefstathiou, Charalambos Vangelatos, Lionel Besson, “Design and Implimentation of a TrustAware Routing Protocol for Large WSNs”, International Journal of Network Security & Its Applications (IJNSA), Vol.2, No.3, July 2010. [44] Guoxing Zhan1, Weisong Shi1, and Julia Deng, “TARF: A Trust-Aware Routing Framework for Wireless Sensor Networks”, 2010. [45] K.Seshadri Ramana, A.A. Chari, Prof. N.Kasiviswanath, “A Trust-Based Secured Routing Protocol for Mobile Ad hoc Networks”, 2004. IJEEMF www.ijeemf.com

29


[46] Md. Shafi qul Islam, M.A. Hannan, Hasan Basri, “An application of Sterio Matching Algorithm for Waste Bin Level”, Journal of Asian Scientific Research 2(11):731-736.

IJEEMF www.ijeemf.com

30