论文标题
无线地震采集的总和最大化和数据传递
Sum-Rate Maximization and Data Delivery for Wireless Seismic Acquisition
论文作者
论文摘要
传统的地震采集系统遇到了许多与遥测电缆相关的困难,这些困难被用作数据传输手段。将传统的地震采集系统转换为无线系统已被视为解决大多数这些困难的潜在解决方案。无线地震采集系统必须像大型无线传感器网络中那样满足巨大的总数据速率要求。本文考虑了无线采集系统,并研究了从地球通道到无线门户的最大可实现的传输数据速率。假定在网关节点上使用连续的干扰取消解码。我们通过优化每个网关节点的解码过程来考虑总和最大化的问题。优化搜索在每个网关上设置的最佳解码,即在每个网关上进行哪组地球管进行解码。提出了各种整数编程算法来解决最大化问题。这些优化算法是模拟的并相互比较的,与其他算法相比,ANT系统算法达到最高的计算复杂性,具有较低的计算复杂性。此外,还考虑了从网关到数据中心的数据传输。在此阶段,研究了两个具有不同缓冲尺寸的网关。对于小型缓冲区,确定并解决了两个优化问题。第一个问题考虑了网关的总功率的最小化,第二个问题考虑了网关之间的功率公平。对于大尺寸的缓冲区,解决了最大化网关加权总和的问题。
Traditional seismic acquisition systems suffer from a number of difficulties related to telemetry cables that are used as a means of data transmission. Transforming the traditional seismic acquisition system to a wireless system has been considered as a potential solution to most of these difficulties. The wireless seismic acquisition system has to serve a huge aggregate data rate requirement as is usually the case in a large wireless sensor network. This paper considers the wireless acquisition system, and studies the maximum achievable transmission data rates from the geophones to the wireless gateways. Successive interference cancellation decoding is assumed to be used at the gateway nodes. We consider the problem of sum-rate maximization by optimizing the decoding process at each gateway node. The optimization searches for optimal decoding set at each gateway, i.e. which group of geophones will be decoded at each gateway. Various integer programming algorithms are proposed for solving the maximization problem. These optimization algorithms are simulated and compared among each other, where it is shown that the ant system algorithm achieves the highest sum-rate with lower computational complexity compared to other algorithms. Furthermore, the data delivery from the gateways to the data center is also considered. In this stage, two gateways with different buffer sizes are studied. For small-size buffers, two optimization problems are identified and solved. The first problem considers the minimization of the total power of the gateways, and the second problem considers power fairness between the gateways. For large-size buffers, the problem of maximizing the weighted sum rate of the gateways is solved.