Relay node placement in wireless sensor network for manufacturing industry

elay nodes are necessary to maintain scalability and increase longevity as the number of manufacturing industrial sensors grows. In a fixed-budget circumstance, however, the cost of purchasing the bare minimum of relay nodes to connect the network may exceed the budget. Although it is hard to establ...

Full description

Saved in:
Bibliographic Details
Main Authors: Anwar Apandi, Nur Ilyana, Safiee, Rabiatul Adawiyah, Wan, Wing Sheng, Muhammad, Nor Aishah, Sarijari, Mohd Adib
Format: Article
Language:English
Published: Institute of Advanced Engineering and Science 2023
Online Access:http://eprints.utem.edu.my/id/eprint/26220/2/3978-12161-1-PB%20%281%29.PDF
http://eprints.utem.edu.my/id/eprint/26220/
https://beei.org/index.php/EEI/article/view/3978/3063
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknikal Malaysia Melaka
Language: English
id my.utem.eprints.26220
record_format eprints
spelling my.utem.eprints.262202023-03-02T12:11:32Z http://eprints.utem.edu.my/id/eprint/26220/ Relay node placement in wireless sensor network for manufacturing industry Anwar Apandi, Nur Ilyana Safiee, Rabiatul Adawiyah Wan, Wing Sheng Muhammad, Nor Aishah Sarijari, Mohd Adib elay nodes are necessary to maintain scalability and increase longevity as the number of manufacturing industrial sensors grows. In a fixed-budget circumstance, however, the cost of purchasing the bare minimum of relay nodes to connect the network may exceed the budget. Although it is hard to establish a network that connects all sensor nodes, in this case, a network with a high level of connection is still desirable. This paper proposes two metrics for determining the connectedness of a disconnected graph of sensor nodes and determining the optimum deployment method for relay nodes in a network with the highest connectedness while staying within a budget restriction. The metrics are the number of connected graph components and the size of the most significant connected graph component. Prim's algorithm and the approximation minimum spanning tree algorithm are applied to construct a disconnected graph and discover the best relay node placement to solve these two criteria. Compared to the other metrics, simulation findings suggest that prioritizing the most significant connected components in the disconnected graph can yield superior outcomes by deploying the fewest number of relay nodes while retaining the connectedness of the graph. Institute of Advanced Engineering and Science 2023-02 Article PeerReviewed text en http://eprints.utem.edu.my/id/eprint/26220/2/3978-12161-1-PB%20%281%29.PDF Anwar Apandi, Nur Ilyana and Safiee, Rabiatul Adawiyah and Wan, Wing Sheng and Muhammad, Nor Aishah and Sarijari, Mohd Adib (2023) Relay node placement in wireless sensor network for manufacturing industry. Bulletin of Electrical Engineering and Informatics, 12 (1). pp. 158-166. ISSN 2302-9285 https://beei.org/index.php/EEI/article/view/3978/3063 10.11591/eei.v12i1.3978
institution Universiti Teknikal Malaysia Melaka
building UTEM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknikal Malaysia Melaka
content_source UTEM Institutional Repository
url_provider http://eprints.utem.edu.my/
language English
description elay nodes are necessary to maintain scalability and increase longevity as the number of manufacturing industrial sensors grows. In a fixed-budget circumstance, however, the cost of purchasing the bare minimum of relay nodes to connect the network may exceed the budget. Although it is hard to establish a network that connects all sensor nodes, in this case, a network with a high level of connection is still desirable. This paper proposes two metrics for determining the connectedness of a disconnected graph of sensor nodes and determining the optimum deployment method for relay nodes in a network with the highest connectedness while staying within a budget restriction. The metrics are the number of connected graph components and the size of the most significant connected graph component. Prim's algorithm and the approximation minimum spanning tree algorithm are applied to construct a disconnected graph and discover the best relay node placement to solve these two criteria. Compared to the other metrics, simulation findings suggest that prioritizing the most significant connected components in the disconnected graph can yield superior outcomes by deploying the fewest number of relay nodes while retaining the connectedness of the graph.
format Article
author Anwar Apandi, Nur Ilyana
Safiee, Rabiatul Adawiyah
Wan, Wing Sheng
Muhammad, Nor Aishah
Sarijari, Mohd Adib
spellingShingle Anwar Apandi, Nur Ilyana
Safiee, Rabiatul Adawiyah
Wan, Wing Sheng
Muhammad, Nor Aishah
Sarijari, Mohd Adib
Relay node placement in wireless sensor network for manufacturing industry
author_facet Anwar Apandi, Nur Ilyana
Safiee, Rabiatul Adawiyah
Wan, Wing Sheng
Muhammad, Nor Aishah
Sarijari, Mohd Adib
author_sort Anwar Apandi, Nur Ilyana
title Relay node placement in wireless sensor network for manufacturing industry
title_short Relay node placement in wireless sensor network for manufacturing industry
title_full Relay node placement in wireless sensor network for manufacturing industry
title_fullStr Relay node placement in wireless sensor network for manufacturing industry
title_full_unstemmed Relay node placement in wireless sensor network for manufacturing industry
title_sort relay node placement in wireless sensor network for manufacturing industry
publisher Institute of Advanced Engineering and Science
publishDate 2023
url http://eprints.utem.edu.my/id/eprint/26220/2/3978-12161-1-PB%20%281%29.PDF
http://eprints.utem.edu.my/id/eprint/26220/
https://beei.org/index.php/EEI/article/view/3978/3063
_version_ 1759693057215692800