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

Abdullah Konak; Sadan Kulturel-Konak

doi:10.1109/RCAR.2017.8311927

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

Abdullah Konak, Sadan Kulturel-Konak

Division of Engineering, Business & Computing (Berks)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	593-597
Number of pages	5
Volume	2017-July
ISBN (Electronic)	9781538620342
DOIs	https://doi.org/10.1109/RCAR.2017.8311927
State	Published - Mar 9 2018
Event	2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017 - Okinawa, Japan Duration: Jul 14 2017 → Jul 18 2017

Other

Other	2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017
Country	Japan
City	Okinawa
Period	7/14/17 → 7/18/17

All Science Journal Classification (ASJC) codes

Control and Optimization
Artificial Intelligence

Access to Document

10.1109/RCAR.2017.8311927

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

@inproceedings{149840a298a84a93aacce1af28d5c873,

title = "A dynamic flocking algorithm with a restrictive partnership model to support mobile ad hoc networks",

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.",

author = "Abdullah Konak and Sadan Kulturel-Konak",

year = "2018",

month = mar,

day = "9",

doi = "10.1109/RCAR.2017.8311927",

language = "English (US)",

volume = "2017-July",

pages = "593--597",

booktitle = "2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017 ; Conference date: 14-07-2017 Through 18-07-2017",

}

Konak, A & Kulturel-Konak, S 2018, A dynamic flocking algorithm with a restrictive partnership model to support mobile ad hoc networks. in 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. vol. 2017-July, Institute of Electrical and Electronics Engineers Inc., pp. 593-597, 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017, Okinawa, Japan, 7/14/17. https://doi.org/10.1109/RCAR.2017.8311927

A dynamic flocking algorithm with a restrictive partnership model to support mobile ad hoc networks. / Konak, Abdullah ; Kulturel-Konak, Sadan.

2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017. Vol. 2017-July Institute of Electrical and Electronics Engineers Inc., 2018. p. 593-597.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Konak, Abdullah

AU - Kulturel-Konak, Sadan

PY - 2018/3/9

Y1 - 2018/3/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85050581901&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050581901&partnerID=8YFLogxK

U2 - 10.1109/RCAR.2017.8311927

DO - 10.1109/RCAR.2017.8311927

M3 - Conference contribution

AN - SCOPUS:85050581901

VL - 2017-July

SP - 593

EP - 597

BT - 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2017

Y2 - 14 July 2017 through 18 July 2017

ER -