Energy-efficient broadcasting in ad hoc wireless networks

Karmakar, Sushanta; Koutris, Paraschos; Pagourtzis, Aris; Sakavalas, Dimitris

doi:10.1016/j.jda.2016.11.004

Cited by 6 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Klonowski et al [31] considered energy-efficient ways to alert a single hop network of weak devices. Efficiency of broadcasting in ad-hoc wireless networks subject to the number of transmissions a node can perform, interpreted as energy constraint, was studied in [21,28,30]. Chang et al [15] as well as Klonowski and Paj ֒ ak [32] studied tradeoffs between the time and energy for broadcasting in radio networks.…”

Section: Injectionmentioning

confidence: 99%

Energy Efficient Adversarial Routing in Shared Channels

Chlebus

Hradovich

Jurdziński

et al. 2019

The 31st ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of stations that can be switched on simultaneously. Each packet is injected into some station and needs to be delivered to its destination station via the channel. A station has to be switched on in order to receive a packet when it is heard on the channel. Each station manages when it is switched on and off by way of a programmable wakeup mechanism, which is scheduled by a routing algorithm. Packet injection is governed by adversarial models that determine upper bounds on injection rates and burstiness. We develop deterministic distributed routing algorithms and assess their performance in the worst-case sense. An algorithm knows the number of stations but does not know the adversary. One of the algorithms maintains bounded queues for the maximum injection rate 1 subject only to the energy cap 3. This energy cap is provably optimal, in that obtaining the same throughput with the energy cap 2 is impossible. We give algorithms subject to the minimum energy cap 2 that have latency polynomial in the total number of stations n for each fixed adversary of injection rate less than 1. An algorithm is k-energy-oblivious if at most k stations are switched on in a round and for each station the rounds when it will be switched on are determined in advance. We give a k-energy-oblivious algorithm that has packet delay O(n) for adversaries of injection rates less than k−1 n−1 , and show that there is no k-energy-oblivious stable algorithm against adversaries with injection rates greater than k n . An algorithm routes directly when each packet makes only one hop from the station into which it is injected straight to its destination. We give a k-energy-oblivious algorithm routing directly that has latency O n 2 k for adversaries of sufficiently small injection rates that are O k 2 n 2 . We develop a k-energy-oblivious algorithm routing directly that is stable for injection rate k(k−1) n(n−1) , and show that no k-energy-oblivious algorithm routing directly can be stable against adversaries with injection rates greater than k(k−1) n(n−1) .

show abstract

Section: Injectionmentioning

confidence: 99%

Energy Efficient Adversarial Routing in Shared Channels

Chlebus

Hradovich

Jurdziński

et al. 2019

The 31st ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…Therefore, power consumption is a major concern when determining a network topology that meets QoS requirements. Several studies have already been performed with a view of satisfying those objectives [10]- [12]. The majority of these studies have proposed algorithms that make numerous assumptions about the computing power of the nodes to reduce energy consumption locally.…”

Section: Introductionmentioning

confidence: 99%

Flow Aggregation for Energy-Aware Ad-Hoc Wireless Networks Respecting QoS Provisions

Boukrim¹,

Antari²

2020

JTIT

View full text Add to dashboard Cite

Emerging communication technologies are now leading developers to design IT systems taking into count their energy-related considerations. Much research performed in the area of ad-hoc wireless networks tends to distribute the ﬂows over all nodes of the network, which increases the amount of energy consumed by each node and reduces longevity of the network. To overcome these problems, this paper seeks to aggregate a set of ﬂows within a number of nodes that is as low as possible in order to be capable of routing those ﬂows. This proposal allows to maximize the number of network nodes that may be turned oﬀ. The proposed solution was formulated as an integer linear programming (ILP) problem using a set of energy and quality of service (QoS) constraints. This formulation minimizes the total energy consumed by the nodes to construct a topology network that is capable of meeting QoS requirement for a set ﬂows inserted into the network. To evaluate the eﬃciency of the proposed model, a performance-based comparison was conducted with another routing model. The simulation results show that the proposed model oﬀers better performance in terms of global energy consumption and network load

show abstract

Optimized Flow Aggregation for Energy-Efficiency and QoS Routing in Ad Hoc Wireless Network

Boukrim,

Antari

2022

Distributed Sensing and Intelligent Systems

View full text Add to dashboard Cite

Energy-efficient broadcasting in ad hoc wireless networks

Cited by 6 publications

References 9 publications

Energy Efficient Adversarial Routing in Shared Channels

Energy Efficient Adversarial Routing in Shared Channels

Flow Aggregation for Energy-Aware Ad-Hoc Wireless Networks Respecting QoS Provisions

Optimized Flow Aggregation for Energy-Efficiency and QoS Routing in Ad Hoc Wireless Network

Contact Info

Product

Resources

About