A Secure On-Demand Routing with Distributed Authentication for Trust-Based Ad Hoc Networks

Ad Hoc Routing with Distributed Ordered Sequences

Multicast routing protocols proposed for mobile ad hoc networks have certain limitations. Most of these protocols try to discover the route on-demand by flooding route request messages, which results in increased end-to-end latency and also consumes considerable amount of network bandwidth. These limitations make protocols not suitable for real-time multimedia communication. In this paper, we have presented an efficient mobile agents aided multicast routing (MAMR) protocol which overcomes these limitations. The protocol is a hybrid protocol where intelligent mobile agents can been integrated with existing on-demand multicast routing protocols such as multicast ad hoc on-demand distance vector (MAODV) routing protocol, on-demand multicast routing protocol (ODMRP) routing protocol and others. Here, the mobile agents move around the network and collect the routing information. This routing information assists on-demand multicast routing protocols in discovering the route in a definite path instead of flooding the route request messages, thereby achieving better end-to-end latency and reduced control traffic in the network. We have used MAODV protocol as an underlying protocol with mobile agents. The proposed MAMR protocol and MAODV have been compared through extensive simulations with end-to-end latency, packet delivery ratio and control overhead as performance parameters

Ad hoc wireless networks consist of mobile nodes in an area without any centralized access point or existing infrastructure. The network topology changes frequently due to nodes’ migrations, signal interferences and power outages. One of the ad hoc network routing protocols is the on-demand routing protocol that establishes a route to a destination node only when it is required by a source node. The overhead of maintenance is low, but it is necessary to reestablish a new route when the routing path breaks down. Several recent papers have studied about ad hoc network routing protocols avoiding the disconnection of the existing route. Each active node on the routing path detects the danger of a link breakage to a downstream node and try to reestablish a new route. The node detects a link problem, try to find a substitute local path before the route breaks down. If the local reestablishment process fails, the route breaks down. In this paper, a robust routing protocol is proposed to increase the success rate of the local route reestablishment and enhance the communication delay performance. The results of computer simulation show that the proposed routing protocol increases system performance.KeywordsMobile NodeSignal StrengthDestination NodeTransmission RangeActive NodeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.

Wireless ad hoc networks are an emerging and popular technology to the world; however, the benefits of them are actually their fragility, too. Owing to mobile node movement, the link break problem always occurs in the network. The problem greatly influences the throughput, delay, jitter, and lots of performance issues of a routing protocol. Hence, this article is proposed to evaluate the influence of link break problem on two categories of most popular routing protocols, i.e. table-driven and on-demand routing protocols. This article briefly discusses the main differences, building up mathematical model, setting up simulation environment, running the simulation, and finally presenting the simulation results and analyzing the performance. We found that the update probability of table-driven routing protocols increase exponentially with the number of mobile nodes but linearly with moving speed. On the contrary, the update probability of on-demand routing protocol increase both linearly with the number of mobile nodes and moving speed. We conclude that the effect of link break problem on table-driven routing protocols is much serious than that on on-demand routing protocols since the former has to maintain each link of the network but the latter only the links of a specific route. Table-driven routing protocols are not scalable; however, on-demand routing protocols are.

Mobile adhoc networks (MANETs) consist of mobile nodes with no fixed infrastructure. Dynamic Source Routing (DSR) which is on-demand routing protocol is a widely accepted mobile adhoc network routing protocol used to provide connectivity to mobile nodes. However, DSR and other on-demand routing protocols are vulnerable to different types of security attacks and black hole attack is one of them. In black hole attack, malicious node sends a fake route reply in response of route request to source node claiming for an optimal route to the destination. Thus, node which starts route discovery process establishes a path through malicious node and starts sending data packet on this route. Malicious node drops the data packet which reduces packet delivery ratio. To secure DSR, we propose a scheme which confirms the authenticity of route with the help of verification packet. This packet is generated by first intermediate hop in the route of route reply. Simulation results show improvement in packet delivery ratio and throughput.

The on-demand routing schemes in mobile ad hoc networks are appealing because of the lower routing overhead, compared with traditional proactive schemes. The on-demand routing protocols introduce routing overhead only in the presence of data packets that need routes. However, the control overhead of on-demand routing schemes increases with node geographic density and traffic pattern density. In fact, this is an undesirable feature for the scalable routing protocols whose control overhead should be under control to keep up with increasing offered load. As a solution for such a drawback of current reactive routing schemes, we propose the selective intermediate nodes mechanism. In this protocol, each node adaptively propagates routing information based on the local load level and cluster status. The local load level (local load status), based on channel utilization and queue size, reflects the load of the node in question and of all of its neighbors; the cluster status denotes the role of a node in a cluster (i.e., a cluster head, gateway or ordinary node). We demonstrate the effectiveness of our enhancement by applying it to ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). Simulation results show that the proposed idea significantly reduces the control overhead and improves the overall performance and scalability of the routing protocols.

