Next Article in Journal
A Novel Memory and Time-Efficient ALPR System Based on YOLOv5
Previous Article in Journal
A Room-Temperature Surface Acoustic Wave Ammonia Sensor Based on rGO/DPP2T-TT Composite Films
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Energy-Efficient Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks

1
School of Advanced Technology, Xi’an Jiaotong-Liverpool University (XJTLU), Suzhou 215123, China
2
Department of Electrical Engineering and Electronics, University of Liverpool, Liverpool L69 3BX, UK
3
School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing 100081, China
*
Author to whom correspondence should be addressed.
Sensors 2022, 22(14), 5276; https://doi.org/10.3390/s22145276
Submission received: 23 May 2022 / Revised: 5 July 2022 / Accepted: 11 July 2022 / Published: 14 July 2022
(This article belongs to the Topic Wireless Sensor Networks)

Abstract

:
In a wireless sensor network (WSN), reducing the energy consumption of battery-powered sensor nodes is key to extending their operating duration before battery replacement is required. Message bundling can save on the energy consumption of sensor nodes by reducing the number of message transmissions. However, bundling a large number of messages could increase not only the end-to-end delays and message transmission intervals, but also the packet error rate (PER). End-to-end delays are critical in delay-sensitive applications, such as factory monitoring and disaster prevention. Message transmission intervals affect time synchronization accuracy when bundling includes synchronization messages, while an increased PER results in more message retransmissions and, thereby, consumes more energy. To address these issues, this paper proposes an optimal message bundling scheme based on an objective function for the total energy consumption of a WSN, which also takes into account the effects of packet retransmissions and, thereby, strikes the optimal balance between the number of bundled messages and the number of retransmissions given a link quality. The proposed optimal bundling is formulated as an integer nonlinear programming problem and solved using a self-adaptive global-best harmony search (SGHS) algorithm. The experimental results, based on the Cooja emulator of Contiki-NG, demonstrate that the proposed optimal bundling scheme saves up to 51.8% and 8.8% of the total energy consumption with respect to the baseline of no bundling and the state-of-the-art integer linear programming model, respectively.

1. Introduction

A typical wireless sensor network (WSN) consists of a head node with abundant computing and power resources and a large number of resource-constrained, battery-powered sensor nodes [1,2]. As the sensor nodes’ energy is strictly limited by the equipped batteries, minimizing their energy consumption is critical to the operation of the entire WSN; for instance, the lifetime of a WSN could be extended by up to 52% through the use of energy-efficient transmission algorithms and protocols [3].
The number of message transmissions can be reduced by bundling several messages together and transmitting them in a common data frame or packet [4,5]. As data transmission modules consume the most energy [6,7], message bundling is considered an efficient technique for reducing the energy consumption of a sensor node [8,9]. However, message bundling not only increases the end-to-end (E2E) delay, but also reduces the synchronization accuracy [10,11,12,13,14]. Various optimal message bundling schemes that investigate the relationship between message bundling and the E2E delay in the reduction of energy consumption have been proposed. However, in most of the work, the message bundling is considered together with, or as part of, other protocols and processes, such as routing [8,9], scheduling [15], and query processing [16]. Few of them focus on message bundling and its effect on energy consumption, both directly and independently.
In [17], for the first time, we took into account time synchronization accuracy and E2E delays in optimal message bundling, where the energy consumption is indirectly minimized by maximizing the total number of bundled messages in a WSN through computationally feasible integer linear programming (ILP). Unlike most of the existing work, in this study, we purely focus on the optimal message bundling, independently from other protocols, such as routing and scheduling. Though the indirect minimization of the energy consumption dramatically simplifies the formulation of the optimal bundling, it cannot capture the negative effect of message bundling on the energy consumption, i.e., a higher probability of retransmissions due to the increased packet error rate (PER) [6]. In this paper, we formulate the optimal bundling problem with a new objective function, thus directly modeling the total energy consumption of a WSN, to address the issue of the optimal message bundling scheme proposed in [17], which takes into account both the positive and negative effects of message bundling on the energy consumption and, thereby, strikes the optimal balance between the number of bundled messages and the number of retransmissions given the link quality. We solve the resulting integer nonlinear programming (INLP) problem using a self-adaptive global-best harmony search (SGHS) [18,19].
As for the verification of the energy efficiency of message bundling schemes, the direct measurement of energy consumption through experiments with a real testbed would not be feasible because hardware-based energy measurement is too difficult to implement due to the significant number of modifications required for existing hardware [20,21] and the need for a dedicated circuit for the measurement [22]. To make matters worse, the interconnection with measurement devices—such as oscilloscopes and digital multimeters—would make it challenging to guarantee that the targets are working under normal conditions. Emulation can provide an alternative solution in this regard; unlike simulation, emulation is based on software implementations (i.e., firmware in our case) that can run on original devices (i.e., WSN motes) without any modification, so experimental results from emulation are more convincing and credible than those from simulation. In addition, measuring energy consumption is more straightforward with emulation than with actual hardware. Therefore, in this paper, considering the diversity of WSN devices and the ease of measuring energy consumption, we verify the energy efficiency of the proposed bundling scheme through realistic experiments based on the Cooja emulator of Contiki-NG [23].
The major contribution of our work in this paper is two-fold: First, we propose a new energy-efficient optimal message bundling scheme where we formulate the optimal message bundling based on an objective function modeling the total power consumption of the whole WSN. The proposed scheme, for the first time, enables us to directly minimize the energy consumption under the joint constraints of synchronization accuracy and E2E delay and to investigate the negative effects of message bundling—i.e., increased PER and the number of retransmissions—on the energy consumption. We also apply the advanced SGHS algorithm in order to solve the resulting INLP problem.
Second, we carry out a comparative analysis of the optimal bundling schemes, where we compare the energy consumption of the three different schemes—i.e., the proposed scheme, the ILP model of [17], and the baseline of no bundling—based on the Contiki-NG and its Cooja emulator with eight different network topologies. We also calculate the power consumption of the three schemes based on a numerical analysis for the verification of the emulation results.
The rest of the paper is organized as follows: The objective function and constraints of the optimal bundling problem are described in Section 2. The emulation process is discussed in Section 3. The experimental results and related discussions are presented in Section 4. Section 5 concludes our work in this paper.

2. Energy-Efficient Optimal Message Bundling

In formulating the energy-efficient optimal message bundling problem, we consider a WSN consisting of one head node and N sensor nodes. Each sensor node periodically generates a measurement message with length L M during each measurement interval (MI). The length L i of a packet bundling Γ i messages at node i ( i [ 0 , 1 , , N 1 ] ) is given by
L i = L H + Γ i · L M ,
where L H is the length of a packet header and, if it exists, a packet footer.
If node i is not a leaf node and has λ i descendant nodes, as shown in Figure 1, the period for generating a packet bundling Γ i messages should be Γ i 1 + λ i MI from the conservation of traffic flows [17]. Here, we assume that, at each non-leaf node, the messages of incoming packets are unbundled first and bundled again with the measurement messages generated at the node before being transmitted via outgoing packets.

2.1. Objective Function

Equation (1) suggests that the energy-saving in message bundling mainly comes from the saved energy for Γ i 1 headers. To quantify the energy consumption in message bundling, we use the amount of energy required for the transmission of one information bit based on the PER, i.e., the ratio of the number of unacknowledged packets to the total number of transferred packets, which is defined as follows [6]:
E b = ( L H + Γ i · L M ) Γ i · L M · ( 1 PER ) · E T X ,
where E T X is the energy consumption for transmitting one bit of data at a given output power level P T X . E T X can be obtained via P T X R T X , where R T X , the transmission rate specified in the IEEE 802.15.4 standard, is 250 kbps. In [6], the PER is empirically modeled as a function of the signal-to-noise ratio (SNR), i.e.,
PER = α · e β · SNR · Γ i · L M ,
where α = 0.0128 and β = −0.15. From Equations (2) and (3), we obtain:
E b = E T X · ( L H + Γ i · L M ) Γ i · L M · ( 1 0.0128 · e 0.15 SNR · Γ i · L M ) .
The energy consumption for transmitting a packet bundling Γ i messages at node i is given by
E T X i = L i · E b = E T X · ( L H + Γ i · L M ) 2 Γ i · L M · ( 1 0.0128 · e 0.15 SNR · Γ i · L M ) .
Given the bundling number Γ i and the number of descendant nodes λ i , the bundled packet transmission interval at node i is given by Γ i 1 + λ i MI , during which the amount of energy E T X i is consumed. Therefore, the average power consumption for packet transmission at node i is given by
P T X i ( Γ i ) = E T X i Γ i 1 + λ i · MI = ( 1 + λ i ) · E T X · ( L H + L M · Γ i ) 2 ( Γ i ) 2 · MI · L M · ( 1 0.0128 · e 0.15 SNR · Γ i · L M ) .
Note that the transmission of a bundled packet at a node causes the energy consumption for the reception of the corresponding packet at its destination node(s); there could be multiple destinations in the case of multicast and broadcast. However, the energy consumption for receiving a packet could be different from that for transmitting the same packet because the transceiver module in a typical WSN mote is designed with asymmetric current consumption. Considering this difference in current consumption for transmission and reception, we can obtain the average power consumption for packet reception at node i under the assumption of a common supply voltage for all WSN nodes as follows:
P R X i = σ j C i P T X j ( Γ j ) ,
where σ is a ratio between current consumption for reception and transmission (i.e., I R X I T X ) and C i is a set of indexes of node i’s child nodes. Therefore, the average power consumption at node i is given by
P i = P T X i + P R X i .
As the average power consumption is stable and constant under periodic message generation at all nodes, we can minimize the energy consumption by minimizing the average power consumption. Therefore, we define the objective function of the energy-efficient optimal bundling problem as the total power consumption of the network, i.e.,
P t o t a l ( Γ ) = i = 0 N 1 P i ,
where Γ Γ 0 ,   ,   Γ N 1 . Note that, if there are only unicast transmissions in the WSN, Equation (9) can be simplified as follows:
P t o t a l ( Γ ) = i = 0 N 1 P T X i ( Γ i ) + σ i = 0 N 1 ( j C i P T X j ( Γ j ) ) = ( 1 + σ ) i = 0 N 1 P T X i ( Γ i ) .

2.2. Bundling Constraints

Because 0 ≤ PER ≤ 1, the bundling number Γ i in Equation (3) with the values of α and β should satisfy the following condition:
0 0.0128 · e 0.15 SNR · Γ i · L M 1 0 Γ i e 0.15 SNR 0.0128 · L M .
In practical implementations, the maximum bundling number is also limited by the maximum payload length of the underlying protocols (e.g., 110 bytes in the IEEE 802.15.4 standard [24]). Therefore, we constrain the bundling number Γ i as follows:
χ m i n Γ i min χ m a x , e 0.15 SNR 0.0128 · L M ,
where χ m i n is a user-defined minimum bundling number, which is typically 1, and χ m a x is the maximum bundling number determined by the ultimate payload length L P , m a x and the message length L M , i.e.,
χ m a x = L P , m a x L M .

