Reduce Routing Overhead Research Articles

QoS in Node-Disjoint Routing for Ad Hoc Networks

Ad hoc network (MANET) is a collection of mobile nodes that can communicate with each other without using any fixed infrastructure. To support multimedia applications such as video and voice MANETs require an efficient routing protocol and quality of service (QoS) mechanism. Node-Disjoint Multipath Routing Protocol (NDMR) is a practical protocol in MANETs: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. QoS support in MANETs is an important issue as best-effort routing is not efficient for supporting multimedia applications. This paper presents a novel adaptation of NDMR, QoS enabled NDMR, which introduces agent-based SLA management. This enhancement allows for the intelligent selection of node-disjoint routes based on network conditions, thus fulfilling the QoS requirements of Service Level Agreements (SLAs).

EHRP: Enhanced hierarchical routing protocol for zigbee mesh networks ee

This letter proposes the enhanced hierarchical routing protocol (EHRP) for ZigBee mesh networks. The EHRP finds the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">shortest hierarchical path</i> based on the ZigBee hierarchical addressing scheme. The EHRP provides efficient and reliable routing paths. In addition, the EHRP is completely compatible with ZigBee v.1.0 standard. Simulation results demonstrate that the EHRP reduces routing overhead and route discovery delay of ZigBee mesh networks significantly compared with the hierarchical routing protocol (HRP) defined in ZigBee v1.0.

Multiple Tree Video Multicast Over Wireless Ad Hoc Networks

In this paper, we propose multiple tree construction schemes and routing protocols for video streaming over wireless ad hoc networks. The basic idea is to split the video into multiple parts and send each part over a different tree, which are constructed to be disjoint with each other so as to increase robustness to loss and other transmission degradations. Specifically, we propose two novel multiple tree multicast protocols. Our first scheme constructs two disjoint multicast trees in a serial, but distributed fashion, and is referred to as serial multiple disjoint tree multicast routing protocol. It achieves reasonable tree connectivity while maintaining disjointness of two trees. In order to reduce routing overhead and construction delay, we further propose parallel multiple nearly-disjoint multicast trees protocol, which is also shown to achieve reasonable tree connectivity. Simulations show that resulting video quality for either scheme is significantly higher than that of single tree multicast, with similar routing overhead and forwarding efficiency

존 기반 MANET에서의 주소 자동 설정 기술을 이용한 라우팅 프로토콜

MANET의 규모가 커짐에 따라 라우팅 성능이 저하되는 문제를 해결하기 위해 대규모의 단일 MANET(mobile ad hoc network)을 존(zone) 이라는 이름의 여러 개의 소규모 MANET들로 분할한 계층형 구조가 제안되고 있다. 본 논문에서는 주소 자동 설정 과정을 통해 얻은 각 노드의 정보들을 MANET 라우팅 기법에 접목하여, 라우팅 프로토콜의 메시지 수를 줄이거나 라우팅 동작 절차를 간소화함으로써 MANET 노드들의 라우팅 부하를 감소시키는 기법을 제안하였다. 제안된 방법은 모의 실험을 통하여 기존 방식의 라우팅 성능을 유지하면서 라우팅 메시지 전송 부하를 줄일 수 있음을 확인하였다. In large-scale MANETs, the performance of MANET routing protocols is degraded significantly. To avoid this, zone-based hierarchical architecture is proposed. In this architecture, single large-scale MANET is divided into multiple small-scale MANETs. In this paper, we propose autoconfiguration-coupled MANET routing protocol to reduce routing overhead of mim user nodes. If MANET routing protocol utilizes the autoconfigured information of each user node, its overhead or procedure can be reduced. Proposed method shows the degradation of routing overhead of user nodes via simulation.

RBR: a region-based routing protocol for mobile nodes in hybrid ad hoc networks

In hybrid ad hoc networks, mobile nodes can communicate not only with each other in a self-organizing manner, but also with nodes on wired networks for extensive information retrieval and dissemination. In this article we consider efficient routing operations between any two nodes in an ad hoc network that is linked to wired networks by an access point. To build routes with low routing overhead efficiently, we develop a new routing scheme of region-based routing (RBR), which utilizes hop counts between mobile nodes and the access point to localize a route discovery within a limited topological region. Limiting the region of route discovery results in fewer routing messages and therefore reduces routing overhead. Simulation results show that the RBR scheme greatly reduces routing overhead while preserving a high rate of success for route discovery to the destination

Ad hoc on‐demand multipath distance vector routing

AbstractWe develop an on‐demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well‐studied single path routing protocol known as ad hoc on‐demand distance vector (AODV). The resulting protocol is referred to as ad hoc on‐demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns‐2 simulations shows that AOMDV is able to effectively cope with mobility‐induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end‐to‐end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley &amp; Sons, Ltd.

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols.

A location routing protocol based on smart antennas for ad hoc networks

Ad hoc networks are a type of mobile networks that function without any fixed infrastructure. One of the weaknesses of ad hoc networks is that route between a source and a destination is likely to break during communication. Location-based routing algorithms are promising in reducing routing overhead in ad hoc networks. Existing location-based routing algorithms employ the Global Positioning System (GPS) as their location information provider, and synchronize information network-wide. Nonetheless, these protocols have some limitations because the use of GPS is not realistic in certain circumstances. Since smart antenna is able to infer direction and ranging information between pairs of ad hoc node, the obtained local position information can be used to improve routing mechanism. This work proposes a novel Location-Enhanced On-Demand (LEOD) routing protocol which is based on smart antenna technique. The LEOD protocol utilizes local position instead of global position to discover routes and make routing decision for the ad hoc network. Theoretical computation and simulation results show that data packet loss rate decreased significantly compared to other methods well-documented in the literature. In addition, this protocol reduces the network control overheads and the power consumption. It also improves network average throughput.

Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks

On-demand routing protocols are widely used in mobile ad hoc networks due to their capability of adjusting to frequent network topology changes within acceptable routing overhead. In this paper, we reinvestigate two techniques, route caching and searching localisation, in particular their joint effect on reducing routing overhead. We first analyse and present the optimal value for two essential parameters: route caching validation probability and local searching radius. We then propose a new routing strategy that adapts to the current caching availability and is self-tunable towards the optimal performance. Simulation shows that routing overhead is thus greatly reduced.

Scalable routing overlay networks

Routing overlays have become a viable approach to working around slow BGP convergence and sub-optimal path selection, as well as to deploy novel forwarding architectures. A common sub-component of a routing overlay is a routing mesh : the route-selection algorithm considers only those virtual links inter-node links in an overlay---in the routing mesh rather than all N 2 virtual links connecting an N -node overlay. Doing so reduces routing overhead, thereby improving the scalability of the overlay, as long as the process of constructing the mesh doesn't itself introduce overhead.This paper proposes and evaluates a low-cost approach to building a topology-aware routing mesh that eliminates virtual links that contain duplicate physical segments in the underlying network. An evaluation of our method on PlanetLab shows that a conservative link pruning algorithm reduces routing overhead by a factor of two without negatively impacting route selection. Additional analysis quanti es the impact on route selection of defining an even sparser mesh on top of the topology-aware routing mesh, documenting the cost/benefit tradeoff that is intrinsic to routing. It also shows that constructing a sparser routing mesh on the topology-aware routing mesh---rather than directly on the Internet---itself benefit,; from having the reduced number of duplicate physical segments in the underlying network, which improves the resilience of the resulting routing mesh.

On the Performance of the HSLS Routing Protocol for Mobile Ad hoc Networks

The area of mobile ad hoc networks has recently attracted much scientific interest, as a very appealing research area with many open issues and still unsolved problems. One of the main issues that concerns researchers is the development of routing algorithms that present good performance and face a hostile environment. Many routing protocols have been proposed, attempting to minimize routing overhead, or to reduce the energy consumed by nodes in order to maximize their lifetime. A critical issue, though, is the development of routing protocols that have the ability to maintain their good characteristics at an acceptable level as the network population grows, an ability known as scalability. FSR, ZRP, HierLS and FSLS protocol family are only a sample of scalable algorithms that have been proposed so far. The HSLS protocol is a member of the FSLS family that is proved to scale the best among the algorithms of the FSLS protocol family. In this paper we propose a mechanism to enhance the already good characteristics of the HSLS protocol aiming at the reduction of routing overhead of the original protocol. This new scheme, which we called AFHSLS, exploits the so-called border nodes, in order to deliver routing packets to their destinations. The new algorithm is proved through simulations to significantly reduce routing overhead, with minor or practically no effect on other metrics, such as packet delivery ratio and delay of data packets.

모바일 애드혹 네트워크에서의 AODV 기반 치대 비중첩 다중경로 라우팅 프로토콜

