An event-driven energy-efficient routing protocol for water quality sensor networks

  • PDF / 1,645,684 Bytes
  • 12 Pages / 595.276 x 790.866 pts Page_size
  • 32 Downloads / 139 Views

DOWNLOAD

REPORT


(0123456789().,-volV)(0123456789(). ,- volV)

An event-driven energy-efficient routing protocol for water quality sensor networks Xiaoyi Wang1 • Gongxue Cheng1 • Qian Sun1 • Jiping Xu1 • Huiyan Zhang1 • Jiabin Yu1 • Li Wang1

Ó Springer Science+Business Media, LLC, part of Springer Nature 2020

Abstract Due to the limited resources of water quality sensor networks, how to design a routing protocol which can prolong the network life cycle is one of a research hotspots. In this paper, according to the event level and the node energy of the sensor networks, the nodes’ types are defined, which can help to determine the cluster node. Then, an event driven routing protocol (EDRP) is proposed, which considers the event information and the remaining energy of the whole network. Simulation results show that, compared with distributed energy-efficient clustering algorithm, EDRP can reduce the overall energy consumption of the network by 138–172%, based on different kinds of events. Besides, EDRP can effectively prolong the life cycle and greatly increase the amount of data transmission of the network. Keywords Energy efficiency  Water quality sensor  Event driven  Routing protocol  Heterogeneous network

1 Introduction

2 Related works

With the development of information technology, wireless sensor networks have been widely applied in traffic monitoring [1, 2], mobile computing [3], environmental observation [4], and many other practical applications [5–7]. Since the twenty-first century, With the deterioration of ecological environment, environmental protection has attracted more and more attention. Water quality sensor network is an effective means for water quality monitoring. Since the water quality sensor nodes are supplied by limited batteries, and can not be supplemented in time. If the nodes consume too much energy, the topology of the network will change accordingly, and the routing of the network will need to be regenerated [8]. Therefore, we need to design an effective routing protocol to prolong the life cycle of the network.

In order to improve the lifetime of sensor networks, researchers have developed many routing protocols, which are mainly divided into plane routing protocol and clustering routing protocol [9]. Typical plane routing protocol are flooding method [10] and gossiping method [9]. On the one hand, the advantages of the plane routing protocol are: simple, easy to expand, and no need for any structural maintenance work, so the network nodes have equal status and are not easy to cause bottleneck effects, so they have better robustness. But on the other hand, the plane routing protocol has significant shortcomings: the organization has no management nodes, lacks optimal management of communication resources, the self-organizing collaborative work algorithm is complex, and the response to network dynamic transformation is slow. Relative to plane routing protocol, the member nodes in the clustering routing protocol close the communication module most of the time, and the cluster head is responsibl