2.3. Delay Constraints

While minimizing the energy consumption, we also need to meet the E2E delay and time synchronization accuracy requirements for time-sensitive applications and the proper operation of WSNs. In [17], the joint constraints of E2E delay and time synchronization accuracy are formulated as follows:
D e 2 e i min D e 2 e m a x , D e 2 e S A ,
where D e 2 e i is the E2E delay of node i given by
D e 2 e i = l = 0 L 1 Γ i 1 + λ i · MI ,
D e 2 e m a x is a user-defined E2E delay requirement, and D e 2 e S A is another E2E delay requirement translated from the minimum time synchronization interval S A m i n through the function τ ( · ) , i.e.,
D e 2 e S A = τ S A m i n .
For detailed discussions on the joint constraints of E2E delay and time synchronization accuracy, readers are referred to [17].

2.4. Integer Nonlinear Programming Model

With the objective function and the constraints in Equations (10), (12) and (14), the energy-efficient optimal bundling can be formulated as the following INLP problem:
minimize Γ P t o t a l ( Γ ) subject to χ m i n Γ i min χ m a x , e 0.15 SNR 0.0128 · L M , i [ 0 ,   ,   N 1 ] , D e 2 e i min D e 2 e m a x , D e 2 e S A , i [ 0 ,   ,   N 1 ] .
Note that, thanks to the objective function P t o t a l ( Γ ) modeling the total power consumption of the network, we can now directly minimize the energy consumption in the optimal bundling formulated in Equation (17). The tradeoff of this direct minimization of the energy consumption is that, unlike the formulation in [17], it results in the INLP problem. The details of the approach to solving the INLP problem will be discussed in Section 4.1.

3. Cooja-Based Emulation

The rapid development of emulation technologies with ever-increasing computing power enables us to develop, run, test, and debug unmodified embedded software on our PC from chips to independent systems and complex multi-node networks. Unlike traditional network simulators, such as ns-2 [25] and OMNeT++ [26], an emulator can run firmware developed for physical devices (e.g., WSN motes), which eliminates the need for creating and maintaining separate simulation models, thereby resulting in credible experimental results [27,28]. Contiki-NG [23] and TinyOS [29,30] are two popular operating systems (OSs) for WSN and Internet of Things (IoT) devices that provide emulators for the devices that they support.
Cooja is the emulator from Contiki-NG, the OS for next-generation IoT devices, which can provide a development and testing environment for WSN/IoT devices with a powerful graphical user interface (GUI) and network simulation capability [23]. Cooja compiles Contiki-NG to a native platform as a shared library and loads the library via Java Native Interfaces (JNIs) to provide the loaded firmware with the same running environment as the actual devices (i.e., the emulation target). Experiments based on the Cooja emulator can enable more realistic investigations of the effect of optimal bundling on energy consumption than those based on network simulators. TinySim is an emulator from TinyOS, another competitive OS designed explicitly for power-constrained sensor nodes [29,30], but it is not comparable to Cooja in terms of features and functionalities, which is why even TinyOS developers use Cooja to run and test firmware developed with TinyOS. Table 1 provides a short comparison between Contiki-NG and TinyOS.
Though Contiki-NG and TinyOS provide similar functionalities and protocol support, Contiki-NG has more active developer communities and abundant application scenarios from which one can expect more comprehensive technical support. Therefore, for the evaluation of the proposed optimal bundling algorithm, we chose Contiki-NG and Cooja.
One of the major strengths of Cooja is its ability to estimate the energy consumption of WSN motes without the actual deployment of a WSN; there are two options in this regard, i.e., Energest [21], a Contiki-NG time recorder for energy estimation providing linear analysis mechanisms, and PowerTracker [34], a Cooja plugin for energy monitoring. Of the two, because PowerTracker is tightly integrated into the Cooja emulator with the full support of a GUI, the energy consumption calculation is mainly based on the output from PowerTracker, while the data from Energest are used for cross-validation. As for the emulation target, the Z1 [27,35] platform is used to obtain reliable results from the energy consumption calculation based on the up-to-date and detailed data from its datasheet. Table 2 summarizes the software and hardware components for the experiments based on the Cooja emulator.

Protocol Stack

Figure 2 shows the network protocol stack of the WSN motes based on NullNet, the minimal network layer of Contiki-NG [36,37].
We choose NullNet to minimize the effect of the complicated network layer protocols, including routing and encryption, in investigating the impact of message bundling on the energy consumption at sensor nodes, which ensures that most of the energy is used for bundled message transmissions. Likewise, in this paper, we also choose the simple carrier sense multiple access (CSMA) medium access control (MAC) protocol to isolate the effect of message bundling in our investigation of the energy consumption.

4. Performance Evaluation

To evaluate the performance of the proposed energy-efficient optimal bundling algorithm, in comparison with the baseline case without message bundling and the ILP model of [17], we consider the eight topologies shown in Figure 3.
We also assume the parameter values summarized in Table 3 for the WSN and optimal bundling unless explicitly stated otherwise.

4.1. Optimal Bundling Numbers

