This page has only limited features, please log in for full access.

Unclaimed
Han-Chieh Chao
Department of Electrical Engineering, National Dong Hwa University, Hualien 97401, Taiwan

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 24 March 2021 in IEEE Sensors Journal
Reads 0
Downloads 0

Robotic musicianship research aims to the configuration of robots can analyze, reason, and generate music autonomous. The goal of this research is to achieve the inspiring and meaningful musical interactions between humans and artificially creative robots. This research presents a new model of automatic music generation which is based on least squares and generative adversarial networks (GANs). This research specifies classical piano as the music source and uses the sensors as the context-awareness technology to sense and receive the input audio in human-robot interaction. Therefore, this research applies sequence generation adversarial network (SeqGAN) techniques that are better able to address discrete issues in generating samples of classical piano melodies and datasets. Modifying the SeqGAN approach, this research presented the Least Squares SeqGAN (LS-SeqGAN) method to create melody units on different chords and generates a set of music pieces as testing dataset. In this research, we implement the original method and use the least squares method to stabilize the training of GANs. The performance evaluation shows that proposed LS-SeqGAN method can fulfill the need both of music quality and creativity. It offers a robust infrastructure for the human-robotic interaction that can be used to promote the related robotic applications.

ACS Style

Mu-Yen Chen; Wei Wei; Han-Chieh Chao; Yi-Fen Li. Robotic Musicianship Based on Least Squares and Sequence Generative Adversarial Networks. IEEE Sensors Journal 2021, PP, 1 -1.

AMA Style

Mu-Yen Chen, Wei Wei, Han-Chieh Chao, Yi-Fen Li. Robotic Musicianship Based on Least Squares and Sequence Generative Adversarial Networks. IEEE Sensors Journal. 2021; PP (99):1-1.

Chicago/Turabian Style

Mu-Yen Chen; Wei Wei; Han-Chieh Chao; Yi-Fen Li. 2021. "Robotic Musicianship Based on Least Squares and Sequence Generative Adversarial Networks." IEEE Sensors Journal PP, no. 99: 1-1.

Journal article
Published: 10 March 2020 in Computer Communications
Reads 0
Downloads 0

With the rapid growth of mobile devices and the emergence of 5G applications, the burden of cellular and the use of the licensed band have enormous challenges. In order to solve this problem, opportunity communication is regarded as a potential solution. It can use unlicensed bands to forward content to users under delay-tolerance constraints, as well as reduce cellular data traffic. Since opportunity communication is easily interrupted when User Equipment (UE) is moving, we adopt Artificial Intelligence (AI) to predict the location of the mobile UE. Then, the meta-heuristic algorithm is used to allocate multiple contents. In addition, deep learning-based methods almost need a lot of training time. Based on real-time requirements of the network, we propose AI-enabled opportunistic networks architecture, combined with Mobile Edge Computing (MEC) to implement edge AI applications. The simulation results show that the proposed multiple contents offloading mechanism can reduce cellular data traffic through UE location prediction and cache allocation.

ACS Style

Wei-Che Chien; Shih-Yun Huang; Chin-Feng Lai; Han-Chieh Chao; M. Shamim Hossain; Ghulam Muhammad. Multiple contents offloading mechanism in AI-enabled opportunistic networks. Computer Communications 2020, 155, 93 -103.

AMA Style

Wei-Che Chien, Shih-Yun Huang, Chin-Feng Lai, Han-Chieh Chao, M. Shamim Hossain, Ghulam Muhammad. Multiple contents offloading mechanism in AI-enabled opportunistic networks. Computer Communications. 2020; 155 ():93-103.

Chicago/Turabian Style

Wei-Che Chien; Shih-Yun Huang; Chin-Feng Lai; Han-Chieh Chao; M. Shamim Hossain; Ghulam Muhammad. 2020. "Multiple contents offloading mechanism in AI-enabled opportunistic networks." Computer Communications 155, no. : 93-103.

Journal article
Published: 12 September 2018 in Sensors
Reads 0
Downloads 0

Big data gathered from real systems, such as public infrastructure, healthcare, smart homes, industries, and so on, by sensor networks contain enormous value, and need to be mined deeply, which depends on a data storing and retrieving service. HBase is playing an increasingly important part in the big data environment since it provides a flexible pattern for storing extremely large amounts of unstructured data. Despite the fast-speed reading by RowKey, HBase does not natively support multi-conditional query, which is a common demand and operation in relational databases, especially for data analysis of ubiquitous sensing applications. In this paper, we introduce a method to construct a linear index by employing a Hilbert space-filling curve. As a RowKey generating schema, the proposed method maps multiple index-columns into a one-dimensional encoded sequence, and then constructs a new RowKey. We also provide a R-tree-based optimization to reduce the computational cost of encoding query conditions. Without using a secondary index mode, experimental results indicate that the proposed method has better performance in multi-conditional queries.

ACS Style

Bo Shen; Yi-Chen Liao; Dan Liu; Han-Chieh Chao. A Method of HBase Multi-Conditional Query for Ubiquitous Sensing Applications. Sensors 2018, 18, 3064 .

AMA Style

Bo Shen, Yi-Chen Liao, Dan Liu, Han-Chieh Chao. A Method of HBase Multi-Conditional Query for Ubiquitous Sensing Applications. Sensors. 2018; 18 (9):3064.

Chicago/Turabian Style

Bo Shen; Yi-Chen Liao; Dan Liu; Han-Chieh Chao. 2018. "A Method of HBase Multi-Conditional Query for Ubiquitous Sensing Applications." Sensors 18, no. 9: 3064.

Conference paper
Published: 09 August 2017 in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Reads 0
Downloads 0

Today’s vehicles technologies are getting better as well as the price of the vehicle is not too expensive so that almost every household has an own car. However, road space is limited so there is high opportunity to see the accidents on the high dense road. Current VANET technology has been able to inform rear vehicles do not go there so that the traffic congestion can be reduced. In this scenario, there are very large amount of emergency message will be generated. It will increase the burden of road side unit. In this paper, we propose a Markov-based model to predict behavior of vehicles so that we can identify which cars really need to receive this message. Simulation results show that this method can reduces the unnecessary message transmission indeed.

ACS Style

Hsin-Hung Cho; Wei-Chih Huang; Timothy K. Shih; Han-Chieh Chao. Emergency Message Reduction Scheme Using Markov Prediction Model in VANET Environment. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2017, 199, 129 -137.

AMA Style

Hsin-Hung Cho, Wei-Chih Huang, Timothy K. Shih, Han-Chieh Chao. Emergency Message Reduction Scheme Using Markov Prediction Model in VANET Environment. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. 2017; 199 ():129-137.

Chicago/Turabian Style

Hsin-Hung Cho; Wei-Chih Huang; Timothy K. Shih; Han-Chieh Chao. 2017. "Emergency Message Reduction Scheme Using Markov Prediction Model in VANET Environment." Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 199, no. : 129-137.

Editorial
Published: 05 May 2017 in Sustainability
Reads 0
Downloads 0

Future Sustainability Computing (FSC) is a novel research topic that deals with algorithms, procedures, and applications of information technologies for abundant life. In this Special Issue, we cover novel research and applications within the scope of sustainability computing dealing with hardware/software technologies, especially for frameworks and architectures. For example, topics include dynamic group management in Internet of Things (IoT); real-time video surveillance; security threats in Software Defined Network (SDN); real-time indoor Air-Quality level indicator; effectiveness of information systems security; load-balancing for inter-sensor convergence; neighbor discovery in sensor networks; transmission algorithm with Quality of Service (QoS) consideration; analysis of the relationship between Intrusion Detection System (IDS) alerts and darknet are included.

ACS Style

Jong Hyuk Park; Han-Chieh Chao. Advanced IT-Based Future Sustainable Computing. Sustainability 2017, 9, 757 .

AMA Style

Jong Hyuk Park, Han-Chieh Chao. Advanced IT-Based Future Sustainable Computing. Sustainability. 2017; 9 (5):757.

Chicago/Turabian Style

Jong Hyuk Park; Han-Chieh Chao. 2017. "Advanced IT-Based Future Sustainable Computing." Sustainability 9, no. 5: 757.

Journal article
Published: 28 April 2016 in Mobile Networks and Applications
Reads 0
Downloads 0

A mature cloud system needs a complete resource allocation policy which includes internal and external allocation. They not only enable users to have better experiences, but also allows the cloud provider to cut costs. In the other words, internal and external allocation are indispensable since a combination of them is only a total solution for whole cloud system. In this paper, we clearly explain the difference between internal allocation (IA) and external allocation (EA) as well as defining the explicit IA and EA problem for the follow up research. Although many researchers have proposed resource allocation methods, they are just based on subjective observations which lead to an imbalance of the overall cloud architecture, and cloud computing resources to operate se-quentially. In order to avoid an imbalanced situation, in previous work, we proposed Data Envelopment Analysis (DEA) to solve this problem; it considers all of a user’s demands to evaluate the overall cloud parameters. However, although DEA can provide a higher quality solution, it requires more time. So we use the Q-learning and Data Envelopment Analysis (DEA) to solve the imbalance problem and reduce computing time. As our simulation results show, the proposed DEA+Qlearning will provide almost best quality but too much calculating time.

ACS Style

Hsin-Hung Cho; Chin-Feng Lai; Timothy K. Shih; Han-Chieh Chao. Learning-Based Data Envelopment Analysis for External Cloud Resource Allocation. Mobile Networks and Applications 2016, 21, 846 -855.

AMA Style

Hsin-Hung Cho, Chin-Feng Lai, Timothy K. Shih, Han-Chieh Chao. Learning-Based Data Envelopment Analysis for External Cloud Resource Allocation. Mobile Networks and Applications. 2016; 21 (5):846-855.

Chicago/Turabian Style

Hsin-Hung Cho; Chin-Feng Lai; Timothy K. Shih; Han-Chieh Chao. 2016. "Learning-Based Data Envelopment Analysis for External Cloud Resource Allocation." Mobile Networks and Applications 21, no. 5: 846-855.

Journal article
Published: 09 May 2015 in Mobile Networks and Applications
Reads 0
Downloads 0

The first service-oriented virtual machine (VM) placement for green data center is designed in this work. Integer Linear Programming (ILP) is the problem design basis. The Tree algorithm is proposed to place VM role instances at the lowest communication cost, economizing the construction cost with fewer physical servers. Another Forest algorithm is also proposed for balancing the computation load between the physical machines. Both of the proposed algorithms are formulated on the graph theoretic technique and evaluated and analyzed using the Best Fit algorithm in the simulations. Although the total power consumption and average utility of both proposed algorithms are slightly impaired, the unnecessary outbound communication cost is significantly eliminated and decreased, especially in the immense number of services. The results show that the proposed Tree and Forest algorithms provide lower communication cost than the Best Fit algorithm, and achieve green communications for large scale environment such as cloud or green data center.

ACS Style

Fan-Hsun Tseng; Chi-Yuan Chen; Li-Der Chou; Han-Chieh Chao; Jian-Wei Niu. Service-Oriented Virtual Machine Placement Optimization for Green Data Center. Mobile Networks and Applications 2015, 20, 556 -566.

AMA Style

Fan-Hsun Tseng, Chi-Yuan Chen, Li-Der Chou, Han-Chieh Chao, Jian-Wei Niu. Service-Oriented Virtual Machine Placement Optimization for Green Data Center. Mobile Networks and Applications. 2015; 20 (5):556-566.

Chicago/Turabian Style

Fan-Hsun Tseng; Chi-Yuan Chen; Li-Der Chou; Han-Chieh Chao; Jian-Wei Niu. 2015. "Service-Oriented Virtual Machine Placement Optimization for Green Data Center." Mobile Networks and Applications 20, no. 5: 556-566.

Journal article
Published: 29 January 2015 in Mobile Networks and Applications
Reads 0
Downloads 0

A large number of new data consuming applications are emerging in the daily routines of mobile users. Device-to-Device (D2D) communication as a new paradigm is introduced to reduce the increasing traffic and offload it to the user equipment (UE). With the development of UE multi-radio interface, we first develop a new hybrid architecture concept for D2D communication. The architecture combines ISM 2.4G spectrum as the Out-Band mode using Bluetooth and Wifi-Direct with the cellular spectrum as the In-Band mode. Secondly, we design a scheme that forms the Out-Band cluster and makes the following periodic signaling interaction via the Bluetooth interface. Traffic is transferred via the Wifi-Direct interface inside the cluster but carried on the cellular spectrum among the clusters. Simulation results show that our proposal increases the system throughput, saves power consumption and prolongs the clusters lifetime.

ACS Style

