AD HOC Networking And Mobile Computing Computer Science Essay

Published: Last Edited:

This essay has been submitted by a student. This is not an example of the work written by our professional essay writers.

Ad-hoc networks are an emerging area of mobile computing. There are various challenges that are very efficient. These are mostly due to the resource poorness of these networks. They are usually set up in situations of emergency, for temporary operations or simply if there are no resources to set up elaborate networks. The Ad-hoc network is able to throw up new requirements and problems in all areas of networking. The solutions for conventional networks are usually not sufficient to provide efficient Ad-hoc operations. The wireless nature of communication and lack of any security infrastructure raise several security problems. In this paper we attempt to analyze the demands of Ad-hoc environment. We focus on three areas of Ad-hoc networks, key exchange and management, Ad-hoc routing, and intrusion detection. Even if the key issues concerning these areas have been addressed here. In the conclusion, We have tried to compile solutions to these problems that have been active areas of research.


Ad-hoc networks are a new paradigm of wireless communication for mobile hosts. No fixed infrastructure such as base stations as mobile switching .The Nodes within each other radio range communicate directly via wireless links while these which are far apart rely on other nodes to relay messages. It causes frequent changes in topology.

Security Goals

Ensures survivability in spite of Denial of Service attacks. On physical and medium right of entry control layer attacker can use jamming technique to interfere with statement on physical channel. On network layer the attacker can disturb the routing protocol. On higher layers, the attacker could bring down high level services e.g.: key management service. Ensures certain in sequence are never disclosed to illegal entities. Message being broadcast is never corrupted. This enables a node to ensure the identity of the peer node it is communicating with. Without which an attacker would copy a node, thus gaining unauthorized access to resource and sensitive information and interfering with operation of other nodes. Ensures that the origin of a message cannot deny having sent the message.


Use of wireless links renders an Adhoc network vulnerable to link attacks ranging from passive eavesdropping to active masquerade, message replay and message deformation. Eavesdropping is a mechanism that might give an invader access to secret information thus violates discretion. Active attacks could range from deleting messages, inject erroneous messages; copy a node etc thus violating ease of use, integrity, authentication and no repudiation. Nodes are roaming freely in an antagonistic environment with moderately poor physical protection have non negligible probability of being compromise. Hence, we need not to consider hateful attacks not only from outside but also from within the network from compromised nodes. For high survivability Adhoc networks should have a dispersed architecture with no central entities, centrality increase vulnerability. Ad-hoc network is dynamic due to frequent changes in topology.

Key Management

Cryptographic schemes such as digital signatures are often employed to protect both routing info as well as data. Public key systems are the key impacts generally advocate because of its upper hand in key sharing. In public key communications each node has a public/private key pair. Public keys discrete to other nodes, while private keys are kept to nodes themselves and that too in secret. Third party (trusted) called guarantee Authority (CA) is used for key management.CA has a public/private key pair, with its public key known to every node and signs certificate compulsory public keys to nodes. The trusted CA has to stay online to reflect with the current bindings, since the bindings could change eventually. Encryption is Public key should be revoked if the owner node is no longer trusted or is out of network. A single key management examine for an Ad-hoc network is almost certainly not a good idea, since it's likely to become Achilles’ heel of the network. If CA is down/unavailable nodes cannot get the current public keys of other nodes to institute secure connection. Also if a CA is compromise, the attacker can sign any mistaken certificates with the private key. The main concepts is based on Naive duplication of CA can make the network more susceptible, since conciliation of a single replica can cause the system to fail. Hence it's more prudent to hand out the trust to a set of nodes by letting these nodes share the key management dependability.

Secure Routing

The up to date routing protocols for Adhoc networks cope well with energetically changing topology but are not designed to have room for defense against malicious attackers. No single standard protocol. The Capture common securities threats and provide guide principle to secure routing protocol. Routers exchange network topology unceremoniously in order to establish routes between nodes another possible target for malicious attackers who intend to bring down the network. As the effect External attackers - inject incorrect routing info, replaying old routing info or distort routing info in order to dividing wall a network or overloading a network with retransmissions and incompetent routing. Internal compromise nodes - more severe discovery and correction more not easy Routing info signed by each node won't work since pacification nodes can generate valid signatures using their private keys. Due to dynamic topology of Adhoc

However, the limitation of finite energy provides concerns about the customary belief that nodes in ad hoc networks will always relay packets for each other. Consider a user in a campus environment equipped with a laptop. As partof his daily activity, the user may participate in different adhoc networks in classrooms, the library and coffee shops. He might expect that his battery-powered laptop will last without recharging until the end of the day. When he participates in these different ad hoc networks, he will be expected to relay traffic for other users. If he accepts all relay requests, he might run out of energy prematurely. Therefore, to extend his lifetime, he might decide to reject all relay requests. If every user argues in this fashion, then the throughput that each user receives will drop dramatically. We can see that there is a networks, warrant that if an assailant who succeeds in compromising one of the participants at a later time would be unable to figure out the session key resultant from previous runs of protocol.

Problems in Existing System

An Ad-hoc network is a communications less network. Unlike traditional networks there is no redeployed communications such as centrally administered routers or strict policy for underneath end-to-end routing.

The nodes themselves are accountable for routing packets. Each node relies on the other nodes to route packets for them. Mobile nodes in direct radio range of one another can communicate directly, but nodes that are too far apart to communicate in a straight line must depend on the midway nodes to route messages for them. If each and every player participates in the creation of the final session key, by making a donation, then it is called contributing key agreement. Not only strong attackers who can disrupt communication by jamming radio channels etc but even the weaker attackers who can insert but cannot change or delete messages sent by players are also provided for.

Ad-hoc networks contain nodes that may recurrently change their locations. Hence the topology in these networks is extremely dynamic. This results in regularly changing neighbors on whom a node relies for routing. This mandate new routing protocols that can handle the dynamic topology by facilitate fresh route discoveries. As if relationships among individual nodes also changes, particularly when some nodes are found to be compromised. Security mechanism need to be on the fly (dynamic) which and not static and should be scalable. Hundreds of thousand of nodes.

As the communication is through wireless medium, it is possible for any interloper to tap the communication easily. Wireless channels present poor protection and routing related control messages can be tampered. And distort them to manipulate routes. Routing protocols should be well adopted to handle such tribulations.

Current Ad-hoc routing protocols intrinsically trust all participant. Most Ad-hoc routing protocols are helpful by nature and depend on adjoining nodes to route packets. This naive trust model allows hateful nodes to paralyze an Ad-hoc network by inserting mistaken routing updates, replaying old messages, changing routing updates or advertising mistaken routing information. The variation is high in the case of structured management. Does not use bandwidth except when needed. Much network in the clouds in the flood process when querying for routes. Initial delay in traffic

The source requests the relay nodes to forward its traffic to the destination. A relay node has the option to either accept or refuse the request. We assume that a relay node communicates decision to the source by transmitting either a positive ora negative acknowledgment. If a negative acknowledgment issent, the traffic session is blocked. A session is said to belongto type j, if at least one of the nodes involved belongs toclass j and the class of any other node is less than or equal to j2. As an example, consider a session with two relays. Letthe source belong to class 1, the first relay to class 2 and thesecond to class 1. Then, the session is of type 2. It will becomeclear later in the paper that the interaction between nodes ina session is dominated

Attacks using fabrication

Multicast network support is becoming a more and more important technology for both military and profitable distributed and group based applications. The security services such as discretion, genuineness and data integrity are necessary for both wired and wireless networks to protect basic applications. In this paper we present a reproduction based study of the impact of different types of attacks in mobile ad hoc networks. We consider the most common type of attacks namely Gray whole attack and Worm whole attack. Specifically, we study how these attacks affect the performance metrics of a multicast session such as packet release ratio, packet latency and packet consumed energy. Between S and X.

Among all the research issues, security is an essential requirement in ad hoc networks. Compared to wired networks, are more vulnerable to security attacks due to the lack of at rusted centralized authority, easy eaves dropping because of shared wireless medium, dynamic network topology, low bandwidth, battery power and memory constraints of the mobile devices. The security issue of MANETS in group communication is even more challenging because of multiple senders and multiple receivers. Several types of security attack in MANETS have been studied it he literature, and the focus of earlier research is on unicast applications. The impacts of security attacks on multicast in ad hoc networks have not yet been solved.

The susceptibility is that an attacker could easily exploit this method of learning routes and poison route caches. Suppose a malicious node M wanted to poison routes to node X. If M were to broadcast spoofed packets with source routes to X via itself, neighboring nodes that overhear the packet transmission may add the route to their route cache.

Routing table overflow attack

In routing table overflow attack, the assailant attempt to create route to missing nodes. The goal of the assailant is to create enough routers to prevent new routes from being created or be too intense the protocol. Completion and flush out rightful routes from routing tables. Proactive routing algorithms attempt to discover routing information even before they are needed, while reactive algorithms create only when they are needed. This makes proactive algorithms more vulnerable to table overflow attacks.

The complexity and uniqueness of network make them more vulnerable to security threats than their wired counterparts. Attacks on ad hoc wireless networks can be classified as passive and active attacks, depending on whether the normal operation of the network is disrupted or not.

Passive attacks: A passive attack does not disturb the normal operation of the network; the attacker snoops the data exchanged in the network without altering it. Here the requirement of discretion gets violated. Detection of passive attack is very difficult since the operation of the network itself doesn’t get affected. One of the solutions to the problem is to use powerful encryption mechanism to encrypt the data being transmitted, there by making it impossible for the attacker to get useful information from the data overhead. Network based: Network based IDS sits on the network gateway and imprison and examines network packets that go through the network hardware interface. Host based: Host based IDS relies on the operating system review data to monitor and analyze the events produce by the users or programs on the host.