特定传感器网络中的度量维度与机器人导航

2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) Pub Date : 2018-10-01 DOI:10.1109/CYBERC.2018.00072

Z. Shao, Pu Wu, Enqiang Zhu, Lanxiang Chen

{"title":"特定传感器网络中的度量维度与机器人导航","authors":"Z. Shao, Pu Wu, Enqiang Zhu, Lanxiang Chen","doi":"10.1109/CYBERC.2018.00072","DOIUrl":null,"url":null,"abstract":"The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md(G) of a graph G is the smallest number k for which G contains a vertex set W such that |W| = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md(HDN1(n)) = 4 for n ≥ 2, this indicates that in this type of hex derived sensor networks, the least number of nodes needed is 4 for locating any other node in such a sensor network.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Metric Dimension and Robot Navigation in Specific Sensor Networks\",\"authors\":\"Z. Shao, Pu Wu, Enqiang Zhu, Lanxiang Chen\",\"doi\":\"10.1109/CYBERC.2018.00072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md(G) of a graph G is the smallest number k for which G contains a vertex set W such that |W| = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md(HDN1(n)) = 4 for n ≥ 2, this indicates that in this type of hex derived sensor networks, the least number of nodes needed is 4 for locating any other node in such a sensor network.\",\"PeriodicalId\":282903,\"journal\":{\"name\":\"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CYBERC.2018.00072\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2018.00072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了度量维度的概念来建模机器人导航，其中导航agent的位置可以在节点间改变。度量维度md (G)的图G是最小的数k的G包含一组顶点W W, | | = k和G的每一对顶点具有不同距离至少一个顶点在W .本文我们证明md (HDN1 (n)) = 4 n≥2,这表明在这种十六进制派生的传感器网络,节点的最少需要4定位在这样一个传感器网络其他节点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Metric Dimension and Robot Navigation in Specific Sensor Networks

The concept of metric dimension was proposed to model robot navigation where the places of navigating agents can change among nodes. The metric dimension md(G) of a graph G is the smallest number k for which G contains a vertex set W such that |W| = k and every pair of vertices of G possess different distances to at least one vertex in W. In this paper, we demonstrate that md(HDN1(n)) = 4 for n ≥ 2, this indicates that in this type of hex derived sensor networks, the least number of nodes needed is 4 for locating any other node in such a sensor network.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)

自引率

0.00%

发文量