Computer Science ›› 2019, Vol. 46 ›› Issue (11A): 387-392.

• Network & Communication • Previous Articles     Next Articles

Energy Efficient Routing Algorithm in Mobile Opportunistic Networks

YUAN Pei-yan, ZHANG Hao   

  1. (School of Computer and Information Engineering,Henan Normal University,Xinxiang,Henan 453007,China)
  • Online:2019-11-10 Published:2019-11-20

Abstract: Intermittently connected mobile networks generally do not have a complete path from the source to the destination during data transmission.In order to quicken data transmission,a large number of multi-copy routing protocols proposed,but most of them do not consider the energy issue.Considering the fact that mobile devices are driven by batteries and have limited energy and they will stop work if excessive energy is consumed,an energy efficient routing scheme was proposed,which uses the disjoint path to spray copies to prolong the lifetime of nodes.In addition,a two-dimensional continuous-time Markov chain (CTMC) was used to model the dissemination process of packets.Finally,the performance simulation and evaluation were carried out.The experimental results show that the proposed scheme has a great improvement in delivery rate,average transmission delay,average network overhead,energy and average hop count compared with classical works.

Key words: Disjoint path, Energy, Intermittent, Markov chain, Multi-copy

CLC Number: 

  • TP393
[1]YUAN P,FAN L,LIU P,et al.Recent progress in routing protocols of mobile opportunistic networks:A clear taxonomy,analysis and evaluation[J].Journal of Network & Computer Applications,2016,62(C):163-170.
[2]WANG X,LIN Y,ZHANG S,et al.A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters[J].Enterprise Information Systems,2015:1-30.
[3]BOLDRINI C,CONTI M,JACOPINI J,et al.HiBOp:a History Based Routing Protocol for Opportunistic Networks[C]∥IEEE International Symposium on World of Wireless,Mobile & Multimedia Networks.IEEE,2007.
[4]WU D,ZHANG F,WANG H,et al.Security-orien ted opportunistic data forwarding in Mobile Social Networks[J].Future Generation Computer Systems,2017:S0167739X17301206.
[5]XU Q,SU Z,GUO S.A Game Theoretical Incentive Scheme for Relay Selection Services in Mobile Social Networks[J].IEEE Transactions on Vehicular Technology,2016,65(8):6692-6702.
[6]ZHOU H,LEUNG V C M,ZHU C,et al.Predictingg Temporal Social Contact Patterns for DataForwarding in Opportunistic Mobile Networks[J].IEEETransactions on Vehicular Technology,2017,PP(99):1-1.
[7]ZAKHARY S,RADENKOVIC M,BENSLIMANE A.Efficient Location Privacy-Aware Forwarding in Opportunistic Mobile Networks[J].IEEE Transactions on Vehicular Technology,2014,63(2):893-906.
[8]ZHANG J,HUANG H,YANG C,et al.Wireless Newt (2019)[OL].https://doi.org/10.1007/s11276-018-01907-2.
[9]YUAN P,PANG X,SONG M.SSR:Using the Social Similarity to Improve the Data Forwarding Performance in Mobile Opportunistic Networks[J].IEEE Access,2019,7:44840-44850.
[10]XU F,XU Q,XIONG Z,et al.Intelligent distributed routing scheme based on social similarity for mobile social networks [J].Future Generation Computer Systems,2019,96:472-480.
[11]LIANG D.Opportunistic media access control and routing fordelay-tolerant mobile ad hoc networks[J].Wireless Networks,2012,18(8):949-965.
[12]BRIN S,PAGE L.The Anatomy of a Large-Scale Hypertextual Web Search Engine[J].Computer Networks & Isdn Systems,1998,30(1/7):107-117.
[13]MTIBAA A,MAY M,DIOT C,et al.PeopleRank:Social Opportunistic Forwarding[C]∥Proceedings of the 29th IEEE International Conference on Computer Communications,Joint Conference of the IEEE Computer and Communications Societies.San Diego,Piscataway:IEEE,2010:111-115.
[14]YING Z,ZHANG C,LI F,et al.Geo-social:Routing with location and social metrics in mobile opportunistic networks[C]∥IEEE International Conference on Communications.IEEE,2015.
[15]罗玉宏,王建新,陈松乔.移动自组网中能量优化的路由算法研究综述[J].计算机科学,2006,33(3):7-10.
[16]曹洪新,李光顺,吴俊华.基于一种新网络拓扑结构的低功耗研究[J].计算机科学,2012,39(S2):327-330.
[17]LIU Y,WU H,XIA Y,et al.Optimal Online Data Dissemination for Resource Constrained Mobile Opportunistic Networks[J].IEEE Transactions on Vehicular Technology,2017,66(6):5301-5315.
[18]周鑫.自组网中一种基于能量均衡的选择性洪泛路由算法[J].计算机应用与软件,2014(7):101-104.
[19]ZHANG Y,LI R,ZHANG Y,et al.Data Forwarding Algorithm Based on Energy Efficiency in Multi-Hop Device to Device Network[C]∥International Conference on Parallel & Distributed Computing.IEEE Computer Society,2017.
[20]聂旭云,杨炎,刘梦娟,等.基于节点能力模型的容迟网络路由算法[J].电子科技大学学报,2013,42(6):905-910.
[21]BISTA B,RAWAT D B.EA-PRoPHET:An Energy AwarePRoPHET-Based Routing Protocol for Delay Tolerant Networks[C]∥2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA).IEEE,2017.
[22]朱至天,谌明,闫朝星,等.延迟中断容忍网络路由技术综述[J].遥测遥控,2018,39(6):63-76.
[23]AHN J,SATHIAMOORTHY M,KRISHNAMACHARI B,et al.Optimizing Content Dissemination in Vehicular Networks with Radio Heterogeneity[J].IEEE Transactions on Mobile Computing,2014,13(6):1312-1325.
[24]SMALL T,HAAS Z J.The shared wireless infestationmodel-a new ad hoc networking paradigm[C]∥Proceedings of The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc 2003).2003:233-244.
[25]RHEE I,SHIN M,HONG S,et al.On the Levy-Walk Nature of Human Mobility[M].IEEE Press,2011:630-643.
[26]YUAN P,SONG M.MONICA One Simulator for Mobile Opportunistic[C]∥Proceedings of the 11th EAI International Conference on Mobile Multimedia Communications.ICST (Institute for Computer Sciences,Social-Informatics and Telecommunications Engineering),2018:21-32.
[1] ZHOU Hang, JIANG He, ZHAO Yan, XIE Xiang-peng. Study on Optimal Scheduling of Power Blockchain System for Consensus Transaction ofEach Unit [J]. Computer Science, 2022, 49(6A): 771-776.
[2] FAN Xing-ze, YU Mei. Coverage Optimization of WSN Based on Improved Grey Wolf Optimizer [J]. Computer Science, 2022, 49(6A): 628-631.
[3] JIANG Rui, XU Shan-shan, XU You-yun. New Hybrid Precoding Algorithm Based on Sub-connected Structure [J]. Computer Science, 2022, 49(5): 256-261.
[4] SHEN Jia-fang, QIAN Li-ping, YANG Chao. Non-orthogonal Multiple Access and Multi-dimension Resource Optimization in EH Relay NB-IoT Networks [J]. Computer Science, 2022, 49(5): 279-286.
[5] DU Hui, LI Zhuo, CHEN Xin. Incentive Mechanism for Hierarchical Federated Learning Based on Online Double Auction [J]. Computer Science, 2022, 49(3): 23-30.
[6] GAO Yan-lu, XU Yuan, ZHU Qun-xiong. Predicting Electric Energy Consumption Using Sandwich Structure of Attention in Double -LSTM [J]. Computer Science, 2022, 49(3): 269-275.
[7] WANG Ying-kai, WANG Qing-shan. Reinforcement Learning Based Energy Allocation Strategy for Multi-access Wireless Communications with Energy Harvesting [J]. Computer Science, 2021, 48(7): 333-339.
[8] HE Quan-qi, YU Fei-hong. Review of Low Power Architecture for Wireless Network Cameras [J]. Computer Science, 2021, 48(6A): 369-373.
[9] CHEN Yong, XU Qi, WANG Xiao-ming, GAO Jin-yu, SHEN Rui-juan. Energy Efficient Power Allocation for MIMO-NOMA Communication Systems [J]. Computer Science, 2021, 48(6A): 398-403.
[10] HONG Chang-jian, GAO Yang, ZHANG Fan, ZHANG Lei. Reliable Transmission Strategy for Underwater Wireless Sensor Networks [J]. Computer Science, 2021, 48(6A): 410-413.
[11] ZHANG Kai, LIU Jing-ju. Attack Path Analysis Method Based on Absorbing Markov Chain [J]. Computer Science, 2021, 48(5): 294-300.
[12] CHENG Yun-fei, TIAN Hong-xin, LIU Zu-jun. Collaborative Optimization of Joint User Association and Power Control in NOMA Heterogeneous Network [J]. Computer Science, 2021, 48(3): 269-274.
[13] DING Shi-ming, WANG Tian-jing, SHEN Hang, BAI Guang-wei. Energy Classifier Based Cooperative Spectrum Sensing Algorithm for Anti-SSDF Attack [J]. Computer Science, 2021, 48(2): 282-288.
[14] ZHANG Yi-wen, LIN Ming-wei. Devices Low Energy Consumption Scheduling Algorithm Based on Dynamic Priority [J]. Computer Science, 2021, 48(11A): 471-475.
[15] WU Pei-pei, WU Zhao-xian, TANG Wen-bing. Real-time Performance Analysis of Intelligent Unmanned Vehicle System Based on Absorbing Markov Chain [J]. Computer Science, 2021, 48(11A): 147-153.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!