Domain Area Planning Utility (DAPU) for planning wireless Battlefield Networks

We describe the key design concepts of Domain Area Planning Utility (DAPU) developed by the PILSNER program to perform high-speed automated planning of Future Battlefield Networks (FBNs). DAPU processes multiple inputs from Resource Planning such as nodes and their trajectories, planned ground- and air-tier nets, Unit Task Organization (UTO) relationships, and typical communication requirements. It then considers multiple metrics and constraints in planning both radio topology and Open Shortest Path First (OSPF) routing hierarchy. DAPU automatically creates and evaluates multiple intermediate solutions as well as builds the final plan for the entire mission within a few minutes for a 328-node network (data based on the government-supplied Attica scenario). The planner can use the plan as an input to the generation of communication goals, which are policy directives how to form the network and which are downloaded to network nodes prior to deployment.

[1]  Vipin Kumar,et al.  Multilevel Algorithms for Multi-Constraint Graph Partitioning , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[2]  Mitesh Patel,et al.  Proactive Integrated Link Selection for Network Robustness (PILSNER) , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[3]  Sunil Samtani,et al.  A novel approach to OSPF-area design for large wireless ad-hoc networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[4]  Mariusz Fecko,et al.  Planning Robust and Scalable OSPF Domains for Future Battlefield Networks , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[5]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .