CHAPTER II LITERATURE REVIEW. route to reach the destination and it will distribute the routing information when there is

Size: px
Start display at page:

Download "CHAPTER II LITERATURE REVIEW. route to reach the destination and it will distribute the routing information when there is"

Transcription

1 CHAPTER II LITERATURE REVIEW 2.1 HWMP Hybrid routing protocol uses distance vector routing algorithm to discover best route to reach the destination and it will distribute the routing information when there is any changes occur in the topology of the network. Hybrid routing protocols uses only less power and memory when compared with link state routing algorithm. Hybrid wireless mesh protocol (HWMP) is a basic wireless mesh network protocol. It is based on the AODV and tree based routing. The drawback of HWMP is it does not consider the security related problems. ARAN Authenticated routing for ad hoc networks (ARAN) is an on demand routing protocol that provides authentication of route discovery, route setup, and route path maintenance using cryptographic certificates. It can detect and protect against malicious attackers without requiring any predeployed network infrastructure. However, it assumes a small amount of prior security coordination among the nodes. A trusted certificate server is used whose public key is assumed to be known to all nodes. On joining the network, each node receives a certificate issued by the trusted server. The certificate received by a node contains the IP address of the node, the public key of the node, the 16

2 timestamp of creation of the certificate and the time at which the certificate would expire. A node uses its certificate for authenticating itself during the routing process. At the time of route discovery, a node broadcasts a signed route discovery packet (RDP). The RDP includes the IP address of the destination node, the certificate of the source node, a nonce, and a timestamp. The RDP is signed by the private key of the source node. Each node in the route discovery path validates the signature of the previous node, removes the certificate and the signature of the previous node, and records the IP address of the previous node. The node then signs the original contents of the packet, appends its own certificate and forwards the message after signing it with its private key. When the RDP reaches the intended destination node, the node creates a route reply packet (REP) and unicasts it back along the reverse path. The REP includes an identifier of the packet type, the IP address of the source, its certificate, the nonce, and the associated timestamp that was initially sent by the source node. On receiving the REP, the source node verifies the signature of the destination node, and the nonce. An error message (ERR) is generated if the timestamp or nonce does not match the requirements or if the certificate fails in the authenticity validation process. ARAN is a secure protocol that can prevent a number of attacks such as unauthorized participation of nodes, spoofed route signaling, spurious routing messages, alteration of routing packets, manipulation of the TTL values in the packets, and replay attacks. However, it is vulnerable to DoS attacks which are launched by flooding the network with bogus control packets. Since signature verification for each packet is required, the attacker can force a node to discard some of the control packets if the node cannot verify the signatures at the rate which is 17

3 equal to or greater than the rate at which the attacker is injecting the bogus control packets. ARIANDE Ariande is a secure on-demand routing protocols which uses the TESLA broadcast authentication routing protocol to provide security. TESLA provide authentication while broadcasting a message, it adds the Message Authentication Code (MAC). All the receivers should know MAC verification key for verification. The major disadvantage of this protocol is the route request message is not authenticated before it reaches the destination. So, the adversary can initiate route request flooding attack. 2.2 Secure efficient ad hoc distance vector (SEAD) routing protocol The secure efficient ad hoc distance vector (SEAD) is a secure and proactive ad hoc routing protocol based on the destination-sequenced distance vector (DSDV) routing protocol. The protocol deploys a one-way hash function for computing the hash chain elements which are used to authenticate the sequence numbers and the metrics of the update messages of the routing tables. The protocol ensures a mutual authentication between a source and a destination pair. The source of each routing table update message is also authenticated so as to prevent creation of any possible routing loop by an attacker which may try to launch an impersonation attack. Although the hash chains are useful for authenticating the metric and the sequence number, they are not sufficient for defending against a malicious node which can advertise the same distance and sequence number that the node has received. To defend against such malicious nodes, hash tree chains are 18

4 used in conjunction with packet leashes, in which the address of the authenticator is tied with the address of the sender node. This prevents an attacker from replaying to an authenticator that it hears in its neighborhood. The protocol uses TESLA TIK for shared key distribution among each pair of nodes in the network. SEAD can defend against routing loop attack if the loop does not contain more than one attacker. The protocol is simple and easy to implement by making a slight modifications to the DSDV protocol. The use of one-way hash chain for authentication reduces the computational complexity. The main drawback of the protocol, however, is the requirement of a trusted entity for distribution and maintenance of the verification element of each node. The trusted entity can also be a single-point-of failure in the protocol operation. 2.3 Security-aware ad hoc routing (SAR) protocol The security-aware ad hoc routing (SAR) protocol uses security as one of the key metrics in the route discovery and maintenance operations, and provides a framework for enforcing and measuring the attributes of the security metric. Unlike traditional routing protocols which utilize distance (measured by the hop-counts), location, power and other metrics for routing path determination, SAR uses security attributes (such as trust values and trust relationships among nodes) in order to define a routing metric. SAR extends ondemand ad hoc routing protocols such as AODV or DSR in order to incorporate the security metric into the route discovery messages. The protocol ensures that an intermediate node that receives an RREQ packet can process or forward it only if the 19

5 node can provide the required security or has the required authorization and trust level. If the node cannot provide the required security, the RREQ packet is dropped. If an end-toend path with the required security attributes can be found, a suitably modified RREP message is sent from an intermediate node or the destination node. The security metric of SAR can be specified by a hierarchy of trust among the nodes. In order to define the trust levels, a key distribution or secret sharing mechanism is utilized in which the nodes belonging to a particular trust level share a key among them. Since the nodes of different security levels do not share any key, they cannot decrypt or process routing packets. SAR allows an application to choose its required level of security. However, the protocol needs different keys for different levels of security. Hence, with the increase in the number of security levels to be maintained, the number of keys to be managed also increases leading to an increase in storage and computational overheads. 2.4 Secure ad hoc on-demand distance vector (SAODV) routing protocol The secure ad hoc on-demand distance vector (SAODV) routing protocol is a secure extension of the AODV protocol. The main objective of SAODV is to ensure integrity, authentication, and non-repudiation of the messages used in the AODV protocol. SAODV uses two mechanisms to secure routing messages: (i) digital signatures to authenticate the non-mutable fields of the messages, and (ii) hash chains to secure the hop count field which is the only mutable\ information in the packets. Since the protocol uses asymmetric cryptography for digital signatures, a key management mechanism is needed for enabling a node to acquire and verify the public key of other nodes in the 20

6 network. SAODV uses the following additional fields in a routing packet header: (i) the hash function field identifies the one-way hash function used for securing the hop-count information, (ii) max hop count is a counter that specifies the maximum number of nodes a packet is allowed to go through, (iii) top hash field is the result of the application of the hash function on the max hop count times to a randomly generated number, and (iv) hash field is the random number used for routing. Each time a node sends an RREQ or an RREP message, it generates a random number and sets the value of the max hop count field same as the time to live (TTL) field in the IP header. The node then sets the hash field with the random number and also sets the identifier field of the hash function. Finally, the node computes the top hash by hashing the random number max hop count times. The protocol enables the receiver node to verify the hop count of each message by applying the hash function (maximum hop count hop count) times to the value in the hash field. If the computed hash value and the value in the top hash field match, the hop count is successfully verified. Each time an RREQ message is rebroadcasted or an RREP is forwarded, the node has to apply the hash function to the hash field. Digital signatures are used to sign every field except the hop count and the hash field. Although the use of hash function and digital signature makes the scheme secure, the intermediate nodes cannot reply to an RREQ message if they have a fresh route to the destination node in their caches. In order to overcome this problem, the authors propose two solutions. The first solution does not allow the intermediate nodes to respond to a RREQ message and make then simply forward the RREQ message, since they cannot sign the message on behalf of the destination node. The second solution involves addition of a signature that 21

7 can be used by intermediate nodes to reply to an RREQ by the node that originally created the RREQ. The route error (RERRs) messages are secured using digital signatures. A node that generates or forwards an RERR message, signs the whole message (except the destination sequence number) using its shared key with its neighbor node. Since the destination node does not authenticate the destination sequence number, a node should not update the destination sequence numbers of the entries in its routing table based on the RERR messages. The performance characteristics of SAODV are similar to those of the AODV protocol. However, the communication overhead in SAODV increases very rapidly with increase in mobility of the nodes due to the use of expensive asymmetric cryptographic operations. 2.5 Secure routing protocol (SRP) The secure routing protocol (SRP) is a secure extension that can be applied to many of the existing routing protocols especially to the DSR protocol. The protocol requires the existence of a security association (SA) between a source-destination pair. This security association is utilized to establish a shared secret key between the two nodes. The protocol appends a header to each routing packet. The source node sends an RREQ with a query sequence (QSEQ) number which is used by the destination node to check whether the RREQ is outdated or valid, a random query identifier (QID) that identifies the specific request, and the output of a keyed hash function. The input to the function is the IP header, the header of the base protocol, and the shared secret key between the pair of nodes. The RREQ message generated by the source node is protected by a message authentication code (MAC) computed using the shared key between the 22

8 source-destination pair. The RRQEs are broadcast to all the neighbors of the source node. Each neighbor that receives the RREQ for the first time appends its identifier to the RREQ and further broadcasts it in the network. All nodes maintain a priority ranking of its neighbors based on the rate at which the queries are generated from them. Higher priorities are assigned to nodes which generate queries at lower rates. The destination node checks the validity of the query and verifies its integrity and authenticity by computing and matching the keyed hash value. If the query is found to be valid and if it passes the integrity and authentication verification tests, the destination node generates a number of replies (RREPs) using different routes. This protects against attacks from malicious nodes that may attempt to modify the RREPs. An RREP includes the entire path from the source to the destination, the query sequence (QSEQ) number, and the query identification (QID) number. The integrity and authenticity of an RREP message is done using message authentication code in the same manner as in case of an RREQ message. Route maintenance is done using route error messages. The route error messages are source-routed along the path which is reported to be broken by an intermediate node. When the notified node receives a route error packet, it compares the route followed by the packet with the prefix of the corresponding route as reported in the route error packet. However, this approach has a security loophole since a fabricated route error attack can be easily launched by a malicious node. SRP is a light-weight protocol that can be easily implemented on a base routing protocol. However, as mentioned earlier, it cannot prevent unauthorized modifications of routes by malicious nodes. 23

9 2.6 ARIADNE: a secure on-demand routing protocol for ad hoc networks Ariadne is a secure on-demand routing protocol that is an extension of the dynamic source routing (DSR) protocol. In contrast to the SEAD protocol which is based on hop-by-hop authentication and message integrity, Ariadne assumes an end-to-end security approach. The protocol assumes the existence of a shared secret key between a pair of nodes and uses a message authentication code (MAC) for authenticating messages using this secret key. In fact, Ariadne proposes three schemes for authentication of messages: (i) authentication between two nodes using their shared secret key, (ii) shared secrets between communicating nodes combined with broadcast authentication using TESLA and (iii) digital signatures. In TESLA, a sender node generates a one-way key chain and defines a schedule based on which the keys are disclosed in the reverse order of their generation. This makes time synchronization a critical requirement for Ariadne. In the route discovery phase, the source node sends an RREQ message that includes the IP address of the source node, an ID that identifies the current route discovery process, a TESLA time interval for indicating the expected arrival time of the request to the destination, a hash chain that includes the address of the source node, the destination node address, the ID of the destination, and two empty lists a node list and a MAC list. A neighbor, node on receiving the RREQ message, first checks the validity of the TESLA time interval so that the time interval is not too far in the future and its corresponding keys are not disclosed yet. A request with an invalid time interval is dropped by the neighbor nodes. If the time interval is valid, then the neighbor node inserts its address in 24

10 the node list, replaces the hash chain with a new one that contains the address of the neighbor nodes along with the addresses of the nodes in the previous hash chain, and appends a message authentication code (MAC) of the entire packet to the MAC list. The MAC is computed using the TESLA key that corresponds to the time interval of the RREQ message. The neighbor node then broadcasts the RREQ message further in the network. The destination node buffers the RREQ and checks for its validity. An RREQ is considered to be valid if the keys with respect to the specified time interval have not yet been disclosed, and if the included hash chain can be verified. If the RREQ message is found to be valid, the destination node generates and broadcasts an RREP message. An RREP message contains all the fields of an RREQ message. In addition, it also contains a target MAC field and an empty key list. The target MAC field is filled in using the computed MAC of the preceding fields of the RREP message and the key that the destination shares with the initiator node. The RREP message is forwarded back to the initiator along the reverse path included in the node list as specified by the DSR protocol. An intermediate node, on receiving the RREP message, waits until the specified time interval allows it to disclose its key. On expiry of the specified time interval, the intermediate node discloses the key and appends the RREP to the key list and forwards the message to the next node. Upon receiving an RREP message, the initiator node verifies the validity of each key in the key list, checks the authenticity of the target MAC, and each MAC in the MAC list. The route maintenance in Ariadne is done in a similar manner as in DSR protocol. A node forwarding a packet to the next hop along the source route returns an RERR message to the packet s original sender if it is unable to deliver 25

11 the Packet to the next hop after a limited number of retransmission attempts. The most critical requirement for the operation of the Ariadne protocol is the existence of a clock synchronization mechanism. The base Ariadne protocol is vulnerable to wormhole attack have proposed a security solution to defend against the wormhole attack using a mechanism called packet leashes. 2.7 Safeguarding Mutable Fields in AODV Route Discovery Process Assuring cryptographic integrity of mutable fields in any on-demand ad hoc routing protocol is more challenging than that of non mutable fields. We propose an efficient authentication strategy for this purpose, which leverages a recently proposed broadcast encryption (BE) scheme. We investigate some shortcomings of SAODV, a popular secure extension of the ad hoc on-demand distance vector (AODV) protocol and suggest some modifications to the protocol to overcome the shortcomings. The modifications include proactive maintenance of a secure reliable delivery neighborhood (RDN) by each node and the use of the BE based authentication strategy for mutable fields. This proposed a routing protocol that requires that all communications between one-hop neighbors be encrypted by using a group secret. A node A provides a secret KA to all its neighbors. While such an approach can keep external attackers a bay, the protocol is susceptible to attacks by malicious internal nodes which can increase or decrease the hop count employ one-hop and two-hop group secrets to facilitate two-hop 26

12 authentication. In their approach nodes proactively determine the two-hop topology and securely de liver a two-hop group secret to every two-hop neighbor. Two-hop neighborhood information is obtained by each node by exchanging their neighbor lists periodically. The use of one hop secrets can prevent external attackers from participating in the network (as packets not encrypted or authenticated with the group secret will be dropped). One-hop secrets can also be used to protect the RREQ relayed by a node from nodes not in its RDN, by encrypting the RREQ with the group secret. For the proposed protocol we shall refer to as SAODV 2 (where 2 indicates the use of two-hop authentication) we assume 1) an offline KDC who distributed secrets / public values to every node to facilitate establishment of pair wise secrets between nodes; 2) an offline KDC who has distributed authentication and verification secrets of a MSBE scheme (like A-RPS) to every node; and 3) a public / private key pair and a certificate signed by an off-line certificate authority (CA) for every node (along with an authentic copy of the public key of the CA). In SAODV-2 every node proactively maintains a secure RDN by providing a group secret to every node in the RDN. We shall represent the RDN secret of node A by KA, which is randomly chosen by A and delivered to all nodes in its RDN by encrypting KA with pair wise secrets. This RDN secret can also be used to cut off some nodes from their RDN if they are suspected of misbehavior. 2.8 Secure Data Transition over Multicast Routing In Wireless Mesh network Multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to 27

13 compute the path metric and forward data. The assumption that all nodes are honest and behave correctly during metric computation, propagation, and aggregation, as well as during data forwarding, leads to unexpected consequences in adversarial networks where compromised nodes act maliciously. In high-throughput multicast protocol in wireless mesh networks we identify novel attacks in wireless mesh networks. The attacks exploit the local estimation and global estimation of metric to allow attackers to attract a large amount of traffic. We show that these attacks are very effective against multicast protocols based on high-throughput metrics. We can say that aggressive path increases attack effectiveness in the absence of defense mechanism. Our approach to defend against the identified attacks combines measurement-based detection and accusation-based reaction techniques. The solution also accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. We demonstrate both the attacks and our defense using ODMRP, a representative multicast protocol for wireless mesh networks, and SPP, an adaptation of the well-known ETX unicast metric to the multicast setting. In this work, we study the security implications of using high-throughput metrics. We focus on multicast in a wireless mesh network environment because it is a representative environment in which high-throughput metrics will be beneficial. Although the attacks we identify can also be conducted in unicast, the multicast setting 28

14 makes them more effective and, at the same time, more difficult to defend against. We focus on mesh-based multicast protocols as they have the potential to be more resilient to attacks. We use ODMRP as a representative protocol for wireless mesh networks and SPP, a metric based on the well-known ETX unicast metric, as a high-throughput multicast metric. We selected SPP since it was shown to outperform all the other multicast metrics for ODMRP. Our approach to defend against the identified attacks combines measurement-based detection and accusation-based reaction techniques. The solution also accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself we limit the number of accusations that can be generated by a node. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. 2.9 Secure Routing for Wireless Mesh Networks This paper describes a Security Enhanced AODV routing protocol for wireless mesh networks (SEAODV). SEAODV employs Blom s key pre-distribution scheme to compute the pair wise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK are used for authenticating unicast and broadcast routing messages respectively. In wireless mesh networks, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbors. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message s authenticity and integrity in a hop-by-hop 29

15 fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency. In this paper, we present SEAODV, a security enhanced version of AODV. We utilize PTK and GTK keys to protect the unicast and broadcast routing messages respectively to ensure that the route discovery process between any two nodes in WMN is secure. We apply BLOM s key pre-distribution scheme in conjunction with the enhanced HELLO message to establish the PTK and use the established PTK to distribute GTK to the node s one-hop neighbors throughout the entire network. We also identify various attacking scenarios specifically happened in AODV and present security analysis to prove that our proposed SEAODV is able to effectively defends against most of those identified attacks. Our Scheme is lightweight and computationally efficient due to the symmetric cryptographic operations (e.g., MAC). In addition, SEAODV supports a hop-by-hop authentication as well Wireless mesh networks: a survey Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE , IEEE , IEEE , sensor networks, etc., can be accomplished through the gateway and bridging functions in the mesh routers. Mesh clients can be either stationary or mobile, and can form a client mesh network among themselves and with mesh routers. WMNs are anticipated to 30

16 resolve the limitations and to significantly improve the performance of ad hoc networks, wireless local area networks (WLANs), wireless personal area networks (WPANs), and wireless metropolitan area networks (WMANs). They are undergoing rapid progress and inspiring numerous deployments. WMNs will deliver wireless services for a large variety of applications in personal, local, campus, and metropolitan areas. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. This paper presents a detailed study on recent advances and open research issues in WMNs. System architectures and applications of WMNs are described, followed by discussing the critical factors influencing protocol design. Theoretical network capacity and the state-of-the-art protocols for WMNs are explored with an objective to point out a number of open research issues. Finally, test-beds, industrial practice, and current standard activities related to WMNs are highlighted. Multi-hop wireless network. An objective to develop WMNs is to extend the coverage range of current wireless networks without sacrificing the channel capacity. Another objective is to provide non-line-of-sight (NLOS) connectivity among the users without direct line-of-sight (LOS) links. To meet these requirements, the mesh-style multi-hopping is indispensable, which achieves higher throughput without sacrificing effective radio range via shorter link distances, less interference between the nodes, and more efficient frequency re-use. Support for ad hoc networking, and capability of selfforming, self-healing, and self-organization. WMNs enhance network performance, because of flexible network architecture, easy deployment and configuration, fault 31

17 tolerance, and mesh connectivity, i.e., multipoint-to-multipoint communications. Due to these features, WMNs have low upfront investment requirement, and the network can grow gradually as needed. Mobility dependence on the type of mesh nodes. Mesh routers usually have minimal mobility, while mesh clients can be stationary or mobile nodes. Multiple types of network access. In WMNs, both backhaul access to the Internet and peer-to-peer (P2P) communications are supported. In addition, the integration of WMNs with other wireless networks and providing services to end-users of these networks can be accomplished through WMNs. Dependence of power-consumption constraints on the type of mesh nodes. Mesh routers usually do not have strict constraints on power consumption. However, mesh clients may require power efficient protocols. As an example, a mesh-capable sensor requires its communication protocols to be power efficient. Thus, the MAC or routing protocols optimized for mesh routers may not be appropriate for mesh clients such as sensors, because power efficiency is the primary concern for wireless sensor networks. Compatibility and interoperability with existing wireless networks. For example, WMNs built based on IEEE technologies must be compatible with IEEE standards in the sense of supporting both mesh-capable and conventional Wi-Fi clients. Such WMNs also need to be inter-operable with other wireless networks such as WiMAX, Zig-Bee, and cellular networks. Throughput Maximization in Wireless Mesh Networks and its Applications Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide 32

18 network access for both mesh and conventional clients. This paper considers the interaction between channel assignment and distributed scheduling in multi-channel, multi radio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnet works in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly with algorithms, which characterized in Dijkstra and KBR (Key based routing) and also in this paper, we will discuss the applications of WMNs. Emerson process management comes under the industrial automation applications of WMNs using Wireless Hart and Emerson s smart wireless extreme applications. It is a secure and TDMA-based wireless mesh networking technology operating in the 2.4 GHz ISM radio band. Wireless HART is a newly developed industrial standard network by the Hart Communication Foundation (HCF), which is being currently replacing the existing HART network in the industries. The HART communication protocol is an open standard, master-slave token passing network protocol, where devices are connected over 4-20 ma analog loop. Process monitoring improving the overall efficiency of our plant, we can reduce costs and improve throughput. 33

