Shaohua Wan

Shenzhen Institutes of Advanced Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Chen Chen

Xidian University

Sotirios K. Goudos

Aristotle University of Thessaloniki

Yirui Wu

Hohai University

Xiaolong Xu

Nanjing University of Information Science and Technology

Lianyong Qi

China University of Petroleum, East China

Xiaoheng Deng

Central South University

Liang Zhao

Shenyang Aerospace University

Panagiotis Sarigiannidis

University of Western Macedonia

Qingqi Pei

Xidian University

Michele Nappi

University of Salerno

Cooperative Institutions

Chinese Academy of Sciences

Xidian University

Wuhan University

University of Electronic Science and Technology of China

Huazhong University of Science and Technology

Central South University

Shanghai Jiao Tong University

Zhejiang University

Nanjing University

Nanjing University of Information Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Classifying transportation mode and speed from trajectory data via deep multi-scale learning

Computer Networks (2019)

Rui Zhang Peng Xie Chen Wang Gaoyang Liu Shaohua Wan

Mode (computer interface)

10.1016/j.comnet.2019.106861

Cite

Citations (118)

AoI-aware energy control and computation offloading for industrial IoT

Future Generation Computer Systems (2022)

Jiwei Huang Han Gao Shaohua Wan Ying Chen

Computation offloading

10.1016/j.future.2022.09.007

Cite

Citations (76)

Editorial to special issue on cross-media learning for visual question answering

Image and Vision Computing (2021)

Shaohua Wan Chen Chen Alexandros Iosifidis

Visual media

10.1016/j.imavis.2021.104355

Cite

Citations (1)

Energy-Efficient Adaptive Routing and Context-Aware Lifetime Maximization in Wireless Sensor Networks

International Journal of Distributed Sensor Networks (2014)

Shaohua Wan

We design and implement a Bezier-based multipath routing algorithm that allows a given source node to send samples of data to a given sink node in large scale sensor networks. Multipath routing can distribute the energy load onto the multiple routes and thus increase the lifetime and quality of the network. It is important to stress the fact that evenly regulating the routing task among the more nodes of the network can also protect a node from failure considering that a node with heavy duty is likely to deplete its power quickly. On the contrary, all the traffic would be shipped along the shortest path routing, corresponding to the heavily congested path case, which in turn leads to overload of the nodes along the optimal routes between the sink and source pair and finally shortens the lifetime of the network. Also, multipath routing can increase end-to-end throughput and provide load balancing. Our view is that minimizing energy consumption while meeting acceptable latency for applications can lead to significant power savings. Our simulation results demonstrate that Bezier-based multipath routing approach significantly outperforms previous SWEEP, Tributaries and Deltas, and the shortest path approaches in terms of lifetime and latency.

Multipath routing

Geographic routing

Equal-cost multi-path routing

10.1155/2014/321964

Cite

Citations (17)

On Improving the accuracy with Auto-Encoder on Conjunctivitis

Applied Soft Computing (2019)

Wei Li Xiao Liu Jin Liu Ping Chen Shaohua Wan

Autoencoder

10.1016/j.asoc.2019.105489

Cite

Citations (42)

The Helical Flow of Drilling Fluids at a Particular Flow Rate - Part 1

Shaohua Wan Sarvesh Naik Ian Bryden

Cite

Citations (0)

Intelligent Caching for Vehicular Dew Computing in Poor Network Connectivity Environments

ACM Transactions on Embedded Computing Systems (2024)

Liang Zhao Hongxuan Li Enchao Zhang Ammar Hawbani Ming‐Wei Lin

In vehicular networks, some edge servers may not function properly due to the time-varying load condition and the uneven computing resource distribution, resulting in a low quality of caching services. To overcome this challenge, we develop a Vehicular dew computing (VDC) architecture for the first time by combining dew computing with vehicular networks, which can achieve wireless communication between vehicles in a resource-constrained environment. Consequently, it is crucial to develop an adaptive caching scheme that empowers vehicles to form efficient cooperation in VDC. In this paper, we propose an intelligent caching scheme based on VDC architecture, which includes two parts. First, to meet the dynamic nature of VDC, a spatiotemporal vehicle clustering algorithm is proposed to establish adaptive cooperation to assist content caching for vehicles. Second, the multi-armed bandit algorithm is employed to select suitable content for caching in vehicles based on real-time file popularity, and a model is established to dynamically update each vehicle’s request preferences. Extensive experiments are conducted to demonstrate that the proposed scheme has excellent performance in terms of cluster head stability and cache hit rate.

10.1145/3643038

Cite

Citations (4)

Adaptively feature matching via joint transformational-spatial clustering

Multimedia Systems (2021)

Linbo Wang Li Tan Xianyong Fang Yanwen Guo Shaohua Wan

Feature (linguistics)

10.1007/s00530-021-00792-8

Cite

Citations (3)

A Multipath Satellite Routing to Enhance Networking Performance for LEO Constellations

Chao Tong Chen Chen Wei Han Zhiyi Wang L.W. Lan

Satellite constellation

Multipath routing

Satellite broadcasting

Communications satellite

10.1109/ispa63168.2024.00315

Cite

Citations (0)

A New Prefetching Strategy Based on Access Density in Linux

Yanxiang He Shaohua Wan Naixue Xiong Jong Hyuk Park

This paper presents a new access-density-based prefetching strategy to improve prefetching for the access patterns that have not been dealt with in the current Linux read-ahead algorithm. These access patterns include: reading file data backwards, reading files in a stridden way (leaving holes in between two adjacent references), alternating references between multiple file regions and reading files randomly. When these patterns are used, the current Linux read-ahead algorithm cannot handle them because the read-ahead operation is not activated. Three metrics are proposed in the evaluation of the algorithm. The current results, obtained from a real prototype implementation in the Linux kernel, show that such prefetching can have a significant performance improvement on the aforementioned access patterns.

Kernel (algebra)

Data access

10.1109/csa.2008.11

Cite

Citations (3)