Energy-efficient Broadcast Research Articles

An analysis of probabilistic forwarding of coded packets on random geometric graphs

We consider the problem of energy-efficient broadcasting on large ad-hoc networks. Ad-hoc networks are generally modelled using random geometric graphs (RGGs). Here, nodes are deployed uniformly in a square area around the origin, and any two nodes which are within Euclidean distance of 1 are assumed to be able to receive each other’s broadcast. A source node at the origin encodes k data packets of information into n(>k) coded packets and transmits them to all its one-hop neighbours. The encoding is such that, any node that receives at least k out of the n coded packets can retrieve the original k data packets. Every other node in the network follows a probabilistic forwarding protocol; upon reception of a previously unreceived packet, the node forwards it with probability p and does nothing with probability 1−p. We are interested in the minimum forwarding probability which ensures that a large fraction of nodes can decode the information from the source. We deem this a near-broadcast. The performance metric of interest is the expected total number of transmissions at this minimum forwarding probability, where the expectation is over both the forwarding protocol as well as the realization of the RGG. In comparison to probabilistic forwarding with no coding, our treatment of the problem indicates that, with a judicious choice of n, it is possible to reduce the expected total number of transmissions while ensuring a near-broadcast.

Energy efficient broadcast protocol for Underwater Wireless Sensor Networks

Energy efficient broadcast protocol for Underwater Wireless Sensor Networks

Energy efficient broadcast protocols for asynchronous duty-cycled wireless sensor networks

In asynchronous duty-cycled wireless sensor networks (WSNs), each node has its own sleep schedule that is independent of the schedules of neighboring nodes. Since each node follows its own independent sleep schedule, the probability that a node’s neighbors will wake up concurrently is quite low. For this reason, each single hop broadcast must be completed through multiple unicast transmissions, and the sender node must remain awake until all of its neighboring nodes have received the broadcast packet. In this paper, we present two energy efficient broadcast protocols, namely Broadcast Progress-based Efficient Multihop Broadcast (BPEMB) protocol and Tree-based Efficient Multihop Broadcast (TEMB) protocol, for asynchronous duty-cycled WSNs. In both of the proposed protocols, the decision of whether to transmit the broadcast packet is based on the link quality information and without any forwarder’s guidance list. The redundant transmissions and collisions are avoided effectively with cooperation among the neighbors, so that the node with the best link quality to the receiver node takes responsibility to forward the packet to the receiver node. With this approach, nodes that are not involved in transmitting the broadcast packet can go to sleep and save their energy. In the BPEMB protocol, the forwarding decision of transmitting the broadcast packet is also influenced by the broadcast progress information, which is piggybacked in the broadcast packet. Through extensive simulations, we demonstrate that the proposed protocols can significantly improve the broadcast efficiency through reducing the energy consumption and minimizing the broadcast latency. The evaluation results also show that both the BPEMB and TEMB protocols can substantially reduce the collisions and redundant transmissions in asynchronous duty-cycled WSNs.

IPBM: an energy efficient reliable interference-aware periodic broadcast messaging protocol for MANETs

Mobile ad-hoc networks (MANETs) have been widely employed in many fields including critical information delivery in open terrains as in tactical area, vehicular or disaster area network scenarios. To provide effective network maintenance for those MANETs, it is essential to adopt proper control communication methods, which provide reliable delivery of network information. However, it is difficult to provide control communication that meets the quality of service requirements due to the broadcasting of control messages and dynamic nature of MANETs. Interference is one of the major problems that degrades this service quality, especially for the networks deployed in open terrain environments. Moreover, large and dense MANET scenarios further complicate this problem. Even though many communication methods have been proposed in the literature, a satisfactory one for periodic and broadcast delivery of control packets considering the interference awareness and at the same time yielding high reliability, goodput, energy efficiency still does not exist for MANETs. To that end, we present a new control communication protocol, which is referred to as the Interference-Aware Periodic Broadcast Messaging (IPBM) protocol, for those MANETs deployed in interference-rich open terrains. We show that the proposed interference awareness mechanism of IPBM, in which the transmission power of the units is increased at certain periods, significantly reduces the packet loss caused by the interference problem. Moreover, IPBM achieves an important amount of increase in the link reliability as well as in goodput with the least power consumption among the evaluated solutions. The mobility support feature of IPBM makes the protocol applicable not only to large and dense but also to highly dynamic MANETs. Besides, IPBM can properly work alongside the deployed main data communication protocol, since it provides valuable network information to be manipulated. Simulation results under both static and dynamic topologies confirm that adopting the IPBM protocol in the intended MANET scenarios significantly increases the reliability and goodput as well as the energy efficiency.

Energy-Efficient Broadcast Scheduling Algorithm in Duty-Cycled Multihop Wireless Networks

Broadcasting is a fundamental function for disseminating messages in multihop wireless networks. Minimum-Transmission Broadcasting (MTB) problem aims to find a broadcast schedule with minimum number of transmissions. Previous works on MTB in duty-cycled networks exploit a rigid assumption that nodes have only active time slot per working cycle. In this paper, we investigated the MTB problem in duty-cycled networks where nodes are allowed arbitrary active time slots per working cycle (MTBDCA problem). Firstly, it is proved to be NP-hard and o(ln⁡Δ)-inapproximable, where Δ is the maximum degree in the network. Secondly, an auxiliary graph is proposed to integrate nodes’ active time slots into the network and a novel covering problem is proposed to exploit nodes’ multiple active time slots for scheduling. Then, a ln⁡(Δ+1)-approximation algorithm is proposed for MTBDCA and a (ln⁡(Δ+1)+Δ)-approximation algorithm is proposed for all-to-all MTBDCA. Finally, extensive experimental results demonstrate the efficiency of the proposed algorithm.

An Energy-Efficient Network-Wide Broadcast Protocol for Asynchronous Wireless Sensor Networks

It is very challenging to design an efficient network-wide broadcast protocol for asynchronous wireless sensor networks (AWSNs). Since the neighbors adopt sleep schedule independently and the probability that they wake up concurrently is very low, each single-hop broadcast has to be substituted by multiple unicast transmissions. Moreover, without the schedule knowledge of designated neighbors, a sender has to keep active until all these nodes are covered, which consumes a large amount of energy. In this letter, we propose an energy-efficient network-wide broadcast protocol (EENWB) for AWSNs. By introducing more aggressive cooperations among the neighboring senders, some senders can go to sleep much earlier, only at the cost of increasing the active periods of their cooperators slightly. Extensive simulation results show that EENWB can reduce the total energy consumption greatly.

Minimal Energy Broadcast for Delay-Bounded Applications in Satellite Networks

Broadcast is a fundamental operation in satellite networks. It is frequently used for satellites’ self-organization, routing discovery, coordination, and collaboration. Meanwhile, many satellite network applications require that a broadcast message from a source node must be received by all the other nodes within a given delay bound. In this paper, we study the delay bounded and minimal energy broadcast problem in satellite networks. The broadcast routing problem is challenging in satellite networks due to highly dynamic change and intermittent connectivity of the network. To solve this problem, we propose an algorithm that is based on the model of multi-power level multi-transmission space-time graph. The algorithm repeatedly finds the most energy efficient “caterpillars” in the graph, and merges these caterpillars into an energy efficient broadcast tree. Simulations have been conducted in real satellite constellations and the results show that our proposed scheme can achieve significant energy saving for broadcast in satellite networks, compared with other existing methods.

Algorithms for energy-efficient broadcasting messages in wireless networks

Algorithms for energy-efficient broadcasting messages in wireless networks

Supporting Energy Efficient Broadcast with Unreliable Links for Wireless Sensor Networks

Broadcast is an essential network operation. Designing an energy efficient broadcast becomes an important issue in a wireless sensor network (WSN) because sensor nodes are battery powered. In a low-duty-cycled WSN with unreliable links, the broadcast problem is challenging because 1) nodes may not be active simultaneously and 2) a transmission may fail to reach all the active nodes. In this paper, we define the least energy consumption broadcast problem, prove it to be NP-hard, and propose a Least-Wake-up-First broadcast scheme (LWF). By reducing the number of forwarders and the number of transmissions, LWF greatly reduces energy consumption while achieving broadcasting. Simulation results verify that LWF improves energy efficiency in duty-cycled WSNs.

Supporting energy efficient broadcast with unreliable links for wireless sensor networks

Supporting energy efficient broadcast with unreliable links for wireless sensor networks

Energy-Efficient Broadcasting Scheme for Smart Industrial Wireless Sensor Networks

In smart Industrial Wireless Sensor Networks (IWSNs), sensor nodes usually adopt a programmable technology. These smart devices can obtain new or special functions by reprogramming: they upgrade their soft systems through receiving new version of program codes. If sensor nodes need to be upgraded, the sink node will propagate program code packets to them through “one-to-many” broadcasting, and therefore new capabilities can be obtained, forming the so-called Software Defined Network (SDN). However, due to the high volume of code packet, the constraint energy of sensor node, and the unreliable link quality of wireless network, rapidly broadcasting the code packets to all nodes in network can be a challenge issue. In this paper, a novel Energy-efficient Broadcast scheme with adjustable broadcasting radius is proposed aiming to improve the performance of network upgrade. In our scheme, the nonhotspots sensor nodes take full advantage of their residual energy caused in data collection period to improve the packet reception probability and reduce the broadcasting delay of code packet transmission by enlarging the broadcasting radius, that is, the transmitting power. The theoretical analyses and experimental results show that, compared with previous work, our approach can averagely reduce the Network Upgrade Delay (NUD) by 14.8%–45.2% and simultaneously increase the reliability without harming the lifetime of network.

Energy-efficient broadcasting in ad hoc wireless networks

We study energy-efficient broadcasting in wireless networks of unknown topology (ad hoc). We measure energy efficiency by the maximum number of transmissions (‘shots’) allowed to any node in the network. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. Initially, we focus on oblivious algorithms for k-shot broadcasting, that is, algorithms where at each step each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of Ω(n2/k) on the broadcasting time of any oblivious k-shot broadcasting algorithm, and (b) an oblivious broadcasting protocol that achieves a matching upper bound, namely O(n2/k), for every k≤n and an upper bound of O(n3/2) for every k>n. We also study the general case of adaptive broadcasting protocols where nodes decide whether to transmit based on all the available information, namely the transmission history known to each. We prove a lower bound of Ω(n1+kk) on the broadcasting time of any protocol by introducing the transmission tree construction which generalizes previous approaches.

Delay constraint energy efficient broadcasting in heterogeneous MRMC wireless networks

Energy efficient broadcasting is a critical problem in Multi-Radio Multi-Channel (MRMC) wireless networks and has captured tremendous attention in the past decades. Most existing works try to minimize energy consumption in broadcast by simply minimizing the number of transmissions. However, radios and channels in MRMC wireless networks may have different propagation characteristics, e.g., communication range and energy consumption. Since wireless radios with different communication ranges have different energy consumptions, it is not always true that minimizing the number of transmissions can minimize the energy consumption. Meanwhile, more and more applications require end-to-end delay guarantee to provide Quality of Service (QoS), e.g., wireless video and online games. It is essential to satisfy the delay constraint when broadcasting in MRMC wireless networks as well.In this paper, we investigate the Delay Constraint Minimum Energy Broadcasting (DCMEB) problem in heterogeneous MRMC wireless networks. Especially, we consider heterogeneous radios and channels with different communication ranges and energy consumptions. We present an Energy Efficient Broadcasting (EEB) strategy in this work. EEB utilizes Multi-Dimension Conflict Graph (MDCG) to capture the conflicts among all possible forwarding nodes and channels, and then calculates the schedule to maximize the number of concurrent transmissions in each time slot in a cost effective way without violating the delay constraint. Our evaluation results show that EEB outperforms the state-of-the-art methods in terms of broadcasting energy cost under delay constraint in heterogeneous MRMC networks.

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

Revisiting XOR-based network coding for energy efficient broadcasting in mobile ad hoc networks

Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the “termination criterion”. To tackle the problem, we propose a termination criterion that is fully compatible with XOR coding. In addition to that, we revisit the internals of XOR coding. We first enhance the synergy of XOR coding with the underlying broadcast algorithm by allowing each mechanism to benefit from information available by the other. In this way, we manage to improve the pruning efficiency of the CDS-based algorithm while at the same time we come up with a method for detecting coding opportunities that has minimal storage and processing requirements compared to current approaches. Then, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. We validate the effectiveness of our proposed algorithm through extensive simulations on a diverse set of scenarios.

Broadcast-Enabled Massive Multicore Architectures: A Wireless RF Approach

Broadcast traditionally has been regarded as a prohibitive communication transaction in multiprocessor environments. Nowadays, such a constraint largely drives the design of architectures and algorithms all-pervasive in diverse computing domains, directly and indirectly leading to diminishing performance returns as the many-core era is approaching. Novel interconnect technologies could help revert this trend by offering, among others, improved broadcast support, even in large-scale chip multiprocessors. This article outlines the prospects of wireless on-chip communication technologies pointing toward low-latency (a few cycles) and energy-efficient broadcast (a few picojoules per bit). It also discusses the challenges and potential impact of adopting these technologies as key enablers of unconventional hardware architectures and algorithmic approaches, in the pathway of significantly improving the performance, energy efficiency, scalability, and programmability of many-core chips.

Energy-Efficient Broadcast in Mobile Networks Subject to Channel Randomness

Wireless communication in a network of mobile devices is a challenging and resource demanding task, due to the highly dynamic network topology and the wireless channel randomness. This paper investigates information broadcast schemes in 2D mobile ad-hoc networks where nodes are initially randomly distributed and then move following a random direction mobility model. Based on an in-depth analysis of the popular Susceptible-Infectious-Recovered epidemic broadcast scheme, this paper proposes a novel energy and bandwidth efficient broadcast scheme, named the energy-efficient broadcast scheme, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of the information dissemination process. The accuracy of analytical results is verified using simulations driven by both the random direction mobility model and a real world trace.

Energy-efficient broadcast in multihop cognitive radio networks

Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for CRNs because multiple channels can be used in a CRN. Most existing multi-channel broadcast schemes rely on a common control channel (CCC) to support broadcast. However, finding such a CCC in a CRN is difficult because an unlicensed user’s available channels are changed over time and space. In this paper, we focus on an environment where no broadcast structure or CCC is established in advance while a node is equipped with one CR transceiver and does not aware of the locations and distances to other nodes. We have defined the one-hop Minimum Multichannel Set Cover (MMSC) problem and the multi-hop Minimum Cost Broadcast (MCB) problem in such an environment. Both problems are NP-hard and we have proposed a heuristic solution, the Energy-Efficient Broadcast (EEB) protocol, to solve them. Considering the uncertain primary user occupancy issue, the EEB protocol features a distributed solution that uses only local information. Simulation results verify that EEB effectively reduces energy consumption and achieves high packet delivery ratio.

Clustering-Based Energy-Efficient Broadcast Tree in Wireless Networks

The characteristics of wireless networks present formidable challenges to the study of broadcasting problem. A crucial issue in wireless networks is the energy consumption, because of the nonlinear attenuation properties of radio signals. Another crucial issue is the trade-off between reaching more nodes in a single hop by using higher power versus reaching fewer nodes in that single hop by using lower power. Given a wireless network with a specified source node that broadcasts messages to all other nodes in the network, the minimum energy broadcast (MEB) problem is NP-hard. In this paper, we propose a hybrid approach CBEEB(clustering-based energy-efficient broadcast) for the MEB problem based on clustering. Theoretical analysis indicates the efficiency and effectiveness of CBEEB. Simulation results show that CBEEB has better performance compared with the existing heuristic approaches.

Energy-Efficient Reliable Broadcast Protocol for WSNs Based on IEEE 802.15.5

We propose two link-layer reliable broadcast protocols for wireless sensor networks based on IEEE 802.15.5. We compare them in terms of energy consumption. By including both positive and negative acknowledgement, our second proposed scheme can effectively reduce the number of unnecessary error control messages and, thereby, significantly reducing the unnecessary power consumption relative to the first scheme. Also, we provide an analytical framework for the evaluation of different reliable broadcast techniques. Simulation results show that Scheme 2 achieves energy savings of up to about 85% compared to Scheme 1.