Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/4548
DC FieldValueLanguage
dc.contributor.authorAwad, Abdalkarim
dc.contributor.authorGerman, Reinhard
dc.contributor.authorDressler, Falko
dc.date.accessioned2017-03-16T09:14:32Z
dc.date.available2017-03-16T09:14:32Z
dc.date.issued2017
dc.identifier.urihttp://hdl.handle.net/20.500.11889/4548
dc.description.abstractWe show the feasibility of efficient routing and service discovery in sensor networks using the Virtual Cord Protocol (VCP). Scalable and energy efficient data management is still a challenging topic in this domain. Recently, the advantages of virtual coordinates have been explored in comparison to solutions based on geographical positions. Due to the fact that such virtual coordinates can be assigned in an “optimal” way, routing and data management becomes more efficient. We implemented our VCP protocol on BTnode sensor nodes to show the applicability of this protocol in a lab environment. Furthermore, we address the issue of service discovery by means of indirections as known from overlay networks.en_US
dc.language.isoen_USen_US
dc.subjectVirtual Cord Protocol (VCP)en_US
dc.subjectSoftware-defined networking (Computer network technology)en_US
dc.subjectSensor networksen_US
dc.subject.lcshWireless sensor networks
dc.titleEfficient service discovery in sensor networks using VCPen_US
dc.typeArticleen_US
newfileds.departmentEngineering and TechnologyEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
newfileds.thesis-prognoneen_US
newfileds.general-subjectnoneen_US
item.languageiso639-1other-
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:Fulltext Publications
Files in This Item:
File Description SizeFormat
Efficient_Service_Discovery_in_Sensor_Networks_usi.pdf334.22 kBAdobe PDFView/Open
Show simple item record

Page view(s)

135
Last Week
1
Last month
3
checked on Apr 14, 2024

Download(s)

37
checked on Apr 14, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.