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
무선 네트워크는 중앙 공유 자원이 없는 분산 시스템입니다. n 각 방송국에는 무선 송수신기가 장착되어 있습니다. 무선 네트워크에서 프로토콜을 평가하는 가장 중요한 매개변수 중 하나는 각 개별 스테이션이 데이터 패킷을 전송/수신하는 활성 시간 슬롯의 수입니다. 우리는 범위 [1,n] 로 n 깨어있는 시간 슬롯을 거의 사용하지 않는 방송국. RN은 다음과 같이 초기화될 수 있는 것으로 알려져 있다. O(로그 로그 n) 모든 스테이션이 번호를 알고 있는 경우 높은 확률로 깨어 있는 시간 슬롯 n RN에 있는 스테이션의 수입니다. 또한 RN은 다음과 같이 초기화될 수 있음을 보여주었습니다. O(로그 n) 스테이션이 모르더라도 깨어 있는 시간 슬롯 n. 그러나 초기화를 수행할 수 있는지 여부는 공개되었습니다. O(로그 로그 n) 스테이션이 알 수 없는 깨어 있는 시간 슬롯 n. 우리의 주요 기여는 획기적인 발전을 제공하는 것입니다. 어떤 방송국도 알지 못하더라도 우리는 이를 보여줍니다. n, RN은 높은 확률로 종료되는 프로토콜에 의해 초기화될 수 있습니다. O(n) 1시간 이상 깨어 있는 스테이션이 없는 시간 슬롯 O(로그 로그 n) 시간대. 그런 다음 계속해서 초기화 프로토콜을 설계합니다. k- 높은 확률로 종료되는 채널 RN O(n/k + (로그 n)2) 1시간 이상 깨어 있는 스테이션이 없는 시간 슬롯 O(로그 로그 n) 시간대.
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.
부
Jacir Luiz BORDIM, Jiangtao CUI, Naohiro ISHII, Koji NAKANO, "Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 967-976, May 2002, doi: .
Abstract: A radio network is a distributed system with no central shared resource, consisting of n stations each equipped with a radio transceiver. One of the most important parameters to evaluate protocols in the radio networks is the number of awake time slots in which each individual station sends/receives a data packet. We are interested in devising energy-efficient initialization protocols in the single-hop radio network (RN, for short) that assign unique IDs in the range [1,n] to the n stations using few awake time slots. It is known that the RN can be initialized in O(log log n) awake time slots, with high probability, if every station knows the number n of stations in the RN. Also, it has been shown that the RN can be initialized in O(log n) awake time slots even if no station knows n. However, it has been open whether the initialization can be performed in O(log log n) awake time slots when no station knows n. Our main contribution is to provide the breakthrough: we show that even if no station knows n, the RN can be initialized by our protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log log n) time slots. We then go on to design an initialization protocol for the k-channel RN that terminates, with high probability, in O(n/k + (log n)2) time slots with no station being awake for more than O(log log n) time slots.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_967/_p
부
@ARTICLE{e85-a_5_967,
author={Jacir Luiz BORDIM, Jiangtao CUI, Naohiro ISHII, Koji NAKANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks},
year={2002},
volume={E85-A},
number={5},
pages={967-976},
abstract={A radio network is a distributed system with no central shared resource, consisting of n stations each equipped with a radio transceiver. One of the most important parameters to evaluate protocols in the radio networks is the number of awake time slots in which each individual station sends/receives a data packet. We are interested in devising energy-efficient initialization protocols in the single-hop radio network (RN, for short) that assign unique IDs in the range [1,n] to the n stations using few awake time slots. It is known that the RN can be initialized in O(log log n) awake time slots, with high probability, if every station knows the number n of stations in the RN. Also, it has been shown that the RN can be initialized in O(log n) awake time slots even if no station knows n. However, it has been open whether the initialization can be performed in O(log log n) awake time slots when no station knows n. Our main contribution is to provide the breakthrough: we show that even if no station knows n, the RN can be initialized by our protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log log n) time slots. We then go on to design an initialization protocol for the k-channel RN that terminates, with high probability, in O(n/k + (log n)2) time slots with no station being awake for more than O(log log n) time slots.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 967
EP - 976
AU - Jacir Luiz BORDIM
AU - Jiangtao CUI
AU - Naohiro ISHII
AU - Koji NAKANO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - A radio network is a distributed system with no central shared resource, consisting of n stations each equipped with a radio transceiver. One of the most important parameters to evaluate protocols in the radio networks is the number of awake time slots in which each individual station sends/receives a data packet. We are interested in devising energy-efficient initialization protocols in the single-hop radio network (RN, for short) that assign unique IDs in the range [1,n] to the n stations using few awake time slots. It is known that the RN can be initialized in O(log log n) awake time slots, with high probability, if every station knows the number n of stations in the RN. Also, it has been shown that the RN can be initialized in O(log n) awake time slots even if no station knows n. However, it has been open whether the initialization can be performed in O(log log n) awake time slots when no station knows n. Our main contribution is to provide the breakthrough: we show that even if no station knows n, the RN can be initialized by our protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log log n) time slots. We then go on to design an initialization protocol for the k-channel RN that terminates, with high probability, in O(n/k + (log n)2) time slots with no station being awake for more than O(log log n) time slots.
ER -