Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks

Su, Sheng; Yu, Hongfang

doi:10.1007/s11276-014-0853-4

Cited by 6 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The makespan of a task scheduling depends on the execution time of each task on the selected machine instance j vm [25].…”

Section: 1 Makespanmentioning

confidence: 99%

See 1 more Smart Citation

Energy-aware task scheduling in cloud compting based on discrete pathfinder algorithm

2021

IJE

View full text Add to dashboard Cite

“…The makespan of a task scheduling depends on the execution time of each task on the selected machine instance j vm [25].…”

Section: 1 Makespanmentioning

confidence: 99%

“…The higher resource utilization indicates that a vm with a higher load and low utilization indicates the minimum load of a vm . Resource utilization j RU is calculated as follows [25]: max /100  …”

Section: 4 Resource Utilizationmentioning

confidence: 99%

Energy-aware task scheduling in cloud compting based on discrete pathfinder algorithm

2021

IJE

View full text Add to dashboard Cite

“…In [26], the authors jointly solve the point coverage problem, sink location problem and data routing problem on heterogeneous sensor networks. Su et al [27] proposed the VNS heuristic to minimize transmission tardiness in data aggregation scheduling. Plotnikov et al [28] investigated problem of finding an optimal communication subgraph in a given edge-weighted graph, which translates to the problem of minimization transmission energy consumption in a WSN.…”

Section: Related Workmentioning

confidence: 99%

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

Plotnikov

Erzin

Zalyubovskiy

2020

Optimization Methods and Software

View full text Add to dashboard Cite

We consider a conflict-free minimum latency data aggregation problem that occurs in different wireless networks. Given a network that is presented as an undirected graph with one selected vertex (a sink), the goal is to find a spanning aggregation tree rooted in the sink and to define a conflict-free aggregation minimum length schedule along the arcs of the tree directed to the sink. Herewith, at the same time slot, each element of the network can either send or receive at most one message. Only one message should be sent by each network element during the whole aggregation session, and the conflicts caused by signal interference should be excluded. This problem is NP-hard and remains NP-hard even in the case when the aggregation tree is given. Therefore, the development of efficient approximate algorithms is very essential for this problem. In this paper, we present new heuristic algorithms based on the genetic local search and the variable neighborhood search metaheuristics. We conducted an extensive simulation that demonstrates the superiority of our algorithms compared with the best of the previous approaches.

show abstract

Aggregation Tree Construction Using Hierarchical Structures

Erzin

Plotnikov

Ladygin

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks

Cited by 6 publications

References 25 publications

Energy-aware task scheduling in cloud compting based on discrete pathfinder algorithm

Energy-aware task scheduling in cloud compting based on discrete pathfinder algorithm

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

Aggregation Tree Construction Using Hierarchical Structures

Contact Info

Product

Resources

About