O. F. Hamad, Mikyung Kang, Jin-Han Jeon, Ji-Seung Nam
{"title":"基于k-均值距离的神经网络节点聚类在无线局域网中增强RDMAR协议中的应用","authors":"O. F. Hamad, Mikyung Kang, Jin-Han Jeon, Ji-Seung Nam","doi":"10.1109/ISSPIT.2008.4775666","DOIUrl":null,"url":null,"abstract":"k-means distance-based nodes clustering technique proposed enhance the performance of RDMAR protocol in a Mobile Ad-hoc NETwork (MANET). To limit the flood search to just a circular local area around the source, the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol uses the Relative Distance (RD). If the distance of flood discovery is further limited by clustering the nodes with similar characters in to one group, different from the dissimilar characters' group, the performance of the RDMAR implementation can be elevated. The k-means algorithm, similar to the one in unsupervised learning in pattern classification, can be recursively applied to re-classify the clusters as the MANET environment, resource availability, and node demands change. This technique can be more effective in a MANET with comparatively moderate change of the dynamicity and slow change in nodes' demands plus highly accumulated groups of nodes at given sub-areas.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Neural Network's k-means Distance-Based Nodes-Clustering for Enhanced RDMAR Protocol in a MANET\",\"authors\":\"O. F. Hamad, Mikyung Kang, Jin-Han Jeon, Ji-Seung Nam\",\"doi\":\"10.1109/ISSPIT.2008.4775666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"k-means distance-based nodes clustering technique proposed enhance the performance of RDMAR protocol in a Mobile Ad-hoc NETwork (MANET). To limit the flood search to just a circular local area around the source, the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol uses the Relative Distance (RD). If the distance of flood discovery is further limited by clustering the nodes with similar characters in to one group, different from the dissimilar characters' group, the performance of the RDMAR implementation can be elevated. The k-means algorithm, similar to the one in unsupervised learning in pattern classification, can be recursively applied to re-classify the clusters as the MANET environment, resource availability, and node demands change. This technique can be more effective in a MANET with comparatively moderate change of the dynamicity and slow change in nodes' demands plus highly accumulated groups of nodes at given sub-areas.\",\"PeriodicalId\":213756,\"journal\":{\"name\":\"2008 IEEE International Symposium on Signal Processing and Information Technology\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Symposium on Signal Processing and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT.2008.4775666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Signal Processing and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2008.4775666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Neural Network's k-means Distance-Based Nodes-Clustering for Enhanced RDMAR Protocol in a MANET
k-means distance-based nodes clustering technique proposed enhance the performance of RDMAR protocol in a Mobile Ad-hoc NETwork (MANET). To limit the flood search to just a circular local area around the source, the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol uses the Relative Distance (RD). If the distance of flood discovery is further limited by clustering the nodes with similar characters in to one group, different from the dissimilar characters' group, the performance of the RDMAR implementation can be elevated. The k-means algorithm, similar to the one in unsupervised learning in pattern classification, can be recursively applied to re-classify the clusters as the MANET environment, resource availability, and node demands change. This technique can be more effective in a MANET with comparatively moderate change of the dynamicity and slow change in nodes' demands plus highly accumulated groups of nodes at given sub-areas.