Scalable routing modeling for wireless ad hoc networks by using polychromatic sets

Xinheng Wang, Shancang Li

Research output: Contribution to journalArticle

Abstract

Graph theory is a traditional mathematical method to analyze computer networks, including intelligent wireless networks, such as ad hoc networks, sensor networks, and wireless mesh networks. Because of the variety of the network nodes and wireless links, conventional graph theory and set theory used to describe the element of the network (node and link) are not suitable to model the modern complex wireless networks. Recent research in weighted graph and random graph theories that place a weight on the links and a probability to decide the existence of the link or not is a further step to model the wireless network in a near real-life scenario. However, it lacks the ability to describe the properties of the network node. In this paper, a new mathematical tool, polychromatic sets (PS-sets), is introduced in modeling the complex wireless networks. PS-sets have the ability to describe the property of each element, which we believe will be a perfect tool to describe the network nodes and links of wireless networks. This paper demonstrates a scalable network modeling using PS-sets theory and a routing scheme based on this model. Evaluation results show that it is simple and scalable, and its performance is superior to other conventional routing schemes. The PS-sets theory could become a new tool in studying modern complex wireless networks.
Original languageEnglish
Pages (from-to)50-58
Number of pages9
JournalIEEE Systems Journal
Volume7
Issue number1
DOIs
Publication statusPublished - 12 Nov 2012
Externally publishedYes

Keywords

  • Polychromatic sets
  • routing
  • wireless ad hoc networks

Cite this

Wang, Xinheng ; Li, Shancang. / Scalable routing modeling for wireless ad hoc networks by using polychromatic sets. In: IEEE Systems Journal. 2012 ; Vol. 7, No. 1. pp. 50-58.
@article{eb995ed7dd6342d0940e33900d50a76b,
title = "Scalable routing modeling for wireless ad hoc networks by using polychromatic sets",
abstract = "Graph theory is a traditional mathematical method to analyze computer networks, including intelligent wireless networks, such as ad hoc networks, sensor networks, and wireless mesh networks. Because of the variety of the network nodes and wireless links, conventional graph theory and set theory used to describe the element of the network (node and link) are not suitable to model the modern complex wireless networks. Recent research in weighted graph and random graph theories that place a weight on the links and a probability to decide the existence of the link or not is a further step to model the wireless network in a near real-life scenario. However, it lacks the ability to describe the properties of the network node. In this paper, a new mathematical tool, polychromatic sets (PS-sets), is introduced in modeling the complex wireless networks. PS-sets have the ability to describe the property of each element, which we believe will be a perfect tool to describe the network nodes and links of wireless networks. This paper demonstrates a scalable network modeling using PS-sets theory and a routing scheme based on this model. Evaluation results show that it is simple and scalable, and its performance is superior to other conventional routing schemes. The PS-sets theory could become a new tool in studying modern complex wireless networks.",
keywords = "Polychromatic sets, routing, wireless ad hoc networks",
author = "Xinheng Wang and Shancang Li",
year = "2012",
month = "11",
day = "12",
doi = "10.1109/JSYST.2012.2214671",
language = "English",
volume = "7",
pages = "50--58",
journal = "IEEE Systems Journal",
issn = "1932-8184",
publisher = "IEEE",
number = "1",

}

Scalable routing modeling for wireless ad hoc networks by using polychromatic sets. / Wang, Xinheng; Li, Shancang.

In: IEEE Systems Journal, Vol. 7, No. 1, 12.11.2012, p. 50-58.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scalable routing modeling for wireless ad hoc networks by using polychromatic sets

AU - Wang, Xinheng

AU - Li, Shancang

PY - 2012/11/12

Y1 - 2012/11/12

N2 - Graph theory is a traditional mathematical method to analyze computer networks, including intelligent wireless networks, such as ad hoc networks, sensor networks, and wireless mesh networks. Because of the variety of the network nodes and wireless links, conventional graph theory and set theory used to describe the element of the network (node and link) are not suitable to model the modern complex wireless networks. Recent research in weighted graph and random graph theories that place a weight on the links and a probability to decide the existence of the link or not is a further step to model the wireless network in a near real-life scenario. However, it lacks the ability to describe the properties of the network node. In this paper, a new mathematical tool, polychromatic sets (PS-sets), is introduced in modeling the complex wireless networks. PS-sets have the ability to describe the property of each element, which we believe will be a perfect tool to describe the network nodes and links of wireless networks. This paper demonstrates a scalable network modeling using PS-sets theory and a routing scheme based on this model. Evaluation results show that it is simple and scalable, and its performance is superior to other conventional routing schemes. The PS-sets theory could become a new tool in studying modern complex wireless networks.

AB - Graph theory is a traditional mathematical method to analyze computer networks, including intelligent wireless networks, such as ad hoc networks, sensor networks, and wireless mesh networks. Because of the variety of the network nodes and wireless links, conventional graph theory and set theory used to describe the element of the network (node and link) are not suitable to model the modern complex wireless networks. Recent research in weighted graph and random graph theories that place a weight on the links and a probability to decide the existence of the link or not is a further step to model the wireless network in a near real-life scenario. However, it lacks the ability to describe the properties of the network node. In this paper, a new mathematical tool, polychromatic sets (PS-sets), is introduced in modeling the complex wireless networks. PS-sets have the ability to describe the property of each element, which we believe will be a perfect tool to describe the network nodes and links of wireless networks. This paper demonstrates a scalable network modeling using PS-sets theory and a routing scheme based on this model. Evaluation results show that it is simple and scalable, and its performance is superior to other conventional routing schemes. The PS-sets theory could become a new tool in studying modern complex wireless networks.

KW - Polychromatic sets

KW - routing

KW - wireless ad hoc networks

U2 - 10.1109/JSYST.2012.2214671

DO - 10.1109/JSYST.2012.2214671

M3 - Article

VL - 7

SP - 50

EP - 58

JO - IEEE Systems Journal

JF - IEEE Systems Journal

SN - 1932-8184

IS - 1

ER -