Title: FRECAST: message transmission model in dense graphs for ad hoc networks

Authors: Sakhinah Abu Bakar, Shaharuddin Salleh, Muhammad Hisyam Lee

Addresses: Faculty of Science, Department of Mathematics, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia. ' Faculty of Science, Department of Mathematics, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia. ' Faculty of Science, Department of Mathematics, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia

Abstract: Ad hoc network is a self-adapting wireless network formed from special function nodes. The network is self-organised where each node acts as a router for transmitting and receiving messages. This enables the network to form a network in the absence of communication infrastructures such as base stations. In this paper, we discuss the problem of single, multiple and broadcasting message transmission in highly-dense ad hoc networks. The problem requires finding the shortest paths and minimum spanning tree in order to make the message transmission optimum. We present a visualisation model called FRECAST based on a routing protocol called WRP.

Keywords: ad hoc networks; minimum spanning tree; shortest paths; routing protocol; message transmission model; dense graphs; wireless networks; visualisation; mobile communications.

DOI: 10.1504/IJSPM.2006.009006

International Journal of Simulation and Process Modelling, 2006 Vol.2 No.1/2, pp.4 - 11

Published online: 12 Feb 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article