Zhijian Lin; Zhibin Gao; Lianfen Huang; Chi-Yuan Chen; Han-Chieh Chao. Hybrid Architecture Performance Analysis for Device-to-Device Communication in 5G Cellular Network. Mobile Networks and Applications 2015, 20, 713 -724.

AMA Style

Zhijian Lin, Zhibin Gao, Lianfen Huang, Chi-Yuan Chen, Han-Chieh Chao. Hybrid Architecture Performance Analysis for Device-to-Device Communication in 5G Cellular Network. Mobile Networks and Applications. 2015; 20 (6):713-724.

Chicago/Turabian Style

Zhijian Lin; Zhibin Gao; Lianfen Huang; Chi-Yuan Chen; Han-Chieh Chao. 2015. "Hybrid Architecture Performance Analysis for Device-to-Device Communication in 5G Cellular Network." Mobile Networks and Applications 20, no. 6: 713-724.

Journal article
Published: 18 September 2014 in Electronic Commerce Research
Reads 0
Downloads 0

Intelligent ubiquitous environments (IUEs) are a new paradigm that offers computing and communication services at any time and anywhere. IUEs are normally implemented by advanced applications and services including cloud computing and mobile computing. The services computing is a new cross-discipline that covers the science and technology needed to bridge the gap between business services and IT/telecommunication services. The goal of this special issue is to develop new computing technology and thereby enables more advanced IT/telecommunication services to support business services more efficiently and effectively. This special issue aims to foster the dissemination of high quality research in any new theory, technique, and research related to recent advanced services computing technology for IUEs, as well as to enhance its state-of-the-art. Topics of primary interest include: Application integration services Business performance management Social networked applications and services

ACS Style

Jongsung Kim; Han-Chieh Chao; Uyen Trang Nguyen. Recent advanced applications and services for intelligent ubiquitous environments. Electronic Commerce Research 2014, 14, 217 -221.

AMA Style

Jongsung Kim, Han-Chieh Chao, Uyen Trang Nguyen. Recent advanced applications and services for intelligent ubiquitous environments. Electronic Commerce Research. 2014; 14 (3):217-221.

Chicago/Turabian Style

Jongsung Kim; Han-Chieh Chao; Uyen Trang Nguyen. 2014. "Recent advanced applications and services for intelligent ubiquitous environments." Electronic Commerce Research 14, no. 3: 217-221.

Journal article
Published: 16 November 2012 in Computing
Reads 0
Downloads 0

The combination of vehicles and wireless communication has resulted in a promising future for vehicular ad hoc networks (VANETs). The VANET is a kind of network that can be built randomly, quickly and temporarily without any infrastructure. The routing of data in a VANET is a challenging task due to the high dynamics, unstable connection environments and transfer direction limit (real road planning) involved. However, it has been discussed that radio obstacles, as found in urban areas, have a significant negative impact on the performance of location based routing. Therefore, the design of a suitable routing protocol for VANETs is an important issue, especially in regard to inter-vehicle communication applications. This paper proposes a energy-efficient geographic routing algorithm that uses the direction, density and distance between nodes in the crossroad routing strategy, to improve the link stability. We compare the novel scheme, ad hoc on-demand distance vector, and dynamic source routing (DSR) for packet loss rate and average end-to-end delay in VANETs to reduce the power consumptions. The simulation results are obtained which demonstrate the power effectiveness of our proposed routing strategy.

ACS Style

Jian-Ming Chang; Chin-Feng Lai; Han-Chieh Chao; Rongbo Zhu. An energy-efficient geographic routing protocol design in vehicular ad-hoc network. Computing 2012, 96, 119 -131.

AMA Style

Jian-Ming Chang, Chin-Feng Lai, Han-Chieh Chao, Rongbo Zhu. An energy-efficient geographic routing protocol design in vehicular ad-hoc network. Computing. 2012; 96 (2):119-131.

Chicago/Turabian Style

Jian-Ming Chang; Chin-Feng Lai; Han-Chieh Chao; Rongbo Zhu. 2012. "An energy-efficient geographic routing protocol design in vehicular ad-hoc network." Computing 96, no. 2: 119-131.

Book chapter
Published: 01 January 2012 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

Due to the technological advances and innovation, Cloud Computing has become the future Internet trend. Users can use Internet services anytime and anywhere through the Cloud virtualization framework and the rapid development of mobile devices. Especially in 3G even 4G-related technologies evolution, the increasing bandwidth makes the media service becomes a popular service. However, due to the heterogeneity of mobile devices, supporting all kinds of media transmission format for a single device is impractical. Even we can install file conversion program in a device to solve this problem, but it would cause additional power consumption and time wasting. In order to solve this problem smoothly, we propose a Distributed Media Conversion System (DMCS) over Cloud Environment. DMCS is based on MapReduce frameworks to conduct distributed media Conversion. With the help of DMCS, we can adjust the multimedia transmission format based on user terminal devices for decreasing energy consumption and assuring media service quality.

ACS Style

Shih-Wen Hsu; Chi-Yuan Chen; Wei-Kuan Shih; Han-Chieh Chao. Distributed Media Conversion System over Cloud Environment. Lecture Notes in Electrical Engineering 2012, 285 -290.

AMA Style

Shih-Wen Hsu, Chi-Yuan Chen, Wei-Kuan Shih, Han-Chieh Chao. Distributed Media Conversion System over Cloud Environment. Lecture Notes in Electrical Engineering. 2012; ():285-290.

Chicago/Turabian Style

Shih-Wen Hsu; Chi-Yuan Chen; Wei-Kuan Shih; Han-Chieh Chao. 2012. "Distributed Media Conversion System over Cloud Environment." Lecture Notes in Electrical Engineering , no. : 285-290.

Special issue paper
Published: 13 July 2011 in Security and Communication Networks
Reads 0
Downloads 0

Key establishment is the most fundamental cryptographic primitive in all kinds of applications where security is a concern. However, the nature of limited resources on sensor nodes restricts the use of conventional key management techniques in wireless sensor networks. Many researchers have conducted different techniques to propose different types of key distribution schemes. In this paper, we survey the existing solutions and describe the state‐of‐the‐art techniques. We not only classify these proposals into location‐independent key distribution schemes and location‐dependent key distribution schemes but also provide a comparison table. We hope to attract more research attentions on this direction. Copyright © 2011 John Wiley & Sons, Ltd.

ACS Style

Chi-Yuan Chen; Han-Chieh Chao. A survey of key distribution in wireless sensor networks. Security and Communication Networks 2011, 7, 2495 -2508.

AMA Style

Chi-Yuan Chen, Han-Chieh Chao. A survey of key distribution in wireless sensor networks. Security and Communication Networks. 2011; 7 (12):2495-2508.

Chicago/Turabian Style

Chi-Yuan Chen; Han-Chieh Chao. 2011. "A survey of key distribution in wireless sensor networks." Security and Communication Networks 7, no. 12: 2495-2508.

Journal article
Published: 27 June 2011 in Sensors
Reads 0
Downloads 0

In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm’s ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms.

ACS Style

Wenzhong Guo; Naixue Xiong; Han-Chieh Chao; Sajid Hussain; Guolong Chen. Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks. Sensors 2011, 11, 6533 -6554.

AMA Style

Wenzhong Guo, Naixue Xiong, Han-Chieh Chao, Sajid Hussain, Guolong Chen. Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks. Sensors. 2011; 11 (7):6533-6554.

Chicago/Turabian Style

Wenzhong Guo; Naixue Xiong; Han-Chieh Chao; Sajid Hussain; Guolong Chen. 2011. "Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks." Sensors 11, no. 7: 6533-6554.

Journal article
Published: 01 June 2011 in Mathematical and Computer Modelling
Reads 0
Downloads 0

And multi-constrained QoS multicast routing based on the genetic algorithm for MANETs, Mathematical and Computer Modelling (2010), doi:10.1016/j.mcm.2010.10.008 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain.

ACS Style

Yun-Sheng Yen; Han-Chieh Chao; Ruay-Shiung Chang; Athanasios Vasilakos. Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling 2011, 53, 2238 -2250.

AMA Style

Yun-Sheng Yen, Han-Chieh Chao, Ruay-Shiung Chang, Athanasios Vasilakos. Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling. 2011; 53 (11-12):2238-2250.

Chicago/Turabian Style

Yun-Sheng Yen; Han-Chieh Chao; Ruay-Shiung Chang; Athanasios Vasilakos. 2011. "Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs." Mathematical and Computer Modelling 53, no. 11-12: 2238-2250.

Journal article
Published: 24 May 2011 in Telecommunication Systems
Reads 0
Downloads 0

In this paper, we proposed a scheduling handover mechanism called SMIPv6 which is based on Mobile IPv6. In the SMIPv6, a new care-of-address is obtained by IP preconfiguration and afterwards, we calculated a better timing to process the handover. Compared with FMIPv6 (Fast handover for MIPv6), SMIPv6 has done away with the tunnel mechanism and reduced the bandwidth waste. Hence, SMIPv6 can reduce the CPU loading of the access routers. Finally, the simulation results showed that SMIPv6 has better handover efficiency and does not cause packet sequence disorders when compared with FMIPv6.

ACS Style

Y.-S. Yen; L.-Y. Chen; T.-Y. Chi; H.-C. Chao. A novel predictive scheduling handover on mobile IPv6. Telecommunication Systems 2011, 52, 461 -473.

AMA Style

Y.-S. Yen, L.-Y. Chen, T.-Y. Chi, H.-C. Chao. A novel predictive scheduling handover on mobile IPv6. Telecommunication Systems. 2011; 52 (2):461-473.

Chicago/Turabian Style

Y.-S. Yen; L.-Y. Chen; T.-Y. Chi; H.-C. Chao. 2011. "A novel predictive scheduling handover on mobile IPv6." Telecommunication Systems 52, no. 2: 461-473.

Journal article
Published: 01 April 2010 in Mathematical and Computer Modelling
Reads 0
Downloads 0

In Wireless Mesh Networks (WMN), the optimal routing of data depends on the link capacities which are determined by link scheduling. The optimal performance of the network, therefore, can only be achieved by joint routing and scheduling optimization. Although the joint single-path routing and scheduling optimization problem has been extensively studied, its multi-path counterpart within wireless mesh networks has not yet been fully investigated. In this paper, we present an optimization architecture for joint multi-path QoS routing and the underlying wireless link scheduling in wireless mesh networks. By employing the contention matrix to represent the wireless link interference, we formulate a utility maximization problem for the joint multi-path routing and MAC scheduling and resolve it using the primal–dual method. Since the multi-path routing usually results in the non-strict concavity of the primal objective function, we first introduce the Proximal Optimization Algorithm to get around such difficulty. We then propose an algorithm to solve the routing subproblem and the scheduling subproblem via the dual decomposition. Simulations demonstrate the efficiency and correctness of our algorithm.

ACS Style

Yajun Li; Liang Zhou; Yuhang Yang; Han-Chieh Chao. Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks. Mathematical and Computer Modelling 2010, 53, 458 -470.

AMA Style

Yajun Li, Liang Zhou, Yuhang Yang, Han-Chieh Chao. Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks. Mathematical and Computer Modelling. 2010; 53 (3):458-470.

Chicago/Turabian Style

Yajun Li; Liang Zhou; Yuhang Yang; Han-Chieh Chao. 2010. "Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks." Mathematical and Computer Modelling 53, no. 3: 458-470.

Journal article
Published: 31 March 2010 in Journal of Systems and Software
Reads 0
Downloads 0

The Capacity and Flow Assignment problem in self-healing ATM networks is an interesting one from a Generalized Multi-Protocol Label Switching (GMPLS) prospective since IP and ATM protocols are destined to co-exist together in this unified platform. This paper continues the investigation of the path-based design approach of the network survivability problem in existing ATM mesh networks. Our contribution consists in quantifying (1) the effects the selection of candidate paths per node pair has on the restoration ratio, (2) the effect of restoration schemes on the restoration ratio, (3) the effect of failure scenarios on the restoration ratio, and finally (4) the effect of network connectivity on the restoration ratio. Numerical results are presented under representative network topologies, various traffic demands and spare capacity distribution schemes. They provide additional guidelines for the design of survivable ATM mesh-type networks, from a network reliability viewpoint.

ACS Style

Isaac Woungang; Guangyan Ma; Mieso K. Denko; Sudip Misra; Han-Chieh Chao; Mohammad S. Obaidat. Survivable ATM mesh networks: Techniques and performance evaluation. Journal of Systems and Software 2010, 83, 457 -466.

AMA Style

Isaac Woungang, Guangyan Ma, Mieso K. Denko, Sudip Misra, Han-Chieh Chao, Mohammad S. Obaidat. Survivable ATM mesh networks: Techniques and performance evaluation. Journal of Systems and Software. 2010; 83 (3):457-466.

Chicago/Turabian Style

Isaac Woungang; Guangyan Ma; Mieso K. Denko; Sudip Misra; Han-Chieh Chao; Mohammad S. Obaidat. 2010. "Survivable ATM mesh networks: Techniques and performance evaluation." Journal of Systems and Software 83, no. 3: 457-466.

Journal article
Published: 26 March 2010 in Sensors
Reads 0
Downloads 0

An Unattended Wireless Sensor Network (UWSN) can be used in many applications to collect valuable data. Nevertheless, due to the unattended nature, the sensors could be compromised and the sensor readings would be maliciously altered so that the sink accepts the falsified sensor readings. Unfortunately, few attentions have been given to this authentication problem. Moreover, existing methods suffer from different kinds of DoS attacks such as Path-Based DoS (PDoS) and False Endorsement-based DoS (FEDoS) attacks. In this paper, a scheme, called AAD, is proposed to Acquire Authentic Data in UWSNs. We exploit the collaboration among sensors to address the authentication problem. With the proper design of the collaboration mechanism, AAD has superior resilience against sensor compromises, PDoS attack, and FEDoS attack. In addition, compared with prior works, AAD also has relatively low energy consumption. In particular, according to our simulation, in a network with 1, 000 sensors, the energy consumed by AAD is lower than 30% of that consumed by the existing method, ExCo. The analysis and simulation are also conducted to demonstrate the superiority of the proposed AAD scheme over the existing methods.

ACS Style

Chia-Mu Yu; Chi-Yuan Chen; Chun-Shien Lu; Sy-Yen Kuo; Han-Chieh Chao. Acquiring Authentic Data in Unattended Wireless Sensor Networks. Sensors 2010, 10, 2770 -2792.

AMA Style

Chia-Mu Yu, Chi-Yuan Chen, Chun-Shien Lu, Sy-Yen Kuo, Han-Chieh Chao. Acquiring Authentic Data in Unattended Wireless Sensor Networks. Sensors. 2010; 10 (4):2770-2792.

Chicago/Turabian Style

Chia-Mu Yu; Chi-Yuan Chen; Chun-Shien Lu; Sy-Yen Kuo; Han-Chieh Chao. 2010. "Acquiring Authentic Data in Unattended Wireless Sensor Networks." Sensors 10, no. 4: 2770-2792.

Journal article
Published: 15 January 2010 in Computers & Mathematics with Applications
Reads 0
Downloads 0
ACS Style

Hongchao Wang; Hongke Zhang; Chi-Yuan Chang; Han-Chieh Chao. A universal access control method based on host identifiers for Future Internet. Computers & Mathematics with Applications 2010, 60, 176 -186.

AMA Style

Hongchao Wang, Hongke Zhang, Chi-Yuan Chang, Han-Chieh Chao. A universal access control method based on host identifiers for Future Internet. Computers & Mathematics with Applications. 2010; 60 (2):176-186.

Chicago/Turabian Style

Hongchao Wang; Hongke Zhang; Chi-Yuan Chang; Han-Chieh Chao. 2010. "A universal access control method based on host identifiers for Future Internet." Computers & Mathematics with Applications 60, no. 2: 176-186.

Conference paper
Published: 01 January 2010 in IET International Conference on Frontier Computing. Theory, Technologies and Applications
Reads 0
Downloads 0
ACS Style

Jian-Ming Chang; Ting-Yun Chi; Hsin-Yun Yang; Han-Chieh Chao. The 6LoWPAN ad-hoc on demand distance vector routing with multi-path scheme. IET International Conference on Frontier Computing. Theory, Technologies and Applications 2010, 1 .

AMA Style

Jian-Ming Chang, Ting-Yun Chi, Hsin-Yun Yang, Han-Chieh Chao. The 6LoWPAN ad-hoc on demand distance vector routing with multi-path scheme. IET International Conference on Frontier Computing. Theory, Technologies and Applications. 2010; ():1.

Chicago/Turabian Style

Jian-Ming Chang; Ting-Yun Chi; Hsin-Yun Yang; Han-Chieh Chao. 2010. "The 6LoWPAN ad-hoc on demand distance vector routing with multi-path scheme." IET International Conference on Frontier Computing. Theory, Technologies and Applications , no. : 1.