检索结果-内蒙古大学图书馆

data aggregation scheduling in Battery-Free Wireless Sensor Networks

IEEE TRANSACTIONS ON MOBILE COMPUTING 2022年第6期21卷 1972-1984页

作者： Zhu, Tongxin Li, Jianzhong Gao, Hong Li, Yingshu Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

To break through the limitation of battery-powered wireless sensor networks, a novel kind of network, named battery-free wireless sensor network (BF-WSN), is proposed. Battery-free sensor nodes in BF-WSNs harvest energy from power sources in their ambient environment, such as solar power, wind power and radio frequency (RF) signal power, etc., instead of batteries. Therefore, the energy consumption of battery-free sensor nodes are not limited by the battery capacity anymore. However, they still have limited energy harvesting rates and energy capacities. data aggregation is a fundamental operation in sensor networks where the sensory data gathered by the relay nodes can be merged by in-network computation, such as taking the maximum, average, or sum, etc., of them. Due to the energy features of BF-WSNs, the data aggregation scheduling problem in BF-WSNs is more complicated and the previous aggregation scheduling algorithms designed for battery-powered WSNs are no longer applicable. This paper investigates the Minimum-Latency aggregation scheduling problem in BF-WSNs, which is proved to be NP-hard. Then, we propose the data aggregation scheduling algorithm to solve the problem. Finally, the theoretical analysis and extensive simulation results are provided to verify the performance of the proposed algorithm.

关键词： Wireless sensor networks Schedules data aggregation Interference Energy harvesting scheduling Batteries Battery-free wireless sensor networks data aggregation scheduling interference-free scheduling

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-Based Active Minimum Delay data aggregation scheduling in Wireless-Powered IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第11期9卷 8786-8799页

作者： Jiao, Xianlong Lou, Wei Guo, Songtao Wang, Ning Chen, Chao Liu, Kai Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

Thanks to the promising wireless power transmission (WPT) technology, wireless-powered Internet of Things (WPIoT) can significantly improve the sustainable service ability of Internet of Things (IoT) with low personnel maintenance costs, and thus, shows remarkable and broad prospects in many applications, especially under the abominable and dangerous environment. Minimum delay data aggregation scheduling (MAS) is a problem of cardinal significance in WPIoT with the objective of timely collecting the data of IoT devices. However, due to the residual energy limitation of IoT devices, WPIoT shows the special feature of adopting the store-charge-and-forward communication mode, which brings new research challenges on designing efficient solutions to the MAS problem. We show that the MAS problem under the physical interference model in WPIoT is NP-hard. To tackle this problem, we propose a delay-efficient data aggregation scheduling algorithm called HADA based on an active data aggregation tree construction method and a novel hypergraph-based link scheduling method. Extensive numerical experiments are conducted to evaluate the performance of our proposed algorithm. The results demonstrate that our HADA algorithm can efficiently improve the performance compared with the existing baseline algorithms.

关键词： Interference data aggregation Delays Internet of Things Wireless sensor networks scheduling algorithms Wireless communication Active data aggregation tree construction data aggregation scheduling hypergraph link scheduling wireless-powered Internet of Things (WPIoT)

来源：评论

学校读者我要写书评

暂无评论

An Intelligent delay efficient data aggregation scheduling for distributed sensor networks

引用

MICROPROCESSORS AND MICROSYSTEMS 2022年 93卷

作者： Joshi, Pallavi Raghuvanshi, Ajay Singh Kumar, Sarvesh Natl Inst Technol Raipur Dept Elect & Commun Engn Raipur India Babu Banarasi Das Univ Lucknow 226028 Uttar Pradesh India

data aggregation is the most prominent task in many wireless sensor network (WSN) applications, that enables all data from the network to be collected at the sink node. The most critical issue in data aggregation is data aggregation scheduling. This problem becomes even cumbersome when considered to obtain minimum latency and collision in the networks where fixed amount of data can be aggregated. Many researches have been conducted to resolve the issue of data delivery with low latency and collision. Though, some methods nearly achieved this objective but at the cost of increased complexity. Also, many works assume the system to be centralized having knowledge of every related device in the network. Practically, WSNs are likely to be distributed where each device's information is dissociated from the other. In this context, a data aggregation scheduling algorithm is proposed to aggregate the data from a tree-based distributed sensor network. An effective aggregation tree construction based on Dijkstra's algorithm is adopted which avoids the chance of re-transmission of data. Furthermore, a new collision prevention scheduling (CPS) algorithm is designed which ensures the data aggregation through non-collision schedules using minimum time slots. The proposed method shows 54.74% less aggregation latency compared to its competitor data aggregation scheduling approach. The outcome of extensive simulations confirms the efficiency and good performance of the proposed algorithm over previous works.

关键词： Wireless sensor networks data aggregation tree Distributed sensor networks data aggregation scheduling Dijkstra?s algorithm

来源：评论

学校读者我要写书评

暂无评论

Long-Lifetime and Low Latency data aggregation scheduling for Wireless Sensor Network

引用

JOURNAL OF TESTING AND EVALUATION 2019年第6期47卷 3878-3892页

作者： Gayathri, Easwaran Vanitha, Mohanraj Mangayarkarasi, Ramaiah Sakthivel, Ramachandran VIT Univ Sch Informat Technol & Engn Katpadi Thiruvallam Rd Vellore 632014 Tamil Nadu India VIT Univ Sch Elect Engn Katpadi Thiruvallam Rd Vellore 632014 Tamil Nadu India

Wireless Sensor Networks contain an incredible number of hubs with limited registering, detecting, and wireless communication capacities. These systems have been utilized as a part of a wide zone of utilizations, such as human services, contamination checking, and target-following frameworks. The dynamic clustering of sensors into bunches is a prevalent procedure to expand the system lifetime and increment adaptability. To accomplish this, in this article the sensor hubs are adjusted to ensure a long lifetime and the activities are arranged into rounds that use fixed time intervals. In the first phase, a clustering topology is found, and a group head is picked in view of the outstanding energy level. Then the cluster head screens the network energy threshold value to identify the energy drain rate of all its cluster members. In the second stage, the Long-Lifetime and Low-Latency data aggregation scheduling method is used. This scheduling method assigns schedule openings to group part information parcels. Here, congestion occurrence is completely kept away from the scenario. In the third stage, an Energy-Efficient Distributed Schedule-based convention is used to keep up greatest residual energy level over the network. The experimental outcome shows the steps proposed in this article ensure an increase in the network lifetime and decrease in the energy utilization.

关键词： dynamic clustering Long-Lifetime and Low-Latency data aggregation scheduling DHRP data aggregation scheduling

来源：评论

学校读者我要写书评

暂无评论

Many-to-many data aggregation scheduling in wireless sensor networks with two sinks

引用

COMPUTER NETWORKS 2017年 123卷 184-199页

作者： Saginbekov, Sain Jhumka, Arshad Nazarbayev Univ Dept Comp Sci Astana Kazakhstan Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

Traditionally, wireless sensor networks (WSNs) have been deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink. Moreover, deploying more than one sink may prolong the network lifetime and address fault tolerance issues. Several protocols have been proposed for WSNs with multiple sinks. However, most of them are routing protocols. Differently, our main contribution, in this paper, is the development of a distributed data aggregation scheduling (DAS) algorithm for WSNs with two sinks. We also propose a distributed energy-balancing algorithm to balance the energy consumption for the aggregators. The energy-balancing algorithm first forms trees rooted at nodes which are termed virtual sinks and then balances the number of children at a given level to level the energy consumption. Subsequently, the DAS algorithm takes the resulting balanced tree and assigns contiguous slots to sibling nodes, to avoid unnecessary energy waste due to frequent active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Through simulation and testbed experiments, we show the correctness and performance of our algorithms. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks data aggregation scheduling Two sinks Many-to-many communication Medium access control

来源：评论

学校读者我要写书评

暂无评论

Source Location Privacy-Aware data aggregation scheduling for Wireless Sensor Networks 37

Source Location Privacy-Aware Data Aggregation Scheduling fo...

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Kirton, Jack Bradbury, Matthew Jhumka, Arshad Univ Warwick Dept Comp Sci Coventry W Midlands England

ISBN: (纸本)9781538617915

Source location privacy (SLP) is an important property for the class of asset monitoring problems in wireless sensor networks (WSNs). SLP aims to prevent an attacker from finding a valuable asset when a WSN node is broadcasting information due to the detection of the asset. Most SLP techniques focus at the routing level, with typically high message overhead. The objective of this paper is to investigate the novel problem of developing a TDMA MAC schedule that can provide SLP. We make a number of important contributions: (i) we develop a novel formalisation of a class of eavesdropping attackers and provide novel formalisations of SLP-aware data aggregation schedules (DAS), (ii) we present a decision procedure to verify whether a DAS schedule is SLP-aware, that returns a counterexample if the schedule is not, similar to model checking, and (iii) we develop a 3-stage distributed algorithm that transforms an initial DAS algorithm into a corresponding SLP-aware schedule against a specific class of eavesdroppers. Our simulation results show that the resulting SLP-aware DAS protocol reduces the capture ratio by 50% at the expense of negligible message overhead.

关键词： TDMA data aggregation scheduling Source Location Privacy Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Contribution to the Optimization of data aggregation scheduling in Wireless Sensor Networks 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO)

作者： Yagouni, Mohammed Mobasti, Zakaria Bagaa, Miloud Djaoui, Hichem USTHB Laromad BP 32 El Alia Algiers Algeria USTHB RECITS Lab Algiers Algeria Res Ctr Sci & Tech Informat CERIST Algiers Algeria

ISBN: (纸本)9783319181677;9783319181660

Wireless Sensor Network (WSN) is a very important research area. It has wide range of applications in different domains, such as industrial production processes and military fields. The sensing of events and forwarding of sensed information, through multi-hops wireless communications, toward the base-station is the main functionality of a WSN. In this paper, we study the problem of how gather and aggregate data from the whole sensor nodes to the base-station, with efficient way, such that the energy consumption is reduced, messages collision are prevented and the time latency is minimized. The problem of data aggregation scheduling is mathematically modeled, and then a heuristic to resolve the problem are proposed. The simulation results show the efficiency of our solution compared to the best approaches existed in literature.

