DataExpo GAKG DeepReport Navigation

Copyright©2015-2024 Acemap, Inc. Shanghai Jiao Tong University. All rights reserved.

沪ICP备18028330号

HF

Huei-Wen Ferng

National Taiwan University of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Jeng‐Ji Huang

National Taiwan Normal University

David Shiung

National Changhua University of Education

Ming‐Fu Li

University of Electronic Science and Technology of China

Alexander Leonovich

National Taiwan University of Science and Technology

Jin‐Fu Chang

National Chi Nan University

Muhammad Taufiq Nuruzzaman

Sunan Kalijaga State Islamic University Yogyakarta

Cheng-Ching Peng

National Taiwan University of Science and Technology

Ying-Tsu Tseng

National Taiwan University of Science and Technology

Ching-Chieh Fang

Chang Gung University

Ge-Ming Chiu

National Taiwan University of Science and Technology

Cooperative Institutions

National Taiwan University of Science and Technology

National Taiwan University

National Yang Ming Chiao Tung University

National Taiwan Normal University

National Cheng Kung University

National Central University

National Taipei University of Technology

Chang Gung University

Chung Yuan Christian University

Academia Sinica

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Erratum to “Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs” [Performance Evaluation 43 (2001) 39–62]

Performance Evaluation (2001)

Huei-Wen Ferng Jin‐Fu Chang

10.1016/s0166-5316(00)00062-6

Cite

Citations (8)

Beaconless Geographical Routing Protocol for a Heterogeneous MSN

IEEE Transactions on Mobile Computing (2020)

Muhammad Taufiq Nuruzzaman Huei-Wen Ferng

Traditional beaconless geographical routing (BGR) protocols perform poorly in a heterogeneous environment due to the consideration of location solely with an assumption of homogeneous transmission. Therefore, we propose a novel BGR with consideration of the locations of candidate forwarders and different transmission ranges. Our proposed protocol, namely, the heterogeneity-aware BGR (HA-BGR), is designed for a heterogeneous mobile sensor network (MSN), where the transmission ranges of mobile sensors are different. In HA-BGR, a node takes its distance, transmission range, and progress to the destination into consideration before setting itself to be a candidate next hop and remains active. Examined by analytical and extensive simulation results, HA-BGR not only needs fewer next-hop candidates but also achieves better performance in the end-to-end delivery ratio and latency as compared to the recently proposed convex-lense decision region BGR (CDR-BGR).

10.1109/tmc.2020.3038628

Cite

Citations (5)

Stability and performance analysis of wireless powered communication networks

Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk and Reliability (2021)

Ming‐Fu Li Ching-Chieh Fang Huei-Wen Ferng

In RF-based wireless powered communication networks (WPCNs), the wireless charging rate at a device is usually low or unstable because of health concerns or time-varying characteristics of wireless channels. Under a low charging rate, the data backlog at a wireless device may be continuously increasing, leading to system performance degradation and data loss. To keep a wireless powered device stable and preserve a finite data backlog, the upper limit of data arrival/acquisition rate at a wireless powered device must be solved under the given data transmission rate and wireless charging rate. Hence, in this paper a novel two-dimensional continuous-time Markov chain model was proposed for analyzing the stability condition of a wireless powered device with a finite energy storage buffer. The average number of data packets, average packet delay, and energy shortage probability at a wireless powered device were analyzed as well. Additionally, simulations were conducted to validate the analytic results and demonstrate that the obtained stability condition is necessary and sufficient for the wireless device.

Fixed wireless

10.1177/1748006x211016776

Cite

Citations (2)

Video streaming over HTTP/2: Design and evaluation of adaptive server-paced push

Journal of Communications and Networks (2021)

Huei-Wen Ferng Shan-Hsiang Shen Chih-Wei Lai

By using the server push of the hypertext transfer pro-tocol (HTTP) version 2.0, i.e., HTTP/2, along with the technique of server pacing, a novel scheme is proposed in this paper to deliver video segments. Furthermore, the load of bitrate adaptation is shifted to the server to avoid bandwidth competition and wastage caused by bitrate switching. It can be explicitly shown that no significant overhead is brought by our proposed scheme via complexity analysis. Moreover, our proposed scheme generates one HTTP request only. With extensive simulations, we successfully demonstrate that it is superior over the closely related schemes in terms of the average achievable bitrate, the number of buffer stalls, the ratio of unclaimed pushes, etc., in particular, when a harsh network condition arises.

Constant bitrate

Hypertext Transfer Protocol

Video server

10.23919/jcn.2021.000007

Cite

Citations (1)

Path-wise performance in a tree-type network: Per-stream loss probability, delay, and delay variance analyses

Performance Evaluation (2006)

Huei-Wen Ferng Chi‐Chao Chao Cheng-Ching Peng

10.1016/j.peva.2006.01.003

Cite

Citations (10)

Modeling of Split Traffic Under Probabilistic Routing

IEEE Communications Letters (2004)

Using a general input traffic class rather than confining it to a specific input traffic model, this letter investigates the split traffic for such a general input traffic class under a probabilistic routing algorithm. Thus the obtained result is applicable for a broad range of input traffic. By way of characterizing the split traffic on each routing path, it is shown that the resultant traffic on each routing path is still the same traffic class with suitable parameter modification.

Equal-cost multi-path routing

Policy-based routing

10.1109/lcomm.2004.832769

Cite

Citations (9)

Enhancing WLAN location privacy using mobile behavior

Expert Systems with Applications (2010)

Shi‐Jinn Horng Chyouhwa Chen Huei-Wen Ferng Tzong‐Wann Kao Meng-Hung Li

MAC address

10.1016/j.eswa.2010.06.036

Cite

Citations (9)

OVSF code tree management for UMTS with dynamic resource allocation and class-based QoS provision

Huei-Wen Ferng Jin-Hui Lin Yuan‐Cheng Lai Yung-Ching Chen

Rather than simply keeping the code tree as com- pact as possible merely depending on the request rate, we design a scheme on the orthogonal variable spreading factor (OVSF) code tree management for the universal mobile telecommunication system (UMTS) by further considering characteristics of traffic and dynamic resource allocation (DRA) to make the management efficient and satisfy different quality-of-service (QoS) require- ments requested by diverse multimedia applications. Through simulations, we demonstrate that the proposed scheme can not only adequately take care of QoS requirements but also significantly reduce the number of code reassignment, making it charming and more suitable for the real and complicated system.

UMTS frequency bands

Tree (set theory)

Code (set theory)

Resource Management

10.1109/vetecf.2005.1558221

Cite

Citations (1)

A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks

Huei-Wen Ferng Hsing‐Yu Chen Jeng‐Ji Huang Wen-Yan Kao

In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.

10.1109/vetecs.2005.1543789

Cite

Citations (0)

Projection-based localization for underwater sensor networks with consideration of layers

Arief Kurniawan Huei-Wen Ferng

Because the global positioning system (GPS) employed in the terrestrial environment does not work in the underwater environment, a localization scheme should be properly designed for such an environment, in particular, the underwater sensor network (UWSN). Focusing on this issue for UWSNs, a scheme called projection-based underwater localization (PUL) is proposed in this paper. PUL applies a projection method to transform the three-dimension (3D) localization problem into a two-dimension (2D) one with consideration of layers to find the coordinate of a node using three reference nodes. By doing so, PUL is able to minimize computation and communication overheads while achieving high accuracy. Investigated via simulations, we show that PUL significantly outperforms some closely related schemes in the literature in terms of localization coverage, localization error, and communication cost.

Underwater acoustic communication

10.1109/tenconspring.2013.6584483

Cite

Citations (10)

More pages