Robust scheduling of wireless sensor networks for target tracking under uncertainty
详细信息    查看全文
文摘

This paper addresses a target tracking robustness problem in Wireless Sensor Networks.

A maximum stability radius schedule is computed with a pseudo-polynomial algorithm.

Two classes of upper bounds are exploited to speed up convergence.

Large problem instances with up to 1000 sensors can be solved in less than 20 seconds.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700