Minimum-Delay Data Aggregation Schedule in Duty-Cycled Sensor Networks

Data aggregation is one of the challenging issues in Wireless Sensor Networks (WSNs). Traditionally, sensor nodes are assumed to be in the active state all the time, which leads to undesirable energy consumption. Moreover, most of the duty-cycle protocols

  • PDF / 944,664 Bytes
  • 13 Pages / 439.37 x 666.142 pts Page_size
  • 46 Downloads / 233 Views

DOWNLOAD

REPORT


Department of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen, China [email protected], [email protected], [email protected] 2 Department of Computer Science and Information Technology, University of Prince Edward Island, Charlottetown, Canada [email protected]

Abstract. Data aggregation is one of the challenging issues in Wireless Sensor Networks (WSNs). Traditionally, sensor nodes are assumed to be in the active state all the time, which leads to undesirable energy consumption. Moreover, most of the duty-cycle protocols are proposed to reduce energy consumption. However, the aggregation delay has been ignored during saving energy. This paper focuses on the problem of minimum-delay aggregation schedule in duty-cycled WSNs under the protocol interference model. To solve the problem, we propose an algorithm by firstly construct an aggregation tree based on the connected dominating set (CDS). Then we propose an aggregation schedule algorithm to avoid the interference, which is Leaves Schedule (LS). Different from existing works, we believe that nodes in different layers can transmit concurrently, thus it will greatly increase the number of nodes transmit concurrently and minimize the total transmission times in order to minimize the aggregation delay. Through extensive simulations, we found that the proposed scheduling method outperforms the state-of-the-art schemes. Keywords: Data aggregation schedule · Minimum delay · Duty-cycled · Wireless Sensor Networks

1

Introduction

With the emergency of better equipped sensor nodes, WSNs have been widely applied in many applications, such as environment monitoring, and data collection [1]. In these applications, battery-powered sensor nodes would be deployed in the target area for a long period of time to sense data, and transmit the sensed data to the base station. According to the fact that neighbor nodes tend to have highly relevant information, data aggregation [2] is usually used during transmission to reduce the total transmission times. In this way, the energy consumption of each node is reduced and the whole network lifetime is prolonged. c Springer International Publishing Switzerland 2016  Q. Yang et al. (Eds.): WASA 2016, LNCS 9798, pp. 305–317, 2016. DOI: 10.1007/978-3-319-42836-9 28

306

X. Yan et al.

To further reduce energy consumption, duty cycle protocols are widely applicable in long-term applications to reduce energy consumption. In dutycycled networks, nodes switch between active state and dormant state periodically. This kind of mode, undoubtedly, reduce energy consumption to a large extent. Data aggregation in duty cycled WSNs can greatly reduce energy consumption. However, a node has to wait some certain time for the parent’s active state, thus the aggregation delay is largely increased. In some real-time applications, e.g. fire monitoring, people are eager to obtain the aggregated data from WSNs within a short time. Hence the res