Aggregated Packet Transmission in Duty-Cycled WSNs: Modeling and Performance Evaluation

Abstract

Duty cycling (DC) is a popular technique for energy conservation in wireless sensor networks that allows nodes to wake up and sleep periodically. Typically, a single packet transmission (SPT) occurs per cycle, leading to possibly long delay. With aggregated packet transmission (APT), nodes transmit a batch of packets in a single cycle. The potential benefits brought by an APT scheme include shorter delay, higher throughput and higher energy efficiency. In the literature, different analytical models have been proposed to evaluate the performance of SPT schemes. However, no analytical models for the APT mode on synchronous DC medium access control mechanisms exist. In this paper, we first develop a three-dimensional (3D) discrete time Markov chain (DTMC) model to evaluate the performance of an APT scheme with packet retransmission enabled. The proposed model captures the dynamics of the state of the queue of nodes and the retransmission status, as well as the evolution of the number of active nodes in the network, i.e., nodes with a non-empty queue. We then study the number of retransmissions needed to transmit a packet successfully. Based on the observations, we develop another less complex DTMC model with infinite retransmissions which embodies only two dimensions. Furthermore, we extend the 3D model into a four-dimensional model by considering error-prone channel conditions. The proposed models are adopted to determine packet delay, throughput, packet loss, energy consumption, and energy efficiency. Furthermore the analytical models are validated through discrete-event based simulations. Numerical results show that an APT scheme achieves substantially better performance than its SPT counterpart in terms of delay, throughput, packet loss and energy efficiency, and that the developed analytical models reveal precisely the behavior of the APT scheme.

Modeling of Duty-Cycled MAC Protocols for Heterogeneous WSN with Priorities

“…Note that the representation of the network state is an approximation. For each class, the state of the set of nodes other than the RN is approximated using only the m parameter [21,22]. As it will be justified later, this approximation provides very accurate results.…”

“…In [19][20][21][22], we found recent examples of the application of DTMC to the modeling and performance evaluation of homogeneous WSN scenarios operating in DC without priorities. The models proposed in [19,20] assume that the state of nodes is mutually independent, even though there is a certain degree of dependency between them in practice [21].…”

“…Different intermediate terms were defined that lead to a less intuitive, less systematic, and less accurate procedure for energy consumption computation. See, for example, [19][20][21][22]25]. However, in this paper, we propose a novel computation method that is simple and accurate, as discussed later.…”

An Efficient QOS Improvement Established on Unreasonable Investment, with a Half and Half Node Participation Clustering Approach in Mobile Ad Hoc Network

“…Botnets that are more cultured create a hierarchy of command and control servers to make it harder, to track down the central command and control server. In ad hoc networks, each node is willing to forward data to other nodes, the determination of which nodes forward data is made excitedly based on the network connectivity [16].…”

“…It's called routing overhead in the network. [16] The above approaches are proposed for improving the performance of AODV routing protocol in the paper. Each of the methods has been implemented and simulated using the network simulator in the network.…”