2017
DOI: 10.3233/jhs-170553
|View full text |Cite
|
Sign up to set email alerts
|

A congestion aware routing for lifetime improving in grid-based sensor networks

Abstract: Wireless sensor networks (WSNs) consist of a large number of tiny, low cost, memory/computational constraint, battery-operated sensor nodes deployed randomly in two (or three) dimensional plane. Due to limited amount of energy in sensors, the network seeks to attain energy efficient routing for prolonging their lifetime. Existing grid based routing protocols reduce the energy dissipation at nodes, however they suffer from congestion. Network congestion may lead to excessive energy consumption, which in turn mi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Then it is solved by transforming the shortest to a generalized semi-matcher. A distributed construction algorithm was proposed for the shortest path tree based on depth priority search and width priority search [14,15]. Wang et.al [16] proposed a dual-tree routing protocol to employ the reverse link and construct two routing trees based on the MST and the DMDC, respectively.…”
Section: Related Workmentioning
confidence: 99%
“…Then it is solved by transforming the shortest to a generalized semi-matcher. A distributed construction algorithm was proposed for the shortest path tree based on depth priority search and width priority search [14,15]. Wang et.al [16] proposed a dual-tree routing protocol to employ the reverse link and construct two routing trees based on the MST and the DMDC, respectively.…”
Section: Related Workmentioning
confidence: 99%
“…e weights estimated from congestion-related parameters were sent to subsequent modules, but the routing cost was not minimized by designed method. Congestion Aware Lifetime Improving Routing Protocol (CALIRP) was designed in [9] to increase the network lifetime through reducing the congestion. However, the computational complexity was not reduced by CALIRP.…”
Section: Introductionmentioning
confidence: 99%