TY - GEN
T1 - An energy-efficient uni-scheduling based on S-MAC in wireless sensor network
AU - Lee, Tae Seok
AU - Yang, Yuan
AU - Shin, Ki Jeong
AU - Park, Myong Soon
PY - 2005
Y1 - 2005
N2 - S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sensor nodes. S-MAC, which was made by modifying IEEE 802.11, reduced the energy wasted in the wireless sensor network by using a periodic listen and sleep scheduling method. The first task that the wireless sensor network using S-MAC performs is to find a neighbor node, and then choose and broadcast its own schedule. In this process, as a result of using a time selected randomly and scheduling, diversified schedules are generated. In the end, schedule clusters, which are different from one another, get to be made, and nodes on these cluster borders fail to communicate with one another due to an inconsistent listen time. In the existing paper on S-MAC, this problem is solved by placing a border node to adopt schedules which are different from one another. However, compared with other nodes, the border node consumes energy more, and its efficiency of data transmission according to the broadcast type is lower. This paper suggested a method for unifying schedules through the H-SYNC (Heartbeat-SYNC) method for solving such problem of the diversified scheduling of S-MAC, and as a result of comparing and evaluating its performance through simulation, it was found that the border node consumed energy less.
AB - S-MAC is a MAC (Medium Access Control) protocol as specialized for the wireless sensor network in order to sacrifice transmission delay and extend the working life of the whole sensor nodes. S-MAC, which was made by modifying IEEE 802.11, reduced the energy wasted in the wireless sensor network by using a periodic listen and sleep scheduling method. The first task that the wireless sensor network using S-MAC performs is to find a neighbor node, and then choose and broadcast its own schedule. In this process, as a result of using a time selected randomly and scheduling, diversified schedules are generated. In the end, schedule clusters, which are different from one another, get to be made, and nodes on these cluster borders fail to communicate with one another due to an inconsistent listen time. In the existing paper on S-MAC, this problem is solved by placing a border node to adopt schedules which are different from one another. However, compared with other nodes, the border node consumes energy more, and its efficiency of data transmission according to the broadcast type is lower. This paper suggested a method for unifying schedules through the H-SYNC (Heartbeat-SYNC) method for solving such problem of the diversified scheduling of S-MAC, and as a result of comparing and evaluating its performance through simulation, it was found that the border node consumed energy less.
UR - http://www.scopus.com/inward/record.url?scp=33646406550&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646406550&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33646406550
SN - 3540290311
SN - 9783540290315
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 293
EP - 304
BT - High Performance Computing and Communcations - First International Conference, HPCC 2005, Proceedings
T2 - 1st International Conference on High Performance Computing and Communcations, HPCC 2005
Y2 - 21 September 2005 through 23 September 2005
ER -