{"title":"An Energy-saving Geographic Routing in Wireless Sensor Network","authors":"Xiao-ou Song","doi":"10.1109/INCoS.2015.27","DOIUrl":null,"url":null,"abstract":"The routing information is hard to maintain and the energy is limited in highly dynamic wireless sensor network. To solve these problems, energy-saving geographic routing (ESGR) is proposed, which does not maintain the network topology and can save energy. A node broadcast its position information to its neighboring nodes before transmitting data. The neighboring nodes compute the position of the virtual relay node using the data transmitter position, the base station position and the energy consumption for circuits and propagation. The neighboring nodes determine whether to become the relay node through competition based on its position, the destination position and the virtual relay node position. The simulation shows that the proposed algorithm is better than BLR, because of the lower energy consumption and lower packet loss ratio. The ESGR algorithm is more appropriate for highly dynamic wireless network.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2015.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The routing information is hard to maintain and the energy is limited in highly dynamic wireless sensor network. To solve these problems, energy-saving geographic routing (ESGR) is proposed, which does not maintain the network topology and can save energy. A node broadcast its position information to its neighboring nodes before transmitting data. The neighboring nodes compute the position of the virtual relay node using the data transmitter position, the base station position and the energy consumption for circuits and propagation. The neighboring nodes determine whether to become the relay node through competition based on its position, the destination position and the virtual relay node position. The simulation shows that the proposed algorithm is better than BLR, because of the lower energy consumption and lower packet loss ratio. The ESGR algorithm is more appropriate for highly dynamic wireless network.