Ben‐Jye Chang

National Yunlin University of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Ying‐Hsin Liang

Nan Kai University of Technology

Ren‐Hung Hwang

National Yang Ming Chiao Tung University

Yan-Min Lin

Qilu University of Technology

Chien‐Ming Chou

National Cheng Kung University

Shin-Shun Su

Chaoyang University of Technology

Wei-Teng Chang

National Yunlin University of Science and Technology

Yueh-Lin Tsai

JDA Software (United States)

Kai-Xiang Cao

National Yunlin University of Science and Technology

Shu‐Yu Lin

National Taipei University

Min‐Xiou Chen

National Dong Hwa University

Cooperative Institutions

Chaoyang University of Technology

National Yunlin University of Science and Technology

National Chung Cheng University

Indian Institute of Technology Delhi

National Yang Ming Chiao Tung University

Indraprastha Institute of Information Technology Delhi

National University of Singapore

National Cheng Kung University

Universidad del Noreste

Indian Institute of Technology Kharagpur

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Cross-Layer-Based Adaptive Vertical Handoff With Predictive RSS in Heterogeneous Wireless Networks

IEEE Transactions on Vehicular Technology (2008)

Ben‐Jye Chang Jun-Fu Chen

A heterogeneous wireless network consists of various wireless networks [e.g., Worldwide Interoperability for Microwave Access (WiMAX) and Wireless Fidelity (WiFi)] and cellular communications [e.g., beyond the third generation (B3G) and the fourth generation (4G)]. Vertical handoff is an important mechanism for achieving continuous seamless transmissions in these networks. In contrast to horizontal handoff, vertical handoff considers not only the received signal strength (RSS) but also the service-class mapping between handoff-in and handoff-out networks. Most previous works have adopted the RSS-based mechanism to determine handoff thresholds, which causes a serious ping-pong effect that increases unnecessary handoff. Although integrating the RSS-based mechanism with a hysteresis method reduces the unnecessary handoff, it suffers from high dropping [i.e., high Sum of Weighted Grade of Service (SWGoS)] and low utilization. Therefore, this paper proposes a cross-layer-based adaptive vertical handoff algorithm with predictive RSS to reduce the unnecessary handoff while significantly increasing utilization and decreasing connection dropping. The proposed approach determines the optimal target network in two phases, i.e., polynomial regression RSS prediction and Markov decision process analysis. Furthermore, fast changes in bandwidth caused by vertical handoff result in inaccurate Transmission Control Protocol (TCP) congestion control and, thus, reduce the TCP goodput. The cross-layer scheme provides a TCP receiver to reply to the TCP sender with the wireless network's protocol type. By using the cross-layer information, the TCP sender can accurately predict the available bandwidth and increase the network goodput. Numerical results indicate that the proposed cross-layer-based approach outperforms the other approaches in the number of vertical handoffs and SWGoS while yielding competitive utilization. In addition, the cross-layer scheme cooperates with existing TCP algorithms to increase goodput by up to 18%.

RSS

10.1109/tvt.2008.921619

Cite

Citations (153)

Reward-Based Radio Interface Selection of Hybrid 4G UMTS and LTE Communications for Fast Cloud Accesses

Wireless Personal Communications (2013)

Ben‐Jye Chang Ying‐Hsin Liang Kai-Xiang Cao

UMTS frequency bands

Air interface

10.1007/s11277-013-1399-y

Cite

Citations (4)

Dynamic update of aggregated routing information for hierarchical QoS routing in ATM networks

Ben‐Jye Chang Ren‐Hung Hwang

For achieving scalable and QoS-ware in large ATM networks, the ATM Private Network-to-Network Interface (PNNI) adopts hierarchical routing which reduces nodal and link information. In order to perform hierarchical routing efficiently, the network will consist of subnetworks, called peer groups, and peer groups will advertise the aggregated information periodically which is based on the time-based update interval or on an event driven basis. The time-based update policy is not adequate to cope with dynamic network traffic. Therefore, we propose a dynamic update policy, referred to as the cost-based update (DCU) policy, to enhance the accuracy of aggregated information and the performance of hierarchical routing, while decreasing the frequency of re-aggregation and information distribution and the overhead of communication. In our simulations, we compare the DCU policy with PNNI time-based update (DCU) policy, full update (FU) policy, and logarithm of residual bandwidth update (LRBU) policy. Our simulation results indicate that the proposed DCU policy yields better performance while significantly reduces the frequency of re-aggregation and the amount of distributed aggregation information.

Policy-based routing

Private Network-to-Network Interface

Hierarchical routing

10.1109/icpads.2001.934880

Cite

Citations (4)

Adaptive competitive on-line routing algorithm for IEEE 802.16j WiMAX multi-hop relay networks

Ben‐Jye Chang Ying‐Hsin Liang Shin-Shun Su

Based on the IEEE 802.16e standard, WiMAX has proposed a relay-based approach, i.e., IEEE 802.16j, to extend the service area of Base Stations (BSs) and to improve the received signal strength (RSS) quality. IEEE 802.16j has the capability to achieve two significant advantages: low-cost of building IEEE 802.16 WiMAX networks and compatible with existing WiMAX standards. According to diverse features on mobility and relay range, the Relay Station (RS) can be classified into three types: Fixed RS (FRS), Nomadic RS (NRS) and Mobile RS (MRS). The relay-based WiMAX network includes different types of RSs. To efficiently construct the relay-based WiMAX and determine an optimal routing path between a Mobile Station (MS) and the MR-BS become two important issues. This paper thus proposes an IEEE 802.16j-conformed relay-based adaptive competitive on-line routing approach, in which a multihop optimal path is selected in terms of link bandwidth, path length and channel condition. Numerical results indicate that the proposed routing approach significantly outperforms other approaches in Fractional Reward Loss (FRL), network utilization and average end-to-end path delay.

