基于K均值聚类的二进制传感器网络多目标定位方法 Multi-objective localization method based on K-means clustering in binary sensor networks.pdfVIP

下载本文档

7
0
约2.82万字
约 5页
2017-09-03 发布于湖北
举报
版权申诉

基于K均值聚类的二进制传感器网络多目标定位方法 Multi-objective localization method based on K-means clustering in binary sensor networks.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

绗?8 鍗绗?0 鏈鎺鍒涓鍐绛 2013 骞 10 鏈 Vol. 28 No. 10 Control and Decision Oct. 2013 鏂囩珷缂栧彿: 1001-0920 (2013) 10-1497-05 鍩轰簬饊€ 鍧囧€艰仛绫荤殑浜岃繘鍒朵紶鎰熷櫒缃戠粶澶氱洰鏍囧畾浣嶆柟娉榛鏈? 鍚存垚涓? 寮犱簯娲? 绋榫? 瀛灏 (涓滃寳澶у淇℃伅绉戝涓庡伐绋嬪闄紝娌堥槼110819) 鎽瑕? 閽堝瀛樺湪閿欒鎶ヨ鐨勪簩杩涘埗浼犳劅鍣ㄧ綉缁? 鎻愬嚭鍩轰簬饊€ 鍧囧€艰仛绫荤殑浜岃繘鍒朵紶鎰熷櫒缃戠粶澶氱洰鏍囧畾浣嶆柟娉? 鍦ㄧ洰鏍囧拰鑺傜偣闂磋窛绂讳俊鎭湭鐭ョ殑鏉′欢涓? 鎻愬嚭鍩轰簬饊€ 鍧囧€艰仛绫荤殑鏀硅繘鍔犳鍑忚礋绠楁硶(KMC-ISNAP) 瀵圭洰鏍囦綅缃繘琛屼及璁? 寮曞叆褰卞搷鍥犲瓙闄嶄綆鍒嗙被杩囩▼涓ā绯婅妭鐐瑰澶氱洰鏍囧畾浣嶈宸殑褰卞搷. 浠跨湡瀹為獙琛ㄦ槑, 饊€ 鍧囧€艰仛绫绘柟娉曞湪澶氫釜鐩爣闅忔満鍒嗗竷鎯呭喌涓嬭兘澶熷鎶ヨ鑺傜偣杩涜鍑嗙‘鍒嗙被, 涓庤川蹇冧及璁＄畻娉曞拰鍔犳鍑忚礋绠楁硶鐩告瘮, KMC-ISNAP 澶氱洰鏍囧畾浣嶆柟娉曞叿鏈杈冮珮鐨勫畾浣嶇簿搴﹀拰杈冨ソ鐨勫閿欐€? 鍏抽敭璇岤鏃犵嚎浼犳劅鍣ㄧ綉缁滐紱浜岃繘鍒朵紶鎰熷櫒锛涴€€ 鍧囧€艰仛绫伙紱澶氱洰鏍囧畾浣涓浘鍒嗙被鍙耳 TP393 鏂囩尞鏍囧織鐮? A Multi-objective localization method based on 饊€?means clustering in binary sensor networks HUANG Yue, WU Cheng-dong, ZHANG Yun-zhou, CHENG Long, SUN Yao (College of Information Science and Engineering锛孨ortheastern University 锛孲henyang 110819锛孋hina 锛嶤orrespondent: HUANG Yue 锛孍-mail 锛歽ue 85@126.com) Abstract: A multi-objective localization algorithm based on 饊€?means clustering is proposed in binary wireless sensor networks with false alarm. The 饊€?means clustering-improved subtract on negative add on positive(KMC-ISNAP) algorithm is applied to localize the multiple objectives where the distance between nodes and objectives is unknown, and in铿倁encing factors are used to reduce the in铿倁ence of fuzzy nodes on localization errors. The simulation results show that the 饊€?means clustering method is able to divide the alarmed sensors into parts accurately when multiple objectives are randomly distributed, and the proposed KMC-ISNAP has higher estimation accuracy and better fault tolerance than centroid estim