Treffer: Revisiting neighbor discovery with interferences consideration

Title:
Revisiting neighbor discovery with interferences consideration
Contributors:
Architectures of networks of services (ARES), Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), ACM
Source:
3rd ACM international workshop on Performance Evaluation of Wireless Ad hoc. :74-81
Publisher Information:
CCSD, 2006.
Publication Year:
2006
Collection:
collection:INRIA
collection:INSA-LYON
collection:INRIA-RHA
collection:INRIA_TEST
collection:TESTALAIN1
collection:INRIA2
collection:INRIA-RENGRE
collection:INRIA-300009
collection:CITI
collection:INSA-GROUPE
collection:UDL
Subject Geographic:
Original Identifier:
HAL:
Document Type:
Konferenz conferenceObject<br />Conference papers
Language:
English
Relation:
info:eu-repo/semantics/altIdentifier/doi/10.1145/1163610.1163623
DOI:
10.1145/1163610.1163623
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00384837v1
Database:
HAL

Weitere Informationen

In wireless multi-hop networks, hello protocols for neighbor discovery are a basic service offered by the networking stack. However, their study usually rely on rather simplistic models which do not take into account problems resulting from low level layers, such as the physical layer. One of the peculiarities of radio communications is the presence of interferences which decrease the capacity of the medium.In this paper, we consider a random hello protocol inspired by aloha and we study the impact of the interferences on the neighbor discovery process. As expected, we prove that, in average and in the presence of interferences, a node discovers only a subset of its neighbors. We propose then an analytical model to compute the average number of nodes that a given node may expect to discover in its neighborhood.Finally, we present a hello protocol with sleep periods. We show how to optimize this protocol using our hybrid model. A real scenario stemming from the CAPNET project is then analyzed and studied.