An approach of Energy Efficient and secure data transfer using multicast routing protocol in Ad Hoc Networks

Routing Information Protocol is one of the oldest Distance Vector Routing Protocol which goes under the Interior Gateway Protocol type 2. Routing Information Protocol version 1 was stated in 1988 and it was the primary routing protocol utilized on the Internet. The purpose behind utilizing the routing protocols is to decrease the time delay (Aydogan, 2010), Improve the data transmission utilization (Shih, 2010), Reducing power utilization (Khan, 2010) and decreasing the packet loss rate and also the routing overload (Hamza, 2010).

Where as, in the multi-hop wireless ad hoc networks, one or more intermediate nodes are present, which receive and forward packets through the wireless links. These networks’ have several advantages as compared to the single local wireless links like improved connectivity, extended coverage, less power and energy, cost effective higher data rates and more efficiency.

Multicasting is a simple way to send one stream of data to multiple users simultaneously. It helps in reducing the required bandwidth significantly, as it enables splitting of a single transmission among multiple users [9]. Multicasting not only optimizes the performance but also enhances the efficiency of network. For these reasons, multicasting has become the preferred transmission method for most group communication.

There are different types of routing mechanisms that will cloak certain subnets which represent all the machines in one geographic location. This means that if people do not want to see subnets within your network then there is no reason that such things should have the potential to travel through your network (Schulting). In order for people to gain access for seeing particular events, then they will need to run a special program that will allow them to gain access. This will notify your device to use its network interface card otherwise known as “NIC” to go and join a multicast group. The NIC well then use an Internet Group Management Protocol to notify the local multicast routers that it would like to join a certain group (Schulting).

Mobile Ad hoc Network”, discussed about a reputation system that relies on neighbors to monitor and identify misbehaving nodes.

In a multiple path routing infrastructure, multiple paths exists between in various networks. an Ad Hoc Network(manet) usually define as a network that has many autonomous notes, that composed of mobile devices that can arrange themselves in various ways. ad hoc on demand distance vector(aodv) is routing protocol for mobile Ad Hoc networks(manets). mobile Ad Hoc Network wireless network that transmits from device to device. in place of using a central base station( access point) to which all computers communicate, this peer to peer more of operation can profoundly change the distance of the wireless network. indicator Billy we will use AOMDV, multipath extension of

The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes. It is loop-free, self-starting, and scales to large numbers of mobile nodes.

An important issue for mobile ad hoc network is the routing protocol design. Due to frequent changes in the topology of the network this becomes a major technical challenge. Node failures and link breakages in the network may cause loss of the network resources. In signal strength based AODV, protocol measures signal strength between nodes and compare with RSSI threshold values. If it is greater than threshold value then it is accepted for further processing otherwise it is discarded. If it will not find any route between source and destination then it will switch to normal AODV which selects route on the basis of minimum hop count. The benefit of this scheme is by selecting a strong route to the destination we can increase the lifetime of the network.

In wireless two popular multicast schemes: shortest past multicast and core based tree. The shortest path multicast tree always select the shortest path from every source to every destination and source node need to build a root tree as itself. Hence, in core based multicast tree, shortest path from the source node to the destination node cannot be guaranteed, but only one tree would be needed to connect the set of the source nodes to a set of the receiver nodes. And many MANET has limited energy resources (battery), and each node operates in unattended manner. So energy efficient is an import design consideration for these networks. So we proposed energy efficient paper using multicast routing protocol according to distance from source to destination in a network.

The root initially broadcasts a DIO message (DODAG Information Object) as depicted in Figure 1. This message contains the information required by RPL nodes to discover a RPL instance, get its configuration parameters, select a parent set, and maintain the DODAG graph. Upon receiving a DIO message, a node adds the sender of the message to its parents list and determines its own rank value by taking into account the objective function referred in the DIO message. The rank value of a node corresponds to its position in the graph with respect to the root and must always be greater than its parents rank in order to guarantee the acyclic nature of the graph. It then forwards updated DIO messages to its neighbors. Based on its parents list, the node selects a preferred parent which becomes the default gateway to be used when data has to be sent toward the DODAG root. At the end of this process, all the nodes participating in the DODAG graph have an upward default route to the DODAG root. This route is composed of all the preferred parents. The DIO messages are periodically sent according to a timer set with the trickle algorithm [16] which optimizes the transmission frequency of control messages depending on the network state. A new node may join an existing network by broadcasting a DIS message (DODAG Information Solicitation) in order to solicit DIO messages from its neighbors. The DAO messages (Destination Advertisement Object)

The approach of dividing the networks into small controllable units is called as clustering. The clustering technique advances the scalability of network through ease of implementation and results energy efficient routing within the sensor networks. The clustering approach has some other advantages also like conserving communication bandwidth, avoiding redundant message transfer, localizing energy efficient route setup etc. LEACH, HEED, DECA, etc. are the energy efficient routing protocols based on clustering technique.

In ad-hoc wireless network, mobile nodes are connected by wireless links. The network is an autonomous and self-configured. It doesn’t have fixed infrastructure or centralized management. The mobile nodes in network are free to move from one place to another. Each node has transmitter and receiver which is used to send and receives the data and communicates with other nodes which are in their communication range. If any node wants to forward packet to the node which is out of range, co-operation of other nodes required; this is known as multi-hop communication. In multi-hop communication message send and received by various intermediate nodes. The network topology frequently changes due to the mobility of nodes as they move within, move into, or move out of the network. In recent years, the ad-hoc wireless network rapidly increases being used in various applications i.e. military purpose, civilian and commercial uses without the fixed infrastructure and human interference.

Abstract— Mobile Ad hoc Network (MANET) is a special self-describing wireless ad hoc network which consists of more number of nodes that can move randomly and erratically. Because of this infrastructure it enables many kinds of attacks and establish topology-exposure problem. Many of the existing multipath protocols may ignore the topology-exposure problem. In this, we proposed a TOpology-HIding multipath routing Protocol (TOHIP) for preventing attacks in topology-exposure. In TOHIP, the link connection information is hidden in route messages, so that the malicious nodes cannot conclude the network topology. In Route Reply phase, the protocol TOHIP can also be used to establish multiple node-disjoint routes and eliminate the unreliable route before transmitting packets in Route Probe phase. With the help of a newly designed protocol, security was assured and earned better capability of finding routes in MANET. The simulation result shows that TOHIP has given better performance when compared with Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol.

Abstract— this paper is an involvement in the field of security study on mobile ad-hoc networks. Boundaries of the mobile ad hoc nodes have been considered in order to design a secure Geographic routing protocol that thwarts selfish and flooding attacks. We took the base of Ad hoc On Demand Routing Protocol (AODV); the most popular Routing protocol. The significance of the proposed protocol that should make sure security as wanted by providing a broad architecture of Secured PPEM Mechanism based Multi-Hop Strong Path Geographic Routing protocol (SMHSP) based on effective key management, secure neighbor detection, secure routing data’s, finding malicious nodes, and eliminating these nodes from routing table. Our results clearly show that our secured Geographic routing protocol increases the throughput and packet delivery ratio while it has a tolerable increase in the routing overhead and average delay. Also, security study proves in details that the proposed protocol

There are many characteristics and challenges that should be taken into consideration when developing multicast routing protocols, like the dynamically changing network topology, limitation of network scalability. There are different types of protocols like unicast protocols [1], [2], cluster based protocols [3] In this paper we discuss about multicast routing for vehicular Ad hoc network which is different from other Ad Hoc networks [4]. Generally there are two types of multicast routing protocols in wireless networks. Tree-based multicast routing protocol, mesh based routing protocol [5]-[8]. In the tree-based multicasting, structure can be very much unstable in multicast ad-hoc routing protocols, as it needs frequent re-configuration in