With the rising interest of expedient, safe, and high-efficient transportation, vehicular ad hoc networks (VANETs) have turned into a critical technology in smart transportation systems. Because of the high mobility of nodes, VANETs are vulnerable to security attacks. In this paper, we propose a novel framework of software-defined VANETs with trust management. Specifically, we separate the forwarding plane in VANETs from the control plane, which is responsible for the control functionality, such as routing protocols and trust management in VANETs. Using the on-demand distance vector routing (TAODV) protocol as an example, we present a routing protocol named software-defined trust based ad hoc on-demand distance vector routing (SD-TAODV). Simulation results are presented to show the effectiveness of the proposed software-defined VANETs with trust management.

Pervasive computing has wide application in military, medical and smart home domain. In pervasive computing, a large number of smart objects interact with one another without the user intervention. Although the technology is promising but security needs to be addressed before the technology is widely deployed. Pervasive networks are formed spontaneously and the devices communicate via radio. Thus, mobile ad hoc networking is an essential technology for pervasive computing. An ad hoc network is a collection of wireless mobile nodes, which acts as a host as well as a router. The communication between the nodes is multihop without any centralized administration. AODV (Ad Hoc On demand Distance Vector) is a prominent on-demand reactive routing protocol for mobile ad hoc networks. But in existing AODV, there is no security provision against well-known attack known as “Black hole attack”. Black hole nodes are those malicious nodes that agree to forward the packets to destination but do not forward the packets intentionally. Thischapter extends the watchdog mechanism for the AODV routing protocol to detect such misbehavior based on promiscuous listening. The proposed method first detects a black hole node and then gives a new route bypassing this node. The experimental results show that in a lightly loaded, hostile environment, the proposed scheme improves the throughput compared to an unprotected AODV protocol.

A mobile ad hoc network is a network of mobile nodes connected by multi-hop wireless links without centralized infrastructure support. The area of ad hoc networking is receiving increasing attention in recent years. Efficient dynamic routing is an important research challenge in such a network. In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing, in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. A variety of new multipath routing protocols targeted at the ad hoc networking environment have been proposed. Multipath routing improves the throughput of ad hoc networks; it is a straightforward mechanism to recover from route losses in a dynamic network. In this paper we have considered a very well-known multipath routing protocol called ad hoc on-demand multipath distance vector routing (AOMDV) on both MAC layers, the standard IEEE 802.11 and a TDMA MAC protocol called evolutionary-TDMA (E-TDMA). We have evaluated the performance of these multipath routing through simulations using NS2 varying the number of paths (particularly we have considered 2 and 3 paths) and varying the number of temporary colors.

Bluetooth scatternet is a platform for realizing wireless personal area networks (WPANs), in which the portable Bluetooth devices may move in the range of a scatternet. This paper presents an on-demand routing protocol for the Bluetooth scatternet with mobile Bluetooth devices. We first discuss the approach of scatternet backbone formation. With the scatternet backbone, the static on-demand routing can be done easily. Furthermore, we propose an on-demand routing protocol, which can detect device movement and establish routes in a mobile scatternet. Moreover, we conduct simulation study to evaluate the performance of the proposed routing protocol.

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

In theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and we introduce the Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how RREQ aggregation can be used. ADARA is compared to AODV and OLSR using discrete-event simulations, and the results show that aggregating RREQs can make on-demand routing more efficient than existing proactive or on-demand routing protocols.

Now a days, mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime to download multimedia data or to access realtime traffic. The mobile Ad Hoc networks have several salient characteristics, such as Dynamic topologies, Bandwidth-constrained, Variable capacity links, Energy-constrained operation and Limited physical security. Due to these features, mobile Ad Hoc networks are particularly vulnerable to denial of service attacks launched through compromised node. The communication in mobile AdHoc networks comprises of two phases, the route discovery and the data transmission. In a hostile environment, adversarial nodes can try to disrupt communication in both the two phases. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. Flooding attack is a novel and powerful attack against on-demand Ad Hoc routing protocols. At present, FAP (Flooding Attack Prevention) is the single scheme proposed to resist such attack. But it may not give quality of service. In this paper, we present a Period Based Defense mechanism against data flooding attack in wireless AdHoc network. This is the new technique to defend the flooding attack. This scheme is based on the periods and uses a blacklist to efficiently prevent the data flooding attack. The main aim of this paper is to enhance the throughput of burst traffic. As a result of which, many data packets are forwarded at a high rate for the whole duration. The simulation results show that the proposed scheme enhances the throughput of burst traffic.

The virtual backbone is an approach for solving routing problems in ad-hoc wireless networks. The virtual backbone approach features low latency, moderate routing overhead and is a hybrid scheme that uses the table-driven and on-demand routing protocols. This work presents a distributed virtual backbone development scheme for ad-hoc wireless networks. Using clustering, distributed labeling and heuristic Steiner tree techniques, our scheme outperforms other schemes in terms of the size and stability of the virtual backbone and the virtual backbone change rate. Experimental results demonstrate that our scheme has lower overhead than traditional table-driven and on-demand routing schemes.