scispace - formally typeset
Topic

Multipath routing

About: Multipath routing is a(n) research topic. Over the lifetime, 15956 publication(s) have been published within this topic receiving 330151 citation(s).

...read more

Papers
More filters

Journal ArticleDOI
Jamal N. Al-Karaki1, Ahmed E. Kamal2Institutions (2)
TL;DR: A survey of state-of-the-art routing techniques in WSNs is presented and the design trade-offs between energy and communication overhead savings in every routing paradigm are studied.

...read more

Abstract: Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas.

...read more

4,572 citations


Journal ArticleDOI
Chris Karlof1, David Wagner1Institutions (1)
11 May 2003-
TL;DR: This work proposes security goals for routing in sensor networks, shows how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensors, and introduces two classes of novel attacks against sensor networks sinkholes and HELLO floods.

...read more

Abstract: We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.

...read more

2,881 citations


9


Journal ArticleDOI
Dally1, Seitz2Institutions (2)
Abstract: A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.

...read more

2,092 citations


Journal ArticleDOI
Ben Y. Zhao1, Ling Huang1, Jeremy Stribling2, Sean Rhea1  +2 moreInstitutions (2)
TL;DR: Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers, illustrating its utility as a deployment infrastructure.

...read more

Abstract: We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, location-independent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and routing applications programming interface using a self-repairing, soft-state-based routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment infrastructure.

...read more

1,871 citations


23


Proceedings ArticleDOI
Sushant Jain1, Kevin Fall2, Rabin Patra3Institutions (3)
30 Aug 2004-
TL;DR: This work forms the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance, and proposes a framework for evaluating routing algorithms in such environments.

...read more

Abstract: We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.

...read more

1,826 citations


11


Network Information
Related Topics (5)
Static routing

25.7K papers, 576.7K citations

96% related
Link-state routing protocol

31.7K papers, 676.8K citations

96% related
Dynamic Source Routing

32.2K papers, 695.7K citations

95% related
Destination-Sequenced Distance Vector routing

20.3K papers, 490.6K citations

94% related
Policy-based routing

13.2K papers, 314.9K citations

94% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202185
2020125
2019142
2018191
2017645
2016934

Top Attributes

Show by:

Topic's top 5 most impactful authors

José Duato

67 papers, 2.6K citations

Jie Wu

50 papers, 1.3K citations

J.J. Garcia-Luna-Aceves

42 papers, 1.7K citations

Mario Gerla

29 papers, 2K citations

Mohamed Ould-Khaoua

25 papers, 386 citations