关键词： Sensors Wireless Sensor Network data aggregation scheduling Heuristic mathematical modeling

来源：评论

学校读者我要写书评

暂无评论

An improved distributed data aggregation scheduling in wireless sensor networks

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2014年第2期27卷 221-240页

作者： Li, Deying Zhu, Qinghua Du, Hongwei Li, Jianzhong Renmin Univ China Sch Informat Beijing 100872 Peoples R China Harbin Inst Technol Shenzhen Grad Sch Shenzhen 518055 Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China

This paper focuses on the distributed data aggregation collision-free scheduling problem, which is one of very important issues in wireless sensor networks. Bo et al. (Proc. IEEE INFOCOM, 2009) proposed an approximate distributed algorithm for the problem and Xu et al. (Proc. ACM FOWANC, 2009) proposed a centralized algorithm and its distributed implementation to generate a collision-free scheduling for the problem, which are the only two existing distributed algorithms. Unfortunately, there are a few mistakes in their performance analysis in Bo et al. (Proc. IEEE INFOCOM, 2009), and the distributed algorithm can not get the same latency as the centralized algorithm because the distributed implementation was not an accurate implementation of the centralized algorithm (Xu et al. in Proc. ACM FOWANC, 2009). According to those, we propose an improved distributed algorithm to generate a collision-free schedule for data aggregation in wireless sensor networks. Not an arbitrary tree in Bo et al. (Proc. IEEE INFOCOM, 2009) but a breadth first search tree (BFS) rooted at the sink node is adopted, the bounded latency 61R+5 Delta-67 of the schedule is obtained, where R is the radius of the network with respect to the sink node and Delta is the maximum node degree. We also correct the latency bound of the schedule in Bo et al. (Proc. IEEE INFOCOM, 2009) as 61D+5 Delta-67, where D is a diameter of the network and prove that our algorithm is more efficient than the algorithm (Bo et al. in Proc. IEEE INFOCOM, 2009). We also give a latency bound for the distributed implementation in Xu et al. (Proc. ACM FOWANC, 2009).

关键词： Distributed approximation algorithm data aggregation scheduling Collision-free Latency Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2014年第1期74卷 1789-1801页

作者： Jhumka, Arshad Bradbury, Matthew Saginbekov, Sain Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

This paper investigates the design of fault-tolerant TDMA-based data aggregation scheduling (DAS) protocols for wireless sensor networks (WSNs). DAS is a fundamental pattern of communication in wireless sensor networks where sensor nodes aggregate and relay data to a sink node. However, any such DAS protocol needs to be cognisant of the fact that crash failures can occur. We make the following contributions: (i) we identify a necessary condition to solve the DAS problem, (ii) we introduce a strong and weak version of the DAS problem, (iii) we show several impossibility results due to the crash failures, (iv) we develop a modular local algorithm that solves stabilising weak DAS and (v) we show, through simulations and an actual deployment on a small testbed, how specific instantiations of parameters can lead to the algorithm achieving very efficient stabilisation. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Wireless sensor networks data aggregation scheduling Fault tolerance Crashes Collision freedom Impossibility Correctness

来源：评论

学校读者我要写书评

暂无评论

Delay Efficient scheduling Algorithms for data aggregation in Multi-Channel Asynchronous Duty-Cycled WSNs

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2019年第9期67卷 6179-6192页

作者： Jiao, Xianlong Lou, Wei Guo, Songtao Yange, Libin Feng, Xinxi Wang, Xiaodong Chen, Guirong Air Force Engn Univ Informat & Nav Coll Xian 710077 Shaanxi Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Northwestern Polytech Univ Sch Automat Xian 710072 Shaanxi Peoples R China Natl Univ Def Technol Coll Comp PDL Key Lab Changsha 410073 Hunan Peoples R China

data aggregation scheduling is a critical issue in WSNs. This paper studies the Delay efficient data aggregation scheduling problem in multi-Channel asynchronous Duty-cycled WSNs (DDACD problem), which aims to accomplish data aggregation with minimum delay. Existing studies, nevertheless, either focus on non-sleeping scenarios or assume that nodes communicate with one single channel, and thus may have poor performance if directly applied to multi-channel asynchronous duty-cycled scenarios. We first show that the DDACD problem is NP-hard. Then, we propose two new concepts of candidate active conflict graphs (CACGs) and feasible active conflict graphs (FACGs) to depict the relationship of the data aggregation links and present two coloring methods to well separate the links at different time slots or on different channels. Based on these two new concepts and two coloring methods, we propose an efficient data aggregation scheduling algorithm called EDAS, which exploits the fewest-children-first rule to choose the forwarding nodes to benefit the link scheduling. To reduce unused time slots or channels, we further propose a novel algorithm called NDAS by making full use of the characteristics of multi-channel asynchronous duty-cycled WSNs. We prove that our algorithms can achieve provable performance guarantee. The results of extensive simulations confirm the efficiency of our algorithms.

关键词： Approximation algorithms data aggregation scheduling multi-channel duty cycle wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：