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.