在基于RSSI(Received Signal Strength Indication)的Wi-Fi室内测距定位技术研究中,首先利用对数距离衰减模型进行测距,然后针对定位精度不高的问题,这里提出利用RSSI自适应选择定位算法的方法,即在定位阶段,当满足能够准确确定定位节...在基于RSSI(Received Signal Strength Indication)的Wi-Fi室内测距定位技术研究中,首先利用对数距离衰减模型进行测距,然后针对定位精度不高的问题,这里提出利用RSSI自适应选择定位算法的方法,即在定位阶段,当满足能够准确确定定位节点所在的最小区域条件时,采用加权质心定位算法,加权因子由1/d表示;当不满足条件时,采用最小二乘定位算法。实验结果表明,自适应选择算法可避免一般加权质心算法由于最小区域的错误锁定而造成的定位误差大的弊端,同时也解决了最小二乘算法在边界区域定位精度难以控制的问题,若考虑定位误差在5m以内的情况,该算法可使35m的走廊定位准确率达到85.7%,较单独采用一般加权质心算法或最小二乘法,定位精度都有较大提高。展开更多
Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ...Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ＊（G） of G is the cardinality of a minimum twin dominating set of G.In this paper we consider the twin domination number in generalized Kautz digraphs GK（n,d）.In these digraphs,we establish bounds on the twin domination number and give a sufficient condition for the twin domination number attaining the lower bound.We give the exact values of the twin domination numbers by constructing minimum twin dominating sets for some special generalized Kautz digraphs.展开更多
文摘在基于RSSI(Received Signal Strength Indication)的Wi-Fi室内测距定位技术研究中,首先利用对数距离衰减模型进行测距,然后针对定位精度不高的问题,这里提出利用RSSI自适应选择定位算法的方法,即在定位阶段,当满足能够准确确定定位节点所在的最小区域条件时,采用加权质心定位算法,加权因子由1/d表示;当不满足条件时,采用最小二乘定位算法。实验结果表明,自适应选择算法可避免一般加权质心算法由于最小区域的错误锁定而造成的定位误差大的弊端,同时也解决了最小二乘算法在边界区域定位精度难以控制的问题,若考虑定位误差在5m以内的情况,该算法可使35m的走廊定位准确率达到85.7%,较单独采用一般加权质心算法或最小二乘法,定位精度都有较大提高。
基金Project supported by the National Natural Science Foundation of China (Grant Nos.10571117, 60773078)the Shuguang Plan of Shanghai Education Development Foundation (Grant No.06SG42)the Shanghai Leading Academic Discipline Project(Grant No.J50101)
文摘Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ＊（G） of G is the cardinality of a minimum twin dominating set of G.In this paper we consider the twin domination number in generalized Kautz digraphs GK（n,d）.In these digraphs,we establish bounds on the twin domination number and give a sufficient condition for the twin domination number attaining the lower bound.We give the exact values of the twin domination numbers by constructing minimum twin dominating sets for some special generalized Kautz digraphs.