Various evolutionary algorithms (EAs)—i.e., population-based optimization algorithms inspired by biological evolution—have been widely used for research on energy conservation in WSNs; for example, a genetic algorithm (GA) was applied to an adaptive clustering protocol to achieve optimal performance in terms of WSN lifetime in [39], particle swarm optimization (PSO) was used for a novel coverage control to reduce the energy consumption of WSN motes in [40], and a social spider optimization (SSO) algorithm was proposed for a clustering a sensor network in [41]. To solve the INLP model formulated in Equation (17), we use SGHS, an improved version of the harmony search (HS) algorithm. HS is a novel intelligent optimization algorithm inspired by the process of improvisation of music performed by an orchestra and has the following advantages over the popular GAs [42,43]:
  • HS algorithms are simple, easy to implement, and based on decimal encoding, while GAs mostly use binary encoding and, thereby, suffer from the Hamming Cliff problem [44].
  • HS algorithms make the most of both local and global information and can store individual optimal solutions.
  • It is convenient to mix HS algorithms with other optimization methods to construct better algorithms.
HS algorithms, however, cannot achieve optimal performance consistently. Therefore, SGHS—which is based on two other variants of HS, i.e., improved HS (IHS) and global-best HS (GHS)—employs a new improvisation scheme and an adaptive parameter tuning method [18,19]. The parameter values of SGHS for optimal bundling are summarized in Table 4.
Based on these parameter values, we obtain the optimal bundling numbers in Table 5 for the eight topologies shown in Figure 3.
The results in Table 5 show that the bundling numbers from the proposed INLP and those from [17] are different for the 1-ary tree topologies (also called parking lot topologies [45]) of T2, T4, T6, and T8, but are identical for the other tree topologies of T1, T3, T5, and T7. As the objective function in the INLP (i.e., Equations (6) and (10)) can take into account both the positive and negative effects of message bundling on energy consumption, the INLP results in a bundling of numbers that are more evenly spread than those with the ILP as the height of the tree increases. The energy consumption with the different bundling numbers for the 1-ary trees is analyzed in Section 4.2.

4.2. Energy Consumption

To investigate the effect of message bundling in a realistic environment with information on the different operation modes of specific hardware platforms, we measured the energy consumption of WSN nodes based on experiments on a directed graph radio medium (DGRM) [46,47] using a Cooja emulation, where the Z1 mote [35] was selected as a target device for all of the nodes. The current consumption at different states of the Z1 mote is summarized in Table 6.
During the emulation experiments, we did not consider other power-saving mechanisms, such as sleep/wake-up scheduling [48], but used only the two active states of “Radio RX” and “Radio TX” to focus on the effect of message bundling on energy consumption. In this case, the energy consumption of the node can be calculated from the two different operating modes of transmission ( T X ) and reception ( R X ) as follows:
E i = V · I T X · T T X + V · I R X · T R X ,
where V is the common supply voltage (i.e., 3 V), and I O P and T O P ( O P [ T X , R X ] ) are the current and the period of each operation mode, respectively. The total energy consumption is given by
E t o t a l = i = 0 N 1 V · I T X · T T X + V · I R X · T R X .
Based on Equation (19), Table 6, and the experimental log files from PowerTracker, we could calculate the total energy consumption for each topology under different message bundling schemes.
The emulation experiments ran for 1 h in emulation time with the optimal bundling numbers from INLP and ILP summarized in Table 5, whose total energy consumption results for T2, T4, T6, and T8 are shown in Figure 4; the total power consumption for the case of no message bundling is also shown as a baseline.
The emulation results confirm that, while both schemes could save a significant amount of energy compared to the baseline, the proposed INLP outperformed the ILP overall. Comparing the emulation results with the mathematical ones shown in Figure 5, which are for total power consumption and based on Equation (10), we can observe that both results show similar trends, indicating that Equation (10) models the total power consumption well under a realistic environment.
To quantify the energy savings of a message bundling scheme with respect to the baseline of no bundling, a performance measure η b a s e was defined as follows:
η b a s e E b a s e t o t a l E s c h e m e t o t a l E b a s e t o t a l = E b a s e t o t a l E s c h e m e t o t a l E b a s e t o t a l .
To further analyze the relative energy savings of INLP in comparison to ILP, we also defined another performance measure η I L P as follows:
η I L P E I L P t o t a l E I N L P t o t a l E I L P t o t a l = E I L P t o t a l E I N L P t o t a l E I L P t o t a l .
Table 7 summarizes the total energy consumption saved by the proposed optimal message bundling scheme in comparison to the baseline (no bundling) and the ILP model of [17].
The results clearly show that message bundling could significantly save the total energy consumption for the 1-ary tree topologies. Of the two bundling schemes, the total energy consumption for the proposed optimal bundling scheme based on INLP is smaller than that for the state-of-the-art one based on ILP in all the cases considered. Overall, the proposed bundling scheme can save up to 51.8% and 8.8% of the total energy consumption with respect to the baseline of no bundling and the bundling based on ILP, respectively, as shown in Table 7. As discussed before, this is because the proposed optimal bundling scheme can take into account both the positive and negative effects of message bundling on the energy consumption during the optimization thanks to the objective function given in Equation (10). These results demonstrate the importance of striking the optimal balance between the positive and negative effects of message bundling, which is further discussed with the results of the number of transmissions in the following section.

4.3. Number of Transmissions and End-to-End Delay

