Reduce Routing Overhead Research Articles

A reliable QoS-aware routing scheme for neighbor area network in smart grid

A reliable bi-directional communication network is one of the key factors in smart grid (SG) to meet application requirements and improve energy efficiency. As a promising communication infrastructure, wireless mesh network (WMN) can provide high speed and cost-effect communication for SG. However, challenges remain to maintain high reliability and quality of service (QoS) when applying WMNs to SG. In this paper, we first propose a hybrid wireless mesh protocol (HWMP) based neighbor area network (NAN) QoS-aware routing scheme, named HWMP-NQ, to meet the QoS requirements by applying an integrated routing metric to route decision with effective link condition probing and queue optimization. To further improve the reliability of the proposed HWMP-NQ, we present a multi-gateway backup routing scheme along with a routing reliability correction factor to mitigate the impact of routing oscillations. Finally, we evaluate the performances of the proposed schemes on NS3 simulator. Extensive simulations demonstrate that HWMP-NQ can distinguish different applications and satisfy the QoS requirements respectively, and also improve the average packet delivery ratio and throughput with a reduced routing overhead, even with a high failure rate of mesh nodes.

An Analysis of The Mechanism for Reducing Routing Overhead in Mobile Ad Hoc Network Using Probabilistic Rebroadcast Technique

Mobile ad hoc network (MANETs) consist of nodes which are continuously moving, this causes continuous link breakage due to which there is frequent path failure occurs and route discoveries is required. The fundamental technique for route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request (RREQ) packet unless it has route to the destination. This mechanism incur retransmission which causes overhead and decrease the packet deliverance ratio and increase the end delay, which cannot be avoided. In this paper we proposed reducing routing overhead in mobile ad hoc network using probabilistic rebroadcast mechanism. In this we have introduced rebroadcast delay to determine the neighbour coverage knowledge which will be useful in finding accurate additional coverage ratio and rebroadcast order. To provide node density adaptation we have also defined connectivity factor. By addition of the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify decrease in the routing overhead by decreasing the number of retransmission and improvement in routing performance.

Location based Routing Protocols: A Survey

Mobile Ad-Hoc Networks (MANET) or Wireless sensor Network (WSN) is a collection of wireless nodes without any centralized access point, topology or centralized administration. Because of this conditions, network overhead and packet delivery ratio get affected. Hence to reduce routing overhead and increase packet delivery ratio in this type network, there are many routing protocols are developed by researchers. Here we are presenting a survey of such routing protocol that make forwarding decision based on node geographic position and route packets only in the direction of destination node. This type of limited flooding reduces the routing overhead in the network. To know the node position, GPS or some other Location services are used.

Efficient Routing with Reduced Routing Overhead and Retransmission of Manet

Adhoc network is a collection of mobile nodes that dynamically form a temporary network and are capable of communicating with each other without the use of a network infrastructure. In manet nodes can change location and configure itself, the mobility of nodes causes continuous link breakage due to which frequent path failure occur and route discovery is required. The fundamental construction for a route discoveries is broadcasting in which the receiver node blindly rebroadcast the first received route request packet unless it has route to the destination. The routing overhead associated with route discovery is very high which leads to poor packet delivery ratio and a high delay to be victorious this type of routing overhead we are proposing the new technique using NCPR. To intended NCPR method is used to determine the rebroadcast order and obtain the more precise additional coverage ratio by sensing neighbor coverage knowledge. We can also define connectivity factor to provide node density adaptation. By combining the additional coverage ratio and connectivity factor, rebroadcast probability is determined. The approach can signify improvement in routing performance and decrease the routing overhead by decreasing the number of retransmission.

IJARCCE - Computer and Communication Engineering

2 Abstract: 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. (1 to 3). 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.(4) 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.

Mobile Agent Supported on Demand Routing Method to Lessen Link Failure in MANET

The ultimate goal of this study is to reduce routing overhead and latency by using mobile agent to get the information about the mobile nodes. The mobile agent is a software program that able to migrate from one node to another node. The mobile agent is not executes under any controller. In this study, the mobile agent is used to get the information about link duration and the energy of the nodes. The source node accesses the information from the mobile agent by using Remote procedure call. When there exists a link between source and destination means it will directly transmit the data to the destination or otherwise transmit via relay node. The relay node is selected based on the link duration and energy of the node. So, the proposed technique reduces the link failure and routing overhead. The performance of the proposed scheme is analyzed by using the simulator NS2.

A review and a new approach to reduce routing overhead in MANETs

Mobile Ad hoc networks are characterized by a frequently changing in the network topology and the need of an efficient dynamic routing protocol. In this work, we have compared the performance of fi...

A Novel Highly Dynamic Choice Routing Scheme for Mobile Adhoc Network

