Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks

被引：0

作者：

Wu, Jia ^{[1
]}

Yi, Xi ^{[1
]}

Chen, Zhigang ^{[1
]}

机构：

[1] School of Software, Central South University, Changsha

来源：

High Technology Letters | 2015年 / 21卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Cache time; Deliver ratio; Energy consumption; Opportunistic networks; Routing algorithm; Transmission delay;

D O I：

10.3772/j.issn.1006-6748.2015.03.012

中图分类号：

学科分类号：

摘要：

Opportunistic networks are random networks and do not communicate with each other among respective communication areas. This situation leads to great difficulty in message transfer. This paper proposes a reducing energy consumption optimal selection of path transmission (OSPT) routing algorithm in opportunistic networks. This algorithm designs a dynamic random network topology, creates a dynamic link, and realizes an optimized selected path. This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks. According to the simulation experiment, OSPT improves deliver ratio, and reduces energy consumption, cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks. Copyright © by HIGH TECHNOLOGY LETTERS PRESS.

引用

页码：321 / 327

页数：6

共 9 条

[1]

Conti M., Giordano S., May M., Et al., From opportunistic networks to opportunistic computing, Communications Magazine, IEEE, 48, 9, pp. 126-139, (2010)

[2]

Jacquet P., Mans B., Rodolakis G., Information propagation speed in mobile and delay tolerant networks, Information Theory, IEEE Transactions on, 56, 10, pp. 5001-5015, (2010)

[3]

Dvir A., Vasilakos A.V., Backpressure-based routing protocol for DTNs, ACM SIGCOMM Computer Communication Review, 40, 4, pp. 405-406, (2010)

[4]

Grossglauser M., Tse D.N.C., Mobility increases the capacity of ad hoc wireless networks, IEEE/ACM Transactions on Networking, 10, 4, pp. 477-486, (2002)

[5]

Wang G., Wang B., Gao Y., Dynamic spray and wait routing algorithm with quality of node in delay tolerant network, Proceedings of the International Conference on Communications and Mobile Computing (CMC), 3, pp. 452-456, (2010)

[6]

Burgess J., Gallagher B., Jensen D., Et al., MaxProp: Routing for vehicle-based disruption-tolerant networks, Proceedings of the 25th IEEE International Conference on Computer Communications Infocom, 6, pp. 1-11, (2006)

[7]

Leguay J., Friedman T., Conan V., Evaluating MobySpace-based routing strategies in delay-tolerant networks, Wireless communications and mobile computing, 7, 10, pp. 1171-1182, (2007)

[8]

Burns B., Brock O., Levine B.N., MORA routing and capacity building in disruption-tolerant networks, Ad hoc networks, 6, 4, pp. 600-620, (2008)

[9]

Keranen A., Ott J., Karkkainen T., The ONE simulator for DTN protocol evaluation, Proceedings of the 2nd International Conference on Simulation Tools and Techniques, (2009)

← 1 →