检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《International Journal of Automation and computing》2012年第6期594-599,共6页国际自动化与计算杂志(英文版)
摘 要:Node localization is a fundamental problem in wireless sensor network.There are many existing algorithms to estimate the locations of the nodes.However,most of the methods did not consider the presence of obstacles.In practice,obstacles will lead to blockage and reflection of communication signals between sensor nodes.Therefore,the presence of obstacles will greatly affect the localization result.In this paper,we implement an obstacle-handling algorithm based on the localization tool developed by MIT,The experimental result shows that the enhanced algorithm can reduce the average distance error by up to 46 %,compared to the original algorithm.Node localization is a fundamental problem in wireless sensor network.There are many existing algorithms to estimate the locations of the nodes.However,most of the methods did not consider the presence of obstacles.In practice,obstacles will lead to blockage and reflection of communication signals between sensor nodes.Therefore,the presence of obstacles will greatly affect the localization result.In this paper,we implement an obstacle-handling algorithm based on the localization tool developed by MIT,The experimental result shows that the enhanced algorithm can reduce the average distance error by up to 46 %,compared to the original algorithm.
关 键 词:Wireless sensor network automatic localization intelligent computing OPTIMIZATION simulation.
分 类 号:TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33