A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink
A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink
复制标题
DOI：
10.1109/twc.2008.060727
复制
发表时间：
2008-03-01
影响因子：
10.4
通讯作者：
Georgiadis, Leonidas
中科院分区：
文献类型：
--
作者：
Gatzianas, Marios;Georgiadis, Leonidas
我们考虑一个噪声限制的无线传感器网络，由电池供电的节点，可以路由信息到一个移动的汇在多跳的方式。最大化网络生命周期的问题，定义为网络可以路由可行流的时间段。对于每个受功率/能量约束的汇点位置，被转换成线性规划，简化成更简单的等价形式，并通过对偶分解求解。未知数是汇逗留时间和每个汇位置的路由流向量。移动的汇的存在提出了新的挑战，但问题的结构仍然可以利用找到最佳的解决方案。提出了一种基于次梯度法的以汇聚点为领导节点的分布式算法，并通过随机网络的仿真对其性能进行了评估。给出了算法对内存的要求。
We consider a noise-limited wireless sensor network that consists of battery-operated nodes which can route information to a mobile sink in a multi-hop fashion. The problem of maximizing the network's lifetime, defined as the period of time during which the network can route a feasible flow. to each sink location subject to power/energy constraints, is cast into a linear program, reduced into a simpler equivalent form and solved via dual decomposition. The unknowns are the sink sojourn times and the routing flow vector for each sink location. The presence of a mobile sink presents new challenges but the problem structure can still be exploited to find the optimal solution. A distributed algorithm based on the subgradient method and using the sink as leader is proposed and its performance is evaluated through simulation for random networks. The algorithm's requirements in memory are also provided.