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

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

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

CLC Number:

TP302

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.

Figures/Tables 15

References 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

Metrics

Recommended 0

No Suggested Reading articles found!

参数	描述	值
α	能耗权重系数	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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 15

References 24

Related Articles 15

Metrics

Recommended 0

[1]	Yang GAO, Hongli ZHANG. Survey on community detection method based on random walk [J]. Journal on Communications, 2023, 44(6): 198-210.
[2]	Tao PENG, Wentao ZHONG, Guojun WANG, Entao LUO, Jinbo XIONG, Yining LIU, Wang Hao. Privacy-preserving precise profile matching in mobile social network [J]. Journal on Communications, 2022, 43(11): 90-103.
[3]	Junlei BI,Zhiyuan LI. Time-variant interest community based query message routing algorithm in opportunity social network [J]. Journal on Communications, 2019, 40(9): 86-94.
[4]	WANG Li’na,GUO Xiaodong,WANG Run. Automated crowdturfing attack in Chinese user reviews [J]. Journal on Communications, 2019, 40(6): 1-13.
[5]	Hao LONG, Shukui ZHANG, Yang ZHANG, Li ZHANG. Task distribution algorithm based on community in mobile crowd sensing [J]. Journal on Communications, 2019, 40(10): 42-54.
[6]	Yancui SHI,Yuan WANG,Qing ZHAO,Xiankun ZHANG. Research status of community detection based on local expansion [J]. Journal on Communications, 2019, 40(1): 149-162.
[7]	Qiang LIU,Yan JIA,Binxing FANG,Bin ZHOU,Yue HU,Jiuming HUANG. Research on the scalability of parallel community detection algorithms [J]. Journal on Communications, 2018, 39(4): 13-20.
[8]	Jing CHEN,Yun WAN. Research on label propagation algorithm based on modularity maximization in the social network [J]. Journal on Communications, 2017, 38(2): 25-33.
[9]	Kun DENG,Wen-ping LI,Fa-hong YU,Jian-pei ZHANG. Overlapping community detection in complex networks based on multi kernel label propagation [J]. Journal on Communications, 2017, 38(2): 53-66.
[10]	Hao LIU,Zhi-gang CHEN,Lian-ming ZHANG. Data forwarding incentive mechanism based on auction model in mobile social network [J]. Journal on Communications, 2017, 38(11): 111-120.
[11]	Zhi-yuan LI,Ru-long CHEN,Ru-chuan WANG. Exploiting interests and behavior prediction for dynamic resource discovery in mobile social networking [J]. Journal on Communications, 2016, 37(4): 34-43.
[12]	Zhen-chao CHANG,Hong-chang CHEN,Rui-yang HUANG,Hong-tao YU,Yang LIU. Semi-supervised dynamic community detection based on non-negative matrix factorization [J]. Journal on Communications, 2016, 37(2): 132-143.
[13]	Chao LI,Li-hua YIN,Kui GENG,Bin-xing FANG. Location privacy preservation approach towards to content sharing on mobile online social network [J]. Journal on Communications, 2016, 37(11): 31-41.
[14]	Jun CAI,Shun-zheng YU,Wai-xi LIU. Caching strategy based on node’s importance to community in information-centric networks [J]. Journal on Communications, 2015, 36(6): 173-182.
[15]	AOJiu-xin C,HENGao-jun C,ANGJing Y,HUZi-qing Z,IUBo L. Social-based routing in pocket switched networks [J]. Journal on Communications, 2015, 36(5): 13-22.