期刊
AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS
卷 73, 期 -, 页码 110-118出版社
ELSEVIER GMBH
DOI: 10.1016/j.aeue.2016.12.005
关键词
Wireless sensor network; Mobile sink; Most desirable path; Data gathering; Rendezvous point; Data gathering schedule
Mobile sink (MS) has drawn significant attention for solving hot spot problem (also known as energy hole problem) that results from multihop data collection using static sink in wireless sensor networks (WSNs). MS is regarded as a potential solution towards this problem as it significantly reduces energy consumption of the sensor nodes and thus enhances network lifetime. In this paper, we first propose an algorithm for designing efficient trajectory for MS, based on rendezvous points (RPs). We next propose another algorithm for the same problem which considers delay bound path formation of the MS. Both the algorithms use k-means clustering and a weight function by considering several network parameters for efficient selection of the RPs by ensuring the coverage of the entire network. We also propose an MS scheduling technique for effective data gathering. The effectiveness of the proposed algorithms is demonstrated through rigorous simulations and comparisons with some of the existing algorithms over several performance metrics. (C) 2016 Elsevier GmbH. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据