HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks
TL;DR: The HOLSR mechanism is derived from the O LSR protocol; however, unlike OLSR, the HOLSR protocol takes advantage of different mobile node capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism.
Abstract: This article reviews the hierarchical optimized link state routing (HOLSR) mechanism for heterogeneous mobile ad hoc networks. In this work a heterogeneous mobile ad hoc network is defined as a network of mobile nodes that are characterized by different communications capabilities, such as multiple radio interfaces. The article focuses on proposing the HOLSR protocol. The HOLSR mechanism is derived from the OLSR protocol; however, unlike OLSR, the HOLSR protocol takes advantage of different mobile node capabilities to reduce the routing control overhead in large heterogeneous ad hoc networks, thus improving the performance of the routing mechanism.
Citations
More filters
TL;DR: A taxonomy of the ad hoc routing protocols is created to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors.
554 citations
Cites background from "HOLSR: a hierarchical proactive rou..."
...The HOLSR network arranges the nodes in three topology levels, depending on their capabilities....
[...]
...bile ad hoc networks (HOLSR) [119]: Villasenor-Gonzalez et al....
[...]
...CGSR [23]), possibly integrated with a hierarchical model (such as in HOLSR [119])....
[...]
...On the other hand, the connections in ad hoc networks are strongly correlated with the physical proximity, which allows the development of clustering approaches (e.g. CGSR [23]), possibly integrated with a hierarchical model (such as in HOLSR [119])....
[...]
...A hierarchical proactive routing mechanism for mobile ad hoc networks (HOLSR) [119]: Villasenor-Gonzalez et al. networks where some nodes have significantly higher resources (transmission range, bandwidth, directional antenna and so on)....
[...]
TL;DR: The challenges of realizing video streaming over MANETs are identified, and the proposed techniques are analyzed and classify, indicating that the research domain suffers from a problem of comparability.
Abstract: Developments in mobile devices and wireless networking provide the technical platform for video streaming over mobile ad hoc networks (MANETs) However, efforts to realize video streaming over MANETs have met many challenges, which are addressed by several different techniques Examples include cross-layer optimization, caching and replication, and packet prioritization Cross-layer optimization typically leverages multiple description video coding and multipath routing to provide the receiver(s) sufficient video quality Caching and replication add tolerance to disruptions and partitioning In this paper, we identify the challenges of realizing video streaming over MANETs, and analyze and classify the proposed techniques Since 65 % of the identified involve cross-layering design, we study the distribution of joint optimization and parameter exchanges Due to the importance and complexity of evaluating the techniques, we analyze the common methods, indicating that the research domain suffers from a problem of comparability
112 citations
Cites background from "HOLSR: a hierarchical proactive rou..."
...They consider only two levels, as opposed to the three-level hierarchy proposed in [87]....
[...]
...[87] propose Hierarchical OLSR (HOLRS), which improves the scalability of OLSR by reducing the amount of exchanged topology control packets....
[...]
Patent•
15 Feb 2007TL;DR: In this article, a contention-based media access mechanism and self-allocating bandwidth within a wireless mesh network by dynamically modifying one or more contentionbased transmission control parameters is presented. But the routing nodes determine a hop count and adjust one ormore contention parameters based at least in part, on the hop count.
Abstract: Methods, apparatuses and systems directed to facilitating load balancing and bandwidth a) location in wireless mesh networks. Generally, according to one implementation of the present invention., routing nodes implement a contention-based media access mechanism and self-allocate bandwidth within a wireless mesh network by dynamically modifying one or more contention-based transmission control parameters. The routing nodes determine a hop count and adjust one or more contention parameters based at least in part, on the hop count.
92 citations
TL;DR: Extensive studies simulations for DSR, AODV, LAR1, FSR and WRP in homogenous and heterogeneous networks that consist of different nodes with different resources showed that while all protocols perform reasonably well in homogeneous networking conditions, their performance suffer significantly over heterogonous networks.
60 citations
Cites background from "HOLSR: a hierarchical proactive rou..."
...The common approach to dealing with heterogeneity of nodes in previous papers [ 13-15 ] is to assign most of the routing load for the powerful nodes, as they possess more resources and communication capabilities....
[...]
...In [ 14 ], scalability issue of OLSR in heterogeneous MANET has been studied....
[...]
Patent•
06 Mar 2006
TL;DR: In this article, a routing node computes a routing metric, which is based on the computed route cost and hop count, and selects a preferred neighbor as the parent routing node based on a best routing metric.
Abstract: Methods, apparatuses and systems directed to facilitating increased throughput in wireless mesh networks. Generally, according to one implementation of the present invention, routing nodes in a wireless mesh network combine metrics corresponding to the link and network layers to select a route to a root node in the wireless mesh network. In one implementation, for each neighbor, a given routing node computes a routing metric, which is based on the computed route cost and hop count, and selects a preferred neighbor as the parent routing node based on the best routing metric.
56 citations
References
More filters
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Abstract: We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the branches definitely assignec~ to the tree under construction (they will form a subtree) ; II. the branches from which the next branch to be added to set I, will be selected ; III. the remaining branches (rejected or not yet considered). The nodes are subdivided into two sets: A. the nodes connected by the branches of set I, B. the remaining nodes (one and only one branch of set II will lead to each of these nodes), We start the construction by choosing an arbitrary node as the only member of set A, and by placing all branches that end in this node in set II. To start with, set I is empty. From then onwards we perform the following two steps repeatedly. Step 1. The shortest branch of set II is removed from this set and added to
22,704 citations
"HOLSR: a hierarchical proactive rou..." refers methods in this paper
...Based on such information, the routing table is calculated using the shortest-path algorithm [7]....
[...]
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,256 citations
"HOLSR: a hierarchical proactive rou..." refers methods in this paper
...In the simulation scenarios, each mobile node changes its location within the subnetwork based on the “random waypoint” model [ 10 ]; that is, the node randomly selects a destination, moves toward that destination at a speed not exceeding the maximum speed for that level, and then pauses; this interval is known as pause-time....
[...]
21 Sep 1999
TL;DR: A novel soft state wireless hierarchical routing protocol-Hierarchical State Routing (HSR) is proposed, which keeps track of logical subnet movements using home agent concepts akin to Mobile IP.
Abstract: In this paper we present a hierarchical routing protocol in a large wireless, mobile network such as found in the automated battlefield or in extensive disaster recovery operations. Conventional routing does not scale well to network size. Likewise, conventional hierarchical routing cannot handle mobility efficiently. We propose a novel soft state wireless hierarchical routing protocol-Hierarchical State Routing (HSR). We distinguish between the "physical" routing hierarchy (dictated by geographical relationships between nodes) and "logical" hierarchy of subnets in which the members move as a group (e.g., company, brigade, battalion in the battlefield). HSR keeps track of logical subnet movements using home agent concepts akin to Mobile IP. A group mobility model is introduced and the performance of the HSR is evaluated through a detailed wireless simulation model.
371 citations
Additional excerpts
...The HOLSR clustering mechanism does not require a logical hierarchical addressing scheme (as discussed in [8]), but one can be employed if desired, as might be the case in some specific scenarios where a network exhibits group mobility (e....
[...]
07 Oct 2002
TL;DR: A new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network is proposed and a new active clustering scheme is presented to help build a stable hierarchical structure, which is fundamental toheterogeneous routing protocols.
Abstract: A mobile ad hoc network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Research has demonstrated its performance bottleneck both theoretically and through simulation experiments. Building a physically hierarchical ad hoc network is a very promising way to achieve scalability. Routing is critical to operate such a hierarchical structure efficiently. Previous research has been solely focusing on extending popular routing schemes developed for the homogeneous ad hoc network. We propose a new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network. We also present a new active clustering scheme to help build a stable hierarchical structure, which is fundamental to heterogeneous routing protocols. Simulation results using GloMoSim show that our routing and clustering scheme gives good performance. The results also provide some insight into new possible designs of routing protocols and mobile network architectures for MANETs when large scale is desired.
180 citations