A hop-count based positioning algorithm for wireless ad-hoc networks

作     者：Gurung, Sarita Hossain, A. K. M. Mahtab Kanchanasut, Kanchana 

作者机构：Asian Inst Technol IntERLab Pathum Thani Thailand Natl Univ Ireland Univ Coll Cork Dept Comp Sci Cork Ireland 

出 版 物：《WIRELESS NETWORKS》 (无线网络)

年 卷 期：2014年第20卷第6期

页      面：1431-1444页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Intelligent Transportation System Cluster of the National Science and Technology Development Agency (NSTDA), Thailand THNIC Foundation 

主　　题：Positioning system Ad-hoc networks Localization algorithm Proximity based localization Hop-count Optimized link state routing (OLSR) 

摘      要：We propose a range-free localization algorithm for a wireless ad-hoc network utilizing the hop-count metric s ability to indicate proximity to anchors (i.e., nodes with known positions). In traditional sense, hop-count generally means the number of intermediate routers a datagram has to go through between its source and the destination node. We analytically show that hop-count could be used to indicate proximity relative to an anchor node. Our proposed algorithm is computationally feasible for resource constrained wireless ad-hoc nodes, and gives reasonable accuracy. We perform both real experiments and simulations to evaluate the algorithm s performance. Experimental results show that our algorithm outperforms similar proximity based algorithms utilizing received signal strength and expected transmission count. We also analyze the impact of various parameters like the number of anchor nodes, placements of anchor nodes and varying transmission powers of the nodes on the hop-count based localization algorithm s performance through simulation.