Cover Image

Analytical studies and experimental examines for flooding-based search algorithms

Flooding search has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although flooding can achieve high coverage but it produces exponentially redundant messages in each hop. To improve this searching sch...

Full description

Saved in:
Bibliographic Details
Main Authors: Barjini, Hassan, Othman, Mohamed, Ibrahim, Hamidah, Udzir, Nur Izura
Other Authors: Liu, Baoxiang
Format: Book Section
Published: Springer 2012
Online Access:http://psasir.upm.edu.my/id/eprint/26097/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.26097
record_format eprints
spelling my.upm.eprints.260972016-01-19T04:44:39Z http://psasir.upm.edu.my/id/eprint/26097/ Analytical studies and experimental examines for flooding-based search algorithms Barjini, Hassan Othman, Mohamed Ibrahim, Hamidah Udzir, Nur Izura Flooding search has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although flooding can achieve high coverage but it produces exponentially redundant messages in each hop. To improve this searching scheme and reduce redundant messages, there are many flooding-based search algorithms in literature. This pa- per provided analytical study for flooding and flooding-based algorithms. The analytical results provided the best hop threshold point for the optimum growth rate coverage and redundant messages from flooding and flooding-based algorithms. The simulation experiments validated analytical results. Springer Liu, Baoxiang Ma, Maode Chang, Jincai 2012 Book Section PeerReviewed Barjini, Hassan and Othman, Mohamed and Ibrahim, Hamidah and Udzir, Nur Izura (2012) Analytical studies and experimental examines for flooding-based search algorithms. In: Information Computing and Applications. Lecture Notes in Computer Science (7473). Springer, Berlin Heidelberg, pp. 299-306. ISBN 9783642340628; EISBN: 9783642340628 10.1007/978-3-642-34062-8_39
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
description Flooding search has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although flooding can achieve high coverage but it produces exponentially redundant messages in each hop. To improve this searching scheme and reduce redundant messages, there are many flooding-based search algorithms in literature. This pa- per provided analytical study for flooding and flooding-based algorithms. The analytical results provided the best hop threshold point for the optimum growth rate coverage and redundant messages from flooding and flooding-based algorithms. The simulation experiments validated analytical results.
author2 Liu, Baoxiang
author_facet Liu, Baoxiang
Barjini, Hassan
Othman, Mohamed
Ibrahim, Hamidah
Udzir, Nur Izura
format Book Section
author Barjini, Hassan
Othman, Mohamed
Ibrahim, Hamidah
Udzir, Nur Izura
spellingShingle Barjini, Hassan
Othman, Mohamed
Ibrahim, Hamidah
Udzir, Nur Izura
Analytical studies and experimental examines for flooding-based search algorithms
author_sort Barjini, Hassan
title Analytical studies and experimental examines for flooding-based search algorithms
title_short Analytical studies and experimental examines for flooding-based search algorithms
title_full Analytical studies and experimental examines for flooding-based search algorithms
title_fullStr Analytical studies and experimental examines for flooding-based search algorithms
title_full_unstemmed Analytical studies and experimental examines for flooding-based search algorithms
title_sort analytical studies and experimental examines for flooding-based search algorithms
publisher Springer
publishDate 2012
url http://psasir.upm.edu.my/id/eprint/26097/
_version_ 1643828829718839296
score 13.160551

Similar Items