This study aims to improve the performance of the traditional routing protocol for MANET such as DSR and AODV in terms of delay and overhead. The proposed routing scheme is called as Highly Dynamic Choice Routing (HDCR) which adopts with the highly dynamic environment of MANET. The link residual life is estimated to reduce the link failure before forwarding data through a node. The velocity of the moving mode is considered while choosing the next forwarder node. This enables the HDCR to decrease the delay in the network. The proposed routing scheme reduces routing overhead and reduces the delay. This scheme reduces the link failure too. The performance is evaluated by using the simulation results obtained by using NS2 simulator.

ENHANCED LOCATION BASED SELF-ADAPTIVE ROUTING ALGORITHM FOR WSN IN INDUSTRIAL AUTOMATION

Today’s most sensitive research area is industrial automation. Traditionally, wired communication used in industrial automation. Nowadays wireless communication increases robustness of network in industrial automation rather than wired. For this purpose use of WSN is done in industrial automation using ZigBee network, AODV routing protocol is supported by network layer of ZigBee network. In this paper a new routing algorithm is proposed which increases packet delivery ratio and reduces routing overhead by full use of location information of nodes and self-adaptation of request zone.

A traffic flow-oriented routing protocol for VANETs

AbstractThis paper presents a novel position-based routing protocol for vehicular ad hoc networks (VANETs) to enhance traffic safety and traffic organization and facilitate driving through a smart transportation system. The protocol is referred to as the traffic flow-oriented routing (TFOR) protocol for VANETs. It considers a real-time urban scenario with multi-lane and bi-directional roads. It chooses junction optimally considering vehicular traffic flows to accomplish robust routing paths and thereby forwarding the data packets. The new junction selection mechanism and routing between the junctions is based on two-hop neighbor information, which increases packet-delivery ratio and decreases end-to-end delay. We designed, implemented, and compared TFOR against existing routing protocols of VANETs (greedy-perimeter stateless routing (GPSR), geographic source routing (GSR), and enhanced greedy traffic-aware routing (E-GyTAR)). Simulation outcomes in urban scenarios show that TFOR minimizes average end-to-end delay and routing overhead by on average 15.3% and 19.5%, respectively, compared to GPSR. It reduces routing overhead up to 17% compared to GSR. TFOR maximizes packet-delivery ratio on an average of 17.5%, 10.7%, and 7.2% compared to GPSR, GSR, and E-GyTAR, respectively.

An Improved Directional Broadcast Algorithm Based on Brownian Motion

Several broadcast algorithms have been developed in recent years. However, the problem of reducing routing overhead in ad hoc networks is always to be concerned. This paper proposes an improved directional broadcast algorithm based on Brownian motion for AODV protocol (DBB-AODV). We bring Brownian motion into network model and gain the distribution of the nodes which encountered destination before. This algorithm uses encounter records to predict the direction to destination and forwards RREQ packets with reasonable probability according to the distribution just mentioned. Simulation results indicate that DBB-AODV saves up to 20% of average routing overhead compared to the probabilistic protocol and about 80% of the blind flooding.

English

English

On the packet loss overhead in buffer-limited ad hoc networks

This paper focuses on the routing overhead analysis in ad hoc networks. Available work in this research field considered the infinite buffer scenario, so that buffer overflow will never occur. Obviously, in realistic ad hoc networks, the node buffer size is strictly bounded, which leads to unavoidable packet loss. Once a packet is dropped by a relay node, the bandwidth consumption for the previous transmission is actually wasted. We define the extra wasted bandwidth as the packet loss (PL) overhead. A theoretical analysis framework based on G/G/1/K queuing model is provided, to estimate the PL overhead for any specific routing protocols. Then, with this framework, we propose a distributed routing algorithm termed as novel load-balancing cognitive routing (NLBCR). The OPNET network simulator is further conducted to compare the performance among the NLBCR, AODV and CRP. The results indicate that NLBCR can reduce routing overhead to a considerable extent, as well as improve the network throughput and decrease the end-to-end delay.

Approach-and-Roam (AaR): A Geographic Routing Scheme for Delay/Disruption Tolerant Networks

Considering that delay/disruption-tolerant networks (DTNs) suffer from a large variation of network topology, geographic routing is an alternative scheme that utilizes real-time geographic information instead of network topology information. However, the real-time geographic information of mobile destination is likely unavailable due to sparse network density. With this in mind, we propose a geographic routing scheme by relying on historical geographic information to estimate the movement range of destination. The idea is to make efficient message replication toward this estimated range via the proposed Approach Phase to reduce routing overhead. Meanwhile, the effective message replication within this range is guaranteed via the proposed Roam Phase to increase the message delivery ratio. We further propose a novel scheme to handle the local maximum problem for geographic routing in sparse networks. Simulation results obtained assuming the maps of three real world cities, namely, Helsinki, Finland; Karlsruhe, Germany; and Manhattan, New York City, USA, show an advantage of the proposed Approach-and-Roam (AaR) over the compared algorithms in terms of delivery ratio, average delivery latency, and overhead ratio.

