In Kalloniatis 2008, 2012 one of us proposed a new mathematical model for networked Command and Control (C2) systems whose elements are engaged in iterative cycling through continuous Observe-Orient-Decide-Act (OODA) loops (Boyd 1987). This proposal draws upon the well-known Kuramoto model in the mathematical complex systems literature that displays the phenomenon of self- synchronisation . Given the significance of that term in the drive to network- enable military forces through this past decade, its application to Network Centric Warfare (NCW) seemed an obvious thing to undertake; curiously, such an application was missing in the C2 literature until recent years. As some C2 researchers have pointed out, including Boyd 1987, the adversary is often neglected when analysing a C2 system and this was the main motivation in Kalloniatis 2008, 2012 in adapting the Kuramoto model to the case of two rival C2 systems, which has been termed the Boyd-Kuramoto Model. In this paper we use the Kuramoto model in a spirit closer to its recent use elsewhere in the C2 community (Dekker 2007, van der Wal 2010, Dekker 2011) for a single system engaged in some aspect of an internal process (choosing from options in Dekker and sensor fusion in van der Wal). Specifically, we shall give a proof of concept that the Kuramoto model can be applied to traditionally structured J- staff military headquarters to test whether the different time-frames of planners (J5) and operators (J3) challenge synchronisation within the many supporting branches, such as Personnel (J1), Intelligence (J2), Logistics (J4) and Communications (J6).
展开▼
