首页> 外文期刊>Networking, IEEE/ACM Transactions on >Distributed Resource Sharing in Low-Latency Wireless Ad Hoc Networks
【24h】

Distributed Resource Sharing in Low-Latency Wireless Ad Hoc Networks

机译:低延迟无线自组织网络中的分布式资源共享

获取原文

摘要

With the growing abundance of portable wireless communication devices, a challenging question that arises is whether one can efficiently harness the collective communication and computation power of these devices. In this paper, we investigate this question by studying a streaming application. Consider a network of N wireless nodes, each of power P, in which one or more nodes are interested in receiving a data stream from a fixed server node S. We ask whether distributed communication mechanisms exist to route media packets from S to the arbitrary but fixed receiver, such that 1) the average communication delay L is short, 2) the load is balanced, i.e., all nodes in the ensemble spend roughly the same amount of average power, and, more importantly, 3) power resources of all nodes are optimally shared, i.e., the lifetime of the network is comparable to an optimally designed network with L nodes whose total power is N ? P. We develop a theoretical framework for incorporation of random long range routes into wireless ad hoc networking protocols that can achieve such performance. Surprisingly, we show that wireless ad hoc routing algorithms, based on this framework, exist that can deliver this performance. The proposed solution is a randomized network structuring and packet routing framework whose communication latency is only L = O(log2 N) hops, on average, compared to O(?(N)) in nearest neighbor communications while distributing the power requirement almost equally over all nodes. Interestingly, all network formation and routing algorithms are completely decentralized, and the packets arriving at a node are routed randomly and independently, based only on the source and destination locations. The distributed nature of the algorithm allows it to be implemented within standard wireless ad hoc communication protocols and makes the proposed framework a compelling candidate for harnessing collective network resources in a truly large-scale wireless ad hoc networ-nking environment.
机译:随着便携式无线通信设备的日益丰富,出现了一个具有挑战性的问题,即人们是否可以有效地利用这些设备的集体通信和计算能力。在本文中,我们通过研究流应用程序来研究这个问题。考虑一个由N个无线节点组成的网络,每个无线节点功率P,一个或多个节点有兴趣从固定服务器节点S接收数据流。我们询问是否存在分布式通信机制来将媒体数据包从S路由到任意一个固定接收器,使得1)平均通信延迟L短,2)负载平衡,即,集合中的所有节点花费大致相同的平均功率量,更重要的是,3)所有节点的功率资源最优共享,即,网络的寿命可与具有L个节点(总功率为N)的最优设计网络相媲美。 P.我们开发了一种理论框架,用于将随机远程路由合并到可以实现这种性能的无线自组网协议中。令人惊讶的是,我们证明了基于此框架的无线自组织路由算法可以提供这种性能。所提出的解决方案是一种随机网络结构和数据包路由框架,与最近邻通信中的O(?(N))相比,其通信延迟平均平均仅为L = O(log2 N)个跃点,同时在所有节点。有趣的是,所有网络的形成和路由算法都完全分散了,到达节点的数据包仅根据源位置和目标位置被随机且独立地路由。该算法的分布式性质允许它在标准的无线ad hoc通信协议中实现,并使所提出​​的框架成为在真正大规模的无线ad hoc网络环境中利用集体网络资源的有力候选者。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号