基于协作传输的群智能无线传感器网节点部署研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
无线传感器网络(Wireless Sensor Networks,WSN)是目前科研领域的热点研究方向,被广泛应用于各个领域但带来信息传输数量和质量的巨大压力。研究人员提出一种协作传输技术(Cooperative Transmission, CT),利用携带单天线的无线网络节点组建虚拟MIMO(Multiple Input Multiple Output)系统获得空间分集增益,扩大无线网络的覆盖范围以减轻该压力。该理论在通讯、控制等领域得到了广泛关注,但在利用节点数量有限的无线传感器网络完成长距离数据传输或在指定位置进行远距离信息采集等类似的研究较少,且不利于实际应用,没有将协作传输的扩展覆盖范围特性应用到多跳无线传感器网络中。
     本课题“基于协作传输的群智能无线传感器网节点部署研究”,在对协作传输以及无线传感器网络研究基础上,分析两者结合带来的增益效果,寻找最佳部署方案,提出利用仅携带单天线能量充足的数量固定类似基站的特殊节点,应用协作传输技术组建在直线上可以获得最远传输距离的无线传感器网络,以充分利用有限节点完成数据传输任务。针对不同场合不同需求下的数据传输任务,研究并改进了多种智能优化算法以提高节点部署的计算精度减少计算时间,并提出了相应的节点部署策略。在灾后信息获取、结构健康监测、作战单元信息传递、个域网构建等领域具有重要应用。本文的主要研究工作如下:
     针对固定节点数目的线形无线传感器网络节点部署问题,提出利用协作传输理论构建自动解码转发(Auto Decode and Forward,ADF)节点部署模型,利用最大比合并(Maximal Ratio Combining,MRC)方法合并多径信号,用解码转发协议对中继信号进行译码转发,以实现协作传输技术在无线传感器网络上应用并获得传输距离的扩展。实验表明,与非协作传输方法DET-CA相比,ADF节点部署模型可以获得更远的传输距离,覆盖距离增大。为了避免出现节点不能译码导致不工作的情况,提出数据共享解码转发(Message SharingDecode and Forward,MS-DF)协作模型,该方法在同一簇内节点进行数据共享,所有无线传感器网络节点全部工作,增大网络的分集增益。实验表明,MS-DF模型有效可行,与ADF协作模型相比,在保证信号传输质量前提下,极大地提高了无线传感器网络的直线传输距离。以5节点为例,比DET-CA传输距离增长5%-54%。
     针对协作传输MS-DF节点部署模型无法常规求解问题,提出改进的蚁群优化算法来寻找模型最优解。该方法使用离散分段方式改进蚁群算法的启发函数,提出引入丛林法则加大信息素更新量,提出融合贪婪算法到禁忌列表(tabulist)更新原则加快算法收敛速度,逐步获得最优解。实验表明,改进的蚁群方法可以有效收敛,并且获得最优解,适用于要求计算结果误差小,但对计算时间要求不高的环境。仿真实验表明,7节点时蚁群算法种群数量是10,迭代次数100次时结果误差仅为0.07%,验证了该算法的可行性和有效性,可以应用于优化求解协作传输节点部署模型。
     针对要求无线传感器网络节点部署计算时间短但对计算结果误差要求不高的部署问题。提出应用萤火虫群优化算法,通过改进萤火虫移动函数和启发因子以适应协作模型求解问题需要,改进决策半径更新函数和步进函数加快算法的收敛速度,避免局部最优以及极值震荡问题,利用算法的多维并发计算优势减少计算时间获得最优解。实验表明,在保证最优值稳定收敛情况下,改进萤火虫群优化算法可以有效地减少计算时间,以13节点为例,萤火虫算法耗时仅是蚁群算法的30%。适合应用于要求计算时间短的场合。
     针对具有大量节点的无线传感器网络的节点部署问题,提出了基于协作传输技术的等数目节点簇,簇间距相等的节点部署方案。该方案分别基于MS-DF协作模型和满分集增益的协作传输模型,每簇节点数目相同,每簇节点中心间距离相等,两种方法均具有网络结构简单、部署速度快的优点,实验结果表明,可以有效地进行大量节点的快速部署。
Wireless Sensor Networks (WSN) is a hot research pot in science and technologywhich has been applied in different fields, and caused great pressure to dataacquasion and transmission. In order to reduce the pressure, reserachers proposedcooperative transmission (CT) technology, which is virtual distributed multiple-input-multiple-output (MIMO) system in the diversity configuration with only oneantenna in every node to expand the coverage area. It is widely concered in thecommunication and control area. There is not enough research on the long distancedata transmission by limit number of nodes or data acquasion where is far awayfrom the source node, and which is not suitable to practical application. There is noapplication by using the range expansion of CT to WSN.
     In this dissertation of “Research on swarm intelligent wireless sensor networknodes deployment based on cooperative transmission”, the cooperative transmissiontheory and WSN is researched and analyzed to see the gain by combining the twotheories, to find the optimal deployment method. This dissertation proposed to usethe fixed number of mobile wireless sensor network nodes which has only oneantenna in every node and enough energy like a base station to get the maximumrange expansion along an appointed line by combining the CT technology. Everynode in the network would work very well without waste. Aiming at problem toapply this model to different environments, this dissertation compared and improveddifferent optimization algorithms to reduce time cost and improve the precision, andgive some rules for nodes deployment. There are some applications for thisstraight-line deployment such as disaster area data acquisition, structure healthmonitoring, communication between combat units, and personal area network, et al.The main research contents of this dissertation is as follows:
     Aiming at the problem that build WSN nodes deployment model with fixednumber of nodes based on CT technology. This dissertation proposed ADF (AutoDecode and Forward) model by using the MRC (Maximal Ratio Combining) methodto combine the copies in each orthogonal channel and use decode and forwardprotocol to receive and retransmit the signals, and to realize the maximum rangeexpansion of WSN. The simulation results show that the ADF model is useful andeffective to get longer end-to-end distance. In order to avoid no decode and not workof any node, this dissertation proposed the MS-DF (Message Sharing Decode andForward) model. This novel model supposed the message sharing of all the nodes inthe same cluster, and then forward to the next hop which could avoid the waste ofnodes in the network and improve the gain of the network. Simulation results show that comparing between MS-DF and ADF models, the MS-DF model great improvesthe range expansion under the same constraint of transmission quality requirement.Take5nodes as an example, the transmission distance of MS-DF is longer thanDET-DA5%to54%.
     Aiming at the problem that there is no solution of the MS-DF model by traditionalmethod. This dissertation proposed the improved ant colony algorithm (IACA) toget the optimal result of the CT models. IACA improved the heuristic function bydiscreting segements of the distance; proposed novel pheromone update rule basedon the law of jungle, proposed the novel tabu list combined the greedy algorithm, toget the optimal results systematically. Simulation results show that the IACA isconvergent, useful and effective, which is suitable for the application requirement ofhigh precision but do not care about time cost. Take7nodes as an example, whilethe ant number is10, the iteration times is100, the inaccuracy is only0.07%, whichprove the IACA is useful to get the optimal result of CT model.
     Aiming at application requirement of short time cost but do not care much aboutprecision. This dissertation proposed the improved glowworm swarm optimization(IGSO) algorithm to solve this problem, which improved the glowworms’ movementprobability function and heuristic factor to adapt to the CT model, improved thelocal-decision range and movement direction function to increase the algorithmconvergent speed and avoid the extremum value shock. By using the advantage ofparallel computing to reduce the calculation time cost. Simulation results show thatIGSO algorithm is useful and effective to reduce the cost time under the constraintof the algorithm is convergent to the optimal result. Take13nodes as an example,the IGSO cost only30%of IACA to solve the model, which is more suitable to theapplication of short time cost.
     Aiming at the problem that build the deployment model of big number of WSNnodes based on CT technology, this dissertation proposed two deployment methodsbased on the same number of nodes in every cluster and same distance between twoneighbor clusters. This dissertation proposed the two methods based on the MS-DFmodel and full diversity gain theory, separately. The simulation results show that thetwo methods are both useful and effective, with the advantage of simple topology,which could deploy a big number of nodes quickly.
