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

User online behavior based on big data distributed clustering algorithm

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2020年第2期17卷

作者： Wang, Yan Xian Peihua Univ Sch Accounting & Finance 888 Changning Rd Xian Shaanxi Peoples R China

With the development of big data technology more and more perfect, many colleges and universities have begun to use it to analyze the construction work. In daily life, such as class, study, and entertainment, the campus network exists. The purpose of this article is to study the online behavior of users, analyze students' use of the campus network by analyzing students, and not only have a clear understanding of the students' online access but also feedback on the operation and maintenance of the campus network. Based on the big data, this article uses distributed clustering algorithm to study the online behavior of users. This article selects a college online user as the research object and studies and analyzes the online behavior of school users. This study found that the second-year student network usage is as high as 330,000, which is 60.98% more than the senior. In addition, the majority of student users spend most of their online time on the weekend, and the other time is not much different. The duration is concentrated within 1 h, 1-2 h, 2-3 h in these three time periods. By studying the user's online behavior, you can understand the utilization rate of the campus network bandwidth resources and the distribution of the use of the network, to prevent students from indulging in the virtual network world, and to ensure that the network users can improve the online experience of the campus network while accessing the network resources reasonably. The research provides a reference for network administrators to adjust network bandwidth and optimize the network.

关键词： Big data distributed clustering algorithm user online behavior campus network

来源：评论

学校读者我要写书评

暂无评论

A Novel Energy-Aware distributed clustering algorithm for Heterogeneous Wireless Sensor Networks in the Mobile Environment

引用

SENSORS 2015年第12期15卷 31108-31124页

作者： Gao, Ying Wkram, Chris Hadri Duan, Jiajie Chou, Jarong S China Univ Technol Coll Comp Sci & Engn Guangzhou 510006 Guangdong Peoples R China Univ Calif Lawrence Berkeley Natl Lab Oakland CA 94612 USA Yun Nan Elect Power Test & Res Inst Grp CO Kunming 650217 Peoples R China Michigan State Univ Coll Engn E Lansing MI 48824 USA

In order to prolong the network lifetime, energy-efficient protocols adapted to the features of wireless sensor networks should be used. This paper explores in depth the nature of heterogeneous wireless sensor networks, and finally proposes an algorithm to address the problem of finding an effective pathway for heterogeneous clustering energy. The proposed algorithm implements cluster head selection according to the degree of energy attenuation during the network's running and the degree of candidate nodes' effective coverage on the whole network, so as to obtain an even energy consumption over the whole network for the situation with high degree of coverage. Simulation results show that the proposed clustering protocol has better adaptability to heterogeneous environments than existing clustering algorithms in prolonging the network lifetime.

关键词： heterogeneous wireless sensor networks sensor computing distributed clustering algorithm collaborative information processing energy efficient mobile sensor

来源：评论

学校读者我要写书评

暂无评论

A distributed clustering algorithm for Wireless Sensor Networks

A Distributed Clustering Algorithm for Wireless Sensor Netwo...

引用

2015 International Conference on Advanced Management Science and Information Engineering(AMSIE 2015)

作者： T.Lv Z.B.Cai School of National Defence Science and Technology Southwest University of Science and Technology

A clustering algorithm is designed to balance the network energy consumption,thereby maximizing network *** the clustering algorithm,the cluster head is generated in the comprehensive consideration of the minimum number of nodes in the overlay network,and the node residual energy and the number of neighboring nodes,during the operation of the network,setting the maximum wait time for cluster heads may avoid the their energy *** and simulation results show that,compared to several important clustering algorithms,the performance of DCOS is proven to be superior in balancing node energy consumption and prolonging the network lifetime.

关键词： LEACH DCOS wireless sensor networks distributed clustering algorithm

来源：评论

学校读者我要写书评

暂无评论

Rural Broadband Access via Clustered Collaborative Communication

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2018年第5期26卷 2160-2173页

作者： Agarwal, Satyam De, Swades IIT Guwahati Dept Elect & Elect Engn Gauhati 781039 India IIT Delhi Dept Elect Engn New Delhi 110016 India IIT Delhi Bharti Sch Telecom New Delhi 110016 India

