检索结果-内蒙古大学图书馆

Doubly-logarithmic energy-efficient initialization protocols for single-hop radio networks

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年第5期E85A卷 967-976页

作者： Bordim, JL Cui, JT Ishii, N Nakano, K Nagoya Inst Technol Dept Intelligence & Comp Sci Nagoya Aichi 4668555 Japan

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.

关键词： radio networks initialization protocols energy-efficient randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Doubly-logarithmic energy-efficient initialization protocols for single-hop radio networks 16

Doubly-logarithmic energy-efficient initialization protocols...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Bordim, J.L. Cui, Jiangtao Ishii, N. Nakano, K. School of Information Science Japan Advanced Institute of Science and Technology 1-1 Asahidai TatsunokuchiIshikawa923-1292 Japan Department of Intelligence and Computer Science Nagoya Institute of Technology Showa-ku Nagoya466-8555 Japan

ISBN: (纸本)0769515738

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. © 2002 IEEE.

关键词： energy-efficient initialization protocols radio networks randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient initialization protocols for ad-hoc radio networks

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2000年第9期E83A卷 1796-1803页

作者： Bordim, JL Cui, JT Hayashi, T Nakano, K Olariu, S Nagoya Inst Technol Dept Elect & Comp Engn Nagoya Aichi 4668555 Japan Old Dominion Univ Dept Comp Sci Norfolk VA 23529 USA

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.

关键词： radio networks initialization protocols energy-efficient randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient initialization protocol for wireless sensor networks with no collision detection

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2002年第2期E85A卷 447-454页

作者： Bhuvaneswaran, RS Bordim, JL Cui, JT Ishii, N Nakano, K Anna Univ Sch Engn & Comp Sci Madras 600025 Tamil Nadu India Japan Adv Inst Technol Sch Informat Sci Ishikawa Ken 9231292 Japan Nagoya Inst Technol Dept Intelligence & Comp Sci Nagoya Aichi 4668555 Japan

A Wireless Sensor Network (WSN, for short) is a distributed system consisting of n sensor nodes and a base station. In this paper, we propose an energy-efficient protocol to initialize the sensor nodes in a WSN, that is, to assign a unique ID to each sensor node. We show that if an upper bound a on the number n of sensor nodes is known beforehand, for any f greater than or equal to 1 and any small mu (0 < mu < 1), a WSN without collision detection capability can be initialized in O((log + (1)/(mu) log f)u(1+mu)) time slots. with probability exceeding 1 - (1)/(f) with no sensor node being awake for more than O(log (1)/(mu) + log f) time slots.

关键词： wireless sensor networks initialization protocols energy-efficient randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：