Energy‐efficient multicast routing scheme for wireless sensor networks

Abstract

This paper presents a novel energy-efficient multicast routing scheme for wireless sensor networks, named extended multicast routing scheme with pruning and energy balancing (E-MPEB) to disseminate data through layered multicast trees with high efficiency and low power consumption. E-MPEB uses pruning and energy balancing algorithms to save energy and balance load. Especially, it supports multisource multicast and multiple multicast tasks. In multisource multicast, we propose dense tree construction and conjunctive pruning algorithms to minimise total transmission in the network. We increase the number of children having the same parent to improve transmission efficiency and turn more nodes into sleep. In multiple multicast tasks, we propose sharing node avoidance algorithm to separate trees for different multicast tasks. This separation reduces transmission congestion at sharing nodes and balances total energy consumption. Formal validations and simulations evaluate the performance of E-MPEB, which show that E-MPEB has a distinct advantage over others in both reducing and balancing energy consumption.

Optimal energy efficient joint power allocation for two‐hop single‐antenna relaying systems

“…Here, the power ratio should be derived from (14). The function in MATLAB Lambert W is employed to realise W f g in (16). Figure 2 demonstrates the EE versus the required minimum SE r 0 , where the PCM parameters are set to OEa 1 , b 1 D OE3.14, 69 and OEa 2 , b 2 D OE4.…”

“…The research on relaying systems has been conducted extensively in the past decade [1][2][3][4][5][6], yet the focus is mainly placed on the SE [7,8] and the bit error rate as described in [9][10][11][12][13][14] and the references therein. A new performance metric for relaying systems that emphasises the EE [15][16][17][18][19] from the green communications point of view [20] has become an attractive topic recently. PA is one of the key topics in the energy efficient communications because the PA scheme affects the EE directly.…”

Knowledge‐based replica deletion scheme using directional anti‐packets for vehicular delay‐tolerant networks

“…Specifically, in unicast transmission, when the data reach their only destination, we say they are delivered, and then, the anti-packet is generated. In multicast, only when the data reach all their destinations could the anti-packets be released [20]. How to judge whether a data message has reached all its destinations or not in a distributed network is an open issue.…”

Subgraph selection over coded packet networks with multiple QoS parameters based on DEA

“…This problem can be modelled as a Steiner tree problem, which is well known as a nondeterministic polynomial time‐complete problem . There are several algorithms that may be employed by multicast routing protocols to construct and maintain low‐cost multicast trees .…”