Lee HyungJune
Department of Computer Science and Engineering, Ewha Womans University, Seoul 120-750, Republic of Korea.
ScientificWorldJournal. 2014;2014:815123. doi: 10.1155/2014/815123. Epub 2014 Sep 1.
We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.
我们提出了一种适用于固定节点和具有预定轨迹路径及到达时间的多个移动节点的自组织传感器网络中的贪婪数据传输方案，该方案具有硬数据包截止期限。在所提出的路由策略中，沿途的每个固定自组织节点决定是将数据包中继到朝向目的地的最短路径固定节点，还是中继到将携带数据包更接近目的地的路过移动节点。我们的目标是在所选路由能够满足端到端数据包截止期限的前提下，利用移动节点来最小化总路由成本。我们基于网络级模拟，从路由成本、数据包交付率、数据包交付时间以及移动节点的可用性等方面对所提出的路由算法进行评估。模拟结果表明，我们提出的算法充分利用了直到数据包截止期限的剩余时间，将其转化为降低总体路由成本和提高数据包交付性能的网络效益。此外，我们证明了该路由方案能够保证在硬截止期限下的数据包交付，有助于改善各种网络服务中的服务质量。
