Title: An Interactive Java Simulator for Routing in Mobile Ad-Hoc Networks
Role: MSc student
Supervisor: Dr. David Hunter
Affiliation: School of Computer Science and Electronic Engineering, University of Essex.
Dates: October 2004 - July 2005

Description:  The aim of this project was to create an interactive simulator in Java programming language to study various routing algorithms in mobile ad-hoc networks. A platform is developed in Java object oriented programming language which permits the study of route discovery, the calculation of the shortest path and the convergence time, based on several scenarios that cause changes on the selected topology (i.e. set up spontaneously an ad hoc network, set up spontaneously an ad hoc network and add a new node, set up spontaneously an ad hoc network and delete an existing node, set up spontaneously an ad hoc network with macro mobility (a node switches off and the same node switches on in a different place). It has also given the opportunity to save the whole procedure of the program during the route discovery in a text form. The simulator's graphical user interface permits the user to adjust the simulation’s parameters dynamically and to see and understand their effect on routing via Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing protocols.

 MSc001 MSc002


Title: Pathfinding Algorithms for Intelligent Agents: A Pacman Game
Role: BSc Student.
Supervisor: Dr. Borbala Benko Katalin.
Affiliation: Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics.
Dates: October 2002 - June 2004

Description: The aim of this project was to test various pathfinding algorithms by implementing a  Pacman Game test platform. In that platform the player wanders in a labyrinth and collects diamonds, while intelligent and non-intelligent agents try to locate it. The intelligent agents move by using pathfinding strategies (i.e. A*, Ants strategy, etc) and the non-intelligent (dummy) agents move by using random strategies (i.e. obstacle avoidance, obstacle ignorance, random number move, etc). This work has also shown how Java can be used to develop platforms for pathfinding algorithms and to find the shortest path, not only of a static goal but of a moving one, using map/graph, intelligent/non-intelligent (dummy) algorithms.

BSc001 BSc002 BSc003 BSc004