检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江苏大学计算机科学与通信工程学院,江苏镇江212013
出 处:《计算机应用研究》2015年第5期1471-1474,1479,共5页Application Research of Computers
基 金:2013年国家级大学生创新创业基金资助项目(10299016)
摘 要:针对当前流行的窗口路线查询处理IWQE算法,若查询路线上节点选择不当(节点剩余能耗过低或节点相距偏远)而导致通信传输中断、查询结果丢失的问题,提出了相应的优化算法EIWQE。算法以剩余能耗为节点选择基础,采用基于位置的路由协议GPSR构建多边形,通过增加中继节点保证查询路线的连通性,并根据最大剩余能耗选择邻居节点分担信息收集与处理任务,以进一步降低查询路线上节点的能耗。给出了EIWQE的详细实现流程,并在OMNET++平台上用仿真方法从查询成功率、查询遍及率、节点能耗的均匀度等方面验证了EIWQE算法的优越性。For the current popular itinerary-based window query execution( IWQE),selecting improper query node in route( node remaining low energy or far away form each other) would lead to communication transmission interruption,losses of query results. This paper proposed a corresponding optimization algorithm enhanced itinerary-based window query execution( EIWQE). The algorithm selected nodes based on remaining energy,it used GPSR building polygons by adding relay nodes to ensure query connectivity of route. In order to further reducing the energy consumption of nodes on queries route,it selected neighbor nodes to share the information gathering and processing tasks based on the maximum residual energy. The paper gives a detailed implementation process of EIWQE and demonstrates the superiority of EIWQE in terms of query success rate,query over rate and uniformity of energy consumption which was simulated on OMNET ++.
关 键 词:无线传感器网络 空间查询 窗口路线查询处理算法 能耗
分 类 号:TP393.09[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62