19 The main advantage of this study is to reduce the time and space complexity through network partitioning. The mesh routers are usually equipped with multiple wireless interfaces operating in orthogonal channels. Mesh routers are rarely mobile and usually do not have power constraints. The issues of channel allocation, scheduling, and routing in WMNs, assuming that the traffic statistics are given. Obtaining a centralized solution wireless network does not seem to be feasible, due to the communication overhead associated with continuously collecting the queue backlog information, and due to the limited processing capability of the nodes. On the other hand, distributed algorithms usually provide only approximate solutions, resulting in significantly reduced throughput. Setting up a routing path in a very large wireless network may take a long time, and the end-to-end delay can become large. Furthermore, even when the path is established, the node states on the path may change. Thus, the scalability of a routing protocol is critical in WMNs. The control network bridging and field data backhaul, to video process monitoring and plant surveillance, Emerson s Smart Wireless technology puts valuable information within reach-easily and cost-effectively to give us better insights into what s happening in our operation. By improving the overall efficiency of our plant, you can reduce costs and improve throughput. Yet process variability can rob us of our desired efficiency. Emerson s Smart Wireless helps you easily and cost-effectively deploys the predictive intelligence needed to reduce variability and improve overall efficiency. Most plants can increase throughput by running closer to what the 34

20 process and equipment are capable of, taking advantage of capacity previously hidden by less-than-optimum performance. The digital intelligence integrated into every level of Plant Web architecture enables you to improve throughput. Improving throughput positions any organization for greater return and competitiveness, regardless of market condition. When capacity constrained, you can produce more with existing assets. When market-limited, you can achieve your target output with fewer operating units. Secure High-Throughput Multicast Routing in Wireless Mesh Networks Recent work in multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute the path metric and forward data. The assumption that all nodes are honest and behave correctly during metric computation, propagation, and aggregation, as well as during data forwarding, leads to unexpected consequences in adversarial networks where compromised nodes act maliciously. In this work we identify novel attacks against high-throughput multicast protocols in wireless mesh networks. The attacks exploit the local estimation and global aggregation of the metric to allow attackers to attract a large amount of traffic. We show that these attacks are very effective against multicast protocols based on high-throughput metrics. We conclude that aggressive path selection is a double-edged sword: While it maximizes throughput, it also increases attack effectiveness in the absence of defense mechanisms. Our approach to defend against the identified attacks combines measurement-based detection and accusation-based reaction 35

21 techniques. The solution also accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. We demonstrate both the attacks and our defense using ODMRP, a representative multicast protocol for wireless mesh networks, and SPP, an adaptation of the well- known ETX unicast metric to the multicast setting. In this work, we study the security implications of using high-throughput metrics. We focus on multicast in a wireless mesh network environment because it is a representative environment in which high-throughput metrics will be beneficial. Although the attacks we identify can also be conducted in unicast, the multicast setting makes them more effective and, at the same time, more difficult to defend against. We focus on meshbased multicast protocols as they have the potential to be more resilient to attacks. We use ODMRP as a representative protocol for wireless mesh networks and SPP, a metric based on the well-known ETX unicast metric, as a high-throughput multicast metric. We selected SPP since it was shown to outperform all the other multicast metrics for ODMRP. To the best of our knowledge, this is the first paper to examine vulnerabilities of high-throughput metrics in general, and in multicast protocols for wireless mesh networks in particular. Significant work focused on the security of unicast wireless routing protocols. Several secure routing protocols resilient to outside attacks were proposed in the last few years such as Ariadne, SEAD, ARAN, and the work. Wireless specific attacks such as flood rushing and worm-hole were identified and studied. RAP 36

22 prevents the rushing attack by waiting for several flood requests and then randomly selecting one to forward, rather than always forwarding only the first one. Techniques to defend against wormhole attacks include Packet Leashes which restricts the maximum transmission distance by using time or location information, True link which uses MAC level acknowledgments to infer if a link exists or not between two nodes, and the work in, which relies on directional antennas. The problem of insider threats in unicast was studied in Watchdog detects adversarial nodes by having each node monitors if its neighbors forward packets to other destinations. SDT and Ariadne use multi-path routing to prevent a malicious node from selectively drop-ping data. ODSBR provides resilience to colluding Byzantine attacks by detecting malicious links based on an acknowledgment-based feedback technique Routing protocols in wireless mesh networks: challenges and design considerations Wireless Mesh Networks (WMNs) are an emerging technology that could revolutionize the way wireless network access is provided. The interconnection of access points using wireless links exhibits great potential in addressing the Blast mile connectivity issue. To realize this vision, it is imperative to provide efficient resource management. Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms has been proposed for other wireless networks, and the unique characteristics of WMNs (e.g., wireless backbone) suggest that WMNs demand a specific solution. To have a clear and precise focus on 37

23 future research in WMN routing, the characteristics of WMNs that have a strong impact on routing must be identified. Then a set of criteria is defined against which the existing routing protocols from ad hoc, sensor, and WMNs can be evaluated and performance metrics identified. This will serve as the basis for deriving the key design features for routing in wireless mesh networks. Thus, this paper will help to guide and refocus future works in this area. Delivering on QoS guarantees requires a strong resource management frame-work, starting with an effective routing protocol. The multi-hop wireless nature of WMN demands a different approach to routing from conventional wireless access networks. It has much more in common with the ad hoc and sensor network fields. However, the overall properties of the individual nodes and the overall network are very different in many ways. Therefore, it is unclear exactly how applicable these approaches are to a WMN. This paper addresses the issue of routing in a WMN, by considering the specific characteristics of a WMN. It explores existing solutions, and evaluates their suitability to the wireless mesh environment. Based on this evaluation, the need for developing new routing mechanisms, specifically tailored for the unique characteristics of WMNs is assessed. A number of issues and considerations are identified and presented, in order to guide future work and the development of a WMN routing protocol. Wireless mesh networks are a unique combination of wireless technologies, exhibiting characteristics of each component (ad hoc, cellular and sensor networks). While describing these characteristics, the commonalities and differences between wireless mesh networks and 38

24 the aforementioned wireless technologies will be emphasized & Transmission medium. All communications in wireless environments have the following constraints: limited available bandwidth, dynamic changes in link capacity (due to interference, noise, etc.), and asymmetrical links (interference, multipath, etc.). Real world implementations have revealed the limitations of simulations due to the complexity of such environments, and have stressed the need for the deployment of test beds in order to assess the validity of the proposed solutions. The impact of the network conditions becomes more critical in multi-hop wireless networks such as ad hoc and mesh networks, as difficulties in bounding transmission delay and packet loss makes supporting QoS-sensitive applications very challenging. & Network deployment. In cellular networks and infrastructure-based WLANs, base stations (access points) are deployed in specific locations. In Mobile Ad hoc Networks (MANETs), the network topology is dynamically changing as users can be highly mobile although still actively participating in the network operations through packet forwarding mechanisms. Wireless mesh networks, being a hybrid technology, blend a fixed wireless backbone with an edge network consisting of mobile users. Wireless technology. Whereas base stations in cellular and ad hoc networks are primarily deployed with Omni-directional antenna technologies, the fixed backbone of WMNs seems to favor the use of directional antennas for increased throughput. However, the impact of environmental conditions on the network performance needs to be taken into consideration, otherwise the communication can significantly deteriorate due to 39

