FRECAST

message transmission model in dense graphs for ad hoc networks

Sakhinah Abu Bakar, Shaharuddin Salleh, Muhammad Hisyam Lee

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)4-11
Number of pages8
JournalInternational Journal of Simulation and Process Modelling
Volume2
Issue number1-2
Publication statusPublished - 2006
Externally publishedYes

Fingerprint

Ad hoc networks
Ad Hoc Networks
Graph in graph theory
Broadcasting
Routing protocols
Routers
Base stations
Wireless networks
Visualization
Minimum Spanning Tree
Special Functions
Vertex of a graph
Routing Protocol
Router
Shortest path
Wireless Networks
Communication
Infrastructure
Model

Keywords

  • ad hoc networks
  • minimum spanning tree
  • shortest path and routing

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Modelling and Simulation

Cite this

FRECAST : message transmission model in dense graphs for ad hoc networks. / Abu Bakar, Sakhinah; Salleh, Shaharuddin; Hisyam Lee, Muhammad.

In: International Journal of Simulation and Process Modelling, Vol. 2, No. 1-2, 2006, p. 4-11.

Research output: Contribution to journalArticle

@article{1eec4bb3c22c4f6195aa5d5d99189429,
title = "FRECAST: message transmission model in dense graphs for ad hoc networks",
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 path and routing",
author = "{Abu Bakar}, Sakhinah and Shaharuddin Salleh and {Hisyam Lee}, Muhammad",
year = "2006",
language = "English",
volume = "2",
pages = "4--11",
journal = "International Journal of Simulation and Process Modelling",
issn = "1740-2123",
publisher = "Inderscience Enterprises Ltd",
number = "1-2",

}

TY - JOUR

T1 - FRECAST

T2 - message transmission model in dense graphs for ad hoc networks

AU - Abu Bakar, Sakhinah

AU - Salleh, Shaharuddin

AU - Hisyam Lee, Muhammad

PY - 2006

Y1 - 2006

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

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

KW - ad hoc networks

KW - minimum spanning tree

KW - shortest path and routing

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

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

M3 - Article

VL - 2

SP - 4

EP - 11

JO - International Journal of Simulation and Process Modelling

JF - International Journal of Simulation and Process Modelling

SN - 1740-2123

IS - 1-2

ER -