English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

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

GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN