A Novel Energy Optimization Mechanism for Medical Data Transmission Using Honeycomb Routing

Mathew, O. Cyril; Rahman, Anisur

doi:10.1166/jmihi.2016.1766

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Honeycomb and Hexagonal networks [1] have been widely studied in various research domains, such as wireless sensor networks, wireless networks [2][3][4][5][6] and cellular networks, in order to study and analyze various issues like routing, [7][8][9] location management and target tracking [10][11][12], energy conservation [13][14][15], and interference estimation [16]. These networks and application domains are applicable to the IoT as well [17][18][19][20][21][22][23][24].…”

Section: Introductionmentioning

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

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