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

3rd International Conference on Advanced Computing and Communication Systems (ICACCS)

作者： Gopalakrishnan, S. Kumar, P. Mohan PSNA Coll Engn & Technol Dindigul 624622 India Jeppiaar Engn Coll Dept Comp Sci Res Ctr Madras 600119 Tamil Nadu India

ISBN: (纸本)9781467392068

data collection schemes fail to supply a secure reliable network in terms of quality, traffic, and end-to-end affiliation. during this paper, a Improved rate Energy-efficient and Linkaware Cluster-tree (IVELCT) theme for knowledge assortment in WSNs is projected which might effectively mitigate the issues of coverage distance, mobility, delay, traffic, tree intensity, and end-to-end affiliation. The projected IVELCT constructs the information assortment tree (DCT) supported the cluster head location. the information assortment node within the DCT doesn't participate in sensing on this explicit spherical, however, it merely collects the information packet from the cluster head and delivers it to the sink. The designed IVELCT theme minimizes the energy exploitation, reduces the end-to-end delay and traffic in cluster head in WSNs by effective usage of the DCT. The strength of the IVELCT algorithmic rule is to construct an easy tree structure, thereby reducing the energy consumption of the cluster head and avoids frequent cluster formation. It additionally maintains the cluster for a substantial quantity of your time. Simulation results have incontestable that IVELCT provides higher QoS in terms of energy consumption, throughput, end-to-end delay, and network time period for mobility-based WSNs.

关键词： Improved Velocity energy-efficient and link-aware cluster-tree data collection tree data collection node cluster tree wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Efficient Cluster-tree Based data collection Scheme for Large Mobile Wireless Sensor Networks

引用

IEEE SENSORS JOURNAL 2015年第4期15卷 2377-2390页

作者： Velmani, R. Kaarthick, B. Anna Univ Dept Comp Sci & Engn Reg Ctr Coimbatore Coimbatore 641047 Tamil Nadu India Coimbatore Inst Engn & Technol Dept Elect & Commun Coimbatore 641032 Tamil Nadu India

real world applications. The effectiveness of WSNs purely depends on the data collection scheme. Numerous data collection schemes such as multipath, chain, tree, cluster and hybrid topologies are available in literature for collecting data in WSNs. However, the existing data collection schemes fail to provide a guaranteed reliable network in terms of mobility, traffic, and end-to-end connection. In this paper, a Velocity Energy-efficient and Link-aware Cluster-tree (VELCT) scheme for data collection in WSNs is proposed which would effectively mitigate the problems of coverage distance, mobility, delay, traffic, tree intensity, and end-to-end connection. The proposed VELCT constructs the data collection tree (DCT) based on the cluster head location. The data collection node in the DCT does not participate in sensing on this particular round, however, it simply collects the data packet from the cluster head and delivers it to the sink. The designed VELCT scheme minimizes the energy exploitation, reduces the end-to-end delay and traffic in cluster head in WSNs by effective usage of the DCT. The strength of the VELCT algorithm is to construct a simple tree structure, thereby reducing the energy consumption of the cluster head and avoids frequent cluster formation. It also maintains the cluster for a considerable amount of time. Simulation results have demonstrated that VELCT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.

关键词： Velocity energy-efficient and link-aware cluster-tree data collection tree data collection node cluster tree wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Markov Decision Process-Based Switching Algorithm for Sustainable Rechargeable Wireless Sensor Networks

引用

IEEE SENSORS JOURNAL 2016年第8期16卷 2788-2797页

作者： Rout, Rashmi Ranjan Krishna, Mothku Sai Gupta, Shalinee Natl Inst Technol Warangal Dept Comp Sci & Engn Warangal 506004 Andhra Pradesh India

In a tree-based wireless sensor network (WSN), a tree structure rooted at sink node is usually created for efficient data collection. Recently, the use of solar harvesting technologies for rechargeable sensor nodes is evolving. Moreover, in a tree-based rechargeable WSN, the nodes that belong to different routes will have different energy dissipation due to unequal harvested-energy and utilized-energy. Network sustainability and energy efficiency are important issues in a tree-based rechargeable sensor network. In this paper, a Markov decision process-based switching algorithm has been designed for a sustainable data collection tree while reducing energy consumption in the network. Furthermore, an analysis of energy consumption has been performed using a real-time sensor traffic pattern. A prediction model has been adopted to estimate the harvesting energy (based on solar power) for the rechargeable sensor nodes. In this paper, the state of each node is defined based on different independent energy levels. The state of each node may change with time depending on harvested-energy and utilized-energy. The proposed Markov decision process approach finds the optimal switching policy for sensor nodes, which switch from one parent to another based on energy levels to preserve sustainability. A detailed theoretical analysis has been performed along with simulation results to show the efficacy of the proposed approach.

关键词： Rechargeable wireless sensor network data collection tree Markov decision process switching energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Randomized Switching for Maximizing Lifetime in tree-Based Wireless Sensor Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2015年第5期23卷 1401-1415页

作者： Imon, Sk Kajal Arefin Khan, Adnan Di Francesco, Mario Das, Sajal K. Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA Aalto Univ Dept Comp Sci & Engn Aalto 00076 Finland Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA

In most wireless sensor network (WSN) applications, data are typically gathered by sensor nodes and reported to a data collection point called sink. To support such a data collection pattern, a tree structure rooted at the sink is defined. Depending on various factors, including the WSN topology and the availability of resources, the energy consumption of nodes in different paths of the data collection tree may vary largely, thus affecting the overall network lifetime. This paper addresses the problem of lifetime maximization of WSNs based on data collection trees. Specifically, we propose a novel and efficient algorithm, called Randomized Switching for Maximizing Lifetime (RaSMaLai), that aims at extending the lifetime of WSNs through load balancing. Given an initial data collection tree, RaSMaLai randomly switches some sensor nodes from their original paths to other paths with lower load. We prove that, under appropriate settings of the operating parameters, RaSMaLai converges with a low time complexity. We further design a distributed version of our algorithm. Through an extensive performance evaluation study that includes simulation of large-scale scenarios and real experiments on a WSN testbed, we show that the proposed RaSMaLai algorithm and its distributed version achieve a longer network lifetime than the state-of-the-art solutions.

关键词： data collection tree load balancing network lifetime randomized algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An effective data collection algorithm for wireless sensor network

引用

COMPUTING 2013年第9期95卷 723-738页

作者： Yu Lasheng Li Jie Liu Renjie Cent S Univ Sch Informat Sci & Engn Changsha Hunan Peoples R China Univ Tsukuba Grad Sch Syst & Informat Engn Dept Comp Sci Tsukuba Ibaraki Japan

This paper proposes an effective subtree merging based data collection algorithm for wireless sensor networks (WSNs), named as SMDC algorithm, which can be applied in a new kind of applications in WSNs, i.e., area query application. The SMDC algorithm can prevent unnecessary energy consumption in ancestor nodes for routing through the union of disjoint sets for different subtrees in the network. The SMDC algorithm includes four phases. Firstly the cluster trees are constructed respectively in the target area. Then the disjoint node sets for each subtrees will be found;thirdly the disjoint subtrees are connected via the closest node between two subtrees;and the last phase is to disconnect the subtrees which have been connected to a new tree branch from their previous tree structure. This paper also presents the simulation to compare the SMDC algorithm with some related works including conventional minimum spanning tree algorithm. Simulation results show that the SMDC algorithm can reduce the redundant energy consumption and the number of hops which results in the reduction of total energy consumption. Especially, it is more efficient as the number of sensor nodes in a target area increases.

关键词： Energy efficiency Wireless sensor network data collection tree Merging algorithm

来源：评论

学校读者我要写书评

暂无评论

RaSMaLai: A Randomized Switching Algorithm for Maximizing Lifetime in tree-based Wireless Sensor Networks

RaSMaLai: A Randomized Switching Algorithm for Maximizing Li...

引用

32nd IEEE INFOCOM Conference

作者： Imon, Sk Kajal Arefin Khan, Adnan Di Francesco, Mario Das, Sajal K. Univ Texas Arlington Ctr Res Wireless Mobil & Networking Arlington TX 76019 USA

ISBN: (纸本)9781467359467

In most wireless sensor network (WSN) applications, data are typically gathered by the sensor nodes and reported to a data collection point, called the sink. In order to support such data collection, a tree structure rooted at the sink is usually defined. Based on different aspects, including the actual WSN topology and the available energy budget, the energy consumption of nodes belonging to different paths in the data collection tree may vary significantly. This affects the overall network lifetime, defined in terms of when the first node in the network runs out of energy. In this paper, we address the problem of lifetime maximization of WSNs in the context of data collection trees. In particular, we propose a novel and efficient algorithm, called Randomized Switching for Maximizing Lifetime (RaSMaLai) that aims at maximizing the lifetime of WSNs through load balancing with a low time complexity. We further design a distributed version of our algorithm, called D-RaSMaLai. Simulation results show that both the proposed algorithms outperform several existing approaches in terms of network lifetime. Moreover, RaSMaLai offers lower time complexity while the distributed version, D-RaSMaLai, is very efficient in terms of energy expenditure.

关键词： Sensor Networks Load Balancing data collection tree Network Lifetime Randomized Algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：