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
이 작업의 주요 기여는 임시 무선 네트워크(ARN, 줄여서)를 위한 에너지 효율적인 무작위 초기화 프로토콜을 제안하는 것입니다. 먼저, 우리는 숫자가 다음과 같다는 것을 보여줍니다. n 스테이션의 수가 미리 알려져 있으면 단일 채널 ARN은 높은 확률로 종료되는 프로토콜에 의해 초기화될 수 있습니다. O(n) 1시간 이상 깨어 있는 스테이션이 없는 시간 슬롯 O(로그 n) 시간대. 그런 다음 숫자가 발생한 경우를 다루겠습니다. n ARN의 스테이션 수는 미리 알 수 없습니다. 우리는 다음과 같은 긴밀한 근사치를 제공하는 우아한 프로토콜에 대해 논의하는 것부터 시작합니다. n. 흥미롭게도 이 프로토콜은 높은 확률로 종료됩니다. O((통나무 n)2) 시간 슬롯과 어떤 스테이션도 1시간 이상 깨어 있으면 안 됩니다. O(로그 n) 시간대. 우리는 이 프로토콜을 사용하여 높은 확률로 종료되는 에너지 효율적인 초기화 프로토콜을 설계합니다. O(n) 1시간 이상 깨어 있는 스테이션이 없는 시간 슬롯 O(로그 n) 시간대. 마지막으로 에너지 효율적인 초기화 프로토콜을 설계합니다. k- 높은 확률로 종료되는 채널 ARN O(n/k+로그 n) 시간 슬롯, 더 이상 깨어 있는 스테이션이 없음 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 L. BORDIM, JiangTao CUI, Tatsuya HAYASHI, Koji NAKANO, Stephan OLARIU, "Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 9, pp. 1796-1803, September 2000, doi: .
Abstract: The main contribution of this work is to propose energy-efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in O(n/k+log n) time slots, with no station being awake for more than O(log n) time slots.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_9_1796/_p
부
@ARTICLE{e83-a_9_1796,
author={Jacir L. BORDIM, JiangTao CUI, Tatsuya HAYASHI, Koji NAKANO, Stephan OLARIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks},
year={2000},
volume={E83-A},
number={9},
pages={1796-1803},
abstract={The main contribution of this work is to propose energy-efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in O(n/k+log n) time slots, with no station being awake for more than O(log n) time slots.},
keywords={},
doi={},
ISSN={},
month={September},}
부
TY - JOUR
TI - Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1796
EP - 1803
AU - Jacir L. BORDIM
AU - JiangTao CUI
AU - Tatsuya HAYASHI
AU - Koji NAKANO
AU - Stephan OLARIU
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2000
AB - The main contribution of this work is to propose energy-efficient randomized initialization protocols for ad-hoc radio networks (ARN, for short). First, we show that if the number n of stations is known beforehand, the single-channel ARN can be initialized by a protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. We then go on to address the case where the number n of stations in the ARN is not known beforehand. We begin by discussing, an elegant protocol that provides a tight approximation of n. Interestingly, this protocol terminates, with high probability, in O((log n)2) time slots and no station has to be awake for more than O(log n) time slots. We use this protocol to design an energy-efficient initialization protocol that terminates, with high probability, in O(n) time slots with no station being awake for more than O(log n) time slots. Finally, we design an energy-efficient initialization protocol for the k-channel ARN that terminates, with high probability, in O(n/k+log n) time slots, with no station being awake for more than O(log n) time slots.
ER -