{"title":"移动Ad-hoc网络中利用移动性的高效连接研究","authors":"Young-jun Oh, Kang-whan Lee","doi":"10.14257/IJMUE.2014.9.12.02","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Study of Efficient Connection using Mobility Property in Mobile Ad-hoc Network\",\"authors\":\"Young-jun Oh, Kang-whan Lee\",\"doi\":\"10.14257/IJMUE.2014.9.12.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.\",\"PeriodicalId\":162936,\"journal\":{\"name\":\"International Conference on Multimedia and Ubiquitous Engineering\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Multimedia and Ubiquitous Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14257/IJMUE.2014.9.12.02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Multimedia and Ubiquitous Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/IJMUE.2014.9.12.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Study of Efficient Connection using Mobility Property in Mobile Ad-hoc Network
In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.