25 external phenomena such as wind or rain (causing link failure from disorientation of the antenna). Network infrastructure to support user mobility. As in ad hoc and cellular networks, users may be mobile. Therefore handoff and location management are important concerns in wireless mesh networks as well. To address these issues, distributed and centralized approaches can be considered. Distributed databases can be deployed in the access points and network gateways to maintain users profile and manage users mobility. A centralized approach can also be used, with one entity responsible for maintaining location information. Techniques can be borrowed from cellular technologies and applied to wireless mesh networks, but the communication costs, whereas of little importance in cellular networks (mainly involve fixed part of the network), have adverse effect in bandwidth-constrained wireless mesh networks. Maximize the System Throughput in Wireless Mesh Network Using Enhanced Gateway Selection Method Studying the challenging problem of optimizing gateway placement for throughput in Wireless Mesh Networks. Wireless Mesh Networks can be easily deployed without wire lines. A wireless mesh network consists of wireless mesh routers and a base station directly connected to external networks. At the centre of the wireless mesh network the base station is located and it chooses a certain number of wireless mesh routers as gateways. Finding the candidate gateways that maximize the system throughput without solving a complex optimization problem which includes a large number of parameters and involves heavy computation load easily and quickly. The 40

26 gateway performance is evaluated by numerical analysis, and also demonstrated through computer simulations. It can also be determined the appropriate candidate gateway with high accuracy when there is a certain variance in the amount of traffic generated by users at each wireless mesh router and also find the minimum number of gateways to maximize the throughput of WMN. Increasing throughput in backbone communication by adding new gateways is effectively reducing the average number of hops each packet needs to access gateways and by existing gateways it reduces the traffic load. The benefits can be diminishing due to inappropriate gateway placement; the new gateways will also result in more interference to existing gateways. Therefore the gateway placement algorithm is not only relieving traffic load in the network but also introduced minimal interference. A novel method is proposed to choose the gateway for deploying a WMN for disaster recovery; it is used to achieve the maximum system throughput. The base station can select a number of wireless mesh routers as gateways, and establish a connection with each of them. Particularly, due to the base station supports one channel, Assume that mesh routers connect to each other by the single channel. Moreover, note that we consider only one gate-way in a certain area. Here, we design a network topology to analyze the system throughput. We randomly deploy the wireless mesh router nodes within a certain area, and they contact with adjacent nodes when the distance between two of them is less than the transmission range. The Minimum Spanning Tree (MST) algorithm to delete the redundant paths and maintain the unique routing path for our network topology. 41

27 The security issues of the original standard addresses 802.1X. The issues still exist with regard to weaknesses in the WEP encryption and data integrity methods. The solution to these problems is the standard, a new standard that specifies improvements to wireless LAN networking security. The wireless vendors agreed on an interoperable interim standard known as Wi-Fi Protected Access (novel gateway system ). The goals of novel gateway system were the following: To require secure Wireless Mesh Networking a Novel gateway system requires secure Wireless Mesh Networking authentication, encryption, unicast and global encryption key management by requiring 802.1X. To address the issues with WEP through a software upgrade. The stream cipher within WEP is vulnerable to known the plaintext attacks. In addition, the data integrity provided with WEP is relatively weak. A novel gateway system with WEP solves most of the remaining security issues, yet only requires firmware updates in wireless equipment and an update for wireless clients. To be forward-compatible with the standard A subset of the security features in the standard is a novel gateway system. To be available before i standard ratification. The wireless equipment and wireless clients are upgrade using novel gateway system. Securing AODV Routing Protocol in Mobile Ad-hoc Networks In this paper, we have proposed a security schema for Ad-hoc On-Demand Distance Vector (AODV) routing protocol. In this schema, each node in a network has a list of its neighbor nodes including a shared secret key which is obtained by executing a key agreement when joining a network. One key principle in our schema is that before 42

28 executing route discovery steps in AODV protocol, each node executes message authentication process with the sender to guarantee the integrity and non-repudiation of routing messages and therefore, could prevent attacks from malicious nodes. Comparing with other recently proposed security routing protocols, our security schema needs less computation power in routing transactions and does not need any centralized element in mobile ad-hoc networks. In this paper, we examine and discuss recent secure routing protocols in order to identify the flaws of current security approaches. Based on the analysis, a security schema for AODV routing protocol has been proposed to eliminate the security flaws in the protocol and compensate identified security weaknesses in recent secure routing approaches. In this section, however, we briefly describe only two schemas: ARAN and SAODV since they are closely related to our approach. In the authors categorized three kinds of threats which are modification, impersonation and fabrication in AODV and DSR. On the basic of this analysis, the authors proposed a protocol called ARAN (Authenticated Routing for Ad hoc Networks) using cryptographic certificates to bring authentication, message-integrity and non-repudiation to the route discovery process based on the assumption of existing of a trusted certificate server. It is not appropriate with ad hoc networks because it forms a centralized element. Moreover, in this protocol, because the source node cannot authenticate intermediate nodes in the routing path, intermediate malicious nodes can use error message attacks to networks. In the authors extend the AODV routing protocol to guarantee security based on the approach of key management scheme in which each node must have certificated public keys of all nodes in the network. This work uses two mechanisms to secure the AODV 43

29 messages: digital signature to authenticate the fixed fields of the messages and hash chains to secure the hop count field. This protocol uses public key distribution approach in the ad hoc network; therefore, it is difficult to deploy and computationally heavy since it requires both asymmetric cryptography and hash chains in exchanging messages. The protocol also did not consider the, authentication of intermediate nodes; hence it could not prevent the attack of falsifying error messages in ad hoc networks. The principle of our schema is that messages in AODV must be authenticated to guarantee the integrity and non-repudiation so that the protocol can be pre- vented against several kinds of attacks. Each node in a network has its own a pair of public key e and private key d following RSA Public-key Crypto-system by self-generation, and each node contains a list of neighbor nodes with records containing the information of a neighbor node including neighbor address, neighbor public key, and a shared secret key. This information is formed after the key agreement between two neighbor nodes to negotiate a pair of keys and a shared secret key. Throughput Maximization in Wireless Mesh Networks and its Applications Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. This paper considers the interaction between channel assignment and distributed scheduling in multi-channel, multi radio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed 44

30 operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into sub networks in which simple distributed scheduling algorithms can achieve 100% throughput. The partitioning is based on the notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly with algorithms, which characterized in Dijkstra and KBR (Key based routing) and also in this paper, we will discuss the applications of WMNs. Emerson process management comes under the industrial automation applications of WMNs using Wireless Hart and Emerson s smart wireless extreme applications. It is a secure and TDMA-based wireless mesh networking technology operating in the 2.4 GHz ISM radio band. Wireless HART is a newly developed industrial standard network by the Hart Communication Foundation (HCF), which is being currently replacing the existing HART network in the industries. The HART communication protocol is an open standard, master-slave token passing network protocol, where devices are connected over 4-20 ma analog loop. Process monitoring improving the overall efficiency of our plant, we can reduce costs and improve throughput. This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). The topologies are used in order to develop a number of centralized 45

Wireless Network Security Spring 2013

Wireless Network Security Spring 2013 Wireless Network Security 14-814 Spring 2013 Patrick Tague Class #11 Control-Plane Routing Misbehavior Agenda Control-Plane Routing Misbehavior MANET Routing Misbehavior at the control-plane Toward secure

More information

SECURE ROUTING PROTOCOLS IN AD HOC NETWORKS

SECURE ROUTING PROTOCOLS IN AD HOC NETWORKS SECURE ROUTING PROTOCOLS IN AD HOC NETWORKS INTRODUCTION 1. With the advancement in radio technologies like Bluetooth, IEEE 802.11or Hiperlan, a new concept of networking has emerged, known as ad hoc networks,

More information

Wireless Network Security Spring 2015

Wireless Network Security Spring 2015 Wireless Network Security Spring 2015 Patrick Tague Class #11 Routing and Forwarding Security 2015 Patrick Tague 1 Class #11 Basics of routing in ad hoc networks Control-plane attacks and defenses Data-plane

More information

Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network

Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)

More information

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication

More information

Security in Mobile Ad-hoc Networks. Wormhole Attacks

Security in Mobile Ad-hoc Networks. Wormhole Attacks Security in Mobile Ad-hoc Networks Wormhole Attacks What are MANETs Mobile Ad-hoc Network (MANET) is a collection of wireless mobile hosts without fixed network infrastructure and centralized administration.

More information

Secure routing in ad hoc and sensor networks

Secure routing in ad hoc and sensor networks Security and Cooperation in Wireless Networks Secure routing in ad hoc and sensor networks routing in ad hoc networks; attacks on routing; countermeasures and secured routing protocols; routing security

More information

Security Issues In Mobile Ad hoc Network Routing Protocols

Security Issues In Mobile Ad hoc Network Routing Protocols Abstraction Security Issues In Mobile Ad hoc Network Routing Protocols Philip Huynh phuynh@uccs.edu Mobile ad hoc network (MANET) is gaining importance with increasing number of applications. It can be

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

3. Evaluation of Selected Tree and Mesh based Routing Protocols

3. Evaluation of Selected Tree and Mesh based Routing Protocols 33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in

More information

Secure Routing and Transmission Protocols for Ad Hoc Networks

Secure Routing and Transmission Protocols for Ad Hoc Networks MobiHoc 2002 Working Session on Security in Ad Hoc Networks Secure Routing and Transmission Protocols for Ad Hoc Networks Zygmunt J. Haas and P. Papadimitratos (Panos) Cornell University Wireless Networks

More information

Mobile Communications. Ad-hoc and Mesh Networks

Mobile Communications. Ad-hoc and Mesh Networks Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between

More information

Routing protocols in WSN

Routing protocols in WSN Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can

More information

Routing Protocols in MANETs

Routing Protocols in MANETs Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an

More information

A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network

A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk

More information

Wireless Networking & Mobile Computing

Wireless Networking & Mobile Computing Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless

More information

J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering

J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering Auburn Information Assurance Laboratory J. A. Drew Hamilton, Jr., Ph.D. Director, Information Assurance Laboratory and Associate Professor Computer Science & Software Engineering 107 Dunstan Hall Auburn

More information

AODV Routing Protocol in MANET based on Cryptographic Authentication Method

AODV Routing Protocol in MANET based on Cryptographic Authentication Method IJCSET October 2012 Vol 2, Issue 10, 1459-1464 www.ijcset.net ISSN:2231-0711 AODV Routing Protocol in MANET based on Cryptographic Authentication Method Thandu Naga Srinu Padma CSE,Sri Sunflower College

More information

Secure Multi-Hop Infrastructure Access

Secure Multi-Hop Infrastructure Access Secure Multi-Hop Infrastructure Access presented by Reza Curtmola (joint work with B. Awerbuch, D. Holmer, C. Nita-Rotaru and H. Rubens) 600.647 Advanced Topics in Wireless Networks Wireless Infrastructure

More information

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,

More information

PRIVACY AND TRUST-AWARE FRAMEWORK FOR SECURE ROUTING IN WIRELESS MESH NETWORKS

PRIVACY AND TRUST-AWARE FRAMEWORK FOR SECURE ROUTING IN WIRELESS MESH NETWORKS PRIVACY AND TRUST-AWARE FRAMEWORK FOR SECURE ROUTING IN WIRELESS MESH NETWORKS 1 PRASHANTH JAYAKUMAR, 2 P.S.KHANAGOUDAR, 3 VINAY KAVERI 1,3 Department of CSE, GIT, Belgaum, 2 Assistant Professor, Dept.

More information

Wireless Network Security Spring 2016

Wireless Network Security Spring 2016 Wireless Network Security Spring 2016 Patrick Tague Class #12 Routing Security; Forwarding Security 2016 Patrick Tague 1 SoW Presentation SoW Thursday in class I'll post a template Each team gets ~5 minutes

More information

Packet Estimation with CBDS Approach to secure MANET

Packet Estimation with CBDS Approach to secure MANET Packet Estimation with CBDS Approach to secure MANET Mr. Virendra P. Patil 1 and Mr. Rajendra V. Patil 2 1 PG Student, SSVPS COE, Dhule, Maharashtra, India 2 Assistance Professor, SSVPS COE, Dhule, Maharashtra,

More information

Wireless Network Security Spring 2016

Wireless Network Security Spring 2016 Wireless Network Security Spring 2016 Patrick Tague Class #11 - Identity Mgmt.; Routing Security 2016 Patrick Tague 1 Class #11 Identity threats and countermeasures Basics of routing in ad hoc networks

More information

Computation of Multiple Node Disjoint Paths

Computation of Multiple Node Disjoint Paths Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes

More information

Implementation of AODV Protocol and Detection of Malicious Nodes in MANETs

Implementation of AODV Protocol and Detection of Malicious Nodes in MANETs Implementation of AODV Protocol and Detection of Malicious Nodes in MANETs Savithru Lokanath 1, Aravind Thayur 2 1 Department of Electronics & Communication Engineering, DayanandaSagar College of Engineering,

More information

A Review on Black Hole Attack in MANET

A Review on Black Hole Attack in MANET A Review on Black Hole Attack in MANET Gourav Ahuja 1, Mrs. Sugandha 2 1 Department of Computer Science and Engineering, VCE, Rohtak, Haryana (India) 2 Asst. Prof., Department of Computer Science and Engineering,

More information

SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS

SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS SEAR: SECURED ENERGY-AWARE ROUTING WITH TRUSTED PAYMENT MODEL FOR WIRELESS NETWORKS S. P. Manikandan 1, R. Manimegalai 2 and S. Kalimuthu 3 1 Department of Computer Science and Engineering, Sri Venkateshwara

More information

A Novel Secure Routing Protocol for MANETs

A Novel Secure Routing Protocol for MANETs 22 A Novel Secure Routing Protocol for MANETs Zhongwei Zhang University of Southern Queensland Australia 1. Introduction Ad hoc networks is a special kind of wireless network mode. A mobile ad hoc network

More information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 9. Ad hoc Networks and Routing 1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

2013, IJARCSSE All Rights Reserved Page 85

2013, IJARCSSE All Rights Reserved Page 85 Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of

More information

Secure and Efficient Routing Mechanism in Mobile Ad-Hoc Networks

Secure and Efficient Routing Mechanism in Mobile Ad-Hoc Networks Secure and Efficient Routing Mechanism in Mobile Ad-Hoc Networks Masroor Ali 1, Zahid Ullah 2, Meharban Khan 3, Abdul Hafeez 4 Department of Electrical Engineering, CECOS University of IT and Emerging

