Secure domination of honeycomb networks

Chithra, M. R.; Menon, Manju K.

doi:10.1007/s10878-020-00570-8

Cited by 9 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But, if there is an intruder which accesses the network not through its vertices, but by using some connections between them (edges), then such intruder could not be identified, and in this sense, the surveillance fails in its commitment and some extra property is required in the network to be used effectively for this purpose [38]. The honeycomb and hexagonal networks along with the security are studied in [39]. Hence, such limitation can cause a major disadvantage from the application point of view.…”

Section: Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Edge Metric Dimension of Honeycomb and Hexagonal Networks for IoT

Abbas¹,

Raza²,

Siddiqui³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Wireless Sensor Network (WSN) is considered to be one of the fundamental technologies employed in the Internet of things (IoT); hence, enabling diverse applications for carrying out real-time observations. Robot navigation in such networks was the main motivation for the introduction of the concept of landmarks. A robot can identify its own location by sending signals to obtain the distances between itself and the landmarks. Considering networks to be a type of graph, this concept was redefined as metric dimension of a graph which is the minimum number of nodes needed to identify all the nodes of the graph. This idea was extended to the concept of edge metric dimension of a graph G, which is the minimum number of nodes needed in a graph to uniquely identify each edge of the network. Regular plane networks can be easily constructed by repeating regular polygons. This design is of extreme importance as it yields high overall performance; hence, it can be used in various networking and IoT domains. The honeycomb and the hexagonal networks are two such popular mesh-derived parallel networks. In this paper, it is proved that the minimum landmarks required for the honeycomb network HC(n), and the hexagonal network HX (n) are 3 and 6 respectively. The bounds for the landmarks required for the hex-derived network HDN1(n) are also proposed.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

“…In order to prove this, the concept of the co-ordinate system of the hexagonal network is presented as adapted by Nocetti et al [39]. He introduced the three axes, X , Y and Z at an angle of 120 along the sides of any triangle within a hexagonal network as shown in the Fig.…”

Section: Edge Metric Dimension Of the Hexagonal Networkmentioning

confidence: 99%

Edge Metric Dimension of Honeycomb and Hexagonal Networks for IoT

Abbas¹,

Raza²,

Siddiqui³

et al. 2022

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…A secure dominating set in is a set which is both a secure set and also a dominating set in . The secure domination number of is [ 2 , 4 ]. For a graph in Fig.…”

Section: Preliminariesmentioning

confidence: 99%

Protection of Medical Information Systems Against Cyber Attacks: A Graph Theoretical Approach

Angel

2022

Wireless Pers Commun

View full text Add to dashboard Cite

Securing electronic health records of patients is the paramount concern in medical information systems which faces unique set of challenges. Safeguarding a health care’s computer network against attacks on its nodes and links requires placing mobile guards on the nodes of a network. Bloom topologies are attractive networks that are potential structures for massively parallel computers. This paper focuses on the evaluation of exact value of the parameters which gives the minimum number of guards required to protect the bloom networks. A linear time algorithm is proposed for finding these parameters. This study is beneficial in locating the minimum number of detection devices or cyber security employees (mobile guards) to be deployed on the significant servers (nodes) of the bloom’s architecture (healthcare system) which is essential for defending the network against a single malware attack by network monitoring.

show abstract

“…He examined numerous facets of this notion and its applications in graph theory. This metric finds utility in diverse domains, encompassing network architecture [3], facility placement [4], and network efficiency and security challenges [5]. Determining the domination number of a graph is frequently a pivotal stage in resolving optimization problems within graph theory [6].…”

Section: Introductionmentioning

confidence: 99%

Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs

Sardar,

Choudhry,

Liu

2024

Journal of Function Spaces

View full text Add to dashboard Cite

Let G=V;E be a simple graph with vertex set V and edge set E. In a graph G, a subset of edges denoted by M is referred to as an edge-dominating set of G if every edge that is not in M is incident to at least one member of M. A set M⊆E is the locating edge-dominating set if for every two edges e1,e2∈E−M, the sets Ne1∩M and Ne2∩M are nonempty and different. The edge domination number γLG of G is the minimum cardinality of all edge-dominating sets of G. The purpose of this study is to determine the locating edge domination number of certain types of claw-free cubic graphs.

show abstract

Secure domination of honeycomb networks

Cited by 9 publications

References 7 publications

Edge Metric Dimension of Honeycomb and Hexagonal Networks for IoT

Edge Metric Dimension of Honeycomb and Hexagonal Networks for IoT

Protection of Medical Information Systems Against Cyber Attacks: A Graph Theoretical Approach

Locating Edge Domination Number of Some Classes of Claw-Free Cubic Graphs

Contact Info

Product

Resources

About