In delay tolerant networking (DTN) nodes exploit their mobility in order to carry messages to their intended destination. Thus the knowledge of a node's neighbors over time, is a fundamental requirement for DTN nodes to exchange knowledge and messages. A typical problem in this task occurs when the neighboring nodes try to response to the neighbor discovery request initiated by a requesting node, during a fixed contention time window. In this paper a novel neighbor discovery protocol proposed for resource constraint devices (RFID tags) running according to the delay tolerant networking paradigm. The proposed protocol is based on the traditional P-Persistent CSMA algorithm, but with the addition of the sift-distribution (sift-Persistent) in order to reduce the collisions during the response phase. The proposal has been tested both in a simulator and in a real testbed under the OpenBeacon framework. Moreover, simulations and real testbed show a coherent behavior validating our proposal in the RFID context. Performance evaluations have been tested in terms of discovered neighbors. © 2013 IEEE.

Neighbor discovery in delay tolerant networking using resource-constraint devices / AMENDOLA, DANILO; Floriano De, Rango; Khalil, Massri; VITALETTI, Andrea. - ELETTRONICO. - (2013), pp. 1-3. ((Intervento presentato al convegno 2013 IFIP Wireless Days (WD) tenutosi a Valencia; Spain nel 13-15 Nov. 2013 [10.1109/WD.2013.6686531].

Neighbor discovery in delay tolerant networking using resource-constraint devices

AMENDOLA, DANILO;VITALETTI, Andrea
2013

Abstract

In delay tolerant networking (DTN) nodes exploit their mobility in order to carry messages to their intended destination. Thus the knowledge of a node's neighbors over time, is a fundamental requirement for DTN nodes to exchange knowledge and messages. A typical problem in this task occurs when the neighboring nodes try to response to the neighbor discovery request initiated by a requesting node, during a fixed contention time window. In this paper a novel neighbor discovery protocol proposed for resource constraint devices (RFID tags) running according to the delay tolerant networking paradigm. The proposed protocol is based on the traditional P-Persistent CSMA algorithm, but with the addition of the sift-distribution (sift-Persistent) in order to reduce the collisions during the response phase. The proposal has been tested both in a simulator and in a real testbed under the OpenBeacon framework. Moreover, simulations and real testbed show a coherent behavior validating our proposal in the RFID context. Performance evaluations have been tested in terms of discovered neighbors. © 2013 IEEE.
9781479905430
File allegati a questo prodotto
File Dimensione Formato  
VE_2013_11573-779526.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 104.55 kB
Formato Adobe PDF
104.55 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/779526
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 2
social impact