Biró, Csaba and Kusper, Gábor (2019) Some k-hop based graph metrics and node ranking in wireless sensor networks. Annales Mathematicae et Informaticae, 50. pp. 19-37. ISSN 1787-5021 (Print) 1787-6117 (Online)
|
Text
AMI_50_from19to37.pdf - Published Version Download (2MB) | Preview |
Abstract
Node localization and ranking is an essential issue in wireless sensor net- works (WSNs). We model WSNs by communication graphs. In our interpretation a communication graph can be directed, in case of heterogeneous sensor nodes, or undirected, in case of homogeneous sensor nodes, and must be strongly connected. There are many metrics to characterize networks, most of them are either global ones or local ones. The local ones consider only the immediate neighbors of the observed nodes. We are not aware of a metric which considers a subgraph, i.e., which is between global and local ones. So our main goal was to construct metrics that interpret the local properties of the nodes in a wider environment. For example, how dense the environment of the given node, or in which extent it can be relieved within its environment. In this article we introduce several novel
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | k-hop based graph metrics, communication graph density, com munication graph redundancy, node ranking |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Tibor Gál |
| Date Deposited: | 20 Dec 2019 10:56 |
| Last Modified: | 03 Apr 2023 06:41 |
| URI: | http://real.mtak.hu/id/eprint/104749 |
Actions (login required)
 |
Edit Item |
