检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:HUANG He SUN Yu-e XIAO Mingjun XU Hongli CHEN Guoliang
机构地区:[1]Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China [2]Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China [3]Shenyang Institute of Computing Technology, Chinese Academy of Sciences, Shenyang 110004, China
出 处:《Chinese Journal of Electronics》2011年第1期155-160,共6页电子学报(英文版)
基 金:This work is supported by the National Grand Fundamental Research 973 Program of China (No.2011CB302905), the National Natural Science Foundation of China (No.60803009 and No.60803116).
摘 要:Most of the localization algorithms use neighbor nodes and anchor nodes to refine the position of nodes estimation. Nevertheless, there has not been any paper mentioned the problem of how to refine the position of nodes in a most rational way. The GTCMS (Game theory based confidence mass-spring) algorithm proposed in our paper elegantly solved this problem using game theory. In the position refining procedure of GTCMS, each node first selects the neighbor nodes which will be used to adjust its position by following the natural game course users converge to a Nash equilibrium, and then uses the best response theorem we proposed to adjust its position. We also prove that the GTCMS algorithm could achieve the global Nash equilibrium. Compared with traditional localization methods, GTCMS algorithm greatly reduces the localization error rate and converges much more efficiently.
关 键 词:Localization technique COLLABORATIVE Game theory Nash equilibrium Wireless sensor networks
分 类 号:O225[理学—运筹学与控制论] TP212[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33