The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMMUNICATIONS
Transactions ID Number: 27-718
Full Name: Ching-Mu Chen
Position: Senior Lecturer
Age: ON
Sex: Male
Address: Bao-Shan Campus: No.2, Shi-Da Road, Changhua City 500, Taiwan, R.O.C.
Country: TAIWAN
Tel: +88648394147
Tel prefix:
Fax: +88648394147
E-mail address: kchen@dragon.ccut.edu.tw
Other E-mails: jung@dragon.ccut.edu.tw
Title of the Paper: a non_ack routing protocol in ad-hoc wireless sensor networks
Authors as they appear in the Paper: Ching-Mu Chen, Tung-Jung Chan, Tair-Rong Chen
Email addresses of all the authors: d95621003@mail.ncue.edu.tw,kchen@dragon.ccut.edu.tw,jung@dragon.ccut.edu.tw
Number of paper pages: 10
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 c!
alled 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.
Keywords: Energy efficiency, Network lifetime, Ad-hoc wireless sensor networks, Routing protocol, No acknowledgement, Binary tree, Query-based.
EXTENSION of the file: .pdf
Special (Invited) Session: An Efficient Routing Protocol with No Acknowledgement Algorithm in Ad-hoc Wireless Sensor Network
Organizer of the Session: 591-801
How Did you learn about congress: brianhm@hotmail.com,itt58@yahoo.com.tw,ncwang@nuu.edu.tw,nicholas@csmu.edu.tw
IP ADDRESS: 60.248.51.116