모바일 애드혹 네트워크(MANET)는 어떤 고정 기반구조나 중앙 집중형 관리 구조를 갖지 않는 모바일 노드의 집합으로 구성된다. AODV (Ad hoc On-demand Distance Vector routing)는 MANET용 온디맨드(on-demand) 라우팅 프로토콜로서, IETF (Internet Engineering Task Force)의 MANET 워킹 그룹에 제출된 기고문(Internet Draft)이다. 본 논문에서는 최대의 노드 비중첩 및 링크 비중첩을 제공하고, AODV 프로토콜은 물론 기존의 AODV 기반 다중경로 프로토콜보다 성능이 우수한 새로운 최대 비중첩 다중경로 AODV (MDAODV) 프로토콜을 제안한다. 본 연구의 핵심 아이디어는 경로 요청(RREQ:Route REQuest) 메시지에 소스 라우팅(source routing) 주소 정보를 추가시켜 확장하는 것과 수신 노드가 일정 시간 동안 도착한 다수의 RREQ를 조사하여 2개의 경로를 선택하는 것이다. 제안한 MDAODV 프로토콜은 기존 다중경로 라우팅 프로토콜에 비해 높은 신뢰성과 우수한 견고성을 갖는 경로를 제공할 뿐만 아니라, 수신 노드에서 경로를 결정하므로 중간 노드에서의 오버헤드를 감소시킨다. 성능평가 결과에 의하면, 제안한 MDAODV 프로토콜은 기존의 AODV 기반 다중경로 프로토콜보다 패킷 전달율과 평균 지연시간의 측면에서 성능이 우수한 반면 라우팅 오버헤드는 오히려 감소하는 경향을 나타낸다. A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

Efficient On-Demand Routing for Mobile Ad Hoc Wireless Access Networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.

BLR: beacon-less routing algorithm for mobile ad hoc networks

Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well with these scenarios. The beacon-less routing algorithm (BLR) presented in this paper is a routing protocol that makes use of location information to reduce routing overhead. However, unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast Hello-messages (called beaconing), and thus avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and performance degradation. BLR selects a forwarding node in a distributed manner among all its neighboring nodes with having information neither about their positions nor even about their existence. Data packets are broadcasted and the protocol takes care that just one of the receiving nodes forwards the packet. Optimized forwarding is achieved by applying a concept of dynamic forwarding delay. Consequently, the node that computes the shortest forwarding delay relays the packet first. This forwarding is detected by the other nodes and suppresses them to relay the same packet any further. Analytical results and simulation experiments indicate that BLR provides efficient and robust routing in highly dynamic mobile ad hoc networks.

LPAR: an adaptive routing strategy for MANETs

This paper presents a new global positioning system (GPS)-based routing protocol, called location-based point-to-point adaptive routing (LPAR) for mobile ad hoc networks. This protocol utilises a 3-state route discovery strategy in a point-to-point manner to reduce routing overhead while maximising throughput in medium to large mobile ad hoc networks. In LPAR, data transmission is adaptable to changing network conditions. This is achieved by using a primary and a secondary data forwarding strategy to transfer data from the source to the destination when the condition of the route is changed during data transmission. A simulation study is performed to compare the performance of LPAR with a number of different exisiting routing algorithms. Our results indicate that LPAR produces less overhead than other simulated routing strategies, while maintains high levels of throughput.

Ad hoc on-demand multipath distance vector routing

We present AOMDV, an on-demand multipath distance vector protocol for mobile ad hoc networks. AOMDV is based on a prominent on-demand single path protocol called AODV. AOMDV establishes multiple loop-free and link-disjoint paths. Performance comparison of AOMDV with AODV using ns-2 simulations under varying node speeds shows that AOMDV provides a factor of two improvement in delay and about 20% reduction in routing overhead, while having similar packet delivery fraction.

Improving the routing and addressing of IP

Simple mechanisms for introducing hierarchy into the interdomain routing system, making it practical to route a truly large Internet, are described. It is shown that addresses need to be assigned along network topological lines to maximise the reduction in routing overhead. Simplifying the mechanisms for changing hot addresses makes it possible to renumber a network so that it has a topologically significant address when the site changes position within the routing system. These proposals make it possible to significantly increase the utilization of addresses and extend the time the Internet can use the Internet Protocol (IP) Version 4. >

Efficient and robust policy routing using multiple hierarchical addresses

One of the most compelling long term problems facing the IP and emerging 0S1 Internet is growth, At the same time, policy routing-the ability of a packet source to determine the type of path its packets will take, or the ability of a transit network to restrict usage—is increasingly required. A hierarchical addressing format reflecting the hierarchical backbone structure reduces routing overhead, but restricts paths to the backbones implied by the address, thus limiting policy and reducing robustness. To overcome this restriction, yet keep the efficiency of hierarchical addressing, this paper proposes the use of multiple addresses. In this scheme, directory service would return multiple addresses, and the host would choose the ones appropriate for its policies, any of which could be used during a connection, as network conditions deem appropriate. This paper establishes a framework for the new technique by exploring the fundamentals of routing and addressing, describes the new technique, and discusses its role as a policy mechanism.