Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Communications-Technology

There are 21 papers published in subject: > since this site started.

Results per page:

21 Total, 3 Pages | 1 2 3 Next > Last >>

Select Subject

All (8828)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Third-level Subject

Communication Network Tec...(38)
Communication Terminal Te...(0)
Communication Transmissio...(8)
Fibre Optical Communicati...(39)
Other Subjects of Communi...(5)
Post and Telecommunicatio...(1)
Postal(0)
Telecommunications(2)
Wired Communications Tech...(2)
Wireless Communication Te...(170)

Rank

Results per page:

21 Total, 3 Pages | 1 2 3 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Power Allocation Based on Non-Cooperative Game in LEO Beam-Hopping Satellite System
	XIAO Xuesong, Quan Qingyi
	Electrics, Communication and Autocontrol Technology 23 December 2023
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Considering that low Earth orbit satellites adopt beam hopping technology for full frequency multiplexing, exacerbating the degree of co-frequency interference in the system, thereby reducing the capacity of the system, a power allocation algorithm of beam-hopping system based on non-cooperative game is proposed in this paper. First, a power resource allocation model based on non-cooperative game is established, and an alternate iterative algorithm is proposed to solve the Nash equilibrium. Then, OPNET is used to build a system-level simulation platform, and the performance of the power allocation algorithm is effectively evaluated. The simulation results show that the proposed power allocation algorithm achieves obvious improvement in interference suppression, spectral efficiency and fairness compared with water filling algorithm and power squaring pricing game.
	TO cite this article:XIAO Xuesong, Quan Qingyi. Power Allocation Based on Non-Cooperative Game in LEO Beam-Hopping Satellite System[OL].[23 December 2023] http://en.paper.edu.cn/en_releasepaper/content/4761762


	2. BBR optimization study based on grey prediction
	LI Ning,Yan Xiaohu
	Electrics, Communication and Autocontrol Technology 07 March 2022
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:BBR (Bottleneck Bandwidth and Round-trip) is a congestion control algorithm developed in recent years. The BBR algorithm probes available resources by asynchronously measuring network bandwidth and minimum latency. It controls the send rate based on the estimated bandwidth, trying not to take up the bottleneck queue, so it keeps latency low while pursuing high throughput. However, in response to high-speed networks, the convergence time performance of BBR is not good. The analysis found that the algorithm could not effectively determine that network resources were fully utilized later in the startup phase, which extended the time for the startup phase to switch to the emptying phase. Therefore, this paper introduces the transition propulsion module, which uses the gray prediction model to accelerate the process of determining the network pipeline filling, and shorten the connection time between the initial two stages. In the NS3 simulation, it was found that the convergence time was significantly shortened.
	TO cite this article:LI Ning,Yan Xiaohu. BBR optimization study based on grey prediction[OL].[ 7 March 2022] http://en.paper.edu.cn/en_releasepaper/content/4756673

Saved Papers

Saved Papers


	3. Resource Allocation for UAV-aided Communication in High-Speed Railway Systems: A Multi-Agent Reinforcement Learning Approach
	Zhou Lanlan,Yu Jianguo
	Electrics, Communication and Autocontrol Technology 26 February 2021
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The past decades have witnessed the rapid developments of high-speed railways (HSRs) communications. To provide seamless communication services between high-speed trains, both mobile edge computing (MEC) servers and UAVs are integrated into HSRs to provide on-demand resource access. However, the sensitive delay requirements of high-speed services pose significant challenges to the resource allocation in HSRs. This paper will formulate the UAV-aided resource allocation in high-speed railways (HSRs) as a distributed optimization problem to optimize the resource utilization while minimizing the path blocking probability. To address this problem, a multi-agent deep deterministic policy gradient (multi-agent DDPG) approach is proposed. The MEC servers are taken as the agents to make resource allocation decisions in the training phase. The simulation shows demonstrate that multi-agent DDPG outperforms the traditional single-agent method. The proposed multi-agent DDPG-based resource allocation algorithm can achieve satisfactory performance.?????
	TO cite this article:Zhou Lanlan,Yu Jianguo. Resource Allocation for UAV-aided Communication in High-Speed Railway Systems: A Multi-Agent Reinforcement Learning Approach[OL].[26 February 2021] http://en.paper.edu.cn/en_releasepaper/content/4753869


	4. Dynamic and proactive caching in User-centric UDN
	Jiang Juzheng
	Electrics, Communication and Autocontrol Technology 21 May 2020
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Wireless content caching has been considered as an efficient way to reduce the traffic and energy consumption in 5G networks. As a promising technology of 5G, User-centric UDN(UUDN) break through the traditional cellular architecture, allowing users served by a following AP group(APG) as the user moving. However, caching in UUDN faces fundamental challenges due to the frequent APG refreshing, irregular user moving and APs cooperation inner each APG. In this paper, we propose a dynamic prefetch method to solve the above questions. First, we use a hybrid Markov model to predict the user\'s future position. Then, we propose an algorithm to choose the prefetch point according to both the time dimension and the spatial dimension. In the end, we put forward a specific formula to calculate the size of prefetch content according to different user moving station. In conclusion, we propose an integrate prefetching process in UUDN network solving the problem of when, where and what content to prefetch. Simulation results show that the method we proposed could get a significantly improve than the popular based method and the forward prefetch method.
	TO cite this article:Jiang Juzheng. Dynamic and proactive caching in User-centric UDN[OL].[21 May 2020] http://en.paper.edu.cn/en_releasepaper/content/4752130


	5. 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


	6. Coordinator Assisted Geographical Routing Protocol for VANET in Urban Scenarios
	PENG Shi,ZHOU Jie-ying
	Electrics, Communication and Autocontrol Technology 28 April 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper investigates the characteristics of the urban scenarios and motion law of VANET and proposes a position-based routing protocol CAGR (Coordinator Assisted Geographical Routing). Considering the characteristics of the urban scenarios, this protocol optimizes the traditional routing protocol of VANET by setting coordinating nodes in special places of the city road. Coordinating nodes calculate the SCORE value based on the distance from the path, the vehicle density and the path delay which will be used to select the best route to destination. At the same time, vehicles use the improved greedy strategy to forward packet on the road between coordinators. When data packet is transmitted to the coordinator, the protocol uses the M/M/C queuing model to optimize the parameters of the network. The experimental results indicate that CAGR protocol has better performance in complex urban scenarios.
	TO cite this article:PENG Shi,ZHOU Jie-ying. Coordinator Assisted Geographical Routing Protocol for VANET in Urban Scenarios[OL].[28 April 2016] http://en.paper.edu.cn/en_releasepaper/content/4685612


	7. User Association Scheme with Resource Reservation Mechanisms for M2M Communications in Small Cell Networks
	FENG Shuaibo,WANG Ke,XU Quansheng,LI Xi
	Electrics, Communication and Autocontrol Technology 02 September 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In recent years, Machine-to-Machine (M2M) communications have become important services with large market potential. M2M communication is defined as the communication among devices without human interactions. Because of the features such as large number of devices, small data transmissions and vast applications range, M2M communications have posed significant challenges to the existing networks which are based on human-to-human (H2H) communications. In this paper, we propose a user association scheme with resource reservation mechanism which can guarantee the quality of service (QoS) of H2H traffics while allocate enough resource to M2M communications. It is formulated as a bargain game optimization problem, which can be resolved by Lagrangian Arithmetic. Simulation results show that the proposed algorithm can achieve higher throughput for M2M traffics without degrading the QoS of H2H traffics.
	TO cite this article:FENG Shuaibo,WANG Ke,XU Quansheng, et al. User Association Scheme with Resource Reservation Mechanisms for M2M Communications in Small Cell Networks[OL].[ 2 September 2015] http://en.paper.edu.cn/en_releasepaper/content/4653582


	8. Capacity Enhanced Resource Allocation Algorithm for Device-to-Device Uplink Underlaying Cellular Networks
	Sun Ke,Xu Quansheng,Li Xi
	Electrics, Communication and Autocontrol Technology 29 April 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we investigate the resource allocation problem among multiple cellular users and multiple D2D pairs to optimize the system capacity performance. We study the resource allocation involving resource block (RB) assignment and power allocation, which is difficult to tackle simultaneously. A two-phase resource allocation scheme is proposed to solve the problem. Firstly, an interference graph based heuristic clustering algorithm and a heuristic RB assignment algorithm are performed to realize the RB assignment. The multi-user interference is properly coordinated by clustering and appreciable system capacity is achieved by the RB assignment. Secondly, we assign different powers for all the users to explore a further capacity enhancement. We prove the concavities of the lower and upper bound of the optimization function, thus the power allocation problem becomes a convex optimization problem and we solve it with a low complexity gradient method. Finally, we present simulation results to verify the proposed scheme. It is shown that, with remarkably reduced complexity, our proposed two-phase scheme achieves a near-optimal performance in terms of the system capacity.
	TO cite this article:Sun Ke,Xu Quansheng,Li Xi. Capacity Enhanced Resource Allocation Algorithm for Device-to-Device Uplink Underlaying Cellular Networks[OL].[29 April 2015] http://en.paper.edu.cn/en_releasepaper/content/4641065


	9. 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


	10. On the frequency offset compensation in physical-layer network coding using OFDM
	WANG Zhou,XIE Gang,LI Xu
	Electrics, Communication and Autocontrol Technology 27 December 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:physical-layer network coding greatly improves the throughput in the two-way relay system. However, due to the difference between the two frequency offsets coming from two sources' transmitting signals and the fact that the signal at the relay node is overlapped, it is difficult to compensate the two different frequency offsets together. In the paper, this problem is analysied and a new method to calculate the compensation frequency offset based on golden section is put forward. Simulation results show that the algorithm has the same performance compared with the mean frequency offset compensation algorithm when the two signals from sources come through the symmetry channels, but in other cases that channels are not symmetry, the proposed algorithm will greatly improves the bit-error-rate(BER) performance of demodulated signal at the relay node.?????
	TO cite this article:WANG Zhou,XIE Gang,LI Xu. On the frequency offset compensation in physical-layer network coding using OFDM[OL].[27 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4502260

	Check out RSS, or use RSS reader to subscribe this item