会议论文集名称：
DEStech Transactions on Computer Science and Engineering
关键词：
Complex networks;Routing strategy;Effective path;Local visibility and Detecting communities
摘要：
A routing strategy using nodes' effective path and dynamic information weight distribution was proposed, which based on the improved efficient path routing strategy in complex network. The strategy's weight factor was optimized by the new strategy, Considering the insufficient of local routing strategies in global performance and the community division technology in complex network, a kind of local visibility routing strategy according to the thought of community division was presented. On the condition of community division of the Bgll condensation algorithm, the topology structure information of neighbor nodes and all the community nodes were only stored in each node's routing list in the new strategy. When node transaction in community, global routing strategy was adopted and when between communities, minimum load strategy will be used. The simulation results indicate that in the different connection density networks, the performance of the new strategy achieves the best when community division's degree of modularization is the highest. Contrasted to other local routing strategy, the optimized strategy holds incomparable superiority on throughput, transmission delay and the packet loss.
摘要：
A routing strategy using nodes' effective path and dynamic information weight distribution was proposed,which based on the improved efficient path routing strategy in complex network.The strategy's weight factor was optimized by the new strategy,and it was compared with the shortest path routing strategy with the traditional routing strategy and the strategy in the view of nodes' efficient path.Simulation results show that the proposed strategy can effectively improve the network throughput without increase average data packet transmission delay.Considering the insufficient of local routing strategies in global performance and the community division technology in complex network,a kind of local visibility routing strategy according to the thought of community division was presented.On the condition of community division of the BGLL condensation algorithm,the topology structure information of neighbor nodes and all the community nodes were only stored in the each node's routing list in the new strategy.When node transaction in community,global routing strategy was adopted and when between communities,minimum load strategy will be used.The simulation results indicate that in the different connection density networks,the performance of the new strategy achieves the best when community division's degree of modularization is the highest.Contrasted to other local routing strategy,the optimized strategy holds incomparable superiority on Throughput,Transmission delay and the Packet Loss.
作者：
Huan Zhou;Minsheng Tan;Qunzhong Peng;Yangwei Li
作者机构：
School of Computer Science and Technology, University of South China, Hengyang Hunan, 421001,China
会议名称：
2014全国第十二届嵌入式系统学术会议
会议时间：
20140921
会议地点：
长沙
会议论文集名称：
2014全国第十二届嵌入式系统学术会议论文集
关键词：
the Improvement of LEACH algorithm;Optimal cluster head selection;Cluster heads forecasting mechanism;Time schedule
摘要：
In order to solve the problem of LEACH Algorithm can not guarantee the larger residual energy node absolutely ware elected as cluster head,and it consumes large amounts of energy for double counting of cluster head election,at the same time,the influence of the node distance for cluster head election is not included.The improved LEACH algorithm has solved the problems veηwell, it makes a use of cluster heads projection to decrease the number of cluster competition by combining with the optimal cluster head selection algorithm,which can reduce the node energy consumption,then to achieve equilibrium ne何ork energy consumption and prolong the survival time of the network.And the experimental results shown that the improved LEACH algorithm balanced the energy consumption of the entire network,significantly reduced the power consumption of the nodes in the monitoring area,delayed the first death nodes appear on the number of rounds,and prolonged the life cycle ofmonitoring network.
摘要：
Dynamic trust relationship making quantization model based on multiple attribute decision has been researched in this paper. Considering the problem that all information from nodes feedback would be not true or reliable, this paper improves a new rule to calculate the feedback trust and proposes a new quantization model on dynamic trust-relationship based on improved feedback trust. On this basis, from the complex structure characteristics of network, this paper introduces the nodes similarity and proposes a improved model of dynamic trust-relationship based on multi-attribution. The simulation experiment showed that the new model have better dynamic adaptability and get a better accuracy and stability of trust evaluation of network.
作者机构：
[Tan, Min-Sheng; Li, Yang-Wei; Xiang, Ting; Peng, Qun-Zhong; Guo, Miao; Wang, Chen-Cheng] Univ South China Hengyang, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
会议名称：
3rd International Conference on Wireless Communication and Sensor Networks (WCSN)
会议时间：
DEC 10-11, 2016
会议地点：
Wuhan, PEOPLES R CHINA
会议主办单位：
[Tan, Min-Sheng;Wang, Chen-Cheng;Guo, Miao;Xiang, Ting;Peng, Qun-Zhong;Li, Yang-Wei] Univ South China Hengyang, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
会议论文集名称：
ACSR-Advances in Comptuer Science Research
关键词：
the improvement of LEACH algorithm;optimal cluster head selection;cluster heads forecasting mechanism;time schedule
摘要：
In order to solve the problem of LEACH Algorithm cannot guarantee the larger residual energy node absolutely were elected as cluster head, and it consumes large amounts of energy for double counting of cluster head election, at the same time, the influence of the node distance for cluster head election is not included. The improved LEACH algorithm has solved the problems very well, it makes a use of cluster heads projection to decrease the number of cluster competition by combining with the optimal cluster head selection algorithm, which can reduce the node energy consumption, then to achieve equilibrium network energy consumption and prolong the survival time of the network. And the experimental results are shown that the improved LEACH algorithm balanced the energy consumption of the entire network, significantly reduced the power consumption of the nodes in the monitoring area, delayed the first dead nodes appear on the number of rounds, and prolonged the life cycle of monitoring network.
期刊：
Journal of Communications,2016年11(12):1088-1094 ISSN：1796-2021
通讯作者：
Ding, Lin(linding1981@163.com)
作者机构：
[Minsheng Tan; Lin Ding] School of Computer Science and Technology, University of South China, Hengyang, 421001, China;[Lin Ding] Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, V6T 1Z4, Canada
通讯机构：
School of Computer Science and Technology, University of South China, Hengyang, China
摘要：
According to the energy bottleneck of the wireless sensor network, the LEACH algorithm is improved in this paper, in the LEACH algorithm, it maybe that the cluster head nodes are far from the base station, and cluster head node has non-uniform distribution, in this case, nodes soon died after consuming energy, so the focus from three aspects of the optimal number of the cluster head and uniform distribution and many jump communication to improve, the improved algorithm through the simulation tests show that network node energy has been obviously saved, at the same time the lifecycle of the system is also effectively extension. In the application of the wireless sensor, we should always hold the principle of energy-first, therefore the LEACH which is a hierarchical routing protocol can save energy has played a crucial role, but the optimal number of the cluster head and uniform distribution can’t be archived because of the change of the location of the cluster head nodes. In addition, when the cluster head far away from center sink node communicate with center sink node, the cluster head will exhaust energy quickly to die, that may affect lifecycle of whole of monitoring network and lead to worse expansibility. For some problems of the LEACH algorithm, the LEACH algorithm is improved in this paper from three aspects of the optimal number of the cluster head and uniform distribution and many jump communication, the improved algorithm through the simulation tests show that network node energy has been obviously saved.
会议名称：
3rd International Conference on Wireless Communication and Sensor Networks (WCSN 2016)
关键词：
Immune peril principle;Internet of Things perception layer;danger degrees of signal;perception;response
摘要：
Danger signal perception and response model of perception layer in IoT based on immune peril principle (DSPRM-IPP) and related algorithms were proposed. DSPRM-IPP model includes immunologic tolerance module, danger perception and accumulation module and response module. Immunologic tolerance module's duty is screening detector which is not matching with autologous collection at the beginning of the sensing layer node deployment, it also constantly adjust to the current detector according to the working environment in process of perception. Danger perception and accumulation module is responsible for the danger signal recognition and accumulation, and detector set generated by immunologic tolerance module is used to determine whether the current signal is danger signal or not. Appropriate response strategy will be taken according to the results of comparing potential cost and response cost in response module. The experimental results show that DSPRM-IPP effectively detects the danger with a low rate of false positives, it also has good adaptability that could adjust constantly according to the working environment and node proportion of residual energy.
作者机构：
[谭敏生; 白曜华; 周欢; 刘尖学] School of Computer Science and Technology, University of South China, Hengyang;Hunan;421001, China;[谭敏生; 白曜华; 周欢; 刘尖学] Hunan;[谭敏生; 白曜华; 周欢; 刘尖学] 421001, China
摘要：
A routing strategy using nodes' effective path and dynamic information weight distribution was proposed,which based on the improved efficient path routing strategy in complex network.The strategy's weight factor was optimized by the new strategy,and it was compared with the shortest path routing strategy with the traditional routing strategy and the strategy in the view of nodes' efficient path.Simulation results show that the proposed strategy can effectively improve the network throughput without increase average data packet transmission delay.Considering the insufficient of local routing strategies in global performance and the community division technology in complex network,a kind of local visibility routing strategy according to the thought of community division was presented.On the condition of community division of the BGLL condensation algorithm,the topology structure information of neighbor nodes and all the community nodes were only stored in the each node's routing list in the new strategy.When node transaction in community,global routing strategy was adopted and when between communities,minimum load strategy will be used.The simulation results indicate that in the different connection density networks,the performance of the new strategy achieves the best when community division's degree of modularization is the highest.Contrasted to other local routing strategy,the optimized strategy holds incomparable superiority on Throughput,Transmission delay and the Packet Loss.
