中国邮电高校学报(英文版) ›› 2016, Vol. 23 ›› Issue (4): 46-52.doi: 10.1016/S1005-8885(16)60044-4

• Wireless • 上一篇    下一篇

Energy aware hierarchical cluster-based routing protocol for WSNs

欧阳瑞,王珂,纪红,张鹤立,李曦   

  1. 北京邮电大学
  • 收稿日期:2016-01-08 修回日期:2016-05-28 出版日期:2016-08-30 发布日期:2016-08-30
  • 通讯作者: 王珂 E-mail:wangke@bupt.edu.cn

Energy aware hierarchical cluster-based routing protocol for WSNs

  • Received:2016-01-08 Revised:2016-05-28 Online:2016-08-30 Published:2016-08-30
  • Contact: Wang-Ke E-mail:wangke@bupt.edu.cn

摘要: Wireless sensor networks (WSNs) are emerging as essential and popular ways of providing pervasive computing environments for various applications. Unbalanced energy consumption is an inherent problem in WSNs, characterized by multi-hop routing and a many-to-one traffic pattern. This uneven energy dissipation can significantly reduce network lifetime. In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In an energy-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a novel energy aware hierarchical cluster-based (NEAHC) routing protocol with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We model the relay node choosing problem as a nonlinear programming problem and use the property of convex function to find the optimal solution. We also evaluate the proposed algorithm via simulations at the end of this paper.

关键词: WSNs, cluster head election, multihop routing, energy efficiency, network lifetime

Abstract: Wireless sensor networks (WSNs) are emerging as essential and popular ways of providing pervasive computing environments for various applications. Unbalanced energy consumption is an inherent problem in WSNs, characterized by multi-hop routing and a many-to-one traffic pattern. This uneven energy dissipation can significantly reduce network lifetime. In multi-hop sensor networks, information obtained by the monitoring nodes need to be routed to the sinks, the energy consumption rate per unit information transmission depends on the choice of the next hop node. In an energy-aware routing approach, most proposed algorithms aim at minimizing the total energy consumption or maximizing network lifetime. In this paper, we propose a novel energy aware hierarchical cluster-based (NEAHC) routing protocol with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. We model the relay node choosing problem as a nonlinear programming problem and use the property of convex function to find the optimal solution. We also evaluate the proposed algorithm via simulations at the end of this paper.

Key words: WSNs, cluster head election, multihop routing, energy efficiency, network lifetime

中图分类号: