CR-MDC: A Method of Constrained Route for Avoiding Congestion of the Satellite Sensor Network for Agriculture

CR-MDC: A Method of Constrained Route for Avoiding Congestion of the Satellite Sensor Network for Agriculture
复制标题

CR-MDC:一种避免农业卫星传感器网络拥塞的约束路由方法

DOI:
10.1155/2015/679595
复制
发表时间:
2015-12
影响因子:
2.3
通讯作者:
Cheng Zijing
Cheng Zijing
中科院分区:
计算机科学4区
文献类型:
--
作者:
Zhang Yuanyuan;Wu Jing;Jiang Hao;Zhou Jianguo;Li Xiuhong;Zhu Laitao;Cheng Zijing

文献摘要

参考文献

相似文献

近年来,无线传感器网络在农业监测中得到了广泛的应用。随着社会的发展,利用卫星传感器网络进行大规模农业监测越来越受到人们的关注,同时也面临着大量农业数据的传输问题。针对卫星传感器网络在大规模农业监测中传输大量数据时网络拥塞避免的问题,提出了一种基于时延和容量度量的受限路由算法(CR-MDC)。根据网络特性,通过离散时间图对玫瑰星座网络进行建模,并考虑链路容量和链路时延等时变参数,将该方案转化为二进制整数规划问题。的约束路由算法的性能进行了比较与现有文献中提出的基于Dijkstra的路由协议。此外,一个改进的CR-MDC下的路由相似性约束,以减少在相邻时隙的切换次数。仿真结果表明,与基于Dijkstra的路由算法相比,改进的CR-MDC具有更低的阻塞率和最大链路利用率,但平均网络延迟更高,同时具有更高的路由相似性。
In recent years, wireless sensor networks have been widely employed in monitoring agriculture. With social development, large-scale agriculture monitoring by satellite sensor network attracts increasing concerns as well as the transmission problem of plentiful agriculture data. In this paper, we propose a new method of constrained route based on the metric of delay and capacity (CR-MDC) to find route path in satellite sensor network, with the aim of achieving congestion avoidance of network for transferring a large amount of data while monitoring large-scale agriculture. We model the rosette constellation network according to network characteristics through a discrete-time figure and formulate the scheme as a binary integer programming problem in consideration of time-variant parameters, for example, link capacity and link delay. The performance of the constrained route algorithm is compared with the Dijkstra-based routing protocols proposed in existing literature. Moreover, an improved CR-MDC under a route similarity constraint is developed to reduce the handoff times in adjacent slots. Simulation results show that the proposed scheme exhibits lower blocking probability and maximum link utilization but higher average network delay than Dijkstra-based routing while the improved CR-MDC has a higher route similarity than CR-MDC.
DOI: --
发表时间: 2006-03
期刊: --
影响因子: --
作者:
M. Radenkovic;B. Wietrzyk
通讯作者: M. Radenkovic;B. Wietrzyk
DOI: 10.1016/j.rse.2005.09.007
发表时间: 2006-01-15
影响因子: 13.5
作者:
Sakamoto, T;Nguyen, NV;Yokozawa, M
通讯作者: Yokozawa, M
DOI: 10.1109/49.634801
发表时间: 1997-10-01
影响因子: 16.4
作者:
Werner, M
通讯作者: Werner, M
DOI: --
发表时间: 2010
期刊: --
影响因子: --
作者:
Tang Huajun;Wu Wenbin;Yang Peng;Zhou Qingbo;Chen Zhongxin
通讯作者: Tang Huajun;Wu Wenbin;Yang Peng;Zhou Qingbo;Chen Zhongxin
DOI: 10.1080/15501320701810297
发表时间: 2008-01
影响因子: 2.3
作者:
S. Iyengar;R. Brooks;G. Karjoth
通讯作者: S. Iyengar;R. Brooks;G. Karjoth