CrushSCI.com
Journal Selection & Manuscript Polishing Services
Ad Hoc Networks journal cover Computer Science
Back to journal directory

Review Cycle Records

Ad Hoc Networks

Elsevier SCIE Non-OA
2026 Emerging Zone 32025 CAS Zone 32025 JCR Q1
154.2Average days
134.5Median days
83Fastest days
402Longest days
2792025 publications

Paper Review Records

All Paper Review Records

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

130 days

Multi-Level Contrastive Knowledge Distillation for Resource-efficient Visual Inference on Edge Devices

AuthorsTing Liang; Lingyu Du; Guohao Lan

AffiliationsDepartment of Software Technology, Delft University of Technology, Van Mourik Broekmanweg 6, Delft, 2628 XE, The Netherlands

Source PDF DOI Publisher page
129 days

Distributed estimation of convex event regions in wireless sensor networks using diffusion cooperation and minimum volume ellipsoids

AuthorsPrabeen Kumar Sahu; Satyakam Baraha; Upendra Kumar Sahoo; Kanuru Srinadh; Santos Kumar Das

AffiliationsDepartment of Electronics and Communication Engineering, National Institute of Technology, Rourkela, Odisha, India; Department of Electronics and Communication Engineering, Sri Sivasubramaniya Nadar College of Engineering, Kalavakkam, Tamil Nadu, India

Source PDF DOI Publisher page
131 days

Contact plan design for optical interplanetary communications

AuthorsJason Gerard; Juan A. Fraire; Sandra Céspedes

AffiliationsDepartment of Computer Science and Software Engineering, Concordia University, Montréal, QC, H2W 2L4, Canada; Inria, INSA Lyon, Villeurbanne, France; CONICET - Universidad Nacional de Córdoba, Córdoba, Argentina

Source PDF DOI Publisher page
160 days

ST-SL: A spatiotemporal swarm learning architecture for dynamic spectrum access in edge computing

AuthorsFeng Li; Dongxu Han; Li Wang

AffiliationsSchool of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, 310018, China; School of Marine Electrical Engineering, Dalian Maritime University, Dalian, 116026, China

Source PDF DOI Publisher page
113 days

Expected-advantage MARL for QoS-aware routing over dynamic inter-satellite links in LEO networks

AuthorsDianying Chen; Kun Zhang; Xiaohe Wu; Chenxi Cai; Hui Chen

AffiliationsSchool of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, 210096, China

Source PDF DOI Publisher page
109 days

Multi-fidelity Gaussian process learning for 3D urban radio map reconstruction from sparse UAV measurements

AuthorsXuan Cheng; YaPeng Wang; DingCheng Yang; Benjamin K. Ng; Sio-Kei Im; Xu Yang

AffiliationsFaculty of Applied Sciences, Macao Polytechnic University, Macao Special Administrative Region of China; Information Engineering School, Nanchang University, Nanchang, 330031, China

Source PDF DOI Publisher page
402 days

Metaheuristic approaches for optimizing UAV base station placement in THz communication for disaster recovery scenarios

AuthorsIsmail Ersin; Sercan Demirci; Mustafa Alper Akkas; Orhan Dagdeviren

AffiliationsInternational Computer Institute, Ege University, 35100, Izmir, Turkey; Department of Computer Engineering, Ondokuz Mayıs University, 55139, Samsun, Turkey; Department of Computer Engineering, Bolu Abant İzzet Baysal University, 14280, Bolu, Turkey; Department of Computer Engineering, Ege University, Bornova, 35100, Izmir, Turkey

Source PDF DOI Publisher page
83 days

ISAC-native communication risk field routing for safety-critical 6G vehicular networks

AuthorsLulan Zuo; Botao Zheng; Xiaolin Niu; Shaowen Jing; Jiayu Huang; Mingkun Zhang

AffiliationsSchool of Intelligent Transportation, Luoyang Normal University, Luoyang, 471934, China; College of Cyber Science and Engineering, Xi’an Jiaotong University, Xi’an, 710049, China; College of Information Engineering, Henan University of Science and Technology, Luoyang, 471023, Henan, China; College of Electronics and Information Engineering, South China University of Technology, Guangzhou, 510641, China

Source PDF DOI Publisher page
106 days

K-DP: A dynamic differential k-anonymous vehicle location privacy protection scheme based on RSU collaboration

AuthorsRan Wang; Shi Dong; Junna Zhang

AffiliationsSchool of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, China; School of Computer Science and Technology, Zhoukou Normal University, Zhoukou, 466001, China

Source PDF DOI Publisher page
142 days

A novel topology-aware and void-avoidance routing protocol for underwater wireless sensor networks

AuthorsRongxin Zhu; Wenjie Li; Haohao Mai; Azzedine Boukerche; Qiuling Yang

AffiliationsHainan University, Haikou, 570228, China; University of Ottawa, Ottawa, K1N 6N5, Canada; Innovation Platform for Academicians of Hainan Province, Haikou, 570228, China

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.