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

Sakhinah Abu Bakar; Shaharuddin Salleh; Muhammad Hisyam Lee

doi:10.1504/ijspm.2006.009006

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

Sakhinah Abu Bakar
, Shaharuddin Salleh^*
, Muhammad Hisyam Lee

^*Corresponding author for this work

Universiti Teknologi Malaysia

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	4-11
Number of pages	8
Journal	International Journal of Simulation and Process Modelling
Volume	2
Issue number	1-2
DOIs	https://doi.org/10.1504/ijspm.2006.009006
Publication status	Published - 2006
Externally published	Yes

Keywords

ad hoc networks
minimum spanning tree
shortest path and routing

Access to Document

10.1504/ijspm.2006.009006

Cite this

@article{2e0515389f8747f28920c581020c72f9,

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

doi = "10.1504/ijspm.2006.009006",

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 - https://www.scopus.com/pages/publications/65449162191

U2 - 10.1504/ijspm.2006.009006

DO - 10.1504/ijspm.2006.009006

M3 - Article

AN - SCOPUS:65449162191

SN - 1740-2123

VL - 2

SP - 4

EP - 11

JO - International Journal of Simulation and Process Modelling

JF - International Journal of Simulation and Process Modelling

IS - 1-2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this