GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference 2009
DOI: 10.1109/glocom.2009.5425543
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Gradient Routing in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 51 publications
(24 citation statements)
references
References 5 publications
0
21
0
Order By: Relevance
“…Gradient : In this study, we based on RIME communication stack [23] , and thus, for data collection we rely on a low overheaded and scalable under realistic conditions Gradient protocol [24] which generates and maintains a tree-based routing topology, rooted at the sink, by employing the number of hops from the sink as the cost metric.…”
Section: Implementation Aspectsmentioning
confidence: 99%
“…Gradient : In this study, we based on RIME communication stack [23] , and thus, for data collection we rely on a low overheaded and scalable under realistic conditions Gradient protocol [24] which generates and maintains a tree-based routing topology, rooted at the sink, by employing the number of hops from the sink as the cost metric.…”
Section: Implementation Aspectsmentioning
confidence: 99%
“…Furthermore, we used a radio model based on disks for the sake of clarity, where each node emits at −10 dBm transmission power, imposing thus, multi-hop communications among the mobile nodes and the sink (up to five hops). At the routing layer, we rely on a broadly used scalable and under realistic conditions gradient protocol [21] that generates a routing tree rooted at the sink (i.e. by employing as a metric a number of hops towards to the sink) having low overhead.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…This paper combined these two approaches for achieving optimal reliable routing A. Gradient-Based Network Setup Gradient Based Network Setup take the minimum hop count and remaining energy of a node while routing data from source node to the sink. The optimal route is established autonomously, the scheme is composed of three sections discussed in [20], [21].…”
Section: Proposed Workmentioning
confidence: 99%