View : 154 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이미정-
dc.date.accessioned2016-08-28T11:08:07Z-
dc.date.available2016-08-28T11:08:07Z-
dc.date.issued2013-
dc.identifier.isbn9781467357401-
dc.identifier.issn1976-7684-
dc.identifier.otherOAK-13977-
dc.identifier.urihttp://dspace.ewha.ac.kr/handle/2015.oak/229915-
dc.description.abstractDue to the risky and power limited environment, sensor nodes deployed in wireless sensor networks are susceptible to a large-scale damage which usually causes simultaneous failures of a group of collocated sensors and thus gets the network fragmented into distinct partitions. In order to make the application operative under the situation, repairing the overall network connectivity is crucial. Moreover, the restoration may be subject to heterogeneous quality of service (QoS) requirements between the partitions. In this paper, we study an effective strategy for establishing a QoS satisfied connected topology among the partitions by deploying the least count of relay nodes. Finding the optimal number and position of RNs is NP-hard without considering QoS. Therefore we propose heuristics which is QoS-aware Relay node placement using Minimum Steiner tree on Convex hull (QRMSC). We validate the effectiveness of QRMSC through extensive simulation experiments. © 2013 IEEE.-
dc.languageEnglish-
dc.titleQRMSC: Efficient QoS-aware relay node placement in wireless sensor networks using Minimum Steiner tree on the Convex hull-
dc.typeConference Paper-
dc.relation.indexSCOPUS-
dc.relation.startpage36-
dc.relation.lastpage41-
dc.relation.journaltitleInternational Conference on Information Networking-
dc.identifier.doi10.1109/ICOIN.2013.6496348-
dc.identifier.scopusid2-s2.0-84876760253-
dc.author.googleLee S.-
dc.author.googleLee M.-
dc.contributor.scopusid이미정(7409118870)-
dc.date.modifydate20170922131432-
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE