Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 3 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. A Modified Sub-cluster Head Stable Clustering Algorithm for Highly Dynamic Unmanned Aerial Vehicles | |||
Guo Yuchen,Zhang Xu | |||
Electrics, Communication and Autocontrol Technology 08 March 2020 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In the UAV network, high-speed movement of nodes will cause frequent network topology updates, making network management more complex and increasing network maintenance overhead. Clustering can increase network capacity, achieve reuse of space resources, and reduce energy consumption overhead. The existing clustering algorithms are proposed for fixed wireless sensor network, mobile ad hoc network with limited mobility or special application such as vehicle network. It is necessary to continue doing the research that could cope with the rapid changes of the network extension caused by the high-speed movement for the UAV.This paper proposes a modified sub-cluster head stable clustering algorithm (SHSC) for highly dynamic unmanned aerial vehicles, which introduces an improved maximum speed similarity parameter when electing a cluster head, so that nodes with similar motion trends are formed the same cluster. The sub-cluster head node is added in each cluster, and becomes a new cluster head immediately when the original cluster head fails or the energy is too low. It is benefit for enhancing the stability of the network. By simulating verification, SHSC is 27% higher than weighted clustering algorithm (WCA) in terms of energy consumption, 22% higher than improved weighted clustering algorithm (IWCA), and 5% higher than optimized stable clustering algorithm (OSCA). In terms of network stability, it is 26% higher than WCA, 22% higher than IWCA, and 19% higher than OSCA. | |||
TO cite this article:Guo Yuchen,Zhang Xu. A Modified Sub-cluster Head Stable Clustering Algorithm for Highly Dynamic Unmanned Aerial Vehicles[OL].[ 8 March 2020] http://en.paper.edu.cn/en_releasepaper/content/4751103 |
2. Optimizing the Combined Input and Crosspoint Queued (CICQ) switch: A new flow control mechanism | |||
Zheng Guangjie,Tang Bihua,Yuan Dongming,Hu Hefei,Ran Jing | |||
Electrics, Communication and Autocontrol Technology 17 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:To date, a combined input and crosspoint queued (CICQ) switch has obtained increasing significant attention for its scalability and simple implementation on FPGA. As the promising next generation high speed packet switch, it is able to address the complex scheduling and high memory access speed problems which exist in other types of switches. However, when distributing packet buffers across crosspoints, it becomes difficult to balance the workload of different buffers, resulting in low memory space efficiency. In this article, we propose a new flow control mechanism to enhance the memory space efficiency, and carry out the performance comparison between such optimized CICQ switch and the one without adopting this mechanism | |||
TO cite this article:Zheng Guangjie,Tang Bihua,Yuan Dongming, et al. Optimizing the Combined Input and Crosspoint Queued (CICQ) switch: A new flow control mechanism[OL].[17 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4573446 |
3. A Novel End-to-End Protection Scheme in Multi-Domain Networks | |||
LIANG Kaile,WANG Hongxiang | |||
Electrics, Communication and Autocontrol Technology 10 May 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Considering the essential improtance of information technology in today's society, network survivability has been a major concern. While pre-provisoned protection strategies for single-link failure has been well studied in single domain networks, and efforts have been made to mitigate these shcemes to Multi-Domain networks, there are still many challenging problems. Diverse path pair computation and setup across domains is very complex and challenging due to the limited state information between domains. In this paper, a novel end-to-end diverse path pairs protection heuristic for Multi-Domain networks considering traffic engineering is proposed. It gives significantly lower routing overhead and complexitty. Integer Linear Programming(ILP) formulation aimming to minimize blocking rate in bandwidth routing optical network is proposed. Meanwhile, the proposed heuristic is evaluated using simulation and compared with both ILP solution and other shceme. | |||
TO cite this article:LIANG Kaile,WANG Hongxiang. A Novel End-to-End Protection Scheme in Multi-Domain Networks[OL].[10 May 2012] http://en.paper.edu.cn/en_releasepaper/content/4477767 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated