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
Kami membentangkan algoritma paging baharu untuk rangkaian wayarles dengan pautan capaian radio jarak jauh ultra (picocells). Rangkaian pejabat (u-pejabat) di mana-mana ialah contoh yang baik bagi rangkaian sedemikian, dan kami membentangkan beberapa aplikasi contoh u-pejabat. Di samping itu, kami menunjukkan bahawa algoritma paging konvensional tidak boleh dilaksanakan dalam rangkaian sedemikian. Oleh itu, kami memperoleh algoritma paging baharu daripada hasil pengukuran rangkaian penderia percubaan dengan pautan wayarles jarak dekat yang digunakan di pejabat kami. Kami melengkapkan orang dengan penderia dan menggunakan pembaca penderia di tempat terpilih di pejabat kami. Penderia menghantar mesej kepada pembaca penderia pada selang masa yang tetap. Jika tiada pembaca penderia berada dalam julat, mesej itu hilang. Pemerhatian utama kami ialah, jika picocell menunjukkan sifat tarikan kepada orang tertentu, masa kediaman terminal mudah alih yang dilampirkan tidak diedarkan gamma (seperti yang diterangkan dalam literatur) dan kebarangkalian kediaman tahan lama meningkat. Oleh itu, jika masa tinggal lebih besar daripada ambang tertentu, kebarangkalian masa tinggal yang tahan lama meningkat jika lokasi pembaca sensor mempunyai sifat tarikan kepada seseorang. Berdasarkan pemerhatian ini, algoritma paging yang dicadangkan kami mendaftarkan lokasi terminal mudah alih hanya apabila masa tinggal dalam sel lebih lama daripada pemalar yang telah ditetapkan. Dengan menetapkan pemalar ini dengan sewajarnya, kami boleh mengurangkan kekerapan mesej pendaftaran dengan ketara sambil memastikan kebarangkalian rangkaian berjaya menyambung ke terminal mudah alih kekal tinggi.
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
Stephan WANKE, Hiroshi SAITO, Yutaka ARAKAWA, Shinsuke SHIMOGAWA, "User Location in Picocells -- A Paging Algorithm Derived from Measured Data" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 9, pp. 2291-2298, September 2010, doi: 10.1587/transcom.E93.B.2291.
Abstract: We present a new paging algorithm for wireless networks with ultra-short-range radio access links (picocells). The ubiquitous office (u-office) network is a good example of such a network, and we present some u-office example applications. In addition, we show that conventional paging algorithms are not feasible in such networks. Therefore, we derived a new paging algorithm from the measurement results of an experimental sensor network with short-range wireless links deployed in our office. We equipped persons with sensors and deployed sensor readers at selected places in our office. The sensors transmit messages to the sensor readers at regular intervals. If no sensor reader is in range, the message is lost. Our main observation is that, if a picocell shows an attraction property to a certain person, the residence time of an attached mobile terminal is not gamma distributed (as described in the literature) and the probability of long-lasting residences increases. Thus, if the residence time is larger than a certain threshold, the probability of a long-lasting residence time increases if a sensor reader location has an attraction property to a person. Based on this observation, our proposed paging algorithm registers the location of the mobile terminal only when the residence time in the cell is longer than a predetermined constant. By appropriately setting this constant, we can significantly reduce the registration message frequency while ensuring that the probability of the network successfully connecting to a mobile terminal remains high.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2291/_p
Salinan
@ARTICLE{e93-b_9_2291,
author={Stephan WANKE, Hiroshi SAITO, Yutaka ARAKAWA, Shinsuke SHIMOGAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={User Location in Picocells -- A Paging Algorithm Derived from Measured Data},
year={2010},
volume={E93-B},
number={9},
pages={2291-2298},
abstract={We present a new paging algorithm for wireless networks with ultra-short-range radio access links (picocells). The ubiquitous office (u-office) network is a good example of such a network, and we present some u-office example applications. In addition, we show that conventional paging algorithms are not feasible in such networks. Therefore, we derived a new paging algorithm from the measurement results of an experimental sensor network with short-range wireless links deployed in our office. We equipped persons with sensors and deployed sensor readers at selected places in our office. The sensors transmit messages to the sensor readers at regular intervals. If no sensor reader is in range, the message is lost. Our main observation is that, if a picocell shows an attraction property to a certain person, the residence time of an attached mobile terminal is not gamma distributed (as described in the literature) and the probability of long-lasting residences increases. Thus, if the residence time is larger than a certain threshold, the probability of a long-lasting residence time increases if a sensor reader location has an attraction property to a person. Based on this observation, our proposed paging algorithm registers the location of the mobile terminal only when the residence time in the cell is longer than a predetermined constant. By appropriately setting this constant, we can significantly reduce the registration message frequency while ensuring that the probability of the network successfully connecting to a mobile terminal remains high.},
keywords={},
doi={10.1587/transcom.E93.B.2291},
ISSN={1745-1345},
month={September},}
Salinan
TY - JOUR
TI - User Location in Picocells -- A Paging Algorithm Derived from Measured Data
T2 - IEICE TRANSACTIONS on Communications
SP - 2291
EP - 2298
AU - Stephan WANKE
AU - Hiroshi SAITO
AU - Yutaka ARAKAWA
AU - Shinsuke SHIMOGAWA
PY - 2010
DO - 10.1587/transcom.E93.B.2291
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2010
AB - We present a new paging algorithm for wireless networks with ultra-short-range radio access links (picocells). The ubiquitous office (u-office) network is a good example of such a network, and we present some u-office example applications. In addition, we show that conventional paging algorithms are not feasible in such networks. Therefore, we derived a new paging algorithm from the measurement results of an experimental sensor network with short-range wireless links deployed in our office. We equipped persons with sensors and deployed sensor readers at selected places in our office. The sensors transmit messages to the sensor readers at regular intervals. If no sensor reader is in range, the message is lost. Our main observation is that, if a picocell shows an attraction property to a certain person, the residence time of an attached mobile terminal is not gamma distributed (as described in the literature) and the probability of long-lasting residences increases. Thus, if the residence time is larger than a certain threshold, the probability of a long-lasting residence time increases if a sensor reader location has an attraction property to a person. Based on this observation, our proposed paging algorithm registers the location of the mobile terminal only when the residence time in the cell is longer than a predetermined constant. By appropriately setting this constant, we can significantly reduce the registration message frequency while ensuring that the probability of the network successfully connecting to a mobile terminal remains high.
ER -