By Topic

An event-driven multi-agent middleware architecture and protocol design for intelligent geographically distributed battlefield training, modeling and simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. B. Megherbi ; CMINDS Research Center, ECE Department, University of Massachusetts Lowell, USA ; D. Pandit

In this paper we present a distributed event driven middleware architecture for situational awareness and intelligent decision making for command and control of geographically distributed networked battlefield agents. We tackle the important and challenging issues of distributed agents scheduling, synchronization, load balancing, and terrain database distribution/management/allocation in a distributed virtual battlefield environment. Here, battlefield agents have a limited knowledge of the global terrain environment and exchange information over a distributed network. We propose a terrain partitioning and dynamic scheduling algorithms, where scheduling of agents on different nodes depends on the geographic distribution and locations of the agent entities in the terrain. In the proposed algorithm, agents with common goals and interest are grouped together to run on the same computing node. The aim here is to reduce the communication network latency cost between different nodes and to increase efficiency and overall system computational performance. In particular, the proposed scheduling and load balancing algorithm makes use of the idea that entities that are geographically located close to and closely related to each other, e.g all entities in the same troop, will communicate more with each other. In this instance, scheduling the agents representing these entities to run on the same node will reduce the communication cost. We also propose a communication protocol between the networked distributed agents as well as describe a method to tackle the important issue of battlefield terrain division and dynamic allocation/re-allocation of resources in the distributed computing environment. Finally, experimental results are presented to show the value and potential of the proposed method.

Published in:

2011 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision Support (CogSIMA)

Date of Conference:

22-24 Feb. 2011