首页 | 本学科首页   官方微博 | 高级检索  
     


Distributed trajectory design for data gathering using mobile sink in wireless sensor networks
Affiliation:1. Department of Computer Science, University of Sharjah, United Arab Emirates;2. Mathematics Department, Faculty of Science, Zagazig University, Zagazig, Egypt;1. Department of Computer Science and Electronics, Kyushu Institute of Technology, 680-4, Kawatsu, Iizuka, Fukuoka, 820-8502, Japan;2. Graduate School of Information Science, NAIST, 8916-5, Takayama, Ikoma, Nara 630-0192, Japan;3. Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan;1. MIS, Université de Picardie Jules Verne Amiens, France;2. Département d?informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada;1. Research Scholar, Departmentof Computer Engineering, GHRCE, Nagpur,India;2. IEEE Member,Departmentof Computer Science & Engineering, GHRCE, Nagpur, India;1. Computer Science Department, University of Sharjah, Sharjah 27272, United Arab Emirates;2. Mathematics Department, Zagazig University, Zagazig, Egypt
Abstract:Several studies have demonstrated the benefits of using a mobile sink (MS) to reduce energy consumption resulting from multi-hop data collection using a static sink in wireless sensor networks (WSNs). However, using MS may increase data delivery latency as it needs to visit each sensor node in the network to collect data. This is a critical issue in delay-sensitive applications where all sensed data must be gathered within a given time constraint. In this paper, we propose a distributed data gathering protocol utilizing MS for WSNs. The proposed protocol designs a trajectory for the MS, which minimizes energy consumption and delay. Our protocol operates in four main phases: data sensing, rendezvous point (RP) selection, trajectory design, and data gathering. In data sensing, a number of deployed sensor nodes keep sensing the target field for a specific period of time to capture events. Then, using a cluster-based RP selection algorithm, some sensor nodes are selected to become RPs based on local information. The selected RPs are then used to determine a trajectory for the MS. To do so, we propose three trajectory design algorithms that support different types of applications, namely reduced energy path (REP), reduced delay path (RDP), and delay bound path (DBP). The MS moves through the constructed path to accomplish its data gathering according to an effective scheduling technique that is introduced in this work. We validate the proposed protocol via extensive simulations over several metrics such as energy, delay, and time complexity.
Keywords:Distributed algorithm  Wireless sensor network  Data gathering  Mobile sink  Trajectory design
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号