Proceedings of the 2012 National Conference on Information Technology and Computer Science

Least Squares Method Prediction-based Spray and Focus Routing Protocol in Opportunistic Networks

Authors
Zhuowei Shen, Ying Tu
Corresponding Author
Zhuowei Shen
Available Online November 2012.
DOI
https://doi.org/10.2991/citcs.2012.101How to use a DOI?
Keywords
Opportunistic Networks, Spray and Focus, Least squares method
Abstract
Opportunistic Networks develops rapidly in recent years. With the popularity of GPS (Global Positioning System), velocity or position prediction plays an important role in opportunistic network routing. In this paper, a new opportunistic routing protocol named LSMPSF (Least Squares Method Prediction-based Spray and Focus) is proposed. With least squares method, LSMPSF predicts velocity by curve fitting. According to the predicted velocities, it estimates the neighbor nodes? delivery ratio and makes routing decision. Simulation results reveal that LSMPSF effectively increases the prediction accuracy and reduces resource consumption. Compared with SF and PROPHET, LSMPSF achieves better performance on delivery ratio and overhead ratio
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2012 National Conference on Information Technology and Computer Science
Part of series
Advances in Intelligent Systems Research
Publication Date
November 2012
ISBN
978-94-91216-39-8
ISSN
1951-6851
DOI
https://doi.org/10.2991/citcs.2012.101How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Zhuowei Shen
AU  - Ying Tu
PY  - 2012/11
DA  - 2012/11
TI  - Least Squares Method Prediction-based Spray and Focus Routing Protocol in Opportunistic Networks
BT  - 2012 National Conference on Information Technology and Computer Science
PB  - Atlantis Press
SP  - 387
EP  - 391
SN  - 1951-6851
UR  - https://doi.org/10.2991/citcs.2012.101
DO  - https://doi.org/10.2991/citcs.2012.101
ID  - Shen2012/11
ER  -