Research and Improvement of Clustering Routing Algorithm in Ad Hoc Network

With the expansion of the network, especially in the case of the nodes frequently moving, clustering routing protocol can reduce the impact of the changed topology on routing protocols, and improve the network scalability and reduce routing overhead. Based on the analysis of the problems of CBRP clustering routing protocol, this paper presents a CRBAC clustering routing algorithm based on ant colony algorithm. The simulation results show that, in the circumstance that the algorithm doesnt significantly increase the routing overhead, improved clustering routing protocol CRBAC get better performance than CBRP. They reflect on the clusters structure more reasonable and stable, the average end-to-end delay and network lifetime significantly improved.

Challenges in Mobile Ad Hoc Network for Secure Data Transmission

An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. LAR is an on-demand protocol who is based on the DSR (Dynamic Source Routing). The Location Aided Routing protocol uses location information to reduce routing overhead of the ad-hoc network! Normally the LAR protocol uses the GPS (Global Positioning System) to get these location information’s. With the availability of GPS, the mobile hosts knows there physical location. Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks - multiple routes between nodes to defend routing against denial of service attacks.

Injection and Evaluation of New Attacks on Ad hoc Proactive Routing Algorithms

Providing security of communications in Mobile Ad hoc Networks (MANETs) is one of the most significant fields for researchers. In order to provide security, the first step is to recognize vulnerabilities and examine different implementable attacks regarding such networks. Secure routing is one of the most important security blind spots regarding MANETs. Security of routing in MANETs can be endangered by uncooperative behavior of nodes. Uncooperative behavior can be done selfishly by refraining from participation in routing or maliciously in the form of an attack against network. One of the most famous and devastating routing attacks regarding MANETs is Black hole. In Optimized Link State Routing (OLSR), as one of the most well-known proactive routing algorithms, Black hole attack can be implemented in different methods. In this paper, effects of different selfish behaviors and different implementations of Black hole on OLSR based MANETs is studied. In order to evaluate network parameters, network simulator (NS-2) tool has been used. Simulation results demonstrate that a special implementation of Black hole, compared to other implementations and selfish nodes, has had more destroying effects on the network. Furthermore, such an attack results in a reduction in routing overhead and delay in transmitting packets compared to basic OLSR. Keywords-Mobile Ad hoc Network; Black hole Attack; Selfish Node; OLSR

A NEW POLICY FOR PATH SELECTION IN DYNAMIC SOURCE ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

In standard DSR protocol, nodes automatically discover and maintain the routes in the network by storing source routes, discovered dynamically on-demand. They maintain route caches that contain the source routes which the node is aware of. Entries are continually updated when new routes are learned and reorder the cached routes according to the traditional shortest path policy. The problem with this approach is that, while the source is still using the primary shortest route, the primary route might fail and the source would remain unaware of that its cache contains a recent/fresh route, which has the same number of hop count and to the same destination. Thus, we proposed a method to improve the performance of DSR protocol by increasing packet delivery ratio and reducing routing overhead by adopting a path selection mechanism. In this study, we present a new strategy for route selection in DSR protocol that uses the recent-short path as routing metric. It calls RSRS. Basically, RSRS depends on the construction time and the hop-count of the cached route for route selection. Since, it utilizes the recent -short path in the route cache as routing metric. The proposed method has been implemented in GloMoSim simulator and its performance compared to the conventional DSR protocol and we have reached more important and comparable simulation results. The simulation results confirmed that the SRSR method improved packet delivery ratio, reduction of routing overhead, number of dropped packets and number of failure links.

IMPULSE RADIO ULTRA WIDE BAND BASED MOBILE ADHOC NETWORK ROUTING PERFORMANCE ANALYSIS

This study presents with the routing overhead analysis of impulse radio - Ultra Wide Band based wireless networks which Employs Dynamic Nature Routing (EDNR) method for determining and selecting the stable route in Mobile Adhoc Network (MANET). This method requires only two sample packets and uses piggyback information on Route-Request (RREQ) and Route-Reply (RREP) packets during a route-discovery procedure. Conventional ENDR results in better routing overhead and packet delivery ratio characteristics with higher energy consumption. The proposed method explores the characteristics of UWB nature of routing based on Node lifetime and Link lifetime prediction for reducing the required bandwidth while maintaining higher packet delivery and lower routing overhead. Simulation results illustrate the improvement of packet delivery ratio by 5% and reduction of routing overhead by 4.8% of the proposed UWB EDNR method over the conventional EDNR method. For higher packet delivery ratio and reduced routing overhead with efficient bandwidth utilization can be achieved by applying UWB based EDNR routing that is desired for real time data communications.

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.