传感器网络关联区域游走查询机制

Walk among Contact Areas Query Mechanism for Sensor Networks

在多数应用中,传感器网络被视为分布式数据库,解析查询是其主要功能之一。提出了关联区域游走查询机制,其设计目标是实现对大规模、节点位置信息无关的传感器网络高效节能的资源查询处理。该机制借鉴小世界网络的研究成果,以关联节点作为长程连接,降低了网络平均路径长度,缩短了查询源和目标间的距离;各节点的邻居与其关联节点的邻居组成关联区域。该机制通过查询消息在关联区域间游走来完成查询,避免了全网泛洪。数学建模分析和实验仿真结果显示:与现有的几个重要相关机制相比,关联区域游走机制具有显著的低能耗特性;此外,关联区域游走机制还具有良好的可扩展性和相比CAPTURE更加广泛的适用范围。

Sensor networks may be viewed in several classes of applications as a distributed database,one of the main functions of sensor networks is to resolve queries. Walk among contact areas query mechanism, proposed in this paper, is designed for power-efficient queries in large-scale, location-free sensor networks. The mechanism borrows from theo- retical results from small-world and uses contacts that act as short cuts, and hence reduces the average path length of networks and distance between querier and target; contact area is composed of each node＇s neighbors and its contact node＇s neighbors, the mechanism resolves a query completely by forward query message among contact areas, the ap- proach avoids global flooding. Theory analysis and simulation results show that the proposed mechanism has lower en- ergy overhead than the current important mechanisms relatively. Furthermore, the proposed mechanism is scalable and has wider application range than CAPTURE.