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

A correlation-based coverage-aware and energy-balanced probabilistic flooding algorithm

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2017年第4期25卷 207-217页

作者： Wang Jianping Rong Huihui Sun Wei Li Qiyue Hefei Univ Technol Sch Elect & Automat Engn Hefei 230009 Anhui Peoples R China

Aiming at the costly explicit and implicit acknowledgements (ACKs) and the serious energy imbalance of the existing flooding algorithm, a correlation-based coverage-aware and energy-balanced probabilistic flooding algorithm (CCEP) is proposed in this paper. CCEP distinguishes previous flooding algorithms with three features: (1) it exploits the link correlation between neighbours;the one-hop neighbours that have high link correlation are assigned to an aggregate explicit or implicit acknowledgement (aggregate ACK), thus effectively ameliorating the ACK implosion problem and saves energy on both data transmit and ACKs;(2) it balances the residual energy of sensor nodes;(3) it achieves target reliability and energy efficiency by tracking real-time aggregate ACKs and probabilistically deciding whether to retransmit a packet. The simulation results reveal that CCEP saves more than 50% energy on explicit and implicit ACKs in most cases while achieving target reliability;CCEP simultaneously reduces network variance of residual energy, thus prolonging the network lifetime.

关键词： sensor networks link correlation probabilistic flooding target reliability energy balance coverage aware

来源：评论

学校读者我要写书评

暂无评论

coverage-aware Geocast Routing in Urban Vehicular Networks

Coverage-aware Geocast Routing in Urban Vehicular Networks

引用

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Jiang, Ruobing Zhu, Yanmin Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)9780769546766

Geocast routing in vehicular ad hoc networks plays an important role as the basis of applications such as traffic information sharing, emergency alarming, and geographic advertisement. It is quite challenging, however, to geocast packets through multi-hop relay vehicles because of the highly dynamic network topology, large scale city road system and fast moving vehicles. Our idea is to measure vehicles' coverage capability and forward packets to those vehicles with higher probability to successfully deliver the packets. The idea is rooted in the widely accepted concept that vehicular trajectories improve packet routing and the fact that vehicular trajectories are nowadays available through widely used navigation system. To accomplish the idea, the difficulty is to measure the coverage capability of a vehicle over a specific region with only partially available vehicular trajectories without accurate timing information. We propose a novel coverage graph to maintain collected trajectories of all the encountered vehicles and their most update timing information so that the extended coverage capability of each vehicle can be estimated. The coverage graph is constructed in a distributed way based on locally shared information and the packet forwarding decisions can be adaptively made to meet different routing objectives.

关键词： vehicular network geocast routing vehicular trajectory coverage aware

来源：评论

学校读者我要写书评

暂无评论

DATA AGGREGATION IN WIRELESS SENSOR NETWORK USING NODE CLUSTERING ALGORITHMS - A COMPARATIVE STUDY

DATA AGGREGATION IN WIRELESS SENSOR NETWORK USING NODE CLUST...

引用

IEEE Conference on Information and Communication Technologies (ICT)

作者： Nithyakalyani, S. Kumar, S. Suresh KSR Coll Engn Dept IT Tiruchengode India Vivekanandha Coll Technol Women Tiruchengode India

ISBN: (纸本)9781467357586;9781467357593

One of the most important parameters to be studied in Wireless Sensor Networks (WSNs) is its life time. There are two typical data mining processes that support to reduce the energy consumption of WSNs is clustering and data summarization. Several energy aware, communication aware, coverage aware, data dissemination and data aggregation/sensor fusion protocols and algorithms have been specifically designed for WSN to reduce the power consumption. One of the primary goals of Node clustering in WSN is in-network preprocessing that aims to obtain qualified information and to limit the energy consumed. A clustering algorithm is composed of three parts first electing cluster head (CH), selection of cluster membership and transferal data from members to *** relays only one of the aggregated or compressed data packet to base station or sink In this paper a brief comparative study is made from different research proposals, which suggests different cluster head selection approaches for data aggregation. The algorithms under study are Data relay K-means clustering algorithm, Fuzzy C- means clustering algorithms and Voronoi based Genetic clustering algorithm. Significant factors for evaluating and comparing these algorithms are defined, analyzed and summarized. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

关键词： Wireless sensor network protocols data summarization clustering algorithms Voronoi diagram energy aware coverage aware

来源：评论

学校读者我要写书评

暂无评论

DATA AGGREGATION IN WIRELESS SENSOR NETWORK USING NODE CLUSTERING ALGORITHMS - A COMPARATIVE STUDY

DATA AGGREGATION IN WIRELESS SENSOR NETWORK USING NODE CLUST...

引用

IEEE Conference on Information & Communication Technologies

作者： S. Nithyakalyani S. Suresh Kumar Department of IT K.S.R College of Engineering Vivekanandha College of Technology for Women

ISBN: (纸本)9781467357593

One of the most important parameters to be studied in Wireless Sensor Networks (WSNs) is its life time. There are two typical data mining processes that support to reduce the energy consumption of WSNs is clustering and data summarization. Several energy aware, communication aware, coverage aware, data dissemination and data aggregation/sensor fusion protocols and algorithms have been specifically designed for WSN to reduce the power consumption. One of the primary goals of Node clustering in WSN is in-network preprocessing that aims to obtain qualified information and to limit the energy consumed. A clustering algorithm is composed of three parts first electing cluster head (CH), selection of cluster membership and transferal data from members to *** relays only one of the aggregated or compressed data packet to base station or sink. In this paper a brief comparative study is made from different research proposals, which suggests different cluster head selection approaches for data aggregation. The algorithms under study are Data relay K-means clustering algorithm, Fuzzy C- means clustering algorithms and Voronoi based Genetic clustering algorithm. Significant factors for evaluating and comparing these algorithms are defined, analyzed and summarized. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

关键词： Wireless sensor network Protocols Data summarization Clustering algorithms Voronoi diagram Energy aware coverage aware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：