More information

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela

Performance Evaluation of Routing Protocols in Wireless Mesh Networks. Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Performance Evaluation of Routing Protocols in Wireless Mesh Networks Motlhame Edwin Sejake, Zenzo Polite Ncube and Naison Gasela Department of Computer Science, North West University, Mafikeng Campus,

More information

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday

Lecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing

More information

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types

Kapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.

More information

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer

More information

BYZANTINE ATTACK ON WIRELESS MESH NETWORKS: A SURVEY

BYZANTINE ATTACK ON WIRELESS MESH NETWORKS: A SURVEY BYZANTINE ATTACK ON WIRELESS MESH NETWORKS: A SURVEY Sunil Goyal1 M.Tech Student, Deptt. of CSE GKU TalwandiSabo,India Vinod sharma2 Assistant Professor, Deptt. of CSE GKU TalwandiSabo,India Abstract-The

More information

Figure 1: Ad-Hoc routing protocols.

Figure 1: Ad-Hoc routing protocols. Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

Introduction to Mobile Ad hoc Networks (MANETs)

Introduction to Mobile Ad hoc Networks (MANETs) Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

Security in Ad Hoc Networks *

Security in Ad Hoc Networks * Security in Ad Hoc Networks * Refik Molva and Pietro Michiardi Institut Eurecom 2229 Route des Crêtes 06904 Sophia-Antipolis, France Abstract. In wirelesss ad hoc networks basic network operations are

More information

SUMMERY, CONCLUSIONS AND FUTURE WORK

SUMMERY, CONCLUSIONS AND FUTURE WORK Chapter - 6 SUMMERY, CONCLUSIONS AND FUTURE WORK The entire Research Work on On-Demand Routing in Multi-Hop Wireless Mobile Ad hoc Networks has been presented in simplified and easy-to-read form in six

More information

Secure Routing for Mobile Ad-hoc Networks

Secure Routing for Mobile Ad-hoc Networks Department of Computer Science IIT Kanpur CS625: Advanced Computer Networks Outline 1 2 3 4 Outline 1 2 3 4 Need Often setting up an infrastructure is infeasible Disaster relief Community networks (OLPC)

More information

Ad Hoc Networks: Issues and Routing

Ad Hoc Networks: Issues and Routing Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/

More information

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols. MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology

More information

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET 2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar

More information

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer

More information

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks

Comparison of proposed path selection protocols for IEEE s WLAN mesh networks Comparison of proposed path selection protocols for IEEE 802.11s WLAN mesh networks Sana Ghannay, Sonia Mettali Gammar and Farouk Kamoun CRISTAL lab, National School of Computer Sciences, ENSI, 2010, Manouba

More information

IEEE s ESS Mesh Networking

IEEE s ESS Mesh Networking IEEE 802.11s ESS Mesh Networking Prof. Young-Bae Ko (youngko@ajou.ac.kr) Ubiquitous Networked Systems (UbiNeS) Lab (http://uns.ajou.ac.kr) KRnet 2006 Contents Introduction - Wireless Mesh Networks IEEE

More information

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate

More information

Performance Analysis of MANET Routing Protocols OLSR and AODV

Performance Analysis of MANET Routing Protocols OLSR and AODV VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu

Chapter 5 Ad Hoc Wireless Network. Jang Ping Sheu Chapter 5 Ad Hoc Wireless Network Jang Ping Sheu Introduction Ad Hoc Network is a multi-hop relaying network ALOHAnet developed in 1970 Ethernet developed in 1980 In 1994, Bluetooth proposed by Ericsson

More information

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)

2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service) 2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing

More information

Vendor: HP. Exam Code: HP2-Z32. Exam Name: Implementing HP MSM Wireless Networks. Version: Demo

Vendor: HP. Exam Code: HP2-Z32. Exam Name: Implementing HP MSM Wireless Networks. Version: Demo Vendor: HP Exam Code: HP2-Z32 Exam Name: Implementing HP MSM Wireless Networks Version: Demo QUESTION 1 A network administrator deploys several HP MSM APs and an HP MSM Controller. The APs discover the

More information

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path

More information

Wireless Mesh Networks

Wireless Mesh Networks Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate

More information

An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks

An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks December 1. 2006 Jong Oh Choi Department of Computer Science Yonsei University jochoi@emerald.yonsei.ac.kr Contents Motivation

More information

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS

A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen

More information

Implementation: Detection of Blackhole Mechanism on MANET

Implementation: Detection of Blackhole Mechanism on MANET Implementation: Detection of Blackhole Mechanism on MANET Mr. Vishwajith M V 1, Pratik Sanjel 2, Pranish Pokharel 3, Kshetiz Pokhrel 4 1 Assistant professor Information Science & Engineering Department,

More information

Security Issues in Mobile Ad hoc Network Noman Islam 1, Zubair A.Shaikh 2

Security Issues in Mobile Ad hoc Network Noman Islam 1, Zubair A.Shaikh 2 Security Issues in Mobile Ad hoc Network Noman Islam 1, Zubair A.Shaikh 2 1 National University of Computer and Emerging Sciences, Karachi, Pakistan 2 DHA Suffa University, Karachi Mobile Ad hoc Networks

More information

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures By Chris Karlof and David Wagner Lukas Wirne Anton Widera 23.11.2017 Table of content 1. Background 2. Sensor Networks vs. Ad-hoc

More information

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol 1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks

More information

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0

White Paper. Mobile Ad hoc Networking (MANET) with AODV. Revision 1.0 White Paper Mobile Ad hoc Networking (MANET) with AODV Revision 1.0 This page is intentionally blank, or rather nearly blank. Table of Contents TABLE OF CONTENTS...3 TABLE OF FIGURES...4 WHAT IS MANET?...5

More information

A Survey of Existing Approaches for Secure Ad Hoc Routing and Their Applicability to VANETS

A Survey of Existing Approaches for Secure Ad Hoc Routing and Their Applicability to VANETS NEC Technical Report NLE-PR-2006-19, NEC Network Laboratories, March 2006, 28 pages. A Survey of Existing Approaches for Secure Ad Hoc Routing and Their Applicability to VANETS Version 1.1 June 2, 2006

More information

Part I. Wireless Communication

Part I. Wireless Communication 1 Part I. Wireless Communication 1.5 Topologies of cellular and ad-hoc networks 2 Introduction Cellular telephony has forever changed the way people communicate with one another. Cellular networks enable

More information

An Industrial Employee Development Application Protocol Using Wireless Sensor Networks

An Industrial Employee Development Application Protocol Using Wireless Sensor Networks RESEARCH ARTICLE An Industrial Employee Development Application Protocol Using Wireless Sensor Networks 1 N.Roja Ramani, 2 A.Stenila 1,2 Asst.professor, Dept.of.Computer Application, Annai Vailankanni

More information

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala. Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction

More information

A Research Study On Packet Forwarding Attacks In Mobile Ad-Hoc Networks

A Research Study On Packet Forwarding Attacks In Mobile Ad-Hoc Networks A Research Study On Packet Forwarding Attacks In Mobile Ad-Hoc Networks (MANET) Bhaskar Kumawat, Dev Kumar Computer Science & Information Communication, Suresh Gyan Vihar University, India Abstract In

More information

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET) INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,

More information

WiMAX Security: Problems & Solutions

WiMAX Security: Problems & Solutions (JCSCR) - ISSN 2227-328X WiMAX Security: Problems & Solutions Paul Semaan LACSC Lebanese Association for Computational Sciences Registered under No. 957, 2011, Beirut, Lebanon Abstract This paper is a

More information

Defenses against Wormhole Attack

Defenses against Wormhole Attack Defenses against Wormhole Attack Presented by: Kadhim Hayawi, ID: 20364216 COURSE PRESENTATION FOR ECE750 - INTELLIGENT SENSORS AND SENSOR NETWORKS Prof. Otman A. Basir Outline Introduction Packet Leashes

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

Subject: Adhoc Networks

Subject: Adhoc Networks ISSUES IN AD HOC WIRELESS NETWORKS The major issues that affect the design, deployment, & performance of an ad hoc wireless network system are: Medium Access Scheme. Transport Layer Protocol. Routing.

More information

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Mina Malekzadeh Golestan University Zohre Fereidooni Golestan University M.H. Shahrokh Abadi

More information

Webpage: Volume 4, Issue VI, June 2016 ISSN

Webpage:  Volume 4, Issue VI, June 2016 ISSN SECURE DYNAMIC SOURCE ROUTING IN MOBILE ADHOC NETWORKS Pooja Sharma 1, Seep Sethi 2 1 M.Tech (ECE), 2 Head of ECE Department Somany (PG) Institute of Technology & Management, Rewari Abstract: A mobile

More information

An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks

An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract

More information

A Survey - Energy Efficient Routing Protocols in MANET

A Survey - Energy Efficient Routing Protocols in MANET , pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram

More information

Abstract of the Book

Abstract of the Book Book Keywords IEEE 802.16, IEEE 802.16m, mobile WiMAX, 4G, IMT-Advanced, 3GPP LTE, 3GPP LTE-Advanced, Broadband Wireless, Wireless Communications, Cellular Systems, Network Architecture Abstract of the

More information

Power aware Multi-path Routing Protocol for MANETS

Power aware Multi-path Routing Protocol for MANETS Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile

More information

Considerable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network)

Considerable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network) Editorial imedpub Journals http://www.imedpub.com/ American Journal of Computer Science and Information Technology DOI: 10.21767/2349-3917.100025 Considerable Detection of Black Hole Attack and Analyzing

More information

DETECTING, DETERMINING AND LOCALIZING MULTIPLE ATTACKS IN WIRELESS SENSOR NETWORK - MALICIOUS NODE DETECTION AND FAULT NODE RECOVERY SYSTEM

DETECTING, DETERMINING AND LOCALIZING MULTIPLE ATTACKS IN WIRELESS SENSOR NETWORK - MALICIOUS NODE DETECTION AND FAULT NODE RECOVERY SYSTEM DETECTING, DETERMINING AND LOCALIZING MULTIPLE ATTACKS IN WIRELESS SENSOR NETWORK - MALICIOUS NODE DETECTION AND FAULT NODE RECOVERY SYSTEM Rajalakshmi 1, Umamaheswari 2 and A.Vijayaraj 3 1 Department

More information

INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH IN ENGINEERING AND TECHNOLOGY WINGS TO YOUR THOUGHTS..

INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH IN ENGINEERING AND TECHNOLOGY WINGS TO YOUR THOUGHTS.. INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH An Overview of Mobile Ad-Hoc Networks: Architecture, Routing and Challenges Avadhesh Kumar 1 Sonali Yadav 2 Kamalesh Chandra Maurya 3 1 Assistant Professor, avadhesh@iul.ac.in

More information

Reliable Broadcast Message Authentication in Wireless Sensor Networks

Reliable Broadcast Message Authentication in Wireless Sensor Networks Reliable Broadcast Message Authentication in Wireless Sensor Networks Taketsugu Yao, Shigeru Fukunaga, and Toshihisa Nakai Ubiquitous System Laboratories, Corporate Research & Development Center, Oki Electric

More information

Ad Hoc Networks: Introduction

Ad Hoc Networks: Introduction Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2

More information

15-441: Computer Networking. Wireless Networking

15-441: Computer Networking. Wireless Networking 15-441: Computer Networking Wireless Networking Outline Wireless Challenges 802.11 Overview Link Layer Ad-hoc Networks 2 Assumptions made in Internet Host are (mostly) stationary Address assignment, routing

More information

Network Security: Broadcast and Multicast. Tuomas Aura T Network security Aalto University, Nov-Dec 2011

Network Security: Broadcast and Multicast. Tuomas Aura T Network security Aalto University, Nov-Dec 2011 Network Security: Broadcast and Multicast Tuomas Aura T-110.5241 Network security Aalto University, Nov-Dec 2011 Outline 1. Broadcast and multicast 2. Receiver access control (i.e. data confidentiality)

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

More information

CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING

CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING 99 CHAPTER 5 AN AODV-BASED CLUSTERING APPROACH FOR EFFICIENT ROUTING 5.1 INTRODUCTION Dynamic network topology and limited system resources characterize mobile ad hoc networking. Many routing protocols

More information

SRPS: Secure Routing Protocol for Static Sensor Networks

SRPS: Secure Routing Protocol for Static Sensor Networks SRPS: Secure Routing Protocol for Static Sensor Networks Hamoinba Vebarin and Samourqi Difrawi International Awarness Institute Email: {hvebarin, sdifrawi}@iwi.org.jp Abstract In sensor networks, nodes

More information

Performance Analysis of Aodv Protocol under Black Hole Attack

Performance Analysis of Aodv Protocol under Black Hole Attack International Journal of Scientific & Engineering Research Volume 2, Issue 8,August-2011 1 Performance Analysis of Aodv Protocol under Black Hole Attack Monika Roopak, Dr. Bvr Reddy ABSTRACT- Mobile Ad-hoc

More information

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.

Anil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput. Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK COMPARISON OF MANET REACTIVE ROUTING PROTOCOLS USING OPNET SIMULATOR SANGEETA MONGA

More information

Performance Evaluation of AODV and DSR routing protocols in MANET

Performance Evaluation of AODV and DSR routing protocols in MANET Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and

More information

Performance Analysis of AODV under Worm Hole Attack 1 S. Rama Devi, 2 K.Mamini, 3 Y.Bhargavi 1 Assistant Professor, 1, 2, 3 Department of IT 1, 2, 3

Performance Analysis of AODV under Worm Hole Attack 1 S. Rama Devi, 2 K.Mamini, 3 Y.Bhargavi 1 Assistant Professor, 1, 2, 3 Department of IT 1, 2, 3 International Journals of Advanced Research in Computer Science and Software Engineering Research Article June 2017 Performance Analysis of AODV under Worm Hole Attack 1 S. Rama Devi, 2 K.Mamini, 3 Y.Bhargavi

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 6 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so

More information

Eradication of Vulnerable host from N2N communication Networks using probabilistic models on historical data

Eradication of Vulnerable host from N2N communication Networks using probabilistic models on historical data Volume 117 No. 15 2017, 1087-1094 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Eradication of Vulnerable host from N2N communication Networks using

More information

UNIT 1 Questions & Solutions

UNIT 1 Questions & Solutions UNIT 1 Questions & Solutions 1. Give any 5 differences between cellular wireless networks and ADHOC wireless network. Ans: The following table shows the difference between cellular networks and Adhoc wireless

More information