Please use this identifier to cite or link to this item:
http://dspace.hebron.edu:8080/xmlui/handle/123456789/229
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Amendola, Danilo | - |
dc.contributor.author | De Rango, Floriano | - |
dc.contributor.author | Massri, Khalil | - |
dc.contributor.author | Vitaletti, Andrea | - |
dc.date.accessioned | 2019-10-09T19:38:30Z | - |
dc.date.available | 2019-10-09T19:38:30Z | - |
dc.date.issued | 2014-06-10 | - |
dc.identifier.citation | 10.1109/ICC.2014.6883920 | en_US |
dc.identifier.issn | Print ISSN: 1550-3607 Electronic ISSN: 1938-1883 | - |
dc.identifier.uri | http://dspace.hebron.edu:80/xmlui/handle/123456789/229 | - |
dc.description.abstract | In this paper we consider Delay Tolerant Network (DTN) as a technology to implement a future network in a People Centric Networking paradigm, using Active RFID carried by people that exchange information with each other. We propose a novel and real Neighbor Discovery (ND) phase on active RFID based DTN using Open Beacon devices. In particular, we propose a solution using the Sift distribution on a probabilistic persistent approach called Sift-Persistent. We simulated P-Persistent, Aloha and our solution using our customized Java simulator. We implemented Sift-Persistent and P-Persistent on Open-Beacon devices, comparing the simulation results and test-beds. 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | 2014 IEEE International Conference on Communications (ICC) | en_US |
dc.title | Efficient Neighbor Discovery in RFID based devices over resource-constrained DTN networks | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journals |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ICC-finale-1569837889.pdf | 259.31 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.