Broadband penetration in rural areas of the developing countries is significantly low. The unique challenges in enabling rural connectivity are sparsity of population locations and modest income of the villagers, which induce low return on investment to the conventional cellular network providers. In this paper, we propose a novel cluster-based network architecture and protocols for efficient rural broadband coverage which requires minimal infrastructure setup by the service provider. Multiple customer premise equipments (CPEs) in a village form clusters and transmit collaboratively over unused television bands to the base station. A two-tier uplink access protocol is proposed and its performance in terms of network throughput and energy efficiency are obtained analytically. The cluster size is optimized to maximize the uplink network throughput and energy-efficiency. A distributed clustering algorithm is proposed for the CPEs to form clusters, while channels are allocated to the clusters using the proposed channel allocation algorithm to minimize inter-cluster interference. Via network simulation studies we demonstrate that the proposed architecture can be cost-effective and energy-efficient, while being scalable at the same time.

关键词： Rural broadband system architecture TVWS distributed beamforming medium access control protocol distributed clustering algorithm discrete-time Markov chains

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: Parallel distributed computing based wireless sensor network anomaly data detection in IoT framework

引用

COGNITIVE SYSTEMS RESEARCH 2018年 52卷 342-350页

作者： Li, Qian Sun, Ruizhi Wu, Huiling Zhang, Qianqian China Agr Univ Coll Informat & Elect Engn Beijing 100080 Peoples R China Henan Univ Anim Husb & Econ Coll Automat Zhengzhou 450000 Henan Peoples R China Henan Engn Res Ctr Anim Hlth Environm & Intellige Zhengzhou Henan Peoples R China

To reduce the energy consumption of wireless sensor networks (WSNs) and prolong the network lifetime, non-uniform clustering routing (DUCF) of WSNs based on distributed fuzzy logic interference is proposed. DUCF protocol fully considers the residual energy of node, the node degree and distance from the base station. Fuzzy rule is formulated based on experience and the probability of node being elected as cluster head and the size of cluster are obtained through fuzzy interference system. DUCF protocol forms non-uniform cluster and further balances the energy consumption among cluster heads. Simulation result indicates that the performances of DUCF protocol in network lifetime and energy consumption are superior to that of LEACH, CHEF and EAUCF protocol. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks (WSNs) Route Fuzzy logic inference distributed clustering algorithm Residual energy

来源：评论

学校读者我要写书评

暂无评论

Improving Government-Data Learning via distributed clustering Analysis 7

Improving Government-Data Learning via Distributed Clusterin...

引用

7th International Conference on Cloud Computing and Big Data (CCBD)

作者： Zhong, Yurong Univ Elect Sci Technol China Res Inst Elect Sci & Technol Chengdu Sichuan Peoples R China

ISBN: (纸本)9781509035557

clustering analysis is a study which is of great value, and the large-scale government-data needed to be handled by cluster analysis is growing increasingly. Efficient analysis techniques of large-scale data need to be adopted to handle the large-scale data. Traditional model of serial programming has serious scalability shortage, which don't satisfy the need of the large-scale government-data handling for computing and storage resources. distributed computing technology represented by the MapReduce has good scalability, and can greatly improve the execution efficiency of data-intensive algorithm, and give play to the computing power of compute cluster based on general hardware. Based on the background of "data platform for public petition", it aims to study how to combine the cluster analysis technology with the current massive government-data, extracting useful information from the mass characteristics hidden in the data through the cluster analysis technology, which can provide comprehensive analyse for system managers and decision makers. This paper focus on the study of combining basic distributed clustering algorithm and TF-IDF algorithm, developing the cases feature analysis module based on distributed clustering algorithm. Based on distributed clustering algorithm, according to the information of the cases, do clustering analysis of cases according to its characteristics, and then get several hidden information through serveral decisional result.

关键词： component government-data distributed clustering algorithm TFIDF algorithm parallel computing feature selection analysis of cases

来源：评论

学校读者我要写书评

暂无评论

A Belief Propagation Based Hierarchical Approach for Capacitated Network Decomposition

A Belief Propagation Based Hierarchical Approach for Capacit...

引用

IEEE/CIC International Conference on Communications in China

作者： Juan Liu Huaiyu Dai Department of Electrical and Computer Engineering North Carolina State University

ISBN: (纸本)9781479941452

With increasing applications of large-scale networks, fully distributed and self-organized clustering algorithms have attracted much attention recently. In this paper, we review the capacitated network decomposition problem that aims to minimize the cut weight. As an extension of our previous work [1], we propose a novel belief propagation based distributed clustering algorithm, which allows each node to select one or multiple co-cluster nodes by sending messages between pairs of nodes. Based on the max-product algorithm, we derive the message-passing procedure on the corresponding factor graph. The distributed clustering algorithm is also extended for a hierarchical structure. Simulation results show that our algorithm can efficiently find a capacitated network decomposition solution, and it outperforms the popular affinity propagation algorithm in some applications.

关键词： belief maintenance graph theory network theory (graphs) pattern clustering affinity propagation algorithm belief propagation capacitated network decomposition distributed clustering algorithm factor graph hierarchical approach hierarchical structure max-product algorithm message-passing procedure algorithm design and analysis clustering algorithms Frequency modulation Joining processes Measurement Message passing Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2011年第1期71卷 27-39页

作者： Yin, Bolian Shi, Hongchi Shang, Yi Univ Missouri Dept Comp Sci Columbia MO 65211 USA Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad hoc networks. Although many distributed algorithms for constructing the CDS have been proposed, nearly all of them require two or more separated phases, which may cause problems such as long delay in the later phases when the network size is large. This paper proposes a distributed Single-Phase algorithm for constructing a connected dominating set, DSP-CDS, in ad hoc networks. The DSP-CDS is an asynchronous distributed algorithm and converges quickly in a single phase. Each node uses one-hop neighborhood information and makes a local decision on whether to join the dominating set. Each node bases its decision on a key variable, strength, which guarantees that the dominating set is connected when the algorithm converges. The rules for computing strength can be changed to accommodate different application needs. The DSP-CDS adapts well to dynamic network topologies, upon which the algorithm makes only necessary local updates to maintain the CDS of the network. The performance of the DSP-CDS can be tuned by adjusting two main parameters. Extensive simulations have demonstrated that those parameters can affect the CDS size, the CDS diameter, and number of rounds for the algorithm to converge. Comparisons with other multiple-phase CDS algorithms have shown that the DSP-CDS converges fast and generates a CDS of comparable size. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Connected dominating set distributed clustering algorithm Ad hoc networks Dynamic topology

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for constructing connected dominating set in Ad Hoc networks

An efficient algorithm for constructing connected dominating...

引用

4th IEEE Consumer Communications and Networking Conference

作者： Yin, Bolian Shi, Hongchi Shang, Yi Univ Missouri Dept Comp Sci Columbia MO 65211 USA

ISBN: (纸本)9781424406661

This paper presents a distributed single-phase algorithm for constructing connected dominating set, DSP-CDS, in large ad hoc networks. DSP-CDS converges quickly in a single phase and adapts well to dynamic network topologies caused by node mobility, node failure, and deployment of new nodes. Performance of DSP-CDS can be tuned by adjusting two main parameters, which can affect the CDS size, CDS diameter, and number of rounds for the algorithm to converge. Comparisons with other multiple-phase CDS algorithms show that DSP-CDS converges faster and generates a CDS of comparable size.

关键词： connected dominating set distributed clustering algorithm ad hoc networks dynamic topology

来源：评论

学校读者我要写书评

暂无评论

Adaptive clustering and transmission range adjustment in wireless sensor networks

Adaptive clustering and transmission range adjustment in wir...

引用

6th IASTED International Conference on Communications, Internet, and Information Technology

作者： Yin, Bolian Shi, Hongchi Shang, Yi Ma, Dianfu Univ Missouri Dept Comp Sci Columbia MO 65211 USA Beihang Univ Dept Comp Sci & Engn Beijing 100083 Peoples R China

ISBN: (纸本)9780889866737

clustering and transmission range adjustment are major approaches to energy saving in wireless sensor networks. Connected dominating set (CDS) as a special clustering structure is widely used as a virtual backbone in a wireless sensor network. In clustered wireless sensor networks, traffic load has a great impact on the energy saving effect of a clustering algorithm. This paper presents RDSP-CDS, a traffic-adaptive clustering and transmission range adjustment algorithm. RDSP-CDS a distributed clustering algorithm that utilizes our energy analysis model [1]. In RDSP-CDS, each node chooses the optimal transmission range based on its local knowledge about the traffic load to achieve network-wide energy saving goals. RDSP-CDS is suitable for heterogeneous dynamic-topology networks.

关键词： wireless networks connected dominating set distributed clustering algorithm dynamic topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：