Energy-balanced routing algorithm for inter-community in mobile sensor network

doi:10.11772/j.issn.1001-9081.2017.07.1855

Journal of Computer Applications ›› 2017, Vol. 37 ›› Issue (7): 1855-1860.DOI: 10.11772/j.issn.1001-9081.2017.07.1855

Previous Articles Next Articles

Energy-balanced routing algorithm for inter-community in mobile sensor network

GAO Qiutian¹, YANG Wenzhong^1,2, ZHANG Zhenyu^1,2, SHI Yan¹, LI Shuangshuang²

1. College of Software Engineering, Xinjiang University, Urumqi Xinjiang 830046, China;
2. College of Information Science and Technology, Xinjiang University, Urumqi Xinjiang 830046, China

Received:2017-01-06 Revised:2017-02-27 Online:2017-07-10 Published:2017-07-18
Supported by:
This work is partially supported by the National Natural Science Foundation of China (U1603115, 61262087, 61262089), the Teachers Research Fund of Xinjiang University (XJEDU2012I09), the Jiangxi Science Foundation for Yong Scholars (20151521020008).

移动传感网社区间能量均衡路由算法

高秋田¹, 杨文忠^1,2, 张振宇^1,2, 石研¹, 李双双²

1. 新疆大学软件学院, 乌鲁木齐 830008;
2. 新疆大学信息科学与工程学院, 乌鲁木齐 830046

通讯作者: 杨文忠
作者简介:高秋田(1991-),女,河南平舆人,硕士研究生,主要研究方向:移动传感器网络、网络安全;杨文忠(1971-),男,河南南阳人,副教授,博士,主要研究方向:无线传感器网络、舆情分析、信息安全;张振宇(1964-),男,山西大同人,教授,博士,主要研究方向:机会网络;石研(1991-),女,河南商丘人,硕士研究生,主要研究方向:移动定位、网络安全;李双双(1992-),女,山东济宁人,硕士研究生,主要研究方向:无线传感器网络、路由协议、物联网。
基金资助:
国家自然科学基金资助项目（U1603115，61262087，61262089）；新疆高校教师科研计划重点资助项目（XJEDU2012I09）；江西省青年科学基金资助项目（20151521020008）。

Abstract

Abstract: Energy efficient routing is a challenging problem in resource constrained Mobile Wireless Sensor Network (MWSN). Focused on the issue that the energy consumption of the inter-community routing in the mobile sensor network is too fast, an Energy-balanced Routing Algorithm for Inter-community (ERAI) was proposed. In ERAI, a new routing metric FC (Forwarding Capacity) based on the residual energy of nodes and the probability of encounter was designed. Then, this metric FC and the directional information of encountered nodes were used for selection of a relay node to forward the messages. The experimental data show that the death time of the first node of ERAI was later than that of Epidemic and PROPHET by 12.6%-15.6% and 4.5%-8.3% respectively, and the residual energy mean square deviation of ERAI was less than that of Epidemic and PROPHET. The experimental results show that the ERAI can balance the energy consumption of each node to a certain extent, and thus prolongs the network lifetime.

Key words: mobile sensor network, community, energy balance, encounter probability, network lifetime

摘要： 在资源受限的无线移动传感器网络（MWSN）中设计能效路由是一个挑战性难题。针对移动传感器网络中社区间路由节点能量消耗过快的问题，提出了一种社区间能量均衡路由算法（ERAI）。设计了一个新的基于节点的剩余能量以及相遇可能性的转发能力路由度量FC。利用此度量FC和相遇节点的去向信息选择中继节点来转发消息。实验数据显示，ERAI路由算法在首个节点消亡时间上与Epidemic和PROPHET路由算法相比分别推迟了12.6％~15.6％和4.5％~8.3％，且节点剩余能量均方差小于Epidemic和PROPHET路由算法。实验结果表明，ERAI在一定程度上均衡了各节点的能耗，延长了网络的生命周期。

关键词: 移动传感网, 社区, 能量均衡, 相遇概率, 生命周期

CLC Number:

TP393.01

GAO Qiutian, YANG Wenzhong, ZHANG Zhenyu, SHI Yan, LI Shuangshuang. Energy-balanced routing algorithm for inter-community in mobile sensor network[J]. Journal of Computer Applications, 2017, 37(7): 1855-1860.

高秋田, 杨文忠, 张振宇, 石研, 李双双. 移动传感网社区间能量均衡路由算法[J]. 计算机应用, 2017, 37(7): 1855-1860.

References

[1] WARH T, CROSSMAN C, HU W, et al. The design and evaluation of a mobile sensor/actuator network for autonomous animal control[C]//IPSN'07:Proceedings of the 6th International Conference on Information Processing in Sensor Networks. New York:ACM, 2007:206-215.
[2] JAVIDI T, KRISHNAMACHARI B, ZHAO Q, et al. Optimality of myopic sensing in multi-channel opportunistic access[C]//ICC 2008:Proceedings of the 2008 IEEE International Conference on Communications. Piscataway, NJ:IEEE, 2008:2107-2112.
[3] DALY E M, HAAHR M. Social network analysis for routing in disconnected delay-tolerant MANETs[C]//MobiHoc'07:Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York:ACM, 2007:32-40.
[4] XIA L, WANG G, LIU Z, et al. An energy-efficient routing protocol based on particle swarm clustering algorithm and inter-cluster routing algorithm for WSN[C]//Proceedings of the 25th Chinese Control and Decision Conference. Piscataway, NJ:IEEE, 2013:4029-4033.
[5] 崔灿,孙毅,陆俊,等.基于混合CS的WSN六边形格状优化分簇路由算法研究[J].通信学报,2016,37(5):176-183.(CUI C, SUN Y, LU J, et al. Research on a hexagonal lattice optimal clustering routing algorithm based on hybrid CS for WSN[J]. Journal on Communications, 2016, 37(5):176-183.)
[6] VAHDAT A, BECKER D. Epidemic routing for partially-connected Ad Hoc networks[D]. Durham, NC:Duke University, 2000.
[7] LU X F, HUI P. An energy-efficient n-epidemic routing protocol for delay tolerant networks[C]//NAS'10:Proceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage. Washington, DC:IEEE Computer Society, 2010:341-347.
[8] RANGO F D, AMELIO S, FAZIO P. Enhancements of epidemic routing in delay tolerant networks from an energy perspective[C]//IWCMC 2013:Proceedings of the 9th IEEE International Wireless Communications and Mobile Computing Conference. Piscataway, NJ:IEEE, 2013:731-735.
[9] SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Spray and focus:efficient mobility-assisted routing for heterogeneous and correlated mobility[C]//PERCOMW'07:Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops. Washington, DC:IEEE Computer Society, 2007:79-85.
[10] LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3):19-20.
[11] HUI P, CROWCROFT, YONEKI E. BUBBLE rap:social-based forwarding in delay-tolerant networks[J]. IEEE Transactions on Mobile Computing, 2011, 10(11):1576-1589.
[12] LI Y, CAO Y, LI S, et al. Integrating forwarding and replication in DTN routing:a social network perspective[C]//Proceedings of the 2011 IEEE 73rd Vehicular Technology Conference. Piscataway, NJ:IEEE, 2011:1-5.
[13] 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.
[14] WANG K, GUO H. An improved routing algorithm based on social link awareness in delay tolerant networks[J]. Wireless Personal Communications, 2014, 75(1):397-414.
[15] 吴大鹏,樊思龙,张普宁,等.机会网络中能量有效的副本分布状态感知路由机制[J].通信学报,2013,34(7):49-58.(WU D P, FAN S L, ZHANG P N, et al. Energy efficient copy distributing status aware routing mechanism in opportunistic network[J]. Journal on Communications, 2013, 34(7):49-58.)
[16] 杨鹏,刘豆,王汝言,等.节点剩余能量均衡的机会网络路由机制[J].系统工程与电子技术,2015,37(8):1894-1901.(YANG P, LIU D, WANG R Y, et al. Node residual energy balanced routing mechanism for opportunistic networks[J]. Systems Engineering and Electronics, 2015, 37(8):1894-1901.)
[17] JUN H, AMMAR M H, ZEGURA E W. Power management in delay tolerant networks:a framework and knowledge-based mechanisms[C]//Proceedings of the Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks. Piscataway, NJ:IEEE, 2005:418-429.
[18] HEINZELMAN W B, CHANDRAKASAN A P, BALAKRISHNAN H. An application-specific protocol architecture for wireless microsensor networks[J]. IEEE Transactions on Wireless Communications, 2002, 1(4):660-670.
[19] KERÄNEN A, OTT J, KÄRKKÄINEN T. The one simulator for DTN protocol evaluation[C]//SIMUTools'09:Proceedings of the 2nd International Conference on Simulation Tools and Techniques. Brussels:Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 2009:Article No. 55.

Energy-balanced routing algorithm for inter-community in mobile sensor network

移动传感网社区间能量均衡路由算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	LI Yafang, LIANG Ye, FENG Weiwei, ZU Baokai, KANG Yujian. Deep network embedding method based on community optimization [J]. Journal of Computer Applications, 2021, 41(7): 1956-1963.
[2]	QIN Li, HAO Zhigang, LI Guoliang. Construction and correlation analysis of national food safety standard graph [J]. Journal of Computer Applications, 2021, 41(4): 1005-1011.
[3]	LI Ping, WANG Fen, CHEN Qidong, SUN Jun. Discrete random drift particle swarm optimization algorithm for solving multi-objective community detection problem [J]. Journal of Computer Applications, 2021, 41(3): 803-811.
[4]	Jicheng CHEN, Hongchang CHEN. Community detection method based on tensor modeling and evolutionary K-means clustering [J]. Journal of Computer Applications, 2021, 41(11): 3120-3126.
[5]	LI Xiangkun, JIA Caiyan. Collaborative filtering method fusing overlapping community regularization and implicit feedback [J]. Journal of Computer Applications, 2021, 41(1): 53-59.
[6]	SHENG Jun, LI Bin, CHEN Ling. Recommendation algorithm based on modularity and label propagation [J]. Journal of Computer Applications, 2020, 40(9): 2606-2612.
[7]	LI Chunying, TANG Yong, XIAO Zhenghong, LI Tiansong. Influential scholar recommendation model in academic social network [J]. Journal of Computer Applications, 2020, 40(9): 2594-2599.
[8]	LUO Xiangyu, LI Jianan, LUO Xiaoxia, WANG Jia. Improved community evolution relationship analysis method for dynamic graphs [J]. Journal of Computer Applications, 2020, 40(8): 2313-2318.
[9]	GE Yu, LIANG Jing. Opportunistic network message forwarding algorithm based on time-effectiveness of encounter probability and repeated diffusion perception [J]. Journal of Computer Applications, 2020, 40(5): 1397-1402.
[10]	ZHENG Wenping, YUE Xiangdou, YANG Gui. Improved label propagation algorithm based on random walk [J]. Journal of Computer Applications, 2020, 40(12): 3423-3429.
[11]	WU Qingshou, CHEN Rongwang, YU Wensen, LIU Genggeng. Overlapping community detection algorithm fusing label preprocessing and node influence [J]. Journal of Computer Applications, 2020, 40(12): 3578-3585.
[12]	LI Shasha, LIANG Dongyang, YU Jie, JI Bin, MA Jun, TAN Yusong, WU Qingbo. Research team mining algorithm based on teacher-student relationship [J]. Journal of Computer Applications, 2020, 40(11): 3198-3202.
[13]	CHENG Qiwei, CHEN Qimai, HE Chaobo, LIU Hai. Overlapping community detection method based on improved symmetric binary nonnegative matrix factorization [J]. Journal of Computer Applications, 2020, 40(11): 3203-3210.
[14]	FU Lidong, HAO Wei, LI Dan, LI Fan. Community dividing algorithm based on similarity of common neighbor nodes [J]. Journal of Computer Applications, 2019, 39(7): 2024-2029.
[15]	ZHANG Qi, JI Shujuan, FU Qiang, ZHANG Chunjin. Weighted reviewer graph based spammer group detection and characteristic analysis [J]. Journal of Computer Applications, 2019, 39(6): 1595-1600.