Optimized routing in organization-aware multihop wireless networks (ORION)
Lijun Qian, Yuanzhu Peter Chen · 2010
In our previous works, we defined a novel routing metric for organization-aware multihop wireless networks. We demonstrated that our proposed routing protocol with this new metric provides the much needed survivability and efficiency in battlefield environments when keeping the cross-organization data transfer at a low level. In this paper, we take one step further and propose ORION, a framework for quality-of-service (QoS) routing in organization-aware wireless networks. Here, we formulate routing as a constrained optimization problem with a new routing metric to address QoS and security/policy requirements of traffic flows as well as node-specific needs, while taking the organizational constraints into account. Since the problem is not solvable in polynomial time, a near optimal solution procedure based on Lagrangian decomposition and subgradient method is proposed and studied to solve the constrained optimization problem, and such a solution renders itself to distributed implementations. Simulation results show that the proposed method provides high QoS while keeping the cross-organization data transfer at a specified level satisfying strict organizational security constraints.