移动社会网络中基于社区的最优能效路由策略研究

doi:10.11959/j.issn.1000-436x.2017107

通信学报 ›› 2017, Vol. 38 ›› Issue (5): 128-144.doi: 10.11959/j.issn.1000-436x.2017107

移动社会网络中基于社区的最优能效路由策略研究

彭颖,王淖(),王高才

广西大学计算机与电子信息学院，广西南宁 530004

修回日期:2017-03-23 出版日期:2017-05-01 发布日期:2017-05-28
作者简介:彭颖（1980-）,女，湖南汉寿人，博士，广西大学讲师，主要研究方向为移动网络能耗及性能优化。|王淖（1977-）,女，湖南长沙人，广西大学讲师，主要研究方向为网络优化。|王高才（1976-）,男，广西桂林人，博士，广西大学教授、博士生导师，主要研究方向为计算机网络、系统性能评价和随机方法。
基金资助:
国家自然科学基金资助项目(61562006);国家自然科学基金资助项目(61262003);广西自然科学基金资助项目（(2016GXNSFBA380181);广西自然科学基金资助项目（(2015GXNSFBA139249);广西自然科学基金资助项目（(2013GXNSFGA019006)

Optimal energy efficiency routing strategy based on community in mobile social network

Ying PENG,Nao WANG(),Gao-cai WANG

School of Computer and Electronic Information,Guangxi University,Nanning 530004,China

Revised:2017-03-23 Online:2017-05-01 Published:2017-05-28
Supported by:
The National Natural Science Foundation of China(61562006);The National Natural Science Foundation of China(61262003);The Natural Science Foundation of Guangxi Province(2016GXNSFBA380181);The Natural Science Foundation of Guangxi Province(2015GXNSFBA139249);The Natural Science Foundation of Guangxi Province(2013GXNSFGA019006)

摘要/Abstract

摘要：

提出基于社区的最优能效路由策略，在给定的延时约束下最小化网络能耗。首先利用马尔可夫链获取信息在连通网中传递的期望能耗和期望延时，然后构建信息从源节点传递到目的节点的能耗和延时综合成本函数，以及中继节点传递信息对综合成本的优化函数，从而得到中继节点的报酬函数，最后利用最优停止理论获得最优中继节点的最优期望报酬，实现最优能效路由策略。在仿真实验中，将提出的路由优化策略与相关文献的路由策略在平均能耗、平均延时和平均传递率各指标上进行对比，结果表明所提的路由策略具有较小的平均能耗、较低的平均延时和较高的平均传递率，取得较好的能耗优化效果。

关键词: 移动社会网络, 最优能效路由, 社区, 最优停止, 最优中继节点

Abstract:

An optimal energy efficiency routing strategy based on community was proposed,which minimized the network energy consumption under the given delay constraint.Firstly the expected energy consumption and delay of message delivery in the connected network were obtained through Markov chain.Then the comprehensive cost function for delivering message from source node to destination node was designed,which was combined with energy consumption and delay.Thus,the optimization function to comprehensive cost of relay node delivering message was obtained,and further the reward function of relay node was gotten.Finally the optimal expected reward of optimal relay node was achieved using the optimal stopping theory,so as to realize the optimal energy efficiency routing strategy.In simulations,the average energy consumption,the average delay and the average delivery ratio of routing optimization strategy were compared with those of other routing strategies in related literatures.The results show that the strategy proposed has smaller average energy consumption,shorter average delay and higher average delivery ratio,gaining better energy consumption optimization effect.

Key words: mobile social network, optimal energy efficiency routing, community, optimal stopping, optimal relay node

中图分类号:

TP302

彭颖,王淖,王高才. 移动社会网络中基于社区的最优能效路由策略研究[J]. 通信学报, 2017, 38(5): 128-144.

Ying PENG,Nao WANG,Gao-cai WANG. Optimal energy efficiency routing strategy based on community in mobile social network[J]. Journal on Communications, 2017, 38(5): 128-144.

图/表 15

图1

图2

图3

图4

图5

表1

图6

图7

图8

图9

图10

图11

图12

图13

图14

参考文献 24

