One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks

Taehong KIM  Daeyoung KIM  Chong Poh KIT  

IEICE TRANSACTIONS on Communications   Vol.E94-B   No.1   pp.297-301
Publication Date: 2011/01/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.297
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
broadcast scheduling,  1-hop neighbor,  sensor network,  

Full Text: PDF(891.1KB)>>
Buy this Article

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.