One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.1 pp.297-301
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.297
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Taehong KIM, Daeyoung KIM, Chong Poh KIT, "One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 1, pp. 297-301, January 2011, doi: 10.1587/transcom.E94.B.297.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.297/_p
Copy
@ARTICLE{e94-b_1_297,
author={Taehong KIM, Daeyoung KIM, Chong Poh KIT, },
journal={IEICE TRANSACTIONS on Communications},
title={One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks},
year={2011},
volume={E94-B},
number={1},
pages={297-301},
abstract={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.},
keywords={},
doi={10.1587/transcom.E94.B.297},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - One-Hop Neighbor Based Broadcast Scheduling in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 297
EP - 301
AU - Taehong KIM
AU - Daeyoung KIM
AU - Chong Poh KIT
PY - 2011
DO - 10.1587/transcom.E94.B.297
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - 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.
ER -
English
