The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Para redes de sensores sem fio nas quais os recursos são limitados e a topologia da rede muda dinamicamente, propomos o algoritmo de agendamento de transmissão baseado em vizinho de um salto (ONBS) para fornecer serviço de entrega confiável de pacotes de transmissão. O algoritmo proposto reduz a sobrecarga de escalonamento, permitindo que cada nó de adesão decida seu escalonamento de transmissão com base apenas nas informações de seu vizinho de um salto, de maneira on-line e distribuída. Além disso, uma vez decidido o horário de transmissão, ele não é alterado para acomodar um novo nó aderido, a fim de evitar alterações consecutivas nos horários existentes. Os resultados da simulação de rede mostram que o algoritmo proposto fornece baixa latência e alta acessibilidade, apesar do baixo overhead e do design do algoritmo on-line.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -