一种低开销的机会网络社区检测算法

任智; 黄希凯; 谭永银

Chinese

您当前的位置：

首页 >

文章列表页 >

一种低开销的机会网络社区检测算法

更新时间：2026-09-04

- 一种低开销的机会网络社区检测算法
- A Low-overhead Community Detect Algorithm in Opportunistic Networks
- 微电子学与计算机 2016年33卷第9期页码：60-63
- 作者机构：
  
  重庆邮电大学机构移动通信技术重庆市重点实验室,重庆,400065
- 作者简介：
- 基金信息：
  
  国家自然科学基金项目 61379159长江学者和创新团队发展计划基金资助项目 IRT1299
- DOI：
  中图分类号：
- 纸质出版：2016
- 稿件说明：
移动端阅览
任智, 黄希凯, 谭永银. 一种低开销的机会网络社区检测算法[J]. 微电子学与计算机, 2016, 33(9): 60-63,69.

REN Zhi, HUANG Xi-kai, TAN Yong-yin. A Low-overhead Community Detect Algorithm in Opportunistic Networks[J]. 2016, 33(9): 60-63.
任智, 黄希凯, 谭永银. 一种低开销的机会网络社区检测算法[J]. 微电子学与计算机, 2016, 33(9): 60-63,69. DOI：

REN Zhi, HUANG Xi-kai, TAN Yong-yin. A Low-overhead Community Detect Algorithm in Opportunistic Networks[J]. 2016, 33(9): 60-63. DOI：

摘要

针对CDTFS(Community Detection algorithm based on Threshold of Familiar Set)算法在社区检测阶段中存在通信冗余开销的问题

提出了一种低开销机会网络社区检测算法—NSDMDT(Network Structure Detection Mechanism based on Dynamic Threshold).NSDMDT算法优化了新节点加入朋友集合时子图的发送顺序和社区关系子图更新机制

减少社区检测时网络中的通信开销

进一步提高了网络的性能.理论分析和仿真结果表明在节点通信半径不同、网络中节点个数不同以及节点移动速率不同的三种情况下

NSDMDT算法网络开销均要低于CDTFS算法

同时在与朋友节点的累积相遇持续时间所占比例上也优于CDTFS算法.

Abstract

To solve the existing problem of redundant communication overhead of the community detection in the CDTFS algorithm

and a novel routing algorithm called NSDMDT (Network Structure Detection Mechanism based on Dynamic Threshold) is proposed. The algorithm optimizes the sending order when a new node joining familiar set and the mechanism of updating community relationship sub graph

reduces the network overhead in the network community detection and improves the performance of the network. Theoretical analysis and simulation results show that NSDMDT algorithm outperforms an existing CDTFS algorithm in terms of control overhead when the communication radius is not the same or when the number of nodes in the network is different

and the ratio of cumulative duration with friend nodes.

关键词

Keywords

references

Clauset A, Shalizi C R, Newman M E J. Power-law distributions in empirical data[J]. SIAM review, 2009, 51(4): 661-703. DOI: 661

WangYunsheng, Wu Jie. Social-tie-based information dissemination in mobile opportunistic social networks[C]//The Conference on International Symposium and Workshops. Madrid: IEEE Press, 2013: 1-6.

Keranen A, Ott J, Karkkainen T. The ONE simulator for DTN protocol evaluation[C]// Proceedings of the International Conference on Simulation Tools and Techniques. Brussels: IEEE Press, 2009: 55-59.

Newman M E J. Modularity and community structure in networks[J]. Proceedings of the National Academy of Sciences, 2006, 103(23): 8577-8582. DOI: 8577

Hui P, Yoneki E, Chan S Y, et al. Distributed community detection in delay tolerant networks[C]//Proceedings of ACM/IEEE international workshop on Mobility in the evolving internet architecture. New York: ACM Press, 2007: 716-722.

Fortunato S. Community detection in graphs[J]. Physics Reports, 2010, 486(3): 75-82. DOI: 75

Liu Li, Jing Yanfang. A survey on social-based routing and forwarding protocols in opportunistic networks[C]// Computer and Information Technology. Chengdu: IEEE Press, 2012: 635-639.

胡桐, 郭忠文, Ludwig Wenning B, et al. 基于社团的移动容迟网络源路由算法[J]. 中国海洋大学学报(自然科学版), 2014, 44(3): 108-117. DOI: 108

熊永平, 孙利民, 牛建伟, 等. 机会网络[J]. 软件学报, 2009, 20(1): 124-137. DOI: 124

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

超低功耗实时时钟电路的设计

基于改进RT-DETR的航拍小目标检测算法

一种基于特征上下文理解与切片分析的肺结核检测算法

基于区块链的AI生成内容溯源框架设计研究

V型沟槽SiC中子探测器的蒙特卡洛分析