CrushSCI.com
Journal Selection & Manuscript Polishing Services
TELECOMMUNICATION SYSTEMS journal cover Computer Science
Back to journal directory

Review Cycle Records

TELECOMMUNICATION SYSTEMS

Springer SCIE Non-OA
2026 Emerging Zone 42025 CAS Zone 42025 JCR Q3
209.9Average days
195.5Median days
44Fastest days
509Longest days
1452025 publications

Paper Review Records

All Paper Review Records

20 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

230 days

Experimental analysis of LTE and 5G air-to-ground propagation for critical emergency response

AuthorsShi Jie Seah; Siat Ling Jong; Hong Yin Lam; Chee Yen Leow

Affiliations1. Faculty of Electrical and Electronic Engineering, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Malaysia; 2. Faculty of Engineering Technology, Universiti Tun Hussein Onn Malaysia, Panchor, Malaysia; 3. Wireless Communication Centre, Faculty of Electrical Engineering, Universiti Teknologi Malaysia, Skudai, Malaysia

Source PDF DOI Publisher page
218 days

A hybrid graph- and sequence-based deep learning framework for behavioral analysis of metamorphic malware

AuthorsParisa Golabvand; Nasser Mikaeilvand; Abbas Mirzaei; Babak Nouri-Moghaddam

Affiliations1. Department of Computer, Faculty of Engineering, Ki.C., Islamic Azad University, Kish, Iran; 2. Department of Cognitive Computational Science, CT.C., Islamic Azad University, Tehran, Iran; 3. Department of Computer Engineering, Ard.C., Islamic Azad University, Ardabil, Iran

Source PDF DOI Publisher page
44 days

Robust preprocessing for privacy-preserving truth discovery under malicious worker uploads

AuthorsYuzhen Liu; Bofei Peng; Liang Bai; Zongjing Cao; Hongmei Shu; Xiaolan Zhou; Jin Wang; Xiaoliang Wang

Affiliations1. School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China; 2. Sanya Research Institute, Hunan University of Science and Technology, Sanya, China

Source PDF DOI Publisher page
149 days

Priority-aware Q-learning for uplink random access in NOMA-based mMTC networks

AuthorsYing Zhang; Zhenyou Wang; Zeyu Wu; Yue Niu

Affiliations1. School of Computer, Jiangsu University of Science and Technology, Zhenjiang, China

Source PDF DOI Publisher page
267 days

GRLI: A Magnetic Attention-Based DRL Approach to Optimize MPTCP Flow Scheduling under Link Contention

AuthorsJorge Abraham Rios Suarez; Jia Min; Shibwabo C. Anyembe

Affiliations1. School of Electronics and Information, Harbin Institute of Technology, Harbin, China

Source PDF DOI Publisher page
354 days

Optimized energy-efficient scheduling for multi-path TCP using distributed constraint and Max-Sum algorithms

AuthorsZulfiqar Ali Arain; Xuesong Qiu; Faheem Yar Khuhawar; Mu Wang; Changqiao Xu

Affiliations1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunication, Beijing, China; 2. Department of Telecommunication Engineering, Mehran University of Engineering and Technology, Jamshoro, Pakistan; 3. Faculty of IT and Design, Bahrain Polytechnic, Isa Town, Kingdom of Bahrain

Source PDF DOI Publisher page
283 days

P4QT: a queueing theory analysis of routing mechanisms based on P4 programmable switches

AuthorsReza Fallahi Kapourchali; Reza Mohammadi

Affiliations1. Department of Computer Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran

Source PDF DOI Publisher page
58 days

Passkey in the Wooden Horse: A Deep Dive into Trojan Based Compromise of Passwordless Credentials

AuthorsAditya Mitra; V. S. Devi Priya; S. Sibi Chakkaravarthy; Anisha Gosh; Mohammad Alshehri

Affiliations1. Center of Excellence(AIR) & School of Computer Science & Engineering, VIT-AP University, Vijayawada, India; 2. Department of CS(Cyber Security), SoE, Dayananda Sagar University, Bengaluru, India; 3. Department of Computer Science, College of Computers and Information Technology, Taif University, Taif City, Saudi Arabia

Source PDF DOI Publisher page
134 days

Energy efficient backscatter communication oriented energy harvesting NOMA

AuthorsShilpi; Sachin Kumar; Sudhanshu Tyagi; Sudeep Tanwar

Affiliations1. Department of ECE, Amity School of Engineering and Technology, Lucknow, India; 2. Department of ECE, Thapar Institute of Engineering and Technology, Deemed to be University, Patiala, India; 3. Department of Department of Computer Engineering-AI & Big Data, Marwadi University, Rajkot, India

Source PDF DOI Publisher page
509 days

An innovative mobility aware distributed service discovery mechanism using aco algorithm (MDSDA) for internet of things environment

AuthorsSamia Haboussi; Akli Abbas; Mourad Amad; Nourredine Oukas

Affiliations1. LIM Laboratory, Computer Science Department, Faculty of Exact Sciences, University of Bouira, Bouira, Algeria

Source PDF DOI Publisher page

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review96.4 days

Median77 days

Contact CrushSCI

Contact CrushSCI

Leave your contact details so we can discuss your manuscript, editing needs, and submission plan.

Selected service: Paper Editing Service

Or leave your contact details

WhatsApp, Telegram, WeChat, and email are all optional, but at least one is required. Once received, we will contact you as soon as possible.