A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory

Dong Wang; Xinheng Wang; Hong-Hsu Yen

doi:10.5121/csit.2016.61510

A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory

Dong Wang, Xinheng Wang, Hong-Hsu Yen

School of Computing, Engineering and Physical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

With the development of new networking paradigms and wireless protocols, nodes with different capabilities are used to form a heterogeneous network. The performance of this kind of networks is seriously deteriorated because of the bottlenecks inside the network. In addition, because of the application requirements, different routing schemes are required toward one particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and adaptable to application requirement. Polychromatic sets theory has the ability to do so. This paper demonstrates the applications of polychromatic sets theory in route discovery and protocols design for heterogeneous networks. From extensive simulations, it shows the nodes with high priority are selected for routing, which greatly increases the performance of the network. This demonstrates that a new type of graph theory could be applied to solve problems of complex networks.

Original language	English
Title of host publication	Computer Science & Information Technology
Subtitle of host publication	Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016
Editors	Natarajan Meghanathan, David C. Wyld
Publisher	AIRCC Publishing Corporation
Pages	103-115
Number of pages	13
Volume	62
ISBN (Print)	9781921987601
DOIs	https://doi.org/10.5121/csit.2016.61510
Publication status	Published - 23 Dec 2016
Event	International Conference on Networks & Communications - Sydney, Australia Duration: 23 Dec 2016 → 24 Dec 2016 Conference number: 8

Publication series

Name	Computer Science & Information Technology
Publisher	AIRCC Publishing Corporation
Number	62
ISSN (Print)	2231-5403

Conference

Conference	International Conference on Networks & Communications
Abbreviated title	NeTCoM 2016
Country/Territory	Australia
City	Sydney
Period	23/12/16 → 24/12/16

Keywords

dynamic routing
heterogeneous networks
wireless sensor networks
polychromatic sets

Access to Document

10.5121/csit.2016.61510

Cite this

Wang, D., Wang, X., & Yen, H.-H. (2016). A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory. In N. Meghanathan, & D. C. Wyld (Eds.), Computer Science & Information Technology : Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016 (Vol. 62, pp. 103-115). (Computer Science & Information Technology ; No. 62). AIRCC Publishing Corporation. https://doi.org/10.5121/csit.2016.61510

Wang, Dong ; Wang, Xinheng ; Yen, Hong-Hsu. / A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory. Computer Science & Information Technology : Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016 . editor / Natarajan Meghanathan ; David C. Wyld. Vol. 62 AIRCC Publishing Corporation, 2016. pp. 103-115 (Computer Science & Information Technology ; 62).

@inproceedings{63b86d8719284485af4352fcf3e64007,

title = "A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory",

abstract = "With the development of new networking paradigms and wireless protocols, nodes with different capabilities are used to form a heterogeneous network. The performance of this kind of networks is seriously deteriorated because of the bottlenecks inside the network. In addition, because of the application requirements, different routing schemes are required toward one particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and adaptable to application requirement. Polychromatic sets theory has the ability to do so. This paper demonstrates the applications of polychromatic sets theory in route discovery and protocols design for heterogeneous networks. From extensive simulations, it shows the nodes with high priority are selected for routing, which greatly increases the performance of the network. This demonstrates that a new type of graph theory could be applied to solve problems of complex networks. ",

keywords = "dynamic routing, heterogeneous networks, wireless sensor networks, polychromatic sets",

author = "Dong Wang and Xinheng Wang and Hong-Hsu Yen",

year = "2016",

month = dec,

day = "23",

doi = "10.5121/csit.2016.61510",

language = "English",

isbn = "9781921987601",

volume = "62",

series = "Computer Science & Information Technology ",

publisher = "AIRCC Publishing Corporation",

number = "62",

pages = "103--115",

editor = "Natarajan Meghanathan and Wyld, {David C.}",

booktitle = "Computer Science & Information Technology",

address = "India",

note = "International Conference on Networks & Communications, NeTCoM 2016 ; Conference date: 23-12-2016 Through 24-12-2016",

}

Wang, D, Wang, X & Yen, H-H 2016, A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory. in N Meghanathan & DC Wyld (eds), Computer Science & Information Technology : Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016 . vol. 62, Computer Science & Information Technology , no. 62, AIRCC Publishing Corporation, pp. 103-115, International Conference on Networks & Communications, Sydney, New South Wales, Australia, 23/12/16. https://doi.org/10.5121/csit.2016.61510

A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory. / Wang, Dong; Wang, Xinheng; Yen, Hong-Hsu.
Computer Science & Information Technology : Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016 . ed. / Natarajan Meghanathan; David C. Wyld. Vol. 62 AIRCC Publishing Corporation, 2016. p. 103-115 (Computer Science & Information Technology ; No. 62).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory

AU - Wang, Dong

AU - Wang, Xinheng

AU - Yen, Hong-Hsu

N1 - Conference code: 8

PY - 2016/12/23

Y1 - 2016/12/23

N2 - With the development of new networking paradigms and wireless protocols, nodes with different capabilities are used to form a heterogeneous network. The performance of this kind of networks is seriously deteriorated because of the bottlenecks inside the network. In addition, because of the application requirements, different routing schemes are required toward one particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and adaptable to application requirement. Polychromatic sets theory has the ability to do so. This paper demonstrates the applications of polychromatic sets theory in route discovery and protocols design for heterogeneous networks. From extensive simulations, it shows the nodes with high priority are selected for routing, which greatly increases the performance of the network. This demonstrates that a new type of graph theory could be applied to solve problems of complex networks.

AB - With the development of new networking paradigms and wireless protocols, nodes with different capabilities are used to form a heterogeneous network. The performance of this kind of networks is seriously deteriorated because of the bottlenecks inside the network. In addition, because of the application requirements, different routing schemes are required toward one particular application. This needs a tool to design protocols to avoid the bottlenecked nodes and adaptable to application requirement. Polychromatic sets theory has the ability to do so. This paper demonstrates the applications of polychromatic sets theory in route discovery and protocols design for heterogeneous networks. From extensive simulations, it shows the nodes with high priority are selected for routing, which greatly increases the performance of the network. This demonstrates that a new type of graph theory could be applied to solve problems of complex networks.

KW - dynamic routing

KW - heterogeneous networks

KW - wireless sensor networks

KW - polychromatic sets

U2 - 10.5121/csit.2016.61510

DO - 10.5121/csit.2016.61510

M3 - Conference contribution

SN - 9781921987601

VL - 62

T3 - Computer Science & Information Technology

SP - 103

EP - 115

BT - Computer Science & Information Technology

A2 - Meghanathan, Natarajan

A2 - Wyld, David C.

PB - AIRCC Publishing Corporation

T2 - International Conference on Networks & Communications

Y2 - 23 December 2016 through 24 December 2016

ER -

Wang D, Wang X, Yen HH. A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory. In Meghanathan N, Wyld DC, editors, Computer Science & Information Technology : Eighth International Conference on Networks & Communications (NETCOM - 2016) Sydney, Australia, December 23~24, 2016 . Vol. 62. AIRCC Publishing Corporation. 2016. p. 103-115. (Computer Science & Information Technology ; 62). doi: 10.5121/csit.2016.61510

A dynamic route discovery scheme for heterogeneous wireless sensor networks based on polychromatic sets theory

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this