.png){kind=icon}
返回
Graph Kernel Based Clustering Algorithm in MANETs
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3001137.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The mobile ad hoc network (MANET) is a kind of dynamic, easy to construct and universal network, which has been widely concerned by a large number of researchers. Graph theory provides an effective theoretical tool for MANETs modeling and analysis. Clustering is one of the most effective methods to measure network performance with different attributes. This paper gives the basic concept of graph kernel and discusses the principle of optimizing graph kernel and multi-graph kernel. In this paper, we propose a Graph Kernel based Clustering Algorithm in MANETs (GKCA). The GKCA algorithm gives the basic concept of graph kernel, discusses the principle of optimizing graph kernel and multi-graph kernel, and proposes the basic principle based on -hop graph kernel. GKCA algorithm uses shortest path (SP) to connect different cluster head nodes for packet transmission. The performance of GKCA algorithm, such as the control packets ratio, packets loss ratio, and average end-to-end delay are experimentally evaluated using network simulation (NS2) software. Experimental analysis shows that the proposed approach is efficient, and its performance advantage in dynamic mobile networks is promising.
Keyword:
Kernel
Peer-to-peer computing
Clustering algorithms
Ad hoc networks
Mobile computing
Mobile nodes
MANET
graph kernel
clustering
performance analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏Localization and Detection of Targets in Underwater Wireless Sensor Using Distance and Angle Based Algorithms基于距离和角度的水下无线传感器目标定位与检测算法.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏Towards models of strategic spatial choice behaviour: theory and application issuesGeoJournal
GeoJournalIF0
PREAI
分享收藏
分享收藏
查看更多内容