文章目录

一、理论基础1、节点覆盖模型2、布谷鸟搜索算法(CS)二、仿真实验与结果分析三、参考文献

一、理论基础

1、节点覆盖模型

本文采取0/1覆盖模型，具体描述请参考这里。

2、布谷鸟搜索算法(CS)

请参考这里。

二、仿真实验与结果分析

①设监测区域为50m×50m50 m×50 m50m×50m的二维平面，传感器节点个数N=35N=35N=35，其感知半径是Rs=5mR_s=5mRs​=5m，通信半径Rc=10mR_c=10mRc​=10m，迭代500次。初始部署、CS优化覆盖、CS算法覆盖率进化曲线如下图所示。

初始部署和最终部署的节点位置及对应的覆盖率分别为：

初始位置：7.880721.937242.03598.109121.570739.012646.469315.555148.15441.52732.980347.581532.238221.144325.90268.793722.936320.22936.81725.721230.628327.614647.396727.951645.606631.553527.47739.46825.48784.92977.718537.96641.026831.559431.36736.893417.72675.394435.678714.075129.32215.18311.077820.336313.764325.768441.331518.00160.9810547.095912.178735.297513.740633.61359.65231.01326.231945.405140.449548.193530.76630.4323831.66679.67177.195426.930131.140111.480119.953830.9908初始覆盖率：0.68704最优位置：28.46239.00633.891326.428228.173413.865822.3199.402812.195630.161528.31332.306928.485422.316546.01593.869218.917337.645443.297518.263219.984929.61499.19818.163440.127938.122637.99039.03613.169811.149228.91184.058446.616411.843836.69883.64146.506624.322745.457933.317835.766526.574447.685643.057438.142832.657335.80544.057524.206745.918420.08519.04443.346811.444720.33742.300710.63713.19636.134618.012442.913749.212944.73644.805615.413344.14715.415746.04545.281636.2949最优覆盖率：0.86621

②设监测区域为20m×20m20 m×20 m20m×20m的二维平面，传感器节点个数N=24N=24N=24，其感知半径是Rs=2.5mR_s=2.5mRs​=2.5m，通信半径Rc=5mR_c=5mRc​=5m，迭代500次。初始部署、CS优化覆盖、CS算法覆盖率进化曲线如下图所示。

初始部署和最终部署的节点位置及对应的覆盖率分别为：

初始位置：5.880913.596517.521417.09695.10713.56516.63283.24279.78312.887611.151319.626312.39993.15936.662116.97974.239811.608511.457512.57030.9298114.63773.5516.461119.375610.17260.8195710.80412.192612.931715.45811.569610.32222.172512.924115.778214.25646.88512.1125.40878.648810.30522.267413.55118.54726.14983.2347.5867初始覆盖率：0.71882最优位置：10.849.06315.80187.16031.34478.60425.502414.69558.822418.36171.1970.6034610.12515.810714.32914.81654.33661.15016.08847.96713.1754.71669.55115.864317.81962.04520.891099.52588.89843.6775.543911.66782.06221.69417.3463.972219.14497.130212.554416.227912.04711.2613.132714.199517.223518.099最优覆盖率：0.89342

③设监测区域为100m×100m100 m×100 m100m×100m的二维平面，传感器节点个数N=40N=40N=40，其感知半径是Rs=10mR_s=10mRs​=10m，通信半径Rc=20mR_c=20mRc​=20m，迭代500次。初始部署、CS优化覆盖、CS算法覆盖率进化曲线如下图所示。

初始部署和最终部署的节点位置及对应的覆盖率分别为：

初始位置：1.036274.413920.050127.850462.879222.87941.645450.063528.400987.023973.240572.048744.768335.72230.4509819.269633.98672.080390.894983.278617.069376.559680.447666.26539.726446.333714.387643.488521.059933.52622.123636.838323.275165.086221.92260.8267164.663177.029391.174590.535229.232837.186895.838460.479579.51348.636253.893115.033791.381928.676190.975811.197461.86869.479541.866365.12448.495992.930518.740854.122272.000855.846865.360316.750490.865415.128674.785728.684296.28849.641756.73165.692687.049233.311770.021850.402119.223290.82848.288591.4553初始覆盖率：0.75777最优位置：50.35829.492222.186544.508390.232575.911857.0987.249192.033691.763744.879520.13035.794924.077858.437991.461492.856440.117519.642637.245981.356330.338218.457857.192423.630282.919473.034292.181736.749636.549328.654175.343567.250652.884275.12657.980683.57148.512522.688994.83989.093995.283163.784741.059148.513771.359529.062771.844777.149869.99526.54816.68417.06180.395171.57380.32342.130846.751412.31187.00440.944489.952695.248461.54267.570865.021563.183872.586924.466825.886435.61155.989552.173950.966867.705523.589343.143610.571692.041913.8847最优覆盖率：0.92383

实验结果表明，CS算法实现了较高的网络覆盖率，节点分布更加均匀，覆盖盲区和感知范围重叠区面积更少，可以验证CS算法的有效性。

三、参考文献

[1] Yang XS, Deb S. Engineering optimisation by cuckoo search[J]. International Journal of Mathematical Modelling & Numerical Optimisation, , 1(4): 330-343.