Ripple flooding scheme and fast time synchronization for wireless sensor network

This thesis propose Ripple Flooding Scheme (RFS) which goal is to achieve extreme fast convergence speed to meet the stringent timing requirement of some sensor network applications such as time synchronization for distributed signal processing. A typical distributed signal processing application as sniper localization system use Rapid Time Synchronization (RaTS)[1] to synchronize all sensors nodes within 30 $\micros$ error require re-synchronization in every 30 s. However the convergence time of the synchronization process itself takes 4 s, which is 13% overhead. With the help of RFS, synchronization process in the same size network can be finished in 25 ms, which is only 0.08% overhead. Instead of using CSMA MAC to avoid collision by transmitting rebroadcast packets at different time, RFS schedule nodes to forward flooding packet at the same to avoid collision. The feasibility of RFS is carefully studied from theory to experiment, and there is 15% packet lost in a single level forwarding due to delay uncertainty among the senders. RFS use three level rebroadcast and overhearing-retransmission scheme to recover the single transmission packet lost and achieve good overall reliability.
Advisors
Kim, Dae-Youngresearcher김대영researcher
Publisher
한국정보통신대학교
Issue Date
2008
Identifier
393029/225023 / 020054704
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2008.8, [ ix, 71 p. ]

Keywords

Multiple Transceivers; Time synchronization; Broadcast; Analysisf; Design and Performance; Wireless sensor network

URI
http://hdl.handle.net/10203/55018
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393029&flag=t
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 92
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0