social group search optimizer algorithm for ad hoc network，成果详细信息-凯发网

due to the dynamic structure in network topology and absence of a centralized administration in management, a specific routing algorithm satisfying the demands of qos is required indeed in mobile ad hoc networks. a novel social group search optimizer algorithm is pro-posed by improving the gso algorithm to a dynamic and discrete algorithm through the introducing of social behaviors. sgso is divided into search and prey parts, where “search” is on duty to find the optimal solution effectively and “prey” is responsible for adjusting the algorithm to the dynamic change of objective functions. dynamic coupling level is used to divide the ad hoc network and corresponding approaches and models based on sgso are applied to routing algorithm, including the decision factor and local routing table. the convergence and correctness of our algorithm are verified mathematically and extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in mobile ad hoc networks. the results show that sgso improves packet delivery ratio and reduces average end-to-end latency effectively, especially for large-scale and high-dynamicnetworks.