[1] 陈维兴, 张天娇, 林家泉, 等. 基于移动agent的机坪机会传输控制方法[J]. 江苏大学学报(自然科学版), 2018, 39(3):309-315. Chen Weixing, Zhang Tianjiao, Lin Jiaquan, et al. Opportunistic transmission control method based on mobile agent of apron network[J]. Journal of Jiangsu University(Natural Science Edition), 2018, 39(3):309-315. [2] 熊永平, 孙利民, 牛建伟, 等. 机会网络[J]. 软件学报, 2009, 20(1):124-137. Xiong Yongping, Sun Limin, Niu Jianwei, et al. Opportunistic networks[J]. Journal of Software, 2009, 20(1):124-137. [3] 马华东, 袁培燕, 赵东. 移动机会网络路由问题研究进展[J]. 软件学报, 2015, 26(3):600-616. Ma Huadong, Yuan Peiyan, Zhao Dong. Research progress on routing problem in mobile opportunistic networks[J]. Journal of Software, 2015, 26(3):600-616. [4] Xiao Mingjun, Wu Jie, Huang Liusheng. Community-aware opportunistic routing in mobile social networks[J]. IEEE Transactions on Computers, 2014, 63:1682-1695. [5] 皇甫伟, 杨心竹, 王欢, 等. 基于出租车轨迹数据的车联网通信机会间隔模型[J]. 北京邮电大学学报, 2019, 42(3):91-97. Huangfu Wei, Yang Xinzhu, Wang Huan, et al. Modeling the statistical distribution of the inter-contact times for communication opportunities in vehicle networks[J]. Journal of Beijing University of Posts and Telecommunications, 2019, 42(3):91-97. [6] So J, Byun H. Load-balanced opportunistic routing for duty-cycled wireless sensor networks[J]. IEEE Transactions on Mobile Computing, 2017, 16(7):1940-1955. [7] Song Ling, Song Qidong, Ye Jin, et al. A hierarchical topology control algorithm for WSN, considering node residual energy and lightening cluster head burden based on affinity propagation[J]. Sensors, 2019, 19:13. [8] Sara K, Jaafar G, Pascal L. Game theory based distributed clustering approach to maximize wireless sensors network lifetime[J]. Journal of Network and Computer Applications, 2018, 123:80-88. [9] Zhao Ruonan, Zhang Lichen, Wang Xiaoming, et al. A novel energy-efficient probabilistic routing method for mobile opportunistic networks[J]. EURASIP Journal on Wireless Communications and Networking, 2018(1):263-278. [10] 田克, 张宝贤, 马建, 等. 无线多跳网络中的机会路由[J]. 软件学报, 2010, 21(10):2542-2553. Tian Ke, Zhang Baoxian, Ma Jian, et al. Opportunistic routing protocols for wireless multihop networks[J]. Journal of Software, 2010, 21(10):2542-2553. [11] Jiang J R, Huang H W, Liao J H, et al. Extending Dijkstra's shortest path algorithm for software defined networking[C]//The 16th Asia-Pacific Network Operations and Management Symposium. Hsinchu:IEEE, 2014:1-4. [12] Liu H, Stoll N, Junginger S, et al. A Floyd-Dijkstra hybrid application for mobile robot path planning in life science automation[C]//2012 IEEE International Conference on Automation Science and Engineering (CASE). Seoul:IEEE, 2012:279-284. [13] 陈炳才, 孙少玮, 宁芊. 基于节点速度和能量的MPR节点集选择[J]. 传感技术学报, 2019, 32(6):902-907. Chen Bingcai, Sun Shaowei, Ning Qian. Selection of MPR set based on node speed and energy[J]. Chinese Journal of Sensors and Actuators, 2019, 32(6):902-907. [14] 刘浩然, 赵赫瑶, 邓玉静, 等. 基于非合作博弈的无线传感器网络覆盖控制算法[J]. 通信学报, 2019, 40(1):71-78. Liu Haoran, Zhao Heyao, Deng Yujing, et al. Converge control algorithm for wireless sensor networks based on non-cooperative game[J]. Journal on Communications, 2019, 40(1):71-78. [15] Hao Xiaochen, Wang Liyuan, Yao Ning, et al. Topology control game algorithm based on Markov lifetime prediction model for wireless sensor network[J]. Ad Hoc Networks, 2018, 78:13-23. [16] 刘洲洲, 彭寒. 基于节点可靠度的无线传感器网络拓扑控制算法[J]. 吉林大学学报(工学版), 2018, 48(2):571-577. Liu Zhouzhou, Peng Han. Topology control algorithm based on node reliability in WSN[J]. Journal of Jilin University (Engineering and Technology Edition), 2018, 48(2):571-577. |