Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/4546
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Awad, Abdalkarim | - |
dc.contributor.author | Dressler, Falko | - |
dc.date.accessioned | 2017-03-16T08:58:02Z | - |
dc.date.available | 2017-03-16T08:58:02Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11889/4546 | - |
dc.description.abstract | We 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. This problem domain is being addressed by recent Distributed Hash Table (DHT)- based approaches for data management in Wireless Sensor Networks (WSNs). In general, such solutions can be classified in three main categories: real location based, virtual location based, and location independent, whereby the most recent approaches for data management and routing in WSNs rely on virtual coordinate | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Sensor networks | en_US |
dc.subject | Wireless LANs | en_US |
dc.title | Efficient routing and data management in sensor networks using virtual cord routing (VCP) | en_US |
dc.type | Article | en_US |
newfileds.department | Engineering and TechnologyEngineering and Technology | en_US |
newfileds.item-access-type | open_access | en_US |
newfileds.thesis-prog | none | en_US |
newfileds.general-subject | Engineering and Technology | الهندسة والتكنولوجيا | en_US |
item.languageiso639-1 | other | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | Fulltext Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Efficient_Routing_and_Data_Management_in_Sensor_Ne.pdf | 130.18 kB | Adobe PDF | View/Open |
Page view(s)
107
Last Week
0
0
Last month
2
2
checked on Apr 14, 2024
Download(s)
40
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.