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/

Global: Zendy Plus annual

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

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A k-clustering protocol is an algorithm in which the wireless network is divided into non-overlapping sub networks, referred to as clusters, and where every node of a sub network is at most k hops from a distinguished station called the cluster-head. A lattice-clustering protocol is an algorithm in which a given area is divided by lattices and randomly distributed hosts in a lattice are one hop from the cluster-head. In this paper, we evaluated the energy eficiencies for the broadcasts designed in both k-clustering and lattice-clustering protocols. The evaluation showed that the k-clustering protocol is characterized by the smallest broadcasting power of each node, and a lattice-clustering protocol constitutes a characteristic feature of the most minimal total energy consumption. The main source of greater energy consumption in k-clustering protocol is a large number of transmissions between adjacent node pairs.

EVALUATION OF K-/LATTICE-CLUSTERING ALGORITHMS FOR RANDOM WIRELESS MULTI-HOP NETWORKS