Making link-state routing scale for ad hoc networks

Santivañez, Cesar; Ramanathan, Ram; Stavrakakis, Ioannis

doi:10.1145/501417.501420

Cited by 128 publications

(69 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[18]), hierarchical link state routing protocol (e.g. [23]), or hazy sighted routing protocol [24] may be used to acquire topology knowledge for routing. Partition detection and healing: In general, with hierarchical clustering, two kinds of partitioning can occur.…”

Section: Discussion Of Practical Issuesmentioning

confidence: 99%

Efficient clustering algorithms for self-organizing wireless sensor networks

Krishnan¹,

Starobinski

2006

Ad Hoc Networks

112

View full text Add to dashboard Cite

Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy resources available in these networks. In this paper, we make contributions towards improving the efficiency of self-organization in wireless sensor networks. We first present a novel approach for message-efficient clustering, in which nodes allocate local "growth budgets" to neighbors. We introduce two algorithms that make use of this approach. We analyze the message complexity of these algorithms and provide performance results from simulations. The algorithms produce clusters of bounded size and low diameter, using significantly fewer messages than the earlier, commonly used, Expanding Ring approach. Next, we present a new randomized methodology for designing the timers of cluster initiators. This methodology provides a probabilistic guarantee that initiators will not interfere with each other. We derive an upper bound on the expected time for network decomposition that is logarithmic in the number of nodes in the network. We also present a variant that optimistically allows more concurrency among initiators and significantly reduces the network decomposition time.However, it produces slightly more clusters than the first method. Extensive simulations over different topologies confirm the analytical results and demonstrate that our proposed methodology scales to large networks.

show abstract

Section: Discussion Of Practical Issuesmentioning

confidence: 99%

Efficient clustering algorithms for self-organizing wireless sensor networks

Krishnan¹,

Starobinski

2006

Ad Hoc Networks

112

View full text Add to dashboard Cite

show abstract

“…Many hierarchical routing approaches have been proposed in the past (e.g., [1][2][3][4]). With hierarchical routing, groups of destinations are aggregated into clusters or other structures in a way that the number of entities for which routing-table entries must be maintained is reduced.…”

Section: Related Workmentioning

confidence: 99%

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Wang

Westphal

Garcia-Luna-Aceves

2013

2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

Abstract-Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.

show abstract

“…Localized Link State Updates: To make link state routing scalable for mobile ad hoc networks, limited disseminationbased schemes have been proposed [27]. Fisheye state routing (FSR) [28] and hazy sighted link state (HSLS) [27] routing schemes update the nearby nodes at a higher frequency than the remote nodes that lie outside a certain scope.…”

Section: Single or Correlated Failuresmentioning

confidence: 99%

“…Fisheye state routing (FSR) [28] and hazy sighted link state (HSLS) [27] routing schemes update the nearby nodes at a higher frequency than the remote nodes that lie outside a certain scope. The drawback is that the chosen scope can be more than sufficient in some cases and less than necessary in other cases resulting in needless updates or forwarding loops.…”

Section: Single or Correlated Failuresmentioning

confidence: 99%

Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing

Robertson

Nelakuditi

2012

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-It has been observed that transient failures are fairly common in IP backbone networks and there have been several proposals based on local rerouting to provide high network availability despite failures. While most of these proposals are effective in handling single failures, they either cause loops or drop packets in the case of multiple independent failures. To ensure forwarding continuity even with multiple failures, we propose Localized On-demand Link State (LOLS) routing. Under LOLS, each packet carries a blacklist, which is a minimal set of failed links encountered along its path, and the next hop is determined by excluding the blacklisted links. We show that the blacklist can be reset when the packet makes forward progress towards the destination and hence can be encoded in a few bits. Furthermore, blacklist-based forwarding entries at a router can be precomputed for a given set of failures requiring protection. While the LOLS approach is generic, this paper describes how it can be applied to ensure forwarding to all reachable destinations in case of any two link or node failures. Our evaluation of this failure scenario based on various real network topologies reveals that LOLS needs 6 bits in the worst case to convey the blacklist information. We argue that this overhead is acceptable considering that LOLS routing deviates from the optimal path by a small stretch only while routing around failures.

show abstract

Making link-state routing scale for ad hoc networks

Cited by 128 publications

References 8 publications

Efficient clustering algorithms for self-organizing wireless sensor networks

Efficient clustering algorithms for self-organizing wireless sensor networks

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Handling Multiple Failures in IP Networks through Localized On-Demand Link State Routing

Contact Info

Product

Resources

About