Novel architecture of self-organized mobile wireless sensor networks

Syed S. Rizvi, Kelsey Karpinski, Abdul Razaque

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

Original languageEnglish (US)
Pages (from-to)163-176
Number of pages14
JournalJournal of Computing Science and Engineering
Volume9
Issue number4
DOIs
StatePublished - Jan 1 2015

Fingerprint

Sensor nodes
Wireless sensor networks
Trees (mathematics)
Topology
Scalability
Energy utilization
Bandwidth

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications

Cite this

@article{afb91c7705e1470eb483e06f46c25ba4,
title = "Novel architecture of self-organized mobile wireless sensor networks",
abstract = "Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.",
author = "Rizvi, {Syed S.} and Kelsey Karpinski and Abdul Razaque",
year = "2015",
month = "1",
day = "1",
doi = "10.5626/JCSE.2015.9.4.163",
language = "English (US)",
volume = "9",
pages = "163--176",
journal = "Journal of Computing Science and Engineering",
issn = "1976-4677",
publisher = "Korean Institute of Information Scientists and Engineers",
number = "4",

}

Novel architecture of self-organized mobile wireless sensor networks. / Rizvi, Syed S.; Karpinski, Kelsey; Razaque, Abdul.

In: Journal of Computing Science and Engineering, Vol. 9, No. 4, 01.01.2015, p. 163-176.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Novel architecture of self-organized mobile wireless sensor networks

AU - Rizvi, Syed S.

AU - Karpinski, Kelsey

AU - Razaque, Abdul

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

AB - Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

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

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

U2 - 10.5626/JCSE.2015.9.4.163

DO - 10.5626/JCSE.2015.9.4.163

M3 - Article

AN - SCOPUS:85008244064

VL - 9

SP - 163

EP - 176

JO - Journal of Computing Science and Engineering

JF - Journal of Computing Science and Engineering

SN - 1976-4677

IS - 4

ER -