无线Ad Hoc网络中的SPAIDS和OAMS模型
SPAIDS and OAMS Models in Wireless Ad Hoc Networks
摘要：
在本文中，我们提出了两个随机分布式算法在无线adhoc网络。我们认为网络是由一对节点（发送者，接收者）在一个衰减空间中构成的。我们考虑到：每个节点都有自己的功率分配，它们之间的距离不遵循对称性。然后，我们考虑一个非均匀网络或一个现实的无线网络，这是超越几何。我们的模型是基于信号干扰噪声比（SINR）模型。在这项工作中，主要的问题是解决调度任务，旨在成功地在现实环境中的消息传输。因此，我们提出了第一个在衰减空间中的随机调度和功率选择算法，称为SPAIDS。为了解决这种非均匀网络中的问题，我们引入了一种新的方法来研究链路之间的影响（干扰），它被定义为加权平均影响（WAFF）。此外，我们研究了度量空间中的在线广播问题，其中节点被激活的情况下，他们收到的数据包。我们提出了一个在线算法在度量空间，这是表示为OAMS。我们的目标是获得最大子集的节点，接收消息的发送节点有足够的能量供应。最后，我们比较了OAMS的性能最优。
英文摘要：
In this paper, we present two randomized distributed algorithms in wireless ad hoc networks. We consider that the network is structured into pairs of nodes (sender, receiver) in a decay space. We take into account the following: Each node has its own power assignment and the distance between them does not follow the symmetry property. Then, we consider a non-uniform network or a realistic wireless network, which is beyond the geometry. Our model is based on the Signal to Interference plus Noise Ratio (SINR) model. In this work, the main problem is to solve the scheduling task aiming the successful transmission of messages in a realistic environment. Therefore, we propose the first randomized scheduling and power selection algorithm in a decay space and is called as SPAIDS. In order to solve the problem in this non-uniform network, we introduce a new way to study the affectance (the interference) among the links, which is defined as Weighted Average Affectance (WAFF). Moreover, we study the online broadcast problem in a metric space, in which the nodes are activated in case that they receive packets. We propose an online algorithm in a metric space which is denoted as OAMS. Our aim is to obtain the maximum subset of nodes that receive the message from a sender node with enough energy supplies. Finally, we compare the performance of OAMS to the optimal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
