An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control

doi:10.7652/xjtuxb201412008

您当前的位置：

首页 >

文章列表页 >

An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control

更新时间：2025-07-09

- An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control
- Vol. 48, Issue 12, Pages: 49-56(2014)
- 作者机构：
  
  重庆邮电大学移动通信技术重庆市重点实验室,重庆,400065
- 作者简介：
- 基金信息：
- DOI：10.7652/xjtuxb201412008
  CLC： TP393.04
- Online First：10 December 2014，
  
  Published：2014
- 稿件说明：
移动端阅览
An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control[J]. 2014, 48(12): 49-56.
DOI：

An Efficient Energy-Saving Routing Algorithm for Opportunistic Networks with Dynamically Adaptive Power Control[J]. 2014, 48(12): 49-56. DOI： 10.7652/xjtuxb201412008.

摘要

针对机会网络中基于跨层设计的能量高效路由算法(ERBC)存在的未考虑节点运动、部分数据消息传输时能耗偏大、矢量消息交换过程有冗余控制开销的问题

提出一种自适应动态功率控制的节能路由算法(ERAPC)加以解决。ERAPC算法通过拓展确认字符(ACK)帧的使用改进了基于接收信号强度指示值(RSSI)的节点测距机制

将功率控制的范围从部分数据消息扩展到全部

以减少节点能耗; 通过等待收发节点尽可能靠近后才传送数据

进一步减小节点能量消耗; 通过提出一种更简捷的矢量消息交换新机制

减少网络控制开销。仿真结果表明

与ERBC算法相比

ERAPC算法的比特能耗至少降低了27.27%

控制开销则减小了11.87%以上。

Abstract

An efficient energy-saving routing algorithm with dynamically adaptive power control(ERAPC)is proposed to address the problems that there exist large energy consumption for transmitting partial data packets

no consideration of node's mobility and high control overhead in vector exchange mechanism lying in the energy-efficient routing algorithm based on cross-layer design(ERBC). The ERAPC extends the usage of acknowledgement(ACK)frames to improve the RSSI-based ranging mechanism

to enlarge the range of power control to all data messages and to reduce nodal energy consumption. Until the sender and the receiver move as close as possible

the data messages are sent out to lower the transmit power further; and an efficient new mechanism of exchanging vectors is presented in ERAPC to decrease the control overhead. Simulation results and comparison with the ERBC algorithm show that the energy consumption of each bit in the ERAPC is reduced by at least 27.27% and the control overhead is reduced by at least 11.87%

respectively.

关键词

Keywords

references

POONGUZHARSELVI B, VETRISELVI V. Survey on routing algorithms in opportunistic networks[C]∥Proceedings of International Conference on Computer Communication and Informatics. Piscataway, NJ, USA: IEEE, 2013: 1-5.

CAO Y, SUN Z, WANG N, et al. Converge-and-diverge: a geographic routing for delay/disruption-tolerant networks using a delegation replication approach[J]. IEEE Transactions on Vehicular Technology, 2013, 62(5): 2339-2343.

NIU J, GUO J, CAI Q, et al. Predict and spread: an efficient routing algorithm for opportunistic networking[C]∥Proceedings of 2011 IEEE Wireless Communications and Networking Conference. Piscataway, NJ, USA: IEEE, 2011: 498-503.

LIU H, CHEN Y. A moving scope aware routing approach for opportunistic networks[C]∥Proceedings of 2010 International Conference on Wireless Communications and Signal Processing. Piscataway, NJ, USA: IEEE, 2010: 1-5.

CHOI B J, SHEN X. Adaptive asynchronous sleep scheduling protocols for delay tolerant networks[J]. IEEE Transactions on Mobile Computing, 2011, 10(9): 1283-1296.

WANG W, MOTANI M, SRINIVASAN V. Opportunistic energy-efficient contact probing in delay-tolerant applications[J]. IEEE/ACM Transactions on Network, 2009, 17(5): 1592-1605.

LU X, HUI P. An energy-efficient n-epidemic routing protocol for delay tolerant networks[C]∥Proceedings of the 5th International Conference on Networking, Architecture, and Storage. Piscataway, NJ, USA: IEEE, 2010: 341-347.

付凯, 夏靖波, 尹波. DTN中一种基于接触时间的休眠机制[J]. 计算机科学, 2013, 40(2): 87-90.

FU Kai, XIA Jingbo, YIN Bo. Sleep scheme based on contact time in DTN[J]. Computer Science, 2013, 40(2): 87-90.

YAO Y K, ZHENG W X, REN Z. An energy-efficient routing algorithm for disruption tolerant networks[C]∥Proceedings of the 2012 2nd International Conference on Computer and Information Application, Paris, France: Atlantis Press, 2012: 895-898.

任智, 索建伟, 陈红. 基于相遇节点跨层感知的机会网络高效低时延路由算法[J]. 通信学报, 2013(10): 1-8.

REN Zhi, SUO Jianwei, CHEN Hong. Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes[J]. Journal on Communications, 2013(10): 1-8.

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.

GU D, ZHANG J. Qos enhancement in IEEE 802.11 wireless local area networks[J]. IEEE Communications Magazine, 2003, 41(6): 120-124.

VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc networks, CS-2000-06[R]. Durham, NC, USA: Duke University, 2000.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Distributed High Efficiency and Energy-Saving Coverage Protocol of Wireless Sensor Networks

Numerical Simulation of Heat-Moisture Barrier Performance of a Horizontal Air Curtain in Cold Storage

Sensitivity Analysis of Foil Geometrical Parameters for the Third-Generation CO2 Gas Foil Bearings Based on Design of Experiments Method

Review of the Application of EBSILON Software in Combined Heat and Power System Optimization

Study on the Thermodynamic Properties in the Anomalous Region of Supercritical Water

Related Author

李善仓

张德运

Related Institution

School of Electronics and Information Engineering, Xi'an Jiaotong University

⁰