Robust Optimization Model and Complexity for Routing Problem in Wireless Sensor Network under Uncertainty

摘要：

Routing problem is one of the most important issues to the wireless sensor network. In sensor network, how to find routing path from source to sink node is very difficult. Robust optimization methodology, which needs no probability distribution on the uncertainty factor, is one of the new approaches to deal with uncertainty real-world problems. Interval data is used to describe edge cost of wireless sensor network in this paper and Absolute Robust Optimization Model (AROM) and Robust Deviation Optimization Model (RDOM) are proposed to describe the routing problem in the wireless sensor network. Complexity results of the robust optimization models are given at last to design efficient algorithm.

关键词： wireless sensor network routing robust optimization complexity

作者: REN Qing-Yuan YANG Wenguo Alex

作者单位: Shandong Industrial Vocational College, Zibo 256414, Shandong, China SiTV Shanghai Interactive Television Ltd.Co, 200072. Shanghai, China Graduate University of Chinese Academy of Sciences, 100049, Beijing, China

会议类型: 国际会议

会议名称: International Symposium on Emergency Management 2011(ISEM‘2011)(第六届国际应急管理论坛暨中国(双法)应急管理专业委员会第七届年会)

会议地点: 北京

会议语种:英文

页码: 476-481

在线出版日期: 2011-11-19（万方平台首次上网日期，不代表论文的发表时间）