{"title":"Loss-Aware Geographic Routing for Unreliable Wireless Sensor Networks","authors":"E. Ghadimi, A. Khonsari, M. S. Talebi, N. Yazdani","doi":"10.1109/CCNC.2009.4784703","DOIUrl":null,"url":null,"abstract":"The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.","PeriodicalId":181188,"journal":{"name":"2009 6th IEEE Consumer Communications and Networking Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2009.4784703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.