FRECAST: message transmission model in dense graphs for ad hoc networks. (13th February 2006)

• Record Type: Journal Article
• Authors: Bakar, Sakhinah Abu; Salleh, Shaharuddin; Lee, Muhammad Hisyam
• Is Part Of: International journal of simulation and process modelling. Volume 2:Number 1/2(2006)
• Page Start: 4
• Page End: 11
• Publication Date: 2006-02-13
• Subjects: ad hoc networks -- minimum spanning tree -- shortest paths -- routing protocol -- message transmission model -- dense graphs -- wireless networks -- visualisation -- mobile communications; Management -- Computer simulation -- Periodicals; Mathematical models -- Periodicals; Operations research -- Periodicals; Simulation methods -- Periodicals; 003.05
• Languages: English
• ISSNs: 1740-2123

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.