[1]	张法, ANTONIO F A , 王林 ,等. 网络能耗系统模型及能效算法[J]. 计算机学报, 2012,35(3): 603-615.
	ZHANG F , ANTONIO F A , WANG L ,et al. Network energy consumption models and energy efficient algorithms[J]. Chinese Journal of Computers, 2012,35(3): 603-615.
[2]	ZHU Y , XU B , SHI X H ,et al. A survey of social-based routing in delay tolerant networks:positive and negative social effects[J]. IEEE Communications Surveys & Tutorials, 2013,15(1): 387-401.
[3]	WEI K M , LIANG X , XU K . A survey of social-aware routing protocols in delay tolerant networks:applications,taxonomy and design-related issues[J]. IEEE Communications Surveys & Tutorials, 2014,16(1): 556-578.
[4]	黄永锋, 董永强, 张三峰 ,等. 基于社会特征周期演化的机会移动网络路由转发策略[J]. 通信学报, 2015,36(3): 151-162
	HUANG Y F , DONG Y Q , ZHANG S F ,et al. Message forwarding based on periodically evolving social characteristics in opportunistic mobile networks[J]. Journal on Communications, 2015,36(3): 151-162.
[5]	YUAN Q , CARDEI I , WU J . An efficient prediction-based routing in disruption-tolerant networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2012,23(1): 19-31.
[6]	XIAO M J , WU J , HUANG L S . Community-aware opportunistic routing in mobile social networks[J]. IEEE Transactions on Computers, 2014,63(7): 1682-1695.
[7]	AMIN V , DAVID B.Epidemic routing for partially connected ad hoc networks . technical report,CS-2000-06[R]. Durham,North Carolina:Duke University, 2000: 1-16.
[8]	LINDGREN A , DORIA A,SCHELéN O . Probabilistic routing in intermittently connected networks[J]. Lecture Notes in Computer Science, 2004,3126(1): 252-259.
[9]	THRASYVOULOS S , KONSTANTINOS P , CAULIGI S R . Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]// The 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking.Pennsylvania. 2005: 252-259.
[10]	THRASYVOULOS S , KONSTANTINOS P , CAULIGI S R . Spray and focus:efficient mobility-assisted routing for heterogeneous and correlated mobility[C]// The Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops. 2007: 79-85.
[11]	ELIZABETH D , MADS H . Social network analysis for routing in disconnected delay-tolerant MANETS[C]// The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2007: 32-40.
[12]	FENG L , WU J . LocalCom:a community-based epidemic forwarding scheme in disruption-tolerant networks[C]// The SECON ‘09 6th Annual IEEE Communications Society Conference. 2009: 1-9
[13]	PAN H , JON C , EIKO Y . Bubble rap:social-based forwarding in delay-tolerant networks[J]. IEEE Transactions on Mobile Computing, 2011,10(11): 1576-1589.
[14]	BULUT E , SZYMANSKI B K . Exploiting friendship relations for efficient routing in mobile social networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2012,23(12): 2254-2265.
[15]	ZHU K L , LI W Z , FU X M . Smart:a social- and mobile-aware routing strategy for disruption-tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2014,63(7): 3423-3434.
[16]	李陟, 李千目, 张宏 ,等. 基于最近社交圈的社交时延容忍网络路由策略[J]. 计算机研究与发展, 2012,49(6): 1185-1195.
	LI Z , LI Q M , ZHANG H ,et al. Cosely social circuit based routing in social delay tolerant networks[J]. Journal of Computer Research and Development, 2012,49(6): 1185-1195.
[17]	WU J , XIAO M J , HUANG L S . Homing spread:community homebased multi-copy routing in mobile social networks[C]// The IEEE INFOCOM. 2013: 2319-2327.
[18]	XIAO M J , WU J , HUANG L S . Home-based zero-knowledge multi-copy routing in mobile social networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2015,26(5): 1238-1250.
[19]	SHAGHAGHIAN S , COATES M . Optimal forwarding in opportunistic delay tolerant networks with meeting rate estimations[J]. IEEE Transactions on Signal and Information Processing over Networks, 2015,1(2): 104-116.
[20]	WANG X , LENG S P , YIN J C ,et al. ESD:an energy saving data delivery scheme in mobile social networks[C]// The Global Communications Conference (GLOBECOM). 2015: 1-6.
[21]	SAHA B K , MISRA S , PAL S . Utility-based exploration for performance enhancement in opportunistic mobile networks[J]. IEEE Transactions on Computers, 2016,65(4): 1310-1322.
[22]	张三峰, 黄迪, 陈州 ,等. 一种面向机会网络路由的最优停止决策方法[J]. 软件学报, 2014,25(6): 1291-1300.
	ZHANG S F , HUANG D , CHEN Z ,et al. Optimal stopping decision method for routing of opportunistic networks[J]. Journal of Software, 2014,25(6): 1291-1300.
[23]	AKKARAJITSAKUL K , HOSSAIN E , NIYATO D . Cooperative packet delivery in hybrid wireless mobile networks:a coalitional game approach[J]. IEEE Transactions on Mobile Computing, 2013,12(5): 840-854
[24]	ZHENG D , GE W Y , ZHANG J S . Distributed opportunistic scheduling for ad hoc networks with random access:an optimal stopping approach[J]. IEEE Transactions on Information Theory, 2009,55(1): 205-222

参数	描述	值
α	能耗权重系数	10⁴
β	延时权重系数	1
Er	接收能耗/(J·bit^?1)	10^?9
Ef	发送能耗/(J·bit^?1)	10^?7
H	社区数量	8~14
U	移动用户数量	800~1 200
D_m	最大延时[τ]	80~120
p_y	帮助概率	1
Q_u	所属社区数量	1~5
λ_u,h	访问概率	0.1~0.2

移动社会网络中基于社区的最优能效路由策略研究

Optimal energy efficiency routing strategy based on community in mobile social network

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 15

参考文献 24

相关文章 15

Metrics

推荐阅读 0

[1]	高阳, 张宏莉. 基于随机游走的社区发现方法综述[J]. 通信学报, 2023, 44(6): 198-210.
[2]	毕俊蕾,李致远. 机会社交网络中基于时变兴趣社区的查询消息路由算法[J]. 通信学报, 2019, 40(9): 86-94.
[3]	王丽娜,郭晓东,汪润. 面向中文用户评论的自动化众包攻击方法[J]. 通信学报, 2019, 40(6): 1-13.
[4]	龙浩, 张书奎, 张洋, 张力. 移动群智感知中基于社区的任务分发算法[J]. 通信学报, 2019, 40(10): 42-54.
[5]	史艳翠,王嫄,赵青,张贤坤. 基于局部扩展的社区发现研究现状[J]. 通信学报, 2019, 40(1): 149-162.
[6]	刘强,贾焰,方滨兴,周斌,胡玥,黄九鸣. 并行社区发现算法的可扩展性研究[J]. 通信学报, 2018, 39(4): 13-20.
[7]	陈晶,万云. 社交网络中基于模块度最大化的标签传播算法的研究[J]. 通信学报, 2017, 38(2): 25-33.
[8]	邓琨,李文平,余法红,张健沛. 基于多核心标签传播的复杂网络重叠社区识别方法[J]. 通信学报, 2017, 38(2): 53-66.
[9]	曹玖新,陈高君,杨婧,朱子青,刘波. 基于社会属性的PSN消息路由算法[J]. 通信学报, 2015, 36(5): 13-22.
[10]	黄永锋,董永强,张三峰,吴国新. 基于社会特征周期演化的机会移动网络路由转发策略[J]. 通信学报, 2015, 36(3): 21-32.
[11]	郭昆,郭文忠,邱启荣,张歧山. 基于局部近邻传播及用户特征的社区识别算法[J]. 通信学报, 2015, 36(2): 68-79.
[12]	王翔,冷甦鹏,张可,刘浩. 车联社会网络综述[J]. 通信学报, 2015, 36(1): 199-210.
[13]	王桐，赵昕琳. 基于改进蛙跳算法的社区划分方法[J]. 通信学报, 2014, 35(Z2): 8-52.
[14]	王桐,赵昕琳. 基于改进蛙跳算法的社区划分方法[J]. 通信学报, 2014, 35(Z2): 48-52.
[15]	卫红权,陈鸿昶,刘力雄,兰巨龙. 基于强度排序的通信社区检测算法[J]. 通信学报, 2014, 35(10): 165-170.