A non-ack routing protocol in ad-hoc wireless sensor networks

Ching Mu Chen, Tung Jung Chan, Tsair Rong Chen

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A wireless sensor network contains many sensor nodes in a certain sensing area. Every sensor node consists of a central processing unit, transmitting unit, receiving unit and power supply unit. In order to have efficient sensed messages, both the base station and sensor nodes have to communicate for each others as well. Therefore, a certain sensing area is divided into many sub-areas and every sensor node transmits its message to cluster head which, normally, will integrate and forward these messages to the base station. At the first step, set-up phase is applied to form clusters and to select cluster heads. During the second phase, the transmission phase, every sensor node received a message from another node has to transmit a confirmed message, acknowledgement (ACK), to ensure whether or not the data has been received which means every sensor node will dissipate much energy on transmitting and receiving. However, this paper proposes an adaptive routing protocol called Non-Ack in the Ad-hoc wireless sensor networks that is the data for every sensor node is transmitted directly to the cluster head and then forwards back to the base station. Some conditions for these sensor nodes with the sensed data directly transmitted without any acknowledgement may be failed so that this paper also considers as nodes fail to transmit the data back, the base station will be taken over for the network. By the consideration of these failure nodes, the base station will establish a binary tree for fault tolerance. A binary tree in the base station is also a big help for query-based routing protocol. Finally, simulation results reveal the entire network lifetime can be extended well and the performance is much better.

Original languageEnglish
Pages (from-to)847-856
Number of pages10
JournalWSEAS Transactions on Communications
Volume7
Issue number8
Publication statusPublished - 2008 Dec 1

Fingerprint

Routing protocols
Sensor nodes
Wireless sensor networks
Base stations
Binary trees
Fault tolerance
Program processors

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Chen, Ching Mu ; Chan, Tung Jung ; Chen, Tsair Rong. / A non-ack routing protocol in ad-hoc wireless sensor networks. In: WSEAS Transactions on Communications. 2008 ; Vol. 7, No. 8. pp. 847-856.
@article{588295b1791c420e8e2c52c0afb1dd44,
title = "A non-ack routing protocol in ad-hoc wireless sensor networks",
abstract = "A wireless sensor network contains many sensor nodes in a certain sensing area. Every sensor node consists of a central processing unit, transmitting unit, receiving unit and power supply unit. In order to have efficient sensed messages, both the base station and sensor nodes have to communicate for each others as well. Therefore, a certain sensing area is divided into many sub-areas and every sensor node transmits its message to cluster head which, normally, will integrate and forward these messages to the base station. At the first step, set-up phase is applied to form clusters and to select cluster heads. During the second phase, the transmission phase, every sensor node received a message from another node has to transmit a confirmed message, acknowledgement (ACK), to ensure whether or not the data has been received which means every sensor node will dissipate much energy on transmitting and receiving. However, this paper proposes an adaptive routing protocol called Non-Ack in the Ad-hoc wireless sensor networks that is the data for every sensor node is transmitted directly to the cluster head and then forwards back to the base station. Some conditions for these sensor nodes with the sensed data directly transmitted without any acknowledgement may be failed so that this paper also considers as nodes fail to transmit the data back, the base station will be taken over for the network. By the consideration of these failure nodes, the base station will establish a binary tree for fault tolerance. A binary tree in the base station is also a big help for query-based routing protocol. Finally, simulation results reveal the entire network lifetime can be extended well and the performance is much better.",
author = "Chen, {Ching Mu} and Chan, {Tung Jung} and Chen, {Tsair Rong}",
year = "2008",
month = "12",
day = "1",
language = "English",
volume = "7",
pages = "847--856",
journal = "WSEAS Transactions on Communications",
issn = "1109-2742",
publisher = "World Scientific and Engineering Academy and Society",
number = "8",

}

A non-ack routing protocol in ad-hoc wireless sensor networks. / Chen, Ching Mu; Chan, Tung Jung; Chen, Tsair Rong.

In: WSEAS Transactions on Communications, Vol. 7, No. 8, 01.12.2008, p. 847-856.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A non-ack routing protocol in ad-hoc wireless sensor networks

AU - Chen, Ching Mu

AU - Chan, Tung Jung

AU - Chen, Tsair Rong

PY - 2008/12/1

Y1 - 2008/12/1

N2 - A wireless sensor network contains many sensor nodes in a certain sensing area. Every sensor node consists of a central processing unit, transmitting unit, receiving unit and power supply unit. In order to have efficient sensed messages, both the base station and sensor nodes have to communicate for each others as well. Therefore, a certain sensing area is divided into many sub-areas and every sensor node transmits its message to cluster head which, normally, will integrate and forward these messages to the base station. At the first step, set-up phase is applied to form clusters and to select cluster heads. During the second phase, the transmission phase, every sensor node received a message from another node has to transmit a confirmed message, acknowledgement (ACK), to ensure whether or not the data has been received which means every sensor node will dissipate much energy on transmitting and receiving. However, this paper proposes an adaptive routing protocol called Non-Ack in the Ad-hoc wireless sensor networks that is the data for every sensor node is transmitted directly to the cluster head and then forwards back to the base station. Some conditions for these sensor nodes with the sensed data directly transmitted without any acknowledgement may be failed so that this paper also considers as nodes fail to transmit the data back, the base station will be taken over for the network. By the consideration of these failure nodes, the base station will establish a binary tree for fault tolerance. A binary tree in the base station is also a big help for query-based routing protocol. Finally, simulation results reveal the entire network lifetime can be extended well and the performance is much better.

AB - A wireless sensor network contains many sensor nodes in a certain sensing area. Every sensor node consists of a central processing unit, transmitting unit, receiving unit and power supply unit. In order to have efficient sensed messages, both the base station and sensor nodes have to communicate for each others as well. Therefore, a certain sensing area is divided into many sub-areas and every sensor node transmits its message to cluster head which, normally, will integrate and forward these messages to the base station. At the first step, set-up phase is applied to form clusters and to select cluster heads. During the second phase, the transmission phase, every sensor node received a message from another node has to transmit a confirmed message, acknowledgement (ACK), to ensure whether or not the data has been received which means every sensor node will dissipate much energy on transmitting and receiving. However, this paper proposes an adaptive routing protocol called Non-Ack in the Ad-hoc wireless sensor networks that is the data for every sensor node is transmitted directly to the cluster head and then forwards back to the base station. Some conditions for these sensor nodes with the sensed data directly transmitted without any acknowledgement may be failed so that this paper also considers as nodes fail to transmit the data back, the base station will be taken over for the network. By the consideration of these failure nodes, the base station will establish a binary tree for fault tolerance. A binary tree in the base station is also a big help for query-based routing protocol. Finally, simulation results reveal the entire network lifetime can be extended well and the performance is much better.

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

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

M3 - Article

AN - SCOPUS:70349624744

VL - 7

SP - 847

EP - 856

JO - WSEAS Transactions on Communications

JF - WSEAS Transactions on Communications

SN - 1109-2742

IS - 8

ER -