Topology sense and graph-based TSG: efficient wireless ad hoc routing protocol for WANET

Abd Alrazak Tareq Rahem, Mahamod Ismail, Ihab Ahmed Najm, Mohammed Balfaqih

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalTelecommunication Systems
DOIs
Publication statusAccepted/In press - 6 Jan 2017

Fingerprint

Routing protocols
Topology
Graph theory
Trees (mathematics)
Packet loss
Wireless networks
Time delay
Throughput
Network protocols
Data storage equipment

Keywords

  • Graph theory
  • Routing Protocol
  • Spanning Tree
  • TMT
  • WANET

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Topology sense and graph-based TSG : efficient wireless ad hoc routing protocol for WANET. / Rahem, Abd Alrazak Tareq; Ismail, Mahamod; Najm, Ihab Ahmed; Balfaqih, Mohammed.

In: Telecommunication Systems, 06.01.2017, p. 1-16.

Research output: Contribution to journalArticle

Rahem, Abd Alrazak Tareq ; Ismail, Mahamod ; Najm, Ihab Ahmed ; Balfaqih, Mohammed. / Topology sense and graph-based TSG : efficient wireless ad hoc routing protocol for WANET. In: Telecommunication Systems. 2017 ; pp. 1-16.
@article{669b7ec9ee3246dc9f5bd4870d2ca8c4,
title = "Topology sense and graph-based TSG: efficient wireless ad hoc routing protocol for WANET",
abstract = "Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.",
keywords = "Graph theory, Routing Protocol, Spanning Tree, TMT, WANET",
author = "Rahem, {Abd Alrazak Tareq} and Mahamod Ismail and Najm, {Ihab Ahmed} and Mohammed Balfaqih",
year = "2017",
month = "1",
day = "6",
doi = "10.1007/s11235-016-0242-7",
language = "English",
pages = "1--16",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Topology sense and graph-based TSG

T2 - efficient wireless ad hoc routing protocol for WANET

AU - Rahem, Abd Alrazak Tareq

AU - Ismail, Mahamod

AU - Najm, Ihab Ahmed

AU - Balfaqih, Mohammed

PY - 2017/1/6

Y1 - 2017/1/6

N2 - Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.

AB - Technologies such as wireless ad hoc have undergone rapid redesigning. The routing protocol plays an essential role in improving the performance of wireless networks. However, improving the routing efficiency of a WANET still faces two main challenging issues: the routing table size and routing protocol selection criteria from the source to destination. This paper propose an efficient routing protocol using the Graph theory. In reviewing previous work, so far no research has represented routing information by a Triangular Matrix Table (TMT). TMT is based on the graph theory to save the entire network topology in a small memory size. Due to node movement or shut down, all neighboring nodes can detect that, namely, topology sense. The proposed Topology Sense and Graph-base (TSG) protocol relies on the topology change only. Node can send update message to all nodes by a distributor-cast mechanism, thus guaranteeing that every node gets one updating message. This mechanism depends on the TMT and Spanning Tree algorithm. The simulation results show that the TSG performs better than the conventional routing protocols. As a consequence, the throughput, delay time, packet loss, and overhead message are significantly improved as verified by NS3.

KW - Graph theory

KW - Routing Protocol

KW - Spanning Tree

KW - TMT

KW - WANET

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

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

U2 - 10.1007/s11235-016-0242-7

DO - 10.1007/s11235-016-0242-7

M3 - Article

AN - SCOPUS:85008455608

SP - 1

EP - 16

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

ER -