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

Industry 4.0 utilizes the Internet of Things (IoT) to rise the efficiency in manufacturing and automation where wireless sensor networks (WSNs) are crucial technologies for communication layer of IoT. WSNs include hundreds of small sized sensor nodes that have the abilities of wireless transmission and environmental sensing. Wireless transmission is prone to various attacks such as data manipulation since data communication is achieved through transfer of radio packets. A countermeasure of this issue is link monitoring by deploying secure points that can physically capture and inspect radio packets. Graph theory plays a critical role to solve various problems in WSNs. Finding minimum Vertex Cover (VC) is an important NP-Hard graph theoretic problem in which the minimum set of nodes (vertices) is aimed to select in such a way that each link should be incident to at least one node from this set. VC is a significant structure for WSNs where it perfectly fits for link monitoring when nodes in VC are set as secure points (monitors). Since sensor nodes are generally battery-powered and have limited transmission range, energy-efficient multi-hop communication to the sink node is of utmost importance. In weighted connected VC (WCVC) structure, subgraph induced by monitor nodes are connected where monitors are chosen according to their weights. When weights of nodes are assigned as reciprocal of their energies, an energy-efficient virtual backbone can be formed. We propose a novel metaheuristic WCVC algorithm for link monitoring and backbone formation in WSNs modeled as undirected graphs. Our proposed algorithm integrates a genetic search with a greedy heuristic to improve WCVC solution quality and decrease the search time. To evaluate the efficiencies of greedy heuristics, we adopt three different heuristics for WCVC problem. We implement our algorithm with its counterparts and reveal that the algorithm is favorable in terms of solution quality and resource consumption.

Weighted Connected Vertex Cover Based Energy-Efficient Link Monitoring for Wireless Sensor Networks Towards Secure Internet of Things