• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >An energy-efficient permutation routing protocol for single-hop radio networks
【24h】

An energy-efficient permutation routing protocol for single-hop radio networks

机译：单跳无线网络的节能置换路由协议

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A radio network (RN) is a distributed system where each station or node is a small hand-held commodity device called a station. Typically, each station has access to a few channels for transmitting and receiving messages. By RN(p, k), we denote a radio network with p stations, where each station has access to k channels. In a single-hop RN, every station is within the transmission range of every other station. Each station consumes power while transmitting or receiving a message, even when it receives a message that is not destined for it. It is extremely important that the stations consume power only when it is necessary since it is not possible to recharge batteries when the stations are on a mission. We are interested in designing an energy-efficient protocol for permutation routing, which is one of the most fundamental problems in any distributed system. An instance of the permutation routing problem involves p stations of an RN, each storing n/p items. Each item has a unique destination address which is the identity of the destination station to which the item should be sent. The goal is to route all the items to their destinations while consuming as little energy as possible. We show that the permutation routing problem of n packets on an RN(p, k) can be solved in 2n/k+(p/k)/sup 2/+p+2k/sup 2/ slots and each station needs to be awake for at most 6n/p+2p/k+8k slots. When k/spl Lt/p/spl Lt, our protocol is more efficient, both in terms of total number of slots and the number of slots each station is awake compared to a previously published protocol by Nakano et al. (2001).
机译：无线电网络（RN）是一个分布式系统，其中每个站点或节点都是称为站点的小型手持式商品设备。通常，每个站都可以访问几个信道来发送和接收消息。通过RN（p，k），我们表示具有p个站点的无线电网络，其中每个站点都可以访问k个信道。在单跳RN中，每个站都在每个其他站的传输范围内。每个工作站在发送或接收消息时都会消耗功率，即使它接收到的消息不是发给它的。极为重要的是，工作站仅在必要时才消耗功率，因为​​在工作站执行任务时无法为电池充电。我们对设计用于置换路由的节能协议很感兴趣，这是任何分布式系统中最基本的问题之一。置换路由问题的一个实例涉及RN的p个站点，每个站点存储n / p个项。每个项目都有一个唯一的目标地址，该地址是该项目应发送到的目标站点的标识。目标是将所有物品路由到目的地，同时消耗尽可能少的能量。我们表明，可以在2n / k +（p / k）/ sup 2 / + p + 2k / sup 2 /时隙中解决RN（p，k）上n个数据包的置换路由问题，并且每个站点都必须清醒最多6n / p + 2p / k + 8k个插槽。当k / spl Lt / p / spl Lt / n时，与Nakano等人先前发布的协议相比，我们的协议在时隙总数和每个站点的时隙数量均清醒方面更为有效。 （2001）。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号