One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks
スポンサーリンク
概要
- 論文の詳細を見る
For wireless sensor networks in which resources are limited and network topology dynamically changes, we propose the one-hop neighbor based broadcast scheduling (ONBS) algorithm to provide reliable delivery service of broadcast packets. The proposed algorithm reduces the scheduling overhead by allowing each joining node to decide its broadcast schedule based on only its one-hop neighbor information in an on-line and distributed manner. Also, once the broadcast schedule is decided, it is not changed to accommodate a newly joining node in order to prevent the consecutive changes of existing schedules. The network simulation results show that the proposed algorithm provides low latency and high reachability despite low overhead and on-line algorithm design.
- (社)電子情報通信学会の論文
- 2011-01-01
著者
-
KIM Taehong
Korea Advanced Institute of Science Technology
-
KIM Daeyoung
Korea Advanced Institute of Science Technology
-
KIT Chong
Korea Advanced Institute of Science Technology
-
Kim Daeyoung
Korea Advanced Inst. Of Sci. Technol. Daejeon Kor
関連論文
- One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks
- One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks
- Precise time synchronization based on ripple flooding in wireless sensor networks