Route Request Research Articles

A Novel Source Based Min-Max Battery Cost Routing Protocol for Mobile Ad Hoc Networks

In the existing energy efficient routing protocols for mobile ad hoc networks such as minimum battery cost routing (MBCR) and min-max battery cost routing (MMBCR) the cost functions are calculated in the route request phase and the decision of selecting a route is taken by the destination node. It is more cost effective and energy efficient if the cost functions are calculated in the route reply phase and the decision of selecting a route for data transmission is taken by the source node. In this paper I propose a novel routing algorithm for mobile ad hoc networks called Source based min-max battery cost routing (SBMMBCR) protocol wherein the routing decision is taken by the source node considering the changes in energy levels during the route reply phase. The performance of the proposed protocol is compared with the existing MMBCR protocol based on application oriented metrics such as throughput, packet delivery ratio, end-to-end delay, normalized routing load and residual energy. Simulation is carried out using NS2. From the simulation results it is observed that the proposed protocol SBMMBCR outperforms MMBCR by giving more network lifetime as well as better throughput, packet delivery ration. Average end-to-end delay is less and the residual energy is also more for SBMMBCR as compared to MMBCR protocol.

Analysis of Mesh Topology of NoC for Blocking and Non-blocking Techniques

Network on Chip is efficient on-chip communication architecture for system on chip architectures. It enables the integration of a large number of computational and storage blocks on a single chip. The router is the basic element of NoC. The router architecture can be used for building a NoC with standard topology with low latency and high speed. In this paper, we implement and analyze a 3x3 mesh network configuration with routers which can support simultaneous routing requests, with blocking and non blocking inputs.

Delay-constrained anycast routing problem in WDM networks with wavelength conversions

Anycast routing and wavelength assignment problem has been intensively studied in wavelength-division multiplexing (WDM) networks, however, real-time application where packets have explicit expiration deadlines is not taken into consideration. In a WDM network, each link is associated with limited wavelengths available for channel connections. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay of message transmission. When the network and the set of anycast routing requests are given, the delay-constrained wavelength conversions anycast routing (DWCAR) problem is to find a set of light-paths, one for each source, for anycasting message to one member of the anycast destination group. The objective is to find a minimum number of wavelength conversions with the constraint that the sum of delays along every path must not exceed a given delay-bound. In this paper, we present a Tabu-search based delay-constrained anycast routing algorithm (TSDA) to solve this NP-complete problem, and compare it to a simple K shortest path based anycast algorithm (KSPA). Simulation results show TSDA achieves an average 40–50% improvement in required wavelength conversions.

Secured and Optimized AODV for Wireless Sensor Networks

Similar to conventional wireless networks, WSNs are based on multi hop routing to ensure connectivity and data forwarding which makes the routing service a challenging task due to the nature of sensors usually limited in memory, battery and computing capacities as well as the nature of the environment which is hostile and unpredictable making the routing protocols developed for conventional wireless network useless for WSNs without modifications and adaptations for the new context of WSNs. Thus in this paper we present an optimized version of AODV protocol for WSNs which takes into consideration the traffic pattern of WSNs and sensors' constraints. In the proposed protocol we affect the task of route discovery to the base station which periodically informs sensors about its location instead of letting this task to sensors which consumes the network resources due to the broadcasting nature of the route discovery. We have also proposed a key distribution scheme destined to establish a symmetric encrypting key between each sensor and the base station, the proposed key management scheme uses the underlying routing requests to execute handshakes and key update which have greatly saved the network resources and ensured a good threshold of security.

Routing bandwidth guaranteed paths for traffic engineering in WiMAX mesh networks

SUMMARYIn this paper, the authors present a novel algorithm for computing bandwidth guaranteed paths for traffic engineering in WiMAX IEEE 802.16 standard based networks using the mesh topology. The underlying algorithm fulfills routing requests ‘on the fly’ without a priori knowledge of future requests. This problem is motivated by the need for efficient handling of traffic and network resource utilization. The key idea behind the solution is the use of heuristic methods to defer routing through certain nodes, which have a higher chance of getting selected because of hop constraints, so that they can be prevented from congestion. Simulation‐based performance evaluation shows that the proposed algorithm performs well in comparison with the selected benchmarks on metrics such as the number of rejected requests and the active links present in the network. Copyright © 2013 John Wiley & Sons, Ltd.

A Novel Routing Scheme for Mobile Ad Hoc Network

Mobile Ad hoc Network (MANET) is a collection of mobile users without any support of fixed infrastructure. The nodes in these networks have several constraints such as transmission power, bandwidth and processing capability. In addition to it an important parameter of interest is the residual battery power of the nodes. Conventional routing schemes do not take this aspect into consideration. Therefore this paper proposes a routing strategy that takes this aspect into consideration by modifying the Route Request (RREQ) packet of the Ad hoc On demand Distance Vector (AODV) routing protocol. The protocol chooses a threshold below which a node is not allowed to relay data/control packets. The results show a remarkable improvement in the value of Packet Delivery Ratio (PDR), throughput and at the same time the network lifetime is not affected.

Design principles of an operator-owned highly distributed content delivery network

Mobile network operators are experiencing a tremendous increase in data traffic due to the growing popularity of bandwidth-intensive video services. This challenge can be faced either by boosting the capacity of the network infrastructure, or by means of offloading traffic from the backhaul and core network and serving contents from distributed cache servers close to the users. Network operators can extend the coverage of traditional CDNs by making usage of caching locations much closer to the users than traditional CDNs. Additionally, network operators can optimize the caching and delivery of contents by exploiting the complete knowledge of their network for designing a cost-effective infrastructure able to achieve both improved user satisfaction and cost savings. This article provides thoroughly justified design principles for a highly distributed operator-owned CDN while focusing on four key aspects: the optimal location of cache servers, mechanisms for request routing, content replica placement, and content outsourcing and retrieval.

A DSR-based routing protocol for mitigating blackhole attacks on mobile ad hoc networks

A mobile ad hoc network is a collection of mobiles, autonomous nodes that communicate in a cooperative manner over a wireless channel without any fixed infrastructure, nor built-in security. As such, this type of network is vulnerable to different types of attacks such as blackhole and wormhole attacks. A blackhole attack is a type of attack where the malicious node so-called blackhole node can attract all the data packets by using a forged route reply packet to falsely claim that it has a shortest route to the destination, thereby dropping all the data packets that it receives. In this paper, an improved version of a dynamic source routing DSR protocol so-called detecting blackhole attack based on DSR DBA-DSR is proposed to combat against blackhole attacks in mobile ad hoc networks. Unlike other solutions, which adopt a reactive approach in which blackhole nodes are identified only after the attack has been carried out on the network, our DBA-DSR scheme detects and isolates the blackhole nodes prior to the actual routing process. This is achieved by using fake route request packets. Simulation results are provided, demonstrating the superiority of DBA-DSR over DSR in terms of network throughput, packet delivery ratio, and routing overhead, chosen as performance metrics, when blackhole nodes are present in the network. Copyright © 2013 John Wiley & Sons, Ltd.

Analysis of MANET dynamic source routing and its performance enhancements

SUMMARYSince the inception of the dynamic source routing (DSR) protocol for mobile ad hoc networks, several enhancements have been proposed, along with other competing routing protocols. All of them provide different degrees of throughput improvement under different scenarios. In this paper, we use DSR as a base, diagnose the contribution of its constituent components, and provide the reason why certain routing enhancements can increase the throughput and under what conditions. A major finding of the study is that the broadcast mechanism used in propagating route request and route error messages has a significant impact on how routing behaves. We also show that unicast route error report and preventive cache update improve throughput at different sides of the mobility spectrum. Finally, we show that aggressive buffer combined with route management provides the best performance improvement on the entire mobility and loading spectrum. Copyright © 2013 John Wiley & Sons, Ltd.

A Counterattack-Detection Scheme in Transmission Time-Based Wormhole Detection Methods

In recent years, the Mobile Ad hoc Network (MANET) is getting more important and is being utilized in various fields. However, routing-disruption attacks have become a serious problem for MANET. In various routing-disruption attack detection methods, transmission time-based methods can detect wormhole attacks efficiently. Attackers might fabricate a time stamp for a Route Request Packet (RREQ) or Route Reply Packet (RREP) to evade wormhole detection methods. To resolve this weakness, we propose a counterattack-detection scheme in transmission time-based wormhole detection methods. In this paper, we show that it is possible for an attacker to find an effective counterattack against wormhole detection methods, so we provide a counterattack-detection scheme. In the first phase, our proposed method uses the transmission time per hop extracted from a RREQ. If the attackers fabricate the RREQ's starting time to evade our proposed method, we can detect this counterattack using the RREQ's transmission time in the second phase, because the fabricated starting time makes the transmission time shorter than the original transmission time. The simulation shows that our proposed method has high reliability for detecting both wormhole attacks and the attacker's counterattack.

A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.

Implementation of Black Hole Security Attack using Malicious Node for Enhanced - DSR Routing Protocol of MANET

Ad hoc Network (MANET) is a group of movable hosts with wireless network interfaces that structure a temporary network without the support of any permanent infrastructure or central administration. A MANET is also referred as an infrastructure less network because the mobile nodes in the network dynamically locate paths among themselves to transfer packets provisionally. Due to the dynamic network topology in ad hoc network nodes are exchanging plenty of routing packets for creating communication which intern increase network overhead and also increase collision in network. This brings about the matter of security in an ad hoc network. Security is core concern in routing protocol of MANET and affects the performance. In this paper, a innovative request forwarding mechanism is proposed in which source node generates route request packet and broadcast packet to other neighbor nodes to locate destination by implementing black hole attack. Proposed EM-DSR (Enhanced Malicious DSR) is implemented on NS-2 and results shown significant improvement over original DSR in terms of various performance metrics. it has been found that on dense network certain numbers of malicious nodes are supportive to reducing communication overhead and because of density negative effect of malicious attacks which is proposed EM-DSR that is able to reduce. Hence result shows proposed EM-DSR will be helpful to decrease communication overhead. KeywordsEM-DSR (Enhanced Malicious DSR), Secured Routing, Black hole attack, malicious nodes, Selfish nodes, Ad hoc network.

A survey of service Discovery Architecture of MANET with AODV-SD

Mobile Adhoc Network (MANET) is network of a no. of mobile routers and associated hosts, organized in a random fashion via wireless link. MANET has been widely used for not only military purposes but for search-andrescue operations, intelligent transportation system, data collection, virtual classrooms and ubiquitous computing. There are various Issues in MANET like Routing, MAC Layer issues, Transport protocol, QoS, Data Mgt. And Security etc. from them Service Discovery is one of the most important issues in MANET. Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with a minimum of manual efforts. Most of the service discovery protocols such as DEAPspace, UPnP, Konark, Salutation, Jini, and SLP. These protocols don’t provide an appropriate route from consumer to service provider. Hence after services are discovered, a route request needs to be initiated in order to access the service. In this paper proposing an efficient, robust and flexible approach to service discovery for MANET that not only discovers a service provider, but at the same time, it also provides a route to access the service.

An Environmental Monitoring Network with AODVjr-PB Routing Algorithm

In this paper, we propose a practical scheme for an environmental monitoring network using an AODVjr-PB routing algorithm and the IEEE 802.15.4 MAC protocol. Based on AODV junior (AODVjr) routing, we designed a novel routing algorithm: AODVjr accompanied by a piggyback mechanism (AODVjr-PB). In AODVjr-PB, the data packet (DATA) was encapsulated in the Route Request packet (RREQ) during propagation of RREQ from its source to the destination. In addition, the acknowledgement packet (ACK) was packaged in the Route Reply packet (RREP) when RREP is transferred from its destination to the source. In this way, the communication overhead was significantly reduced. The MAC protocol of our network was the IEEE 802.15.4 standard, which is suitable for building wireless sensor networks (WSNs). We deployed a real WSN, each node in the network consisted of a single chip microcomputer (SCM) with an 8051 core, several sensors, an RF module, and four AA batteries. We further employed a blacklist table to test the large-scale network performance in an indoor environment. The experimental results prove that our design outperforms the network with AODVjr routing algorithm in terms of transmission delay, delivery success rate, and data rate.

Routing Discovery Algorithm Using Parallel Chase Packet

On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C). Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

Performance Comparison on Trust Based Power Aware Reliable On Demand Routing Protocol in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a collection of mobile wireless nodes, which communicate to each other without any centralized administration. Trust and Power consumption is the most challenging task in routing protocol design for Mobile ad hoc networks (MANETs), since the highly dynamic nature of MANET coupled with limited bandwidth and battery power imposes severe restrictions on routing protocols especially on achieving the routing. Furthermore replacing and recharging batteries and making nodes co-operative are often impossible in significant environments. In this paper, we effort to study the performance of three on- demand routing protocols (AODV, DSR, DYMO) in terms of number of hop counts, number of routes selected, number of RREQ packets, number of RREP packets and power consumption in transmit, received and ideal modes. During route discovery, nodes are more trust to find reliable route for communication and utilizing maximum energy capacity for selection of route. Route based selection of nodes called 'Reliability'. Route request from the source is accepted by a node only if its reliability is high. Otherwise, the route request is discarded. This approach forms a reliable route from source to destination thus increasing network life time, improving power utilization and decreasing number of packet loss during transmission. To solve the above problem here we describe the three on demand routing and it is simulated using QualNet 5.0 simulator.

6LoWPAN Local Repair Using Bio Inspired Artificial Bee Colony Routing Protocol

Abstract Due to recent advances of heterogeneous network and the emergence of Internet of Things (IoT), wireless sensor network (WSN) are assumed to be part of huge heterogeneous network.The IEEE 802.15.4 standard introduces WSN from personal area network (PAN) into low power personal area network (LoWPAN). This standard is a low cost, low rate, low power wireless personal area network technology. Hence, 6LoWPAN is defined by Internet Engineering Task Force (IETF) as Internet Protocol (IP) applied into IEEE 802.15.4 devices. 6LoWPAN Ad Hoc On-Demand Distance Vector Routing (LOAD) and 6LoWPAN Ad Hoc On- Demand Distance Vector Routing with Multipath Scheme (MLOAD) are based on Ad-Hoc on Demand Distance Vector (AODV), and simplify the routing protocol for 6LoWPAN mesh network. The AODV, LOAD and MLOAD for 6LoWPAN mesh network to broadcast route request (RREQ) message of route discovery is devoid of load the whole network overhead. In this paper, we proposed the 6LoWPAN Local Repair Using Bio Inspired Artificial Bee Colony (ABC) to find a route to the destination that reduce network overhead of route discovery.

Ad Hoc On-Demand Multipath Distance Vector Routing Protocol Based on Node State

To improve the performance of Ad hoc on-demand multipath distance vector (AOMDV) protocol, we proposed NS-AOMDV which is short for “AOMDV based on node state”. In NS-AOMDV, we introduce node state to improve AOMDV’s performance in selecting main path. In route discovery process, the routing update rule calculates the node weight of each path and sorts the path weight by descending value in route list, and we choose the path which has the largest path weight for data transmission. NS-AOMDV also uses the technology of route request (RREQ) packet delay forwarding and energy threshold to ease network congestion, limit the RREQ broadcast storm, and avoid low energy nodes to participate in the establishment of the path. The results of simulation show that NS-AOMDV can effectively improve the networks’packets delivery rate, throughput and normalized routing overhead in the situation of dynamic network topology and heavy load.

A Fuzzy Rule Based Forensic Analysis of DDoS Attack in MANET

Mobile Ad Hoc Network (MANET) is a mobile distributed wireless networks. In MANET each node are self capable that support routing functionality in an ad hoc scenario, forwarding of data or exchange of topology information using wireless communications. These characteristic specifies a better scalability of network. But this advantage leads to the scope of security compromising. One of the easy ways of security compromise is denial of services (DoS) form of attack, this attack may paralyze a node or the entire network and when coordinated by group of attackers is considered as distributed denial of services (DDoS) attack. A typical, DoS attack is flooding excessive volume of traffic to deplete key resources of the target network. In MANET flooding can be done at routing. Ad Hoc nature of MANET calls for dynamic route management. In flat ad hoc routing categories there falls the reactive protocols sub category, in which one of the most prominent member of this subcategory is dynamic source routing (DSR) which works well for smaller number of nodes and low mobility situations. DSR allows on demand route discovery, for this they broadcast a route request message (RREQ). Intelligently flooding RREQ message there forth causing DoS or DDoS attack, making targeted network paralyzed for a small duration of time is not very difficult to launch and have potential of loss to the network. After an attack on the target system is successful enough to crash or disrupt MANET for some period of time, this event of breach triggers for investigation. Investigation and forensically analyzing attack scenario provides the source of digital proof against attacker. In this paper, the parameters for RREQ flooding are pointed, on basis of these parameters fuzzy logic based rules are deduced and described for both DoS and DDoS. We implemented a fuzzy forensic tool to determine the flooding RREQ attack of the form DoS and DDoS. For this implementation various experiments and results are elaborated in this paper.

Improving MANET Routing Protocols Through the Use of Geographical Information

This paper provides a summary of our research study of the location-aided routing protocols for mobile ad hoc networks (MANET). This study focuses on the issue of using geographical location information to reduce the control traffic overhead associated with the route discovery process of the ad-hoc on demand distance vector (AODV) routing protocol. AODV performs route discovery by flooding the whole network with the route request packets. This results in unnecessarily large number of control packets traveling through the network. In this paper, we introduced a new Geographical AODV (GeoAODV) protocol that relies on location information to reduce the flooding area to a portion of the network that is likely contains a path to destination. Furthermore, we also compared GeoAODV performance with that of the Location Aided Routing (LAR) protocol and examined four mechanisms for reducing the size of the flooding area: LAR zone, LAR distance, GeoAODV static, and GeoAODV rotate. We employed OPNET Modeler version 16.0 software to implement these mechanisms and to compare their performance through simulation. Collected results suggest that location-aided routing can significantly reduce the control traffic overhead during the route discovery process. The comparison study revealed that the LAR zone protocol consistently generates fewer control packets than other location-aided mechanisms. However, LAR zone relies on the assumption that location information and traveling velocities of all the nodes are readily available throughout the network, which in many network environments is unrealistic. At the same time, the GeoAODV protocols make no such assumption and dynamically distribute location information during route discovery. Furthermore, the collected results showed that the performance of the GeoAODV rotate protocol was only slightly worse than that of LAR zone. We believe that even though GeoAODV rotate does not reduce the control traffic overhead by as much as LAR zone, it can become a preferred mechanism for route discovery in MANET.