WiMAX

IEEE 802

RSS

10.1109/pimrc.2009.5450380

Cite

Citations (3)

An Efficient Adaptive Grouping for Single Code Assignment in WCDMA Mobile Networks

Wireless Personal Communications (2006)

Ren‐Hung Hwang Ben‐Jye Chang Min‐Xiou Chen Kun-Chan Tsai

Code (set theory)

Blocking (statistics)

Rake

Interleaving

10.1007/s11277-006-9065-2

Cite

Citations (12)

Distributed Wireless Links Repair for Maximizing Reliability and Utilization in Multicast MANET

Ben‐Jye Chang Yan-Min Lin Ying‐Hsin Liang

For achieving multicast routing in self-organizing wireless on demand networks, the multicast ad hoc on-demand distance vector (MAODV) routing protocol is proposed. In MAODV, a multicast tree is created when a sender wants to send packets to several receivers in mobile ad hoc networks (MANETs). In such ad hoc networks, wireless links may be lost occasionally due to mobile nodes on the multicast tree that are unreachable, which causes broken branches, low network reliability, and low packet delivery rate. For overcoming the problem MAODV provides a simple local repair mechanism that tries to find an alternative route to a tree by broadcasting the RREQ message from the downstream nodes of the broken link, but results in extensive control messages and obvious low successful repair rate. Therefore, in this paper we propose a unicast-type multihop local repair protocol in multicasting MANET to recover lost links efficiently while increasing network reliability, minimizing the number of control messages, and reducing repair delay. Meanwhile, the optimal number of hops of neighbor table is also analyzed. Numerical results demonstrate that the proposed multihop local repair approach outperforms other repair approaches in successful repair rate and control message overhead.

Geocast

10.1109/waina.2008.281

Cite

Citations (5)

Cross-layer-based adaptive congestion and contention controls for accessing cloud services in 5G IEEE 802.11 family wireless networks

Computer Communications (2017)

Ben‐Jye Chang Shih‐Pin Chen

Application layer

10.1016/j.comcom.2017.03.001

Cite

Citations (10)

Scalable Distributed Multicast Routing with Multiple Classes of QoS Guarantee

IEICE Transactions on Communications (2004)

Ren‐Hung Hwang Ben‐Jye Chang Wen-Cheng Hsiao Jenq‐Muh Hsu

This paper proposes dynamic distributed unicast and multicast routing algorithms for multiple classes of QoS guaranteed networks. Each link in such a network is assumed to be able to provide multiple classes of QoS guarantee by reserving various amounts of resource. A distributed unicast routing algorithm, DCSP (Distributed Constrained Shortest Path), for finding a QoS constrained least cost path between each O-D (Originating-Destination) pair, is proposed first. Two class reduction schemes, the linear and logarithmic policies, are develpoed to prevent exponential growth of the number of end-to-end QoS classes. Based on DCSP, two distributed multicast routing algorithms, DCSPT (Distributed Constrained Shortest Path Tree) and DTM (Distributed Takahashi and Mutsuyama), are proposed to find QoS constrained minimum cost trees. Numerical results indicate that DCSP strongly outperforms previously proposed centralized algorithms and it works better with the linear class reduction method. For the multicast routing algorithms, the DCSPT with linear class reduction method yields the best performance of all multicast routing algorithms.

Unicast

Source

Cite

Citations (3)

Wireless Sensor Network-Based Adaptive Vehicle Navigation in Multihop-Relay WiMAX Networks

Ben‐Jye Chang Bo-Jhang Huang Ying‐Hsin Liang

The main goal of vehicle navigation systems is to determine the optimal routing path for achieving the least travel time and exhausted gasoline. Most navigation systems use the static shortest path routing algorithm or use optional traffic information broadcasted by a centralized traffic information center (TIC) to avoid routing to heavy traffic load roads. Since the traffic information may be gathered from few monitoring devices that only covers some specific highways and roads, it results in some disadvantages, including only supporting partial traffic information on some roads, long update period and low reliability of using a centralized TIC. In consequence, the determined route could be the shortest distance route but it may not meet the demands of the optimal routing: the least travel time and exhausted gasoline. Therefore, we propose herein the wireless sensor network-based adaptive navigation approach, which uses the WiMAX multihop relay networks as the inter-vehicle communications (IVC) to increase the reliability and efficiency of inter-vehicle communications. Real-time traffic information could be gathered from various types of sensors equipped on vehicles and exchanged among neighbor vehicles. As a result, the navigation system can obtain three metrics of the road traffic density, road class and road distance to determine the optimal route. Numerical results indicate that the proposed adaptive navigation approach outperforms other approaches in the average travel time and average exhausted gasoline while yielding competitive average travel distance.

WiMAX

10.1109/aina.2008.23

Cite

Citations (37)

Dynamic Resource Allocation and Offloading Optimization for Network Slicing in B5G Multi-tier Multi-tenant Systems

Computer Networks (2024)

Ren‐Hung Hwang Jia-You Lin Yen Chuang Ben‐Jye Chang

Resource Management

10.1016/j.comnet.2024.110876

Cite

Citations (0)