• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Tools with Artificial Intelligence >A Constraint Programming Approach to the Additional Relay Placement Problem in Wireless Sensor Networks
【24h】

A Constraint Programming Approach to the Additional Relay Placement Problem in Wireless Sensor Networks

机译：无线传感器网络中附加继电器放置问题的约束编程方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are subject to node failures, the network topology should be robust, so that when a failure does occur, data delivery can continue from all surviving nodes. A WSN is k-robust if an alternate length-constrained route to a sink is available for each surviving node after the failure of up to k-1 nodes. Determining whether a network is k-robust is an NP-complete problem. We develop a Constraint Programming (CP) approach for solving this problem which outperforms a Mixed-Integer Programming (MIP) model on larger problems. A network can be made robust by deploying extra relay nodes, and we extend our CP approach to an optimisation problem by using QuickXplain to search for a minimal set of relays, and compare it to a state-of-the-art local search approach.
机译：无线传感器网络（WSN）由许多传感器节点组成，这些传感器节点通过多跳网络将其数据无线传输到数据接收器。由于WSN易受节点故障的影响，因此网络拓扑应具有鲁棒性，以便在发生故障时，可以继续从所有尚存的节点进行数据传递。如果在多达k-1个节点发生故障后，每个存活的节点都可以使用一条到接收器的受长度限制的替代路由，则WSN是k健壮的。确定网络是否具有k鲁棒性是一个NP完全问题。我们开发了一种用于解决此问题的约束编程（CP）方法，该方法在较大问题上的性能优于混合整数编程（MIP）模型。可以通过部署额外的中继节点来使网络变得健壮，并且通过使用QuickXplain搜索最小的中继集并将其与最新的本地搜索方法进行比较，我们将CP方法扩展到了优化问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号