Searching for Resources in MANETs - A Cluster Based Flooding Approach

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supported by a light-weight clustering algorithm. The paper compares the relative efficiency of two clustering approaches using 1.5-hop and 2.5-hop neighborhood information, and of a non-clustered approach. It presents a set of simulation results on the clustering efficiency and on searching efficiency for low and high mobility patterns, showing that the 1.5-hop algorithm is more resilient to load and to node movement than the 2.5-hop algorithm.

Original languageEnglish
Title of host publicationE-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers
EditorsJ. Filipe, H. Coelhas, M. Saramago
PublisherSpringer Verlag
Pages236-245
Number of pages10
ISBN (Print)9783540759928
DOIs
Publication statusPublished - 1 Jan 2007
Event2nd International Conference on E-business and Telecommunication Networks, ICETE 2005 - Reading, United Kingdom
Duration: 3 Oct 20057 Oct 2005

Publication series

NameCommunications in Computer and Information Science
PublisherSpringer Verlag
Volume3 CCIS
ISSN (Print)1865-0929

Conference

Conference2nd International Conference on E-business and Telecommunication Networks, ICETE 2005
CountryUnited Kingdom
CityReading
Period3/10/057/10/05

Fingerprint

Flooding
Overlay networks
Overlay Networks
Resources
Clustering
Relative Efficiency
Mobile ad hoc networks
Mobile Ad Hoc Networks
Clustering algorithms
Clustering Algorithm
Routing
Servers
Server
Costs
Vertex of a graph
Simulation

Keywords

  • clustering protocol
  • Performance analysis of wireless ad hoc networks
  • searching service

Cite this

Oliveira, R., Bernardo, L., & Pinto, P. (2007). Searching for Resources in MANETs - A Cluster Based Flooding Approach. In J. Filipe, H. Coelhas, & M. Saramago (Eds.), E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers (pp. 236-245). (Communications in Computer and Information Science; Vol. 3 CCIS). Springer Verlag. https://doi.org/10.1007/978-3-540-75993-5_20
Oliveira, Rodolfo ; Bernardo, Luis ; Pinto, Paulo. / Searching for Resources in MANETs - A Cluster Based Flooding Approach. E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers. editor / J. Filipe ; H. Coelhas ; M. Saramago. Springer Verlag, 2007. pp. 236-245 (Communications in Computer and Information Science).
@inproceedings{8a8920538d5c4cd3b3dc896a9c4ed983,
title = "Searching for Resources in MANETs - A Cluster Based Flooding Approach",
abstract = "In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supported by a light-weight clustering algorithm. The paper compares the relative efficiency of two clustering approaches using 1.5-hop and 2.5-hop neighborhood information, and of a non-clustered approach. It presents a set of simulation results on the clustering efficiency and on searching efficiency for low and high mobility patterns, showing that the 1.5-hop algorithm is more resilient to load and to node movement than the 2.5-hop algorithm.",
keywords = "clustering protocol, Performance analysis of wireless ad hoc networks, searching service",
author = "Rodolfo Oliveira and Luis Bernardo and Paulo Pinto",
year = "2007",
month = "1",
day = "1",
doi = "10.1007/978-3-540-75993-5_20",
language = "English",
isbn = "9783540759928",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "236--245",
editor = "J. Filipe and H. Coelhas and M. Saramago",
booktitle = "E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers",

}

Oliveira, R, Bernardo, L & Pinto, P 2007, Searching for Resources in MANETs - A Cluster Based Flooding Approach. in J Filipe, H Coelhas & M Saramago (eds), E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers. Communications in Computer and Information Science, vol. 3 CCIS, Springer Verlag, pp. 236-245, 2nd International Conference on E-business and Telecommunication Networks, ICETE 2005, Reading, United Kingdom, 3/10/05. https://doi.org/10.1007/978-3-540-75993-5_20

Searching for Resources in MANETs - A Cluster Based Flooding Approach. / Oliveira, Rodolfo; Bernardo, Luis; Pinto, Paulo.

E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers. ed. / J. Filipe; H. Coelhas; M. Saramago. Springer Verlag, 2007. p. 236-245 (Communications in Computer and Information Science; Vol. 3 CCIS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Searching for Resources in MANETs - A Cluster Based Flooding Approach

AU - Oliveira, Rodolfo

AU - Bernardo, Luis

AU - Pinto, Paulo

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supported by a light-weight clustering algorithm. The paper compares the relative efficiency of two clustering approaches using 1.5-hop and 2.5-hop neighborhood information, and of a non-clustered approach. It presents a set of simulation results on the clustering efficiency and on searching efficiency for low and high mobility patterns, showing that the 1.5-hop algorithm is more resilient to load and to node movement than the 2.5-hop algorithm.

AB - In this paper, we propose a searching service optimized for highly dynamic mobile ad-hoc networks based on a flooding approach. MANETs unreliability and routing costs prevent the use of central servers or global infra-structured services on top of a priori defined virtual overlay networks. A flooding approach over a virtual overlay network created on-demand performs better. Flooding is supported by a light-weight clustering algorithm. The paper compares the relative efficiency of two clustering approaches using 1.5-hop and 2.5-hop neighborhood information, and of a non-clustered approach. It presents a set of simulation results on the clustering efficiency and on searching efficiency for low and high mobility patterns, showing that the 1.5-hop algorithm is more resilient to load and to node movement than the 2.5-hop algorithm.

KW - clustering protocol

KW - Performance analysis of wireless ad hoc networks

KW - searching service

UR - http://www.scopus.com/inward/record.url?scp=84904860119&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75993-5_20

DO - 10.1007/978-3-540-75993-5_20

M3 - Conference contribution

SN - 9783540759928

T3 - Communications in Computer and Information Science

SP - 236

EP - 245

BT - E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers

A2 - Filipe, J.

A2 - Coelhas, H.

A2 - Saramago, M.

PB - Springer Verlag

ER -

Oliveira R, Bernardo L, Pinto P. Searching for Resources in MANETs - A Cluster Based Flooding Approach. In Filipe J, Coelhas H, Saramago M, editors, E-business and Telecommunication Networks - 2nd International Conference, ICETE 2005, Selected Papers. Springer Verlag. 2007. p. 236-245. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-540-75993-5_20