scispace - formally typeset
Topic

Routing protocol

About: Routing protocol is a(n) research topic. Over the lifetime, 46593 publication(s) have been published within this topic receiving 901846 citation(s).

...read more

Papers
  More

Proceedings ArticleDOI: 10.1109/HICSS.2000.926982
04 Jan 2000-
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

...read more

Topics: Wireless sensor network (59%), Routing protocol (59%), Mobile wireless sensor network (57%) ...read more

11,951 Citations


Open access
01 Jan 2000-
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.

...read more

Topics: Wireless Routing Protocol (61%), Routing protocol (60%), Wireless sensor network (59%) ...read more

11,410 Citations


Open accessProceedings ArticleDOI: 10.1109/MCSA.1999.749281
C.E. Perkins, E.M. Royer1Institutions (1)
25 Feb 1999-
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

...read more

11,180 Citations


Journal ArticleDOI: 10.1109/TWC.2002.804190
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

...read more

Topics: Routing protocol (56%), Wireless Application Protocol (52%), Cluster analysis (51%) ...read more

9,655 Citations


Proceedings ArticleDOI: 10.1145/345910.345953
Brad Karp1, Hsiang-Tsung Kung1Institutions (1)
01 Aug 2000-
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

...read more

Topics: Routing table (65%), Geographic routing (64%), IP forwarding (64%) ...read more

7,152 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202243
20211,410
20201,703
20191,953
20182,212
20172,455

Top Attributes

Show by:

Topic's top 5 most impactful authors

Nadeem Javaid

227 papers, 4.5K citations

Zahoor Ali Khan

140 papers, 2.8K citations

J.J. Garcia-Luna-Aceves

139 papers, 6.1K citations

Leonard Barolli

133 papers, 1.5K citations

Mario Gerla

113 papers, 10K citations

Network Information
Related Topics (5)
Wireless ad hoc network

49K papers, 1.1M citations

96% related
Wireless Routing Protocol

28.9K papers, 689.5K citations

96% related
Wireless sensor network

142K papers, 2.4M citations

96% related
Dynamic Source Routing

32.2K papers, 695.7K citations

96% related
Mobile ad hoc network

31.5K papers, 634.9K citations

96% related