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
Rangkaian radio ialah sistem teragih tanpa sumber perkongsian pusat, yang terdiri daripada n stesen masing-masing dilengkapi dengan transceiver radio. Salah satu parameter terpenting untuk menilai protokol dalam rangkaian radio ialah bilangan slot masa terjaga di mana setiap stesen individu menghantar/menerima paket data. Kami berminat untuk mencipta protokol pemulaan cekap tenaga dalam rangkaian radio hop tunggal (RN, ringkasnya) yang memberikan ID unik dalam julat [1,n] kepada n stesen menggunakan beberapa slot masa terjaga. Adalah diketahui bahawa RN boleh dimulakan dalam O(log log n) slot masa terjaga, dengan kebarangkalian tinggi, jika setiap stesen mengetahui nombornya n stesen di RN. Juga, telah ditunjukkan bahawa RN boleh dimulakan O(log n) slot masa terjaga walaupun tiada stesen yang tahu n. Walau bagaimanapun, ia telah dibuka sama ada permulaan boleh dilakukan dalam O(log log n) slot masa terjaga apabila tiada stesen yang tahu n. Sumbangan utama kami adalah untuk memberikan kejayaan: kami menunjukkan bahawa walaupun tiada stesen yang tahu n, RN boleh dimulakan oleh protokol kami yang ditamatkan, dengan kebarangkalian tinggi, dalam O(n) slot masa tanpa stesen berjaga lebih daripada O(log log n) slot masa. Kami kemudiannya meneruskan untuk mereka bentuk protokol permulaan untuk k-saluran RN yang tamat, dengan kebarangkalian tinggi, dalam O(n/k + (log n)2) slot masa tanpa stesen berjaga lebih daripada O(log log n) slot masa.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -