2008 International Symposium on Industrial Embedded Systems 2008
DOI: 10.1109/sies.2008.4577693
|View full text |Cite
|
Sign up to set email alerts
|

TPR: Dead end aware table less position based routing scheme for low power data-centric wireless sensor networks

Abstract: Abstract-In this paper we present a Table less Position based Routing (TPR) scheme for low power data centric wireless sensor networks. TPR is localized, uses greedy forwarding approach, and does not rely on neighborhood information. These characteristics reduce the communication overhead (no neighborhood information exchange), make the protocol highly scalable (no routing tables are maintained and beacons are not exchanged when a node leaves or enters the networks), and it performs better in mobile environmen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…In recent years, the shortest path problem has been investigated comprehensively in the literature [9 -14] and evolutionary algorithms draw attention to many researchers to find solution to the problem. Recent studies show that researchers have done some research work to solve the shortest path problem by applying genetic algorithms [9][10][11][12][13][14][15], particle swarm optimization [22], and neural networks [23]. To solve the shortest path problem, several routing algorithms such as Dijkstra's algorithm, Bellman-Ford algorithm, breadth-first algorithm, and depth-first algorithm have been proposed, to name a few [24].…”
Section: Review Of Ga-based Routing Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…In recent years, the shortest path problem has been investigated comprehensively in the literature [9 -14] and evolutionary algorithms draw attention to many researchers to find solution to the problem. Recent studies show that researchers have done some research work to solve the shortest path problem by applying genetic algorithms [9][10][11][12][13][14][15], particle swarm optimization [22], and neural networks [23]. To solve the shortest path problem, several routing algorithms such as Dijkstra's algorithm, Bellman-Ford algorithm, breadth-first algorithm, and depth-first algorithm have been proposed, to name a few [24].…”
Section: Review Of Ga-based Routing Algorithmsmentioning
confidence: 99%
“…Therefore, shortest path problem attracts interests of many researchers. Depending on applications, in routing, forwarding schemes can be based on minimizing end-to-end delay, energy consumption, number of hops, and geographic distance [10]. In order to support time-constrained services, such as military application, to deliver information within a specified time, an efficient routing algorithm is desired that should attempt to find shortest path quickly.…”
Section: Introductionmentioning
confidence: 99%
“…It provides a rich library of modules and supports mobility and environmental dynamics. It also provides a simulation template for users to quick start simulation study Madani et al (2008); Weber et al (2007).…”
Section: Pawismentioning
confidence: 99%
“…e3D [56,57] In energy efficient distributed dynamic diffusion (e3D) routing algorithm, each node updates neighbours' information through distance derived from radio signal strength, battery power and load. TPR [58] No need of routing table and neighbourhood information. Topology control protocols/ algorithms GAF Rotates node functionality periodically to ensure fair energy consumption among nodes.…”
Section: Location Based Routing Protocols/ Algorithms Directmentioning
confidence: 99%