Unlike the ILP model of [17], the effect of packet retransmissions due to packet errors—especially on a link with a lower SNR—is taken into account in the objective function of the proposed INLP model through Equations (2)–(5). This effect of packet retransmissions is also properly captured in the Cooja emulation thanks to the Contiki-NG CSMA MAC protocol. Table 8 summarizes the average number of transmissions (including the original transmission) at the MAC layer.
Except for the simplest topology of T2, INLP results in a lower number of transmissions than that with ILP. The difference between the two bundling schemes increases as the number of nodes increases; the difference in the average number of transmissions is 0.0906 for T8 compared to 0.0074 for T4. This difference in the number of transmissions is better illustrated through its distribution for the most complicated topology of T8, as shown in Figure 6.
Note that the mote output module of the Cooja emulator can display the E2E delay of each node. We observe that the requirement of user-defined synchronization accuracy, which is translated into the E2E delay of 6 seconds, is met for all of the cases considered, as shown in Table 9.

4.4. Discussion

The results of energy and power consumption based on Cooja emulation and Equation (10), respectively, clearly show the importance of taking into account the negative effects of message bundling—including increased PER and the number of retransmissions—as well as its positive effects. Thanks to the objective function that considers both the positive and negative effects of message bundling on the energy consumption, the proposed energy-efficient optimal bundling scheme can save more energy than the bundling based on ILP, which focuses only on the positive effects of message bundling.
The same results of energy and power consumption also show that Equation (10), based on the empirical model of the amount of energy required for the transmission of one information bit based on PER [6], captures the effect of packet retransmissions due to packet errors well; as discussed in Section 4.2, the results based on the Cooja emulation employing the CSMA MAC protocol match well with those based on Equation (10).
Note that, though the energy consumption measurement with the Cooja emulation has many advantages over that with actual hardware, as mentioned in Section 1, the results of energy consumption presented in Section 4.2 should be interpreted appropriately; the numerical results based on Equation (10) verify those based on the Cooja emulation by providing similar trends, but they cannot completely guarantee the accuracy of the energy consumption measurement with the Cooja emulation in comparison with that with actual hardware. In this regard, the energy consumption results presented in this section are to be interpreted as the relative performance of the bundling schemes, but not the absolute performance.

5. Conclusions

In this paper, we proposed a new energy-efficient optimal message bundling scheme for WSNs. Unlike the ILP model of [17], where the energy consumption is indirectly reduced by maximizing the message bundling number, the proposed scheme directly minimizes the power consumption of sensor nodes by considering relayed traffic from descendant nodes, as well as self-generated traffic, under the same constraints of E2E delay and synchronization accuracy. We formulated the optimal message bundling problem based on the power consumption of the entire WSN as an INLP model, which can take into account both the positive and negative effects of message bundling on the energy consumption, including packet retransmissions, and used SGHS to find an optimal solution. The experimental results based on the Cooja emulator of Contiki-NG demonstrate that the proposed optimal bundling scheme saves up to 51.8% and 8.8% of the total energy consumption with respect to the baseline case of no message bundling and the state-of-the-art ILP model of [17], respectively.
As a future extension of the current work, it is worth investigating an alternative formulation of the energy-efficient optimal bundling problem that enables analytical approaches (e.g., convex optimization), possibly with the approximation of the nonlinear objective function, given the complexity of the INLP model based on the nonlinear objective function for sensor nodes’ energy consumption and the solution procedure based on SGHS.

Author Contributions

Methodology, S.L., L.Z. and K.S.K.; development, S.L. and X.H.; software, S.L.; validation, S.L., K.S.K. and X.H.; writing—original draft preparation, S.L. and K.S.K.; writing—review and editing, K.S.K., S.L., X.H., L.Z. and J.S.; funding acquisition, K.S.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the Postgraduate Research Scholarships (under Grant PGRS1912001), Key Program Special Fund (under Grant KSF-E-25), and Research Development Fund (under Grant RDF-16-02-39) of Xi’an Jiaotong-Liverpool University.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the editor and anonymous reviewers for their helpful and constructive comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kim, K.S.; Lee, S.; Lim, E.G. Energy-Efficient Time Synchronization Based on Asynchronous Source Clock Frequency Recovery and Reverse Two-Way Message Exchanges in Wireless Sensor Networks. IEEE Trans. Commun. 2017, 65, 347–359. [Google Scholar] [CrossRef] [Green Version]
  2. Huan, X.; Kim, K.S. On the practical implementation of propagation delay and clock skew compensated high-precision time synchronization schemes with resource-constrained sensor nodes in multi-hop wireless sensor networks. Comput. Netw. 2020, 166, 106959.1–106959.8. [Google Scholar] [CrossRef]
  3. Park, C.; Lahiri, K.; Raghunathan, A. Battery discharge characteristics of wireless sensor nodes—An experimental analysis. In Proceedings of the IEEE 2nd IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, Santa Clara, CA, USA, 26–29 September 2005. [Google Scholar]
  4. Rajagopalan, R.; Varshney, P.K. Data-aggregation techniques in sensor networks: A survey. IEEE Commun. Surveys Tutor. 2006, 8, 48–63. [Google Scholar] [CrossRef] [Green Version]
  5. Cui, J.; Valois, F. Data aggregation in wireless sensor networks—Compressing or forecasting? In Proceedings of the 2014 IEEE Wireless Communications and Networking Conference (WCNC), Istanbul, Turkey, 6–9 April 2014; pp. 2892–2897. [Google Scholar] [CrossRef] [Green Version]
  6. Fu, S.; Zhang, Y.; Jiang, Y.; Hu, C.; Shih, C.; Marrón, P.J. Experimental Study for Multi-layer Parameter Configuration of WSN Links. In Proceedings of the IEEE 35th International Conference on Distributed Computing Systems, Columbus, OH, USA, 29 June–2 July 2015; pp. 369–378. [Google Scholar] [CrossRef]
  7. Srbinovska, M.; Dimcev, V.; Gavrovski, C. Energy consumption estimation of wireless sensor networks in greenhouse crop production. In Proceedings of the IEEE EUROCON 2017—17th International Conference on Smart Technologies, Ohrid, North Macedonia, 6–8 July 2017; pp. 870–875. [Google Scholar] [CrossRef]
  8. Li, X.; Liu, W.; Xie, M.; Liu, A.; Zhao, M.; Xiong, N.N.; Zhao, M.; Dai, W. Differentiated Data Aggregation Routing Scheme for Energy Conserving and Delay Sensitive Wireless Sensor Networks. Sensors 2018, 18, 2349. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  9. Li, X.; Liu, A.; Xie, M.; Xiong, N.N.; Zeng, Z.; Cai, Z. Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks. Sensors 2018, 18, 1216. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  10. Deng, X.; Yang, Y. Online Adaptive Compression in Delay Sensitive Wireless Sensor Networks. IEEE Trans. Comput. 2012, 61, 1429–1442. [Google Scholar] [CrossRef]
  11. Al-Anbagi, I.; Erol-Kantarci, M.; Mouftah, H.T. Delay Critical Smart Grid Applications and Adaptive QoS Provisioning. IEEE Access 2015, 3, 1367–1378. [Google Scholar] [CrossRef]
  12. Doudou, M.; Djenouri, D.; Badache, N. Survey on Latency Issues of Asynchronous MAC Protocols in Delay-Sensitive Wireless Sensor Networks. IEEE Commun. Surv. Tutor. 2013, 15, 528–550. [Google Scholar] [CrossRef]
  13. Wang, Y.; Vuran, M.C.; Goddard, S. Cross-Layer Analysis of the End-to-End Delay Distribution in Wireless Sensor Networks. IEEE/ACM Trans. Netw. 2012, 20, 305–318. [Google Scholar] [CrossRef] [Green Version]
  14. Wang, J.; Dong, W.; Cao, Z.; Liu, Y. On the Delay Performance in a Large-Scale Wireless Sensor Network: Measurement, Analysis, and Implications. IEEE/ACM Trans. Netw. 2015, 23, 186–197. [Google Scholar] [CrossRef]
  15. Xu, X.; Li, X.Y.; Mao, X.; Tang, S.; Wang, S. A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks. IEEE Trans. Parallel Distrib. Syst. 2011, 22, 163–175. [Google Scholar] [CrossRef] [Green Version]
  16. Samuel, M.; Michael, J.F.; Joseph, M.H.; Hong, W. The Design of an Acquisitional Query Processor for Sensor Networks. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, USA, 9–12 June 2003; pp. 491–502. [Google Scholar]
  17. Huan, X.; Kim, K.S. Optimal Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks. Sensors 2019, 19, 4027. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  18. Pan, Q.K.; Suganthan, P.; Tasgetiren, M.F.; Liang, J. A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 2010, 216, 830–848. [Google Scholar] [CrossRef]
  19. Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.; Valavi, K. Self-adaptive global best harmony search algorithm applied to reactor core fuel management optimization. Ann. Nucl. Energy 2013, 62, 86–102. [Google Scholar] [CrossRef]
  20. Hurni, P.; Nyffenegger, B.; Braun, T.; Hergenroeder, A. On the Accuracy of Software-Based Energy Estimation Techniques. In Wireless Sensor Node; Marrón, P.J., Whitehouse, K., Eds.; Springer: Berlin/Heidelberg, Germany, 2011; pp. 49–64. [Google Scholar]
  21. Dunkels, A.; Fredrik, S.; Tsiftes, N.; He, Z. Software based on line energy estimation for sensor nodes. In Proceedings of the EmNets07: Fourth International Workshop on Embedded Networked Sensors, Cork, Ireland, 25–26 June 2007; pp. 28–32. [Google Scholar]
  22. Huan, X.; Kim, K.S.; Lee, S.; Lim, E.G.; Marshall, A. A Beaconless Asymmetric Energy-Efficient Time Synchronization Scheme for Resource-Constrained Multi-Hop Wireless Sensor Networks. IEEE Trans. Commun. 2019, 68, 1716–1730. [Google Scholar] [CrossRef] [Green Version]
  23. Contiki-NG: The OS for Next Generation IoT Devices. Available online: https://github.com/contiki-ng (accessed on 20 September 2021).
  24. Akbar, M.S.; Yu, H.; Cang, S. IEEE 802.15.4 frame aggregation enhancement to provide high performance in life-critical patient monitoring systems. Sensors 2017, 17, 241. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  25. The Network Simulator-ns-2. Available online: https://www.isi.edu/nsnam/ns/ (accessed on 9 September 2021).
  26. Varga, A. OMNeT++: Discrete Event Simulation System. Available online: http://www.omnetpp.org/ (accessed on 9 September 2021).
  27. Rudy Hendrawan, I.N.; Arsa, I.G.N. Zolertia Z1 energy usage simulation with Cooja simulator, 2017. In Proceedings of the 1st International Conference on Informatics and Computational Sciences (ICICoS), Semarang, Central Java, Indonesia, 15–16 November 2017. [Google Scholar] [CrossRef]
  28. Sitanayah, L.; Sreenan, C.J.; Fedor, S. A Cooja-Based Tool for Coverage and Lifetime Evaluation in an In-Building Sensor Network. J. Sens. Actuator Netw. 2016, 5, 4. [Google Scholar] [CrossRef] [Green Version]
  29. TinyOS GitHub Homepage. Available online: https://github.com/tinyos (accessed on 20 September 2021).
  30. TinyOS Documentation Wiki. Available online: http://tinyos.stanford.edu/tinyos-wiki/ (accessed on 20 September 2021).
  31. Montenegro, G.; Schumacher, C.; Kushalnagar, N. RFC 4919IPv6 over Low-PowerWireless Personal Area Networks (6LoWPANs): Overview, Assumptions, Problem Statement, and Goals. Internet Standard; Internet Engineering Task Force (IETF): Freemont, CA, USA, 2007. [Google Scholar]
  32. Winter, T.; Thubert, P.; Brandt, A.; Hui, J.W.; Kelsey, R. RFC 6550RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks. Internet Standard; Internet Engineering Task Force (IETF): Freemont, CA, USA, 2012. [Google Scholar]
  33. Shelby, Z.; Hartke, K.; Bormann, C. RFC 7252The Constrained Application Protocol (CoAP). Internet Standard; Internet Engineering Task Force (IETF): Freemont, CA, USA, 2014. [Google Scholar]
  34. Finne, N. PowerTracker. Available online: https://github.com/contiki-ng/cooja/tree/master/apps (accessed on 29 September 2021).
  35. Zolertia. Zolertia Z1 Datasheet. Available online: http://zolertia.sourceforge.net/wiki/images/e/e8/Z1_RevC_Datasheet.pdf (accessed on 20 September 2021).
  36. Contiki OS Verion 2.6—The uIP TCP/IP Stack. Available online: http://contiki.sourceforge.net/docs/2.6/a01793.html#:~:text=The (accessed on 10 July 2022).
  37. Dunkels, A. uIP—A Free Small TCP/IP Stack. Available online: http://www.dunkels.com/adam/download/uip-doc-0.5.pdf (accessed on 10 July 2022).
  38. Std 802.15.4-2020; Revision of IEEE Std 802.15.4-2015. IEEE Standard for Low-Rate Wireless Networks. IEEE Computer Society: Washington, DC, USA, 2020.
  39. Liu, J.L.; Ravishankar, C.V. LEACH-GA: Genetic Algorithm-Based Energy-Efficient Adaptive Clustering Protocolfor Wireless Sensor Networks. Int. J. Mach. Learn. Comput. 2011, 1, 79–85. [Google Scholar] [CrossRef] [Green Version]
  40. Wang, J.; Ju, C.; Gao, Y.; Sangaiah, A.; Kim, G.J. A PSO based energy efficient coverage control algorithm for wireless sensor networks. Comput. Mater. Contin. 2018, 56, 433–446. [Google Scholar] [CrossRef]
  41. Tabatabaei, S. A novel fault tolerance energy-aware clustering method via social spider optimization (SSO) and fuzzy logic and mobile sink in wireless sensor networks (WSNs). Comput. Syst. Sci. Eng. 2020, 35, 477–494. [Google Scholar]
  42. Geem, Z.W.; Kim, J.H.; Loganathan, G.V. A new heuristic optimization algorithm: Harmony search. Simulation 2001, 76, 60–68. [Google Scholar] [CrossRef]
  43. Gao, X.Z.; Govindasamy, V.; Xu, H.; Wang, X.; Zenger, K. Harmony search method: Theory and applications. Comput. Intell. Neurosci. 2015, 2015, 258491. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  44. Schaffer, J.D.; Caruana, R.A.; Eshelman, L.J.; Das, R. A study of control parameters affecting online performance of genetic algorithms for function optimization. In Proceedings of the 3rd International Conference on Genetic Algorithms, Fairfax, VA, USA, 4–7 June 1989; pp. 51–60. [Google Scholar]
  45. de Baynast, A.; Gurewitz, O.; Knightly, E.W. Cooperative strategies and optimal scheduling for tree networks. In Proceedings of the IEEE INFOCOM 2007, Anchorage, AK, USA, 6–12 May 2007; pp. 1857–1865. [Google Scholar] [CrossRef]
  46. Telang, A. RPL Objective Function and Simulation Using DGRM Model in Cooja. 2014. Available online: https://anrg.usc.edu/contiki/index.php/RPL_objective_function_modification_and_simulation_in_cooja (accessed on 10 July 2022).
  47. Kharche, S.; Pawar, S. Node level energy consumption analysis in 6LoWPAN network using real and emulated Zolertia Z1 motes. In Proceedings of the 2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), Bangalore, India, 6–9 November 2016; pp. 1–5. [Google Scholar] [CrossRef]
  48. Ye, D.; Zhang, M. A self-adaptive sleep/wake-up scheduling approach for wireless sensor networks. IEEE Trans. Cybern. 2018, 48, 979–992. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Conservation of traffic flows at a non-leaf node.
Figure 1. Conservation of traffic flows at a non-leaf node.
Sensors 22 05276 g001
Figure 2. Contiki-NG network protocol stack.
Figure 2. Contiki-NG network protocol stack.
Sensors 22 05276 g002
Figure 3. WSN topologies for performance evaluation.
Figure 3. WSN topologies for performance evaluation.
Sensors 22 05276 g003
Figure 4. Total energy consumption based on the Cooja emulation.
Figure 4. Total energy consumption based on the Cooja emulation.
Sensors 22 05276 g004
Figure 5. Total power consumption based on Equation (10).
Figure 5. Total power consumption based on Equation (10).
Sensors 22 05276 g005
Figure 6. Distribution of the number of transmissions for T8: (a) ILP [17] and (b) INLP.
Figure 6. Distribution of the number of transmissions for T8: (a) ILP [17] and (b) INLP.
Sensors 22 05276 g006aSensors 22 05276 g006b
Table 1. Contiki-NG vs. TinyOS.
Table 1. Contiki-NG vs. TinyOS.
Contiki-NGTinyOS
ProtocolsIEEE 802.15.4, 6LoWPAN 1 , RPL 2 , and CoAP 3
LanguageGeneric CDedicated NesC and C
CompilerC compilersDedicated compiler
PortabilityEasyHard
Main targetIndustrial applicationsTeaching & research
1 IPv6 over Low-Power Wireless Personal Area Networks [31]. 2 Routing Protocol for Low-Power and Lossy Networks [32]. 3 Constrained Application Protocol [33].
Table 2. Experimental environment used with Cooja.
Table 2. Experimental environment used with Cooja.
ComponentDescription
Contiki-NGIoT OS
EnergestContiki-NG’s energy monitor
PowerTrackerCooja’s radio energy monitor
Zolertia Z1 platformWSN mote
Table 3. Default parameter values for the WSN and optimal bundling.
Table 3. Default parameter values for the WSN and optimal bundling.
ParameterMI [s]LH [byte]LM [byte] D e 2 e m a x [s] D e 2 e S A [s] χ m i n χ m a x SNR [dB]ETX [mJ/byte]
Value123 *10 66111 60.000032 **
* Based on the IEEE 802.15.4 data frame, 21-byte MAC header, and 2-byte MAC footer [38]. Based on a six-byte timestamp, three-byte measurement data, and one-byte node ID. Based on the maximum payload size of 127 bytes [38]. ** Based on Z1’s CC2420 power levels: 3, 7, 11, 15, 19, 23, 27, and 31. In the CC2420 datasheet, at power level 31, the TX power PTX is 0 dBm (1 mW).
Table 4. Parameter settings of SGHS for optimal bundling.
Table 4. Parameter settings of SGHS for optimal bundling.
ParameterValueDescription
funPtotalObjective function
x Γ Vector of bundling numbers
AConstraints matrix (i.e., A · xlimit) according to Equation (15)
limit6Delay constraint (i.e., m i n D e 2 e m a x , D e 2 e S A )
l b , u b 1, 10Lower/upper bounds (i.e., χ m i n , χ m a x )
N I 9000The number of improvisations (iterations)
H M S 2000Harmony memory size
H M C R m 0.2Average harmony memory considering rate
P A R m 0.2Average pitch adjusting rate
B W M a x 6Bandwidth upper bound
B W M i n 1Bandwidth lower bound
Table 5. Optimal bundling numbers.
Table 5. Optimal bundling numbers.
TopologyINLP (Equation (17))ILP [17]
T16, 66, 6
T24, 46, 3
T36, 4, 46, 4, 4
T46, 4, 26, 6, 1
T56, 4, 4, 46, 4, 4, 4
T64, 4, 3, 26, 6, 3, 1
T75, 5, 5, 5, 55, 5, 5, 5, 5
T85, 6, 3, 3, 15, 6, 6, 1, 1
Table 6. Current consumption at different states of the Z1 mote [35].
Table 6. Current consumption at different states of the Z1 mote [35].
StateOffDownIdleRadio RXRadio TX
Current<1 μA20 μA426 μA18.8 mA17.4 mA
Table 7. Summary of the energy saved by the proposed optimal message bundling scheme (INLP) with respect to the baseline (no bundling) and the ILP model [17].
Table 7. Summary of the energy saved by the proposed optimal message bundling scheme (INLP) with respect to the baseline (no bundling) and the ILP model [17].
Topologyw.r.t. Baseline (No Bundling)w.r.t. ILP [17]
Saved Energy [mJ] η base [%]Saved Energy [mJ] η ILP [%]
T20.903051.83420.00580.6862
T42.115250.59150.19768.7295
T63.904051.08430.14633.7663
T86.080450.21760.58118.7922
Table 8. Average number of transmissions at the CSMA MAC layer.
Table 8. Average number of transmissions at the CSMA MAC layer.
TopologyBundling Scheme
ILP [17]INLP
T21.30071.3333
T41.29111.2837
T61.30801.2624
T81.46841.3778
Table 9. End-to-end delay performance.
Table 9. End-to-end delay performance.
TopologyBundling SchemeE2E [ms]
Max.Min.Avg.
T2ILP2312641122
INLP3352721650
T4ILP4352882357
INLP134472647
T6ILP44401042375
INLP3368882261
T8ILP51841682519
INLP25201521294
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, S.; Kim, K.S.; Zhang, L.; Huan, X.; Smith, J. Energy-Efficient Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks. Sensors 2022, 22, 5276. https://doi.org/10.3390/s22145276

AMA Style

Li S, Kim KS, Zhang L, Huan X, Smith J. Energy-Efficient Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks. Sensors. 2022; 22(14):5276. https://doi.org/10.3390/s22145276

Chicago/Turabian Style

Li, Sihao, Kyeong Soo Kim, Linlin Zhang, Xintao Huan, and Jeremy Smith. 2022. "Energy-Efficient Message Bundling with Delay and Synchronization Constraints in Wireless Sensor Networks" Sensors 22, no. 14: 5276. https://doi.org/10.3390/s22145276

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop