A dynamic flocking algorithm with a restrictive partnership model to support mobile ad hoc networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

This paper presents an improved flocking algorithm to increase the connectivity of a mobile ad hoc network using autonomous and intelligent agents. Flocking algorithms usually aim to simulate realistic movements of a group of agents. In this paper, however, agents use a flocking algorithm to find a solution to a computationally very difficult optimization problem in real-time as the topology of the network changes due to the mobility of users. In the improved flocking algorithm, agents select their interaction partners based on the Gabriel Graph and adjust their flocking behavior parameters dynamically. A simulation study is conducted to compare the performance of the improved flocking algorithm with a previous algorithm. Computational studies show that the recommended strategies are quite effective.

Original languageEnglish (US)
Title of host publication2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages593-597
Number of pages5
ISBN (Electronic)9781538620342
DOIs
StatePublished - Jul 2 2017
Event2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017 - Okinawa, Japan
Duration: Jul 14 2017Jul 18 2017

Publication series

Name2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
Volume2017-July

Other

Other2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
Country/TerritoryJapan
CityOkinawa
Period7/14/177/18/17

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A dynamic flocking algorithm with a restrictive partnership model to support mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this