Probing mechanism scheduling for connected coverage wireless sensor network

M. Mahdavi, Mahamod Ismail, K. Jumari, Z. M. Hanapi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Sensing coverage and network connectivity are two main requirements which maintain perfect operation of wireless sensor network. Joint scheduling method has considered both requirements by using random scheduling for sensing coverage, which divides sensor nodes to k subsets. Each sensor nodes randomly selects one defined subset. Then, the algorithm turns on extra sensor nodes, if necessary for network connectivity. As Extra-on sensor nodes participate in other nodes routing, some of them may be subject of many times transmission and reception. Furthermore, some of Extra-on nodes should be active the whole time to create network connectivity. Both mentioned reasons can drain out energy of those extra active nodes and may lead to network partitioning. Hence, reducing number of Extra-on nodes is important. In this study, we utilize probing mechanism scheduling in joint scheduling method to reduce the number of extra on sensor nodes. By using probing mechanism that some nodes change their working schedule, number of extra on nodes reduces by 20%.

Original languageEnglish
Pages (from-to)579-584
Number of pages6
JournalInformation Technology Journal
Volume10
Issue number3
DOIs
Publication statusPublished - 2011

Fingerprint

Sensor nodes
Wireless sensor networks
Scheduling
Set theory

Keywords

  • Connectivity
  • Coverage
  • Partitioning
  • Probing
  • Scheduling
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Probing mechanism scheduling for connected coverage wireless sensor network. / Mahdavi, M.; Ismail, Mahamod; Jumari, K.; Hanapi, Z. M.

In: Information Technology Journal, Vol. 10, No. 3, 2011, p. 579-584.

Research output: Contribution to journalArticle

Mahdavi, M. ; Ismail, Mahamod ; Jumari, K. ; Hanapi, Z. M. / Probing mechanism scheduling for connected coverage wireless sensor network. In: Information Technology Journal. 2011 ; Vol. 10, No. 3. pp. 579-584.
@article{4fff60465bfa41f79517d90753f74458,
title = "Probing mechanism scheduling for connected coverage wireless sensor network",
abstract = "Sensing coverage and network connectivity are two main requirements which maintain perfect operation of wireless sensor network. Joint scheduling method has considered both requirements by using random scheduling for sensing coverage, which divides sensor nodes to k subsets. Each sensor nodes randomly selects one defined subset. Then, the algorithm turns on extra sensor nodes, if necessary for network connectivity. As Extra-on sensor nodes participate in other nodes routing, some of them may be subject of many times transmission and reception. Furthermore, some of Extra-on nodes should be active the whole time to create network connectivity. Both mentioned reasons can drain out energy of those extra active nodes and may lead to network partitioning. Hence, reducing number of Extra-on nodes is important. In this study, we utilize probing mechanism scheduling in joint scheduling method to reduce the number of extra on sensor nodes. By using probing mechanism that some nodes change their working schedule, number of extra on nodes reduces by 20{\%}.",
keywords = "Connectivity, Coverage, Partitioning, Probing, Scheduling, Wireless sensor networks",
author = "M. Mahdavi and Mahamod Ismail and K. Jumari and Hanapi, {Z. M.}",
year = "2011",
doi = "10.3923/itj.2011.579.584",
language = "English",
volume = "10",
pages = "579--584",
journal = "Information Technology Journal",
issn = "1812-5638",
publisher = "Asian Network for Scientific Information",
number = "3",

}

TY - JOUR

T1 - Probing mechanism scheduling for connected coverage wireless sensor network

AU - Mahdavi, M.

AU - Ismail, Mahamod

AU - Jumari, K.

AU - Hanapi, Z. M.

PY - 2011

Y1 - 2011

N2 - Sensing coverage and network connectivity are two main requirements which maintain perfect operation of wireless sensor network. Joint scheduling method has considered both requirements by using random scheduling for sensing coverage, which divides sensor nodes to k subsets. Each sensor nodes randomly selects one defined subset. Then, the algorithm turns on extra sensor nodes, if necessary for network connectivity. As Extra-on sensor nodes participate in other nodes routing, some of them may be subject of many times transmission and reception. Furthermore, some of Extra-on nodes should be active the whole time to create network connectivity. Both mentioned reasons can drain out energy of those extra active nodes and may lead to network partitioning. Hence, reducing number of Extra-on nodes is important. In this study, we utilize probing mechanism scheduling in joint scheduling method to reduce the number of extra on sensor nodes. By using probing mechanism that some nodes change their working schedule, number of extra on nodes reduces by 20%.

AB - Sensing coverage and network connectivity are two main requirements which maintain perfect operation of wireless sensor network. Joint scheduling method has considered both requirements by using random scheduling for sensing coverage, which divides sensor nodes to k subsets. Each sensor nodes randomly selects one defined subset. Then, the algorithm turns on extra sensor nodes, if necessary for network connectivity. As Extra-on sensor nodes participate in other nodes routing, some of them may be subject of many times transmission and reception. Furthermore, some of Extra-on nodes should be active the whole time to create network connectivity. Both mentioned reasons can drain out energy of those extra active nodes and may lead to network partitioning. Hence, reducing number of Extra-on nodes is important. In this study, we utilize probing mechanism scheduling in joint scheduling method to reduce the number of extra on sensor nodes. By using probing mechanism that some nodes change their working schedule, number of extra on nodes reduces by 20%.

KW - Connectivity

KW - Coverage

KW - Partitioning

KW - Probing

KW - Scheduling

KW - Wireless sensor networks

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

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

U2 - 10.3923/itj.2011.579.584

DO - 10.3923/itj.2011.579.584

M3 - Article

AN - SCOPUS:78651378789

VL - 10

SP - 579

EP - 584

JO - Information Technology Journal

JF - Information Technology Journal

SN - 1812-5638

IS - 3

ER -