引文
[1]张玫,邹钊鹏,诸刚.机器人技术[M].机械工业出版社,2011:1-57.
    [2]陈雯柏.无线传感器网络中MIMO通信与移动机器人控制的算法研究[D].北京邮电大学,2011:1-28,36-53.
    [3]车楠.无线传感器网络环境中节点布置问题研究[D].哈尔滨工业大学,2012:1-21.
    [4]崔益安.多机器人协同覆盖技术研究[D].中南大学,2008:1-11.
    [5] Mei Y, Lu Y H, Hu Y C, et al. A Case Study of Mobile Robot’s EnergyConsumption and Conservation Techniques[C]. Proceedings of12thInternational Conference on Advanced Robotics,2005:492-497.
    [6] Chang J Y, Lin Y S. A Clustering Deployment Scheme for Base Stations andRelay Stations in Multi-hop Relay Networks[J]. Computers and ElectricalEngineering,2014,40:407-420.
    [7]黄丘林,史小卫. MIMO系统中分集增益和空间复用增益的折衷关系[J].电子与信息学报,2007(3):681-685.
    [8]方朝曦.无线通信系统中的协同传输技术研究[D].复旦大学,2009:6-31.
    [9]赵绍刚,李岳梦.移动通信网络中的协作通信[J].移动通信,2005(4):91-94.
    [10] Sendonaris, Erkip E, Aazhang B. User Cooperation Diversity. Part I. SystemDescription[J]. IEEE Transactions on Communications.2003,51(11):1927-1938.
    [11] Sendonaris, Erkip E, Aazhang B. User Cooperation Diversity. Part II.Implementation Aspects and Performance Analysis[J]. IEEE Transactions onCommunications.2003,51(11):1939-1948.
    [12] Laneman J N,Wornell G W,Tse D N C. An Efficient Protocol for RealizingCooperative Diversity in Wireless Networks[J],Proc. IEEE SIT,Washington,DC, June2001:294.
    [13] Laneman J N,Tse D N C,Wornell G W. Cooperative Diversity in WirelessNetworks: Efficient Protocols and Outage Behavior[J]. IEEE Transactions onInformation Theory,2004,50(12):3062-3080.
    [14] Alamouti S. A Simple Transmit Diversity Technique for WirelessCommunications[J]. IEEE Journal on Selected Areas in Communications,1998,16(8):1451-1458.
    [15] Jiao H Z, Ingram M A, Li F Y. A Cooperative Lifetime Extension MACProtocol in Duty Cycle Enabled Wireless Sensor Networks[C].2011MilitrayCommunication Conference,2011:896-901.
    [16] Lin J, Ingram M A. SCT-MAC: A Scheduling Duty Cycle MAC Protocol forCooperative Wireless Sensor Network[C].2012IEEE International Conferenceon Communications (ICC),2012:345-349.
    [17] Hassan S A, Ingram M A. A Stochastic Approach in Modeling CooperativeLine Networks[C].2011IEEE Wireless Communications and NetworkingConference (WCNC),2011:1322-1327.
    [18] Hassan S A, Ingram M A. A Quasi-Stationary Markov Chain Model of aCooperative Multi-Hop Linear Network[J]. IEEE Transactions on WirelessCommunications,2011,10(7):2306-2315.
    [19] Kailas A, Ingram M A. Analysis of a Simple Recruiting Method forCooperative Routes and Strip Networks[J]. IEEE Transactions on WirelessCommunications,2010,9(8):2415-2419.
    [20] Liu Q J, Ma X L, Zhou G T. A General Diversity Gain Function and ItsApplication in Amplify-and-Forward Cooperative Networks[J]. IEEETransactions on Signal Processing,2011,59(2):859-863.
    [21] Jin W J, Ingram M A. Lifetime Optimization of Multi-hop Wireless SensorNetworks by Regulating the Frequency of Use of Cooperative Transmission[C].2011Military Communications Conference,2011:878-883.
    [22] Jin W J, Ingram M A. Residual-Energy-Activated Cooperative Transmission(REACT)to Avoid the Energy Hole[C].2010IEEE International Conferenceon Communications Workshops (ICC),2010:1-5.
    [23] Jung H, Jun C Y, Ingram M A. Experimental Range Extension of ConcurrentCooperative Transmission in Indoor Environments at2.4GHz[C].2010MilitaryCommunications Conference,2010:148-153.
    [24] Nguyen V, Ingram M A. Cooperative Transmission Range Doubling with IEEE802.15.4[C]. Proceedings of2012IEEE International Conference onCommunications, Ottawa, CA, June,2012:126-130.
    [25] Hasannejad M, Mehrani M, Shanbehzadeh J, et al. A New Method in Coveragefor Wireless Sensor Networks[C].2010Sixth Advanced InternationalConference on Telecommunications (AICT),2010:434-438.
    [26] Himsoon T, W. Siriwongpairat P, Han Z, et al. Lifetime Maximization viaCooperative Nodes and Relay Deployment in Wireless Networks[J]. IEEEJournal on Selected Areas in Communications,2007,25(2):306-317.
    [27] Adinoyi, Yanikomeroglu H. Cooperative Relaying in Multi-antenna FixedRelay Networks[J]. IEEE Transactions on Wireless Communications,2007,6(2):533-544.
    [28] Bradford G J, Laneman J N. An Experimental Framework for the Evaluation ofCooperative Diversity[C].43rd Annual Conference on Information Sciencesand Systems, CISS2009:641-645.
    [29] Sirkeci-Mergen, Scaglione A, Mergen G. Asymptotic Analysis of MultistageCooperative Broadcast in Wireless Networks[J]. IEEE Transactions onInformation Theory,2006,52(6):2531-2550.
    [30]陈前斌,张洁,唐伦.采用TAS/MRC技术的MIMO中继系统中断概率分析[J].北京邮电大学学报,2010(06):38-42.
    [31]胡钰林.多节点协作通信系统中的节点规划和调度[D].中国科学技术大学,2011:1-23.
    [32] Xu P, Dai X C, Ding Z G, Krikidis I, Leung K K. Approaching MISO UpperBound: Design of New Wireless Cooperative Transmission Protocols[J]. IEEETransactions on Wireless Communications,2011,10(8):2725-2737.
    [33]李洪星.无线协作通信中的关键技术研究[D].上海交通大学,2010:1-27.
    [34]施玉晨.无线中继系统中的编码与协作传输技术研究[D].西安电子科技大学,2012:3-26.
    [35]韩昌彩.多天线与协作中继网络中的传输技术研究[D].北京邮电大学,2009:6-35.
    [36]陈坤.协作通信中的链路自适应传输技术[D].北京邮电大学,2009:1-10.
    [37] Huang J, Wang Y, Wu T, et al. On the Energy Efficiency of MIMO CooperativeRelaying Networks[J]. The Journal of China Universities of Posts andTelecommunications,2009, April,16(2):14-19.
    [38] Zhao H T, Emiliano G P, Wei J B, et al. Capacity and Resource Allocation ofCooperative MIMO in Ad Hoc Networks[J]. Physical Communication,2011,4:98-110.
    [39] Himsoon T, Siriwongpairat W P, Zhu H, et al. Lifetime Maximization byCooperative Sensor and Relay Deployment in Wireless Sensor Networks[C].2006IEEE Wireless Communications and Networking Conference, WCNC2006:439-444.
    [40] Gassandras C G, Li W. Sensor Network and Cooperative Control[J], EuropeanJournal of Control,2005,11:436-463.
    [41]李向一.基于协作分集的无线传感器网络高能效传输技术研究[D].北京邮电大学,2013:1-20.
    [42] Sze K C, New A P, Rekleitis I. Distributed Coverage with Multi-robotSystem[C]. Proceedings of2006IEEE International Conference on Roboticsand Automation, ICRA2006:2423-2429.
    [43] Antonelli G, Arrichiello F, Chiaverini S, et al. A Self-configuring MANET forCoverage Area Adaptation through Kinematic Control of a Platoon of MobileRobots[C]. Intelligent Robots and Systems, IROS2005:1332-1337.
    [44] Arguedas M, Perez C, Carvalho M, et al. A Directed Expansion TopologyControl Algorithm for mobile Ad-Hoc networks[C].2010MilitrayCommunications Conference, MILCOM2010:1417-1422.
    [45]刘强.无线传感器网络组网关键技术研究[D].电子科技大学,2012:1-17.
    [46] Zou Y, Chakrabarty K. Sensor Deployment and Target Localization based onVirtual Forces. Proceedings of the2003IEEE INFOCOM New York, USA,2003:1293-1303.
    [47] Mansourkie Fatemeh,Ahmed Mohamed Hossam. Minimizing the probability ofcollision in wireless sensor networks using cooperative diversity and optimalpower allocation[C], IWCMC2013:120-124.
    [48] Muelen E V D. Three-terminal Communication Channels[J], Adv. Appl. Prob.,1971(3):120-154.
    [49] Liu K J R, Sadek A K, Su W F,等.协作通信及网络[M].任品毅,廖学文,高贞贞,等,译.第一版,北京,电子工业出版社,2010:3-5.
    [50] Liu K J R, Sadek A K, Su W F, et al. Cooperative Communication andNetworking[M]. Cambridge,2009:29-31.
    [51] Cover T, Gamal A E. Capacity Theorems for the Relay Channel[J]. IEEETransactions on Information Theory,1979,25(5):572-584.
    [52] Jiao H Z, Brunelli D, Li F Y. A Cooperative Lifetime Extension MAC Protocolin Duty Cycle enabled Wireless Sensor Networks[C].2011MilitrayCommunications conference,2011:896-901.
    [53]褚御芝,郑宝玉.认知无线网络中基于最佳中继选择的协作传输策略[J].仪器仪表学报,2011(3):520-526.
    [54] Zhang J C, Song C, Sharif H, Alahmad M. A Battery-Aware DeploymentScheme for Cooperative Wireless Sensor Networks[C].2009IEEE GlobalTelecommunications Conference, GLOBECOM2009:1-5.
    [55] Zhu H, Sun Y L, Shi H Y. Cooperative Transmission for Underwater AcousticCommunications[C].2008IEEE International Conference on Communications,ICC2008:2028-2032.
    [56] Howard A, Mataric M J, Sukhatme G S An Incremental Self-DeploymentAlgorithm for Mobile Sensor Networks[J], Autonomous Robots, Special Issueon Intelligent Systems,2002:113-126.
    [57]高伟东,王文博,袁广翔,等.协作通信中的中继节点选取和功率分配联合优化[J].北京邮电大学学报,2008(02):68-71.
    [58]啜钢.基于两跳协作通信系统中断概率和功率分配的研究[D].北京邮电大学,2010:2-59.
    [59]张书奎,樊建席,崔志明.无线传感器网络中可靠的数据协作传输机制[J].通信学报,2010(11):30-40.
    [60]郭辉.基于协作分集的无线通信技术研究[D].西安电子科技大学,2012:1-25.
    [61] Sun Z, Akyildiz I F, Hancke G P. Capacity and Outage Analysis of MIMO andCooperative Communication Systems in Underground Tunnels[J]. IEEETransactions on Wireless Communications,2011,10(11):3793-3803.
    [62] Proakis J G. Digital Communications[M],4thed. McGraw-Hill, Inc.,2001:20-255.
    [63] Sadek K, Zhu H, Liu K J R. Distributed Relay-Assignment Protocols forCoverage Expansion in Cooperative Wireless Networks[J]. IEEE Transactionson Mobile Computing,2010,9(4):505-515.
    [64] Garcia D, Sakaguchi K, Araki K. Cell Planning for CooperativeTransmission[C].2008IEEE Wireless Communications and NetworkingConference, IEEE WCNC2008:1769-1774.
    [65] Jacobson K R, Krzymien W A. Cooperative vs Multihop Relaying in CellularSystems[C]. IEEE20th International Symposium on Personal, Indoor, andMobile Radio Communications,2009:1853-1857.
    [66] Sadek K, Zhu H, Liu K J R. Multi-node Cooperative Resource Allocation toImprove Coverage Area in Wireless Networks[C].2005IEEE GlobalTelecommunications Conference, GLOBECOM2005:3055-3062.
    [67] Sirkeci-Mersen, A. Scaglione. A Continuum Approach to Dense WirelessNetworks with Cooperation[C]. INFOCOM2005.24th Annual JointConference of the IEEE Computer and Communications Societies. ProceedingsIEEE2005:2755-2763.
    [68] Aksu, Ercetin O. Reliable Multi-hop Routing with Cooperative Transmissionsin Energy Constrained Networks[J]. IEEE Transactions on WirelessCommunications,2008,7(8):2861-2865.
    [69] Gui B, Lin D, Cimini L J. Routing Strategies in Multihop CooperativeNetworks[J]. IEEE Transactions on Wireless Communications,2009,8(2):843-855.
    [70] Gueguen, Rachedi A, Guizani M. Incentive Scheduler Algorithm forCooperation and Coverage Extension in Wireless Networks[J]. IEEETransactions on Vehicular Technology,2013,62(2):797-808.
    [71]刘冬燕. n个球放入m个盒子的几种情形讨论[J].中国科技信息,2010(2):234-235.
    [72]沈春林.分球入盒问题的探讨[J].数学通讯,2012(3):46-48.
    [73] Ozgur A, Johari R, Tse D N C. Information Theoretic Operating Regimes ofLarge Wireless Networks[J], IEEE Transactions on Information Theory, Jan,2010,56(1):427-437.
    [74] Zhang X D, Beaulieu N C. Outage and Error Rate of Cellular Systems UsingMRC in the Presence of Multiple Interferers and Correlated RayleighFading[C].2006IEEE Global Telecommunications Conference, IEEEGLOBECOM2006:1-6.
    [75] Ozgur A, Johari R, Tse D N C, et al. Information-Theoretic Operating Regimesof Large Wireless Networks[J], Proceeding of IEEE Transaction on InformationTheory, JAN2010:427-437.
    [76] Hussin M S, Stutzle T. Tabu Search vs. Simulated Annealing as a Function ofthe Size of Quadratic Assignment Problem Instances[J]. Computers&Operations Research,2014,43:286-291.
    [77] Ahonen H, Alvrenga A G D, Amaral A R S. Simulated Annealing and TabuSearch Approaches for the Corridor Allocation Problem[J]. European Journal ofOperational Research,2014,232:221-233.
    [78] Lin S W, Yu V F. Multi-start Simulated Annealing Heuristic for the LocationRouting Problem with Simultaneous Pickup and Delivery[J]. Applied SoftComputing,2014, http://dx.doi.org/10.1016/j.asoc.2014.06.024.
    [79] Yuan J G, He C W, Gao W C, et al. A Novel Hard Decision Decoding Schemebased on Genetic Algorithmand Neural Network[J]. Optik,2014,125:3457-3461.
    [80] Blum C,Merkle D著,龙飞译.群智能[M].国防工业出版社,2011:1-232.
    [81] Kennedy J, Eberhart R. Particle Swarm Optimization[C]. Proceedings of1995IEEE International Conference on Neural Networks,1995:1942-1948.
    [82] Li P W, Zhao J. Intelligent Single Particle Optimization and Particle SwarmOptimization Fusion Algorithm[J]. International Journal of AppliedMathematics and Statistics,2013,45:395-403.
    [83] Lee K B, Kim J H, Multiobjective Particle Swarm Optimization withPreference-Based Sort and its Application to Path Following FootstepOptimization for Humanoid Robots[J]. IEEE Transactions on EvolutionaryComputation,2013,17(6):755-766.
    [84] Fu Y G, Ding M Y, Zhou C P, et al. Route Planning for Unmanned AerialVehicle (UAV) on the Sea Using Hybrid Differential Evolution andQuantum-Behaved Particle Swarm Optimization[J]. IEEE Transactions onSystems, Man, and Cybernetics: Systems,2013,43(6):1451-1465.
    [85] Durand F R, Abrao T. Energy-Efficient Power Allocation for WDM/OCDMNetworks With Particle Swarm Optimization[J]. IEEE/OSA Journal of OpticalCommunications and Networking,2013,5(5):512-523.
    [86] Wang L, Yang B, Chen Y H. Improving Particle Swarm Optimization UsingMulti-layer Searching Strategy[J]. Information Sciences,2014,274:70-94.
    [87] Devi S, Geethanjali M. Optimal Location and Sizing of Distribution StaticSynchronous Series Compensator using Particle Swarm Optimization[J].Electrical Power and Energy Systems,2014,62:646-653.
    [88] Zhang J H, Gong D W, Zhang Y. A Niching PSO-based Multi-robotCooperation Method for Localizing Odor Sources. Neurocomputing[J],2014,123:308-317.
    [89] Kuila P, Jana P K. Energy Efficient Clustering and Routing Algorithms forWireless Sensor Networks: Particle Swarm Optimization Approach[J].Engineering Applications of Artificial Intelligence,2014,33:127-140.
    [90] Kechagiopoulos P N, Beligiannis G N. Solving the Urban Transit RoutingProblem Using a Particle Swarm Optimization based Algorithm[J]. AppliedSoft Computing,2014,21:654-676.
    [91] Hu M Q, Wu T, Weir J D. An Adaptive Particle Swarm Optimization withMultiple Adaptive Methods[J]. IEEE Transactions on EvolutionaryComputation,2013, October,17(5):705-720.
    [92]彭喜元,彭宇,戴毓丰.群智能理论及应用[J].电子学报,2003(S1):1982-1988.
    [93]柳长安,鄢小虎,刘春阳,等.基于改进蚁群算法的移动机器人动态路径规划方法[J].电子学报,2011(5):1220-1224.
    [94]马建华,房勇,袁杰.多车场多车型最快完成车辆路径问题的变异蚁群算法[J].系统工程理论与实践,2011(08):1508-1516.
    [95] Dorigo M, Maniezzo V, Colorni A. Ant System: Optimization by a Colony ofCooperating Agents[J]. IEEE Transactions on Systems, Man, and Cybernetics,Part B: Cybernetics,1996,26(1):29-41.
    [96] Dorigo M, Caro G D. Ant Colony Optimization: a New Meta-heuristic[C].Proceedings of the1999Congress on Evolutionary Computation, CEC1999:1472-1477.
    [97]刘波.蚁群算法改进及应用研究[D].燕山大学,2010:1-61.
    [98]高小永.基于多目标蚁群算法的土地利用优化配置[D].武汉大学,2010:52-76.
    [99] Mourad F, Chehade H, Snoussi H, et al. A Single-target Tracking Algorithm inControlled Mobility Sensor Networks[C].20117th International Workshop onSystems, Signal Processing and their Applications,2011:371-374.
    [100]Mourad F, Chehade H, Snoussi S, et al. Controlled Mobility Sensor Networksfor Target Tracking Using Ant Colony Optimization[J]. IEEE Transactions onMobile Computing,2012,11(8):1261-1273.
    [101]Kumar N V A, Thomas A. Energy Efficiency and Network LifetimeMaximization in Wireless Sensor Networks Using Improved Ant ColonyOptimization[C].2012Third International Conference on ComputingCommunication&Networking Technologies (ICCCNT),2012:1-5.
    [102]Yang Z W, Liu H. Ant Colony Algorithm for Evaluation of University Trainingbase Teaching[J]. International Journal of Applied Mathematics and Statistics,2013,44:312-320.
    [103]Juang C F, Chang P H. Designing Fuzzy-Rule-Based Systems Using ContinuousAnt-Colony Optimization[J]. IEEE Transactions on Fuzzy Systems,2010,18(1):138-149.
    [104]寇晓丽,刘三阳,张建科.一种随机蚁群算法求解连续空间优化问题[J].系统工程与电子技术,2006(12):1909-1911.
    [105]程志刚,陈德钊,吴晓华.连续蚁群优化算法的研究[J].浙江大学学报(工学版),2005(08):1147-1151.
    [106]Rezaee, Jalali M J P. Multi-resolution Ant Colony-a New Approach to UseSwarm Intelligence in Continuous Problems[C].2009International Conferenceon Information and Multimedia Technology, ICIMT2009:529-532.
    [107]叶志伟,郑肇葆.蚁群算法中参数、、设置的研究----以TSP问题为例[J].武汉大学学报,2004,29(7):597-601.
    [108]詹士昌,徐婕,吴俊.蚁群算法中有关算法参数的最优选择[J].科技通报,2003,19(5):381-386.
    [109]Verdaguer M, Clara N, Gutierrez O, et al. Application of Ant-Colony-Optimization Algorithm for Improved Management of First Flush Effects inUrban Wastewater Systems[J]. Science of the Total Environment,2014,485:143-152.
    [110]Rezaei G, Afshar M H, Rohani M. Layout Optimization of Looped Networks byConstrained Ant Colony Optimisation Algorithm[J]. Advances in EngineeringSoftware,2014,70:123-133.
    [111]Li Y Q, Wang R X, Xu M Q. Rescheduling of Observing Spacecraft UsingFuzzy Neural Network and Ant Colony Algorithm[J]. Chinese Journal ofAeronautics,2014,27(3):678-687.
    [112]Mustaffa Z, Yusof Y, Kamaruddin S S. Enhanced Artificial Bee Colony forTraining Least Squares Support Vector Machines in Commodity PriceForecasting[J]. Journal of Computational Science,2014,5:196-205.
    [113]Tsai H C. Integrating the Artificial Bee Colony and Bees Algorithm to FaceConstrained Optimization Problems[J]. Information Sciences,2014,258:80-93.
    [114]Azad M A K, Rocha A M A C, Fernandes E M G P. A Simplified BinaryArtificial Fish Swarm Algorithm for0–1Quadratic Knapsack Problems[J].Journal of Computational and Applied Mathematics,2014,259:897-904.
    [115]Azad M A K, Rocha A M A C, Fernandes E M G P. Improved Binary ArtificialFish Swarm Algorithm for the0-1Multidimensional Knapsack Problems[J].Swarm and Evolutionary Computation,2014,14:66-75.
    [116]Krishnand K N, Ghose D. Detection of Multiple Source Locations Using aGlowworm Metaphor with Applications to Collective Robotics[C]. Proceedingof IEEE Swarm Intelligence Symposium. Piscataway: IEEE Press,2005:84-91.
    [117]Krishnand K N, Ghose D. Glowworm Swarm Optimization:a New Method forOptimizing Multi-modal Functions[J]. International Journal of ComputationalIntelligence Studies,2009,1(1):93-119.
    [118]Aljarah I, Ludwig S A. A New Clustering Approach based on GlowwormSwarm Optimization[C].2013IEEE Congress on Evolutionary Computation(CEC),2013:2642-2649.
    [119]He L F, Tong X, Huang S W. A Glowworm Swarm Optimization Algorithmwith Improved Movement Rule[C].2012Fifth International Conference onIntelligent Networks and Intelligent Systems, ICINIS2012:109-112.
    [120]Wu B, Qian C H, Ni W H, Fan S H. The Improvement of Glowworm SwarmOptimization for Continuous Optimization Problems[J]. Expert Systems withApplications,2012,39:6335-6342.
    [121]周永权,黄正新.求解TSP的人工萤火虫群优化算法[J].控制与决策,2012(12):1816-1821.
    [122]刘翠萍,张海涛,白舸.基于萤火虫群优化算法的无线传感器节点部署[J].计算机应用,2013,33(4):905-907.
    [123]Liu C P, Zhang H T, Bai G. Node Deployment of Wireless Sensor Networkbased on Glowworm Swarm Optimization Algorithm[J]. CODEN JYIIDU,2013,33(4):905-907.
    [124]杨艳,周永权,罗林.人工萤火虫群优化算法求解约束优化问题[J].小型微型计算机系统,2014(01):185-188.
    [125]龚巧巧.多目标人工萤火虫群优化算法及其应用[D].广西民族大学,2011:3-18.
    [126]Yang Y, Zhou Y Q, Gong Q Q. Hybrid Artificial Glowworm SwarmOptimization Algorithm for Solving System of Nonlinear Equations[J]. Journalof Computational Information Systems,2011,6(10):3431-3438.
    [127]Gong Q Q, Zhou Y Q, Luo Q F. Hybrid Artificial Glowworm SwarmOptimization Algorithm for Solving Multi-dimensional Knapsack Problem[C].Procedia Engineering,2011,15:2880-2884.
    [128]Zeng Y, Zhang J. Glowworm Swarm Optimization and Heuristic Algorithm forRectangle Packing Problem[C].2012International Conference on InformationScience and Technology (ICIST),2012:136-140.
    [129]Liao W H, Kao Y C, Li Y S. A Sensor Deployment Approach using GlowwormSwarm Optimization Algorithm in Wireless Sensor Networks[J]. ExpertSystems with Applications,2011,38:12180-12188.
    [130]曾云宝.智能天线波束赋形算法研究[D].北京邮电大学,2006:1-28.
    [131]Ingram M A, Diversity[M/OL]. http://www.ece.gatech.edu/research/labs/sarl/tutorials/index.html:1-10.
    [132]李冬,史浩山,张忻. MIMO系统中一种基于线性接收的满分集正交空时编码[J].西北工业大学学报,2010(06):906-910.
    [133]李伟,李宏.全速率满分集准正交空时分组码的设计[J].现代电子技术,2011(05):40-42.
    [134]倪英俊,李明奇,郭文强.全速率满分集准正交空时分组码设计研究[J].计算机工程与应用,2012(12):120-124.
    [135]Zhou S L, Ma X L, Pattipati K. A View on Full Diversity Modulus-preservingRate-one Linear Space-time Block Codes[J]. Signal Processing,2006,86:1968-1975.
    [136]Li B Y, Ayanoglu E. Full-Diversity Precoding Design of Bit-Interleaved CodedMultiple Beamforming with Orthogonal Frequencey Division Multiplexing[J].IEEE Transactions on Communications,2013, June,61(6):2432-2445.
    [137]于迎新,王钢.协作分集系统中基于注水算法的功率分配方案研究[J].电子与信息学报,2012(12):2830-2836.
    [138]Ismail A, Alouini M S. On Low-complexity Full Diversity Detection ofMulti-user Space-time Coding[C]. IEEE ICC2013, Budapest, Hungary,2013:3204-3208.
    [139]Huang C R, Guo Y, Lee M H. High-rate Full Diversity Space-Time-FrequencyCodes with Partial Interference Cancellation Decoding[C].2012ICCSEE,2012:235-240.
    [140]Song Y, Li J P, Cai C S. An Improved STBC Scheme of Achieving High-RateFull-Diversity with Linear Receivers[J].20106th International Conference onWireless Communicaiton,2010:1-4.
    [141]Wang H M, Xia X G, Yin Q Y, et al. A Family of Space-Time Block CodesAchieving Full Diversity with Linear Receivers[J]. IEEE Transactions onCommunications,2009,57(12):3607-3617.