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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2012
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/26097/ |
| _version_ | 1848845487892856832 |
|---|---|
| author | Barjini, Hassan Othman, Mohamed Ibrahim, Hamidah Udzir, Nur Izura |
| author2 | Liu, Baoxiang |
| author_facet | Liu, Baoxiang Barjini, Hassan Othman, Mohamed Ibrahim, Hamidah Udzir, Nur Izura |
| author_sort | Barjini, Hassan |
| building | UPM Institutional Repository |
| collection | Online Access |
| 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.
|
| first_indexed | 2025-11-15T08:47:36Z |
| format | Book Section |
| id | upm-26097 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T08:47:36Z |
| publishDate | 2012 |
| publisher | Springer |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-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 |
| spellingShingle | Barjini, Hassan Othman, Mohamed Ibrahim, Hamidah Udzir, Nur Izura Analytical studies and experimental examines for flooding-based search algorithms |
| title | 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_short | Analytical studies and experimental examines for flooding-based search algorithms |
| title_sort | analytical studies and experimental examines for flooding-based search algorithms |
| url | http://psasir.upm.edu.my/id/eprint/26097/ http://psasir.upm.edu.my/id/eprint/26097/ |