基于多目标优化的固定中继节点唤醒策略

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

摘要/Abstract

摘要：

针对城市中人们移动规律的“潮汐效应”以及机会网络中固定中继节点运行时能耗较高的问题，提出基于固定中继节点消息转发能力和能量消耗的多目标固定中继节点唤醒策略。该策略将能量有效性作为固定中继节点唤醒的指标并利用网络收益—能量消耗模型来解决能量消耗和转发能力之间的矛盾。固定中继节点唤醒选择问题是一个NP难问题，提出采用遗传算法选择合适的中继节点进入唤醒状态，在此过程中改进了选择算子使算法更快地收敛于解空间。仿真结果表明，该唤醒策略能够在保证消息传输性能的同时提高每个固定中继节点单位能耗的平均转发效率。

关键词: 机会网络, 潮汐效应, 遗传算法, 多目标优化, 能量有效性

Abstract:

In order to deal with the “tidal effect” when people move in the city and solve the problem of high energy consumption of fixed relay nodes in opportunistic networks,a wakeup strategy of multi-objective optimization was proposed,which made use of the message forward ability and energy consumption of fixed relay nodes.This strategy used energy efficiency as the indicator to make the nodes awake,and deployed a network revenue-energy consumption model to resolve the contradiction between energy consumption and message forward ability.As the selection problem of awake relay nodes was a NP-hard problem,genetic algorithm was used to select proper fixed relay nodes to keep awake.In this process,selection operator was improved to make the algorithm converge to solution space quickly.Experiments show that the proposed wakeup strategy can guarantee the successful rate of message transmission and improve the average message forwarding capabilities of fixed relay nodes by consuming a unit energy.

Key words: opportunistic network, tidal effect, GA algorithm, multi-objective optimization, energy efficiency

中图分类号:

TP302

马学彬,李爱丽,张晓娟. 基于多目标优化的固定中继节点唤醒策略[J]. 通信学报, 2017, 38(10): 47-59.

Xue-bin MA,Ai-li LI,Xiao-juan ZHANG. Wakeup strategy based on multi-objective optimization for fixed relay nodes[J]. Journal on Communications, 2017, 38(10): 47-59.

图/表 20

图1

表1

表2

图2

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

图13

图14

图15

图16

图17

图18

参考文献 29

[1]	KARAMSHUK D , BOLDRINI C , CONTI M ,et al. Human mobility models for opportunistic networks[J]. IEEE Communications Magazine, 2011,49(12): 157-165.
[2]	LEE C H , EUN D Y . Exploiting heterogeneity for improving forwarding performance in mobile opportunistic networks:an analytic approach[J]. IEEE Transactions on Mobile Computing, 2016,15(1): 150-162.
[3]	ABDELMOUMEN M , ARFAOUI I , FRIKHA M ,et al. On the performance of MANETs under different mobility patterns and routing protocols and its improvement based on fixed relay nodes[C]// 2012 5th International Conference on New Technologies,Mobility and Security (NTMS). 2012: 1-5.
[4]	MAWAD Y , FISCHER S . Infrastructure-based delay tolerant network communication[C]// 2016 International Conference on Information Networking (ICOIN). 2016: 161-165.
[5]	LI Y , WENG B , LIU Q ,et al. Multiple ferry routing for the opportunistic networks[C]// Global Telecommunications Conference (GLOBECOM 2011). 2011: 1-5.
[6]	YASMEEN F , HUDA M , HAQUE M ,et al. Using ferry access points to improve the performance of message ferrying in delay-tolerant networks[C]// ICCNMC. 2011: 173-179.
[7]	ZHAO W , CHEN Y , AMMA M ,et al. Capacity enhancement using throwboxes in DTNs[C]// IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS). 2006: 31-40.
[8]	YING Z , ZHANG C , WANG Y . Social based throwbox placement in large-scale throwbox-assisted delay tolerant networks[C]// 2014 IEEE International Conference on Communications (ICC). 2014 2472-2477.
[9]	LLOYD E L , XUE G . Relay node placement in wireless sensor networks[J]. IEEE Transactions on Computers, 2007,56(1): 134-138.
[10]	LI F , YIN Z , TANG S ,et al. k-throwbox placement problem in throwbox-assisted delay tolerant networks[C]// Global Communications Conference (GLOBECOM). 2014: 253-258.
[11]	SHAHBAZI S , KARUNASEKERA S , Harwood A . Improving performance in delay/disruption tolerant networks through passive relay points[J]. Wireless Networks, 2012,18(1): 9-31.
[12]	洪璐, 洪锋 . UWSP:水下无线传感器网络节点休眠协议[J]. 通信学报, 2013,34(S1): 162-269.
	HONG L , HONG F . UWSP:sleeping algorithms for underwater sensor network[J]. Journal on Communications, 2013,34(S1): 162-269.
[13]	唐飞岳, 叶晖, 赵明 . 机会网络节点唤醒调度机制研究[J]. 计算机工程与应用, 2011,47(26): 95-97.
	TANG Y F , YE H , ZHAO M . Node wake-up scheduling mechanism for opportunistic networks[J]. Computer Engineering and Applications, 2011,47(26): 95-97.
[14]	叶晖, 潘怡, 何文德 ,等. 机会网络蓝牙设备唤醒调度机制研究[J]. 计算机工程与科学, 2014,36(17): 1290-1295.
	YE H , PAN Y , HE W D ,et al. A bluetooth node wake-up scheduling mechanism for opportunistic networks[J]. 2014,36(17): 1290-1295.
[15]	LI H S , LIU S M , HU B . Research on node sleep/wake-up mechanism in WSN based on fuzzy energy control[C]// ICINIS. 2009.
[16]	FEENEY L M , NILSSON M . Investigating the energy consumption of a wireless network interface in an Ad Hoc network[C]// The Conference on INFOCOM. 2001.
[17]	SORBER J , BANERJEE N , CORNER M D ,et al. Turducken:hierarchical power management for mobile devices[C]// The Conference on Mobisys. 2005.
[18]	JUN H , AMMAR M , CORNER M ,et al. Hierarchical power management in disruption tolerant networks with traffic-aware optimization[C]// ACM Sigcomm Workshop on Challenged Networks (CHANTS). 2006.
[19]	JUN H , AMMAR M H , ZEGURA E W . Power management in delay tolerant networks:a framework and knowledge-based mechanisms[C]// IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON). 2005.
[20]	FENG Y , BAI X , DANG N ,et al. A sleep scheduling mechanism based on power law distribution for mobile delay tolerate networks[C]// 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). 2015: 481-490.
[21]	HSU C C , CHANG J M , CHOU Z T ,et al. Optimizing spectrum-energy efficiency in downlink cellular networks[J]. IEEE Transactions on Mobile Computing, 2014,13(9): 2100-2112.
[22]	VOSE M D . The simple genetic algorithm:foundations and theory[M]. MIT Press, 1999.
[23]	熊军, 高敦堂, 沈庆宏 ,等. 遗传算法交叉算子性能对比研究[J]. 南京大学学报:自然科学版, 2004,40(4): 432-437.
	XIONG J , GAO D T , SHEN Q H ,et al. Comparation of crossover operators in genetic algorithm[J]. Journal of Nanjing University:Natural Sciences, 2004,40(4): 432-437.
[24]	文诗华, 郑金华, 李密青 . 多目标进化算法中变异算子的比较与研究[J]. 计算机工程与应用, 2009,45(2): 74-78.
	WEN S H , ZHENG J H , LI M Q . A comparative study of operator of multi-objective evolutionary algorithm mutation[J]. Computer Engineering and Applications, 2009,45(2): 74-78.
[25]	KER?NEN A , OTT J K?RKK?INEN T . The ONE simulator for DTN protocol evaluation[C]// 2nd International Conference on Simulation Tools and Techniques. 2009.
[26]	DSOUZA R J , JOSE J . Routing approaches in delay tolerant networks:a survey[J]. International Journal of Computer Applications, 2010,1(17): 8-14.
[27]	SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]// The 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. 2005: 252-259.
[28]	CHAINTREAU A , HUI P , CROWCROFT J ,et al. Impact of human mobility on opportunistic forwarding algorithms[J]. IEEE Transactions on Mobile Computing, 2007,6(6): 606-620.
[29]	EKMAN F , KER?NEN A , KARVO J ,et al. Working day movement model[C]// 1st ACM SIGMOBILE Workshop on Mobility Models. 2008.

参数名称	参数值
仿真时长/s	43 200
场景大小	4 500 m×4 500 m
移动节点编号范围	0～34
节点移动模型	RandomPointModel
移动节点缓存大小/MB	20
固定节点数量SN	0,4,9,16,25,36
固定节点缓存大小/MB	500
固定节点传输范围/m	200
移动节点传输速率/(kbit·s^-1)	250
消息大小/kB	200

参数名称	参数值
仿真时长/s	43 200
场景大小	4 500 m×4 500 m
移动节点编号范围	0～34
节点移动模型	WorkingDayModel
移动节点缓存大小/MB	20
固定节点数量SN	0,4,9,16,25,36
固定节点缓存大小/MB	500
固定节点传输范围/m	200
移动节点传输速率/(kbit·s^-1)	250
移动节点移动速率/(m·s^-1)	2,4,6,8,10,12
移动节点数量	10,20,30,40,50,60
消息大小/kB	200
发送消息能耗/(J·bit^-1)	3
接收消息能耗/(J·bit^-1)	1
单次扫描能耗/J	1
基础能耗/(J·s^-1)	0.5