An efficient energy-saving routing algorithm for opportunistic networks with dynamically adaptive power control

被引：0
作者：
机构：
[1] Key Laboratory of Mobile Communications Technology of Chongqing, Chongqing University of Posts and Telecommunications, Chongqing
来源：
Ren, Zhi | 1600年 / Xi'an Jiaotong University卷 / 48期
关键词：
Energy-saving; Opportunistic networks; Overhead; Power control; Routing algorithm;
D O I：
10.7652/xjtuxb201412008
中图分类号：
学科分类号：
摘要：
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. ©, Xi'an Jiaotong University. All right reserved.
引用
收藏
页码：49 / 56
页数：7
相关论文
共 13 条
  • [1] Poonguzharselvi B., Vetriselvi V., Survey on routing algorithms in opportunistic networks, Proceedings of International Conference on Computer Communication and Informatics, pp. 1-5, (2013)
  • [2] Cao Y., Sun Z., Wang N., Et al., Converge-and-diverge: a geographic routing for delay/disruption-tolerant networks using a delegation replication approach, IEEE Transactions on Vehicular Technology, 62, 5, pp. 2339-2343, (2013)
  • [3] Niu J., Guo J., Cai Q., Et al., Predict and spread: an efficient routing algorithm for opportunistic networking, Proceedings of 2011 IEEE Wireless Communications and Networking Conference, pp. 498-503, (2011)
  • [4] Liu H., Chen Y., A moving scope aware routing approach for opportunistic networks, Proceedings of 2010 International Conference on Wireless Communications and Signal Processing, pp. 1-5, (2010)
  • [5] Choi B.J., Shen X., Adaptive asynchronous sleep scheduling protocols for delay tolerant networks, IEEE Transactions on Mobile Computing, 10, 9, pp. 1283-1296, (2011)
  • [6] Wang W., Motani M., Srinivasan V., Opportunistic energy-efficient contact probing in delay-tolerant applications, IEEE/ACM Transactions on Network, 17, 5, pp. 1592-1605, (2009)
  • [7] Lu X., Hui P., An energy-efficient n-epidemic routing protocol for delay tolerant networks, Proceedings of the 5th International Conference on Networking, Architecture, and Storage, pp. 341-347, (2010)
  • [8] Fu K., Xia J., Yin B., Sleep scheme based on contact time in DTN, Computer Science, 40, 2, pp. 87-90, (2013)
  • [9] Yao Y.K., Zheng W.X., Ren Z., An energy-efficient routing algorithm for disruption tolerant networks, Proceedings of the 2012 2nd International Conference on Computer and Information Application, pp. 895-898, (2012)
  • [10] Ren Z., Suo J., Chen H., Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes, Journal on Communications, 10, pp. 1-8, (2013)
12