2018
DOI: 10.1007/s11276-018-1836-7
|View full text |Cite
|
Sign up to set email alerts
|

Intertwined localization and error-resilient geographic routing for mobile wireless sensor networks

Abstract: Geographic routing in wireless sensor networks brings numerous inherent advantages, albeit its performance relying heavily on accurate node locations. In mobile networks, localization of the continuously moving nodes is a challenging task and location errors are inevitable and affect considerably routing decisions. Our proposal is in response to the unrealistic assumption widely made by previous geographic routing protocols that the accurate location of mobile nodes can be obtained at any time. Such idealized … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 47 publications
(58 reference statements)
0
1
0
Order By: Relevance
“…In [14], each node utilizes a fuzzy logic controller to reduce the beacon overhead by considering node speed and the number of neighboring nodes. The authors in [15] evaluated the effect of neighbourhood discovery time on the performance of geographic routing in mobile sensor network and calculated the suitable time interval for neighbourhood discovery after considering the communication range, speed and number of neighboring nodes. In [16], a beaconing scheme is proposed to maintain the trade-off between the accuracy of the neighbor table and beacon overhead.…”
Section: Background and Related Workmentioning
confidence: 99%
“…In [14], each node utilizes a fuzzy logic controller to reduce the beacon overhead by considering node speed and the number of neighboring nodes. The authors in [15] evaluated the effect of neighbourhood discovery time on the performance of geographic routing in mobile sensor network and calculated the suitable time interval for neighbourhood discovery after considering the communication range, speed and number of neighboring nodes. In [16], a beaconing scheme is proposed to maintain the trade-off between the accuracy of the neighbor table and beacon overhead.…”
Section: Background and Related Workmentioning
confidence: 99%