View : 16 Download: 0

QRMSC: Efficient QoS-aware relay node placement in wireless sensor networks using Minimum Steiner tree on the Convex hull

Title
QRMSC: Efficient QoS-aware relay node placement in wireless sensor networks using Minimum Steiner tree on the Convex hull
Authors
Lee S.Lee M.
Ewha Authors
이미정
SCOPUS Author ID
이미정scopus
Issue Date
2013
Journal Title
International Conference on Information Networking
ISSN
1976-7684JCR Link
Citation
pp. 36 - 41
Indexed
SCOPUS scopus
Abstract
Due 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.
DOI
10.1109/ICOIN.2013.6496348
ISBN
9781467357401
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