一种基于蚁群算法的无线传感器网络服务发现机制

A Service Discovery Scheme Based on Ant Colony Algorithm in Wireless Sensor Networks

在诸如普适计算等未来网络应用环境下，无线传感器网络得到了普遍的关注．而服务发现问题是其中的重要问题．从蚁群中获得的灵感，提出了一种基于蚁群算法的服务发现机制，该机制使用基于需求的服务通告方法，通过有限次叠代来获取最优的服务提供者，同时获取到达该服务提供者的服务会话路径．在优化原则的设置上，通过调整行为参数可以调整目标函数，从而针对不同的网络行为需求能够动态处理跳数、时延和能量消耗的关系．通过理论推导证明了该方法的收敛性，通过仿真试验将本文所题方法相比其他服务发现机制进行了对比分析，结果表明了本文所述方法的有效性．

In wireless sensor networks, efficient service discovery and data transmission mechanisms are both essential and challenging. Ant colony algorithm which has been used to resolve routing, localization and object tracing issues in mobile ad hoc and sensor networks provide a valuable solution for this problem. In this paper, we propose a novel scalable Service Discovery Scheme based on Ant Colony Algorithm in wireless sensor networks （SDACA）. SDACA, supporting on-demanded service advertisement scheme, can obtain the optimized Service Provider with the optimized routing path via limited iteration to satisfy service and trans- mission requirements. The parameters can be adjusted to set services optimization principles, which address a variety of network be- havior needs to dynamically handle the relationship among hops,delay and energy consumption. Theoretical analysis shows that the convergence of the scheme. We also evaluate it against other approaches to identify its merits and limitations. The simulation results show that SDACA can maximize the network utilization. Farther experiments indicate that it is useful and efficient.