{"title":"A nearby server selection protocol based cross-shaped trajectory in sensor networks","authors":"Ingu Han, Y. Tscha, Kyoon-Ha Lee","doi":"10.1109/ICACT.2006.206223","DOIUrl":null,"url":null,"abstract":"In the case of being of multiple server hosting the same resources in wireless multi-hop sensor networks, the publishing/subscribing scheme based on a cross-shaped trajectory results in anomaly for a client to locate a contents server which is not even close because the contents location server computes the distance of server for itself instead of client. In this paper, we analyze this problem and propose a solution to discover the nearby server from a client. The proposed algorithm makes use the location information of all servers (at most 4, one per direction) to compute a nearby server from client, replies back the location of nearby server to client. The result of our simulation shows that the proposed algorithm performs favorably more than the method based on the view of location server in terms of cost","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Conference Advanced Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2006.206223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In the case of being of multiple server hosting the same resources in wireless multi-hop sensor networks, the publishing/subscribing scheme based on a cross-shaped trajectory results in anomaly for a client to locate a contents server which is not even close because the contents location server computes the distance of server for itself instead of client. In this paper, we analyze this problem and propose a solution to discover the nearby server from a client. The proposed algorithm makes use the location information of all servers (at most 4, one per direction) to compute a nearby server from client, replies back the location of nearby server to client. The result of our simulation shows that the proposed algorithm performs favorably more than the method based on the view of location server in terms of cost