Ying-Hong Wang

Dynamic backup routes routing protocol for mobile ad hoc networks

Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR^2P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR^2P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR^2P could more thoroughly improve the quality of routing protocol than those proposed in the past.

Ad hoc on-demand backup node setup routing protocol

An ad hoc wireless network provides infrastructureless data networking, where users have network services while they are continually moving. Instructureless, and mobility are properties of the ad hoc wireless networks. Furthermore, each move of the mobile host affects the change of network topology, and affects the change of the transmission route. There are numerous routing protocols developed for ad hoc wireless networks, and they may be generally categorized as table-driven or source-initiated on-demand. However, the properties of the ad hoc wireless networks still affect those routing algorithms. The ad hoc backup node setup routing protocol (ABRP) is proposed to lead us pay move attention on the intrinsic properties of the ad hoc wireless networks. It provides a more complete consideration of the routing quality. According to the proposed ABRP, the destination can receive some more routes in a period of time. Those routes from the source node to the destination node may give us ways to analyze and find some good backup routes to get more help for reconnection when a link failure occurs. The backup route information can be saved in a specific on-the-route node. The enables the backup routes to be rapidly found and traced back to these nodes when there are situations such as disconnection or connection loss. Moreover, the ABRP provides a backup node mechanism to reconnect maintenance quickly, so meeting the property of ad hoc wireless networks.

Multi-resolution image inpainting

Digital inpainting is an image interpolation mechanism, which can automatically restore damaged or partially removed image. Most inpainting mechanisms use a singular resolution approach on the extrapolation or interpolation of pixels. We propose a multi-resolution algorithm, which can take into consideration the different levels of details. The algorithm was tested on 1000 still images, with an evaluation showing the effectiveness of our approach. The demonstration of our work is available at: http://www.mine.tku.edu.tw/demos/inpaint.

Dynamic MAP Selection Mechanism for HMIPv6

Hierarchical Mobile IPv6 management(HMIPv6) which is drawn up by the IETF (Internet Engineering Task Force) utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update messages among the mobile node, correspondent node, and the mobile nodes home agent. According to the HMIPv6 mechanism, the MAP of higher layer can efficiently reduce the frequency of binding update messages; it will have higher loading of service and become the bottleneck of the whole network. Because the MAPs bandwidth of services is finite and if MAP serves as the gateway at the same time, the whole network will be crashed due to overloading. This research proposes a MAP selection mechanism that takes the mobile nodes particular characteristics which include the mobility velocity and quantity of communication services into consideration, the research can manage MAPs efficiently. Besides, the research also designs the MAP Load Balance mechanism to avoid the network crash due to the overloaded MAP.

A Routing Method by Reactive Energy Decision in Wireless Sensor Networks

The wireless sensor network (WSN) was extensively deployed and researched recently. While taking the advantage of smaller dimension, lower cost and simple structure of the sensor nodes, more restrictions come with sensors. Therefore, the limited power of sensor nodes is the most direct and difficult problem we meet. The limitation on the energy of sensor nodes creates the bottlenecks when designing the suitable routing protocols. In order to solve the problem of limited energy, the loading of nodes has to be distributed as possible as it could. If the energy consumption can be shared averagely by most nodes, then the lifetime of sensor networks will be enlarged. Thus we propose the routing protocol called Reactive Energy Decision Routing Protocol (REDRP) for the sensor network which considers several representative routing protocols in different structures. This protocol will create the routes in a reactive routing method to transmit the data gathered from nodes and the REDRP will use the residual energy of nodes as the routing decision for energy-aware. The results of simulation show that the more fairness usage of sensor nodes, the more energy consumption of entire network will be distributed by our protocol and the longer the lifetime of nodes.

A Location Mechanism with Mobile Reference Nodes in Wireless Sensor Networks

Since the mass development of the wireless network, the advancement in wireless communications and micro-electronics element promote the development of wireless sensor networks (WSNs). The sensor nodes of WSNs have the following abilities such as: sensing, computation, and wireless communication capabilities. Hence, WSNs can be used for various application domains. Recently, the localization issue in the WSNs has become an important research topic. In this paper, we propose a location mechanism with mobile reference nodes and Global Positioning System (GPS) to help sensor nodes to calculate the coordinate location information. And then sensor nodes deliver the coordinate location to base station through neighboring sensor nodes. By using this mechanism, we can calculate the coordinate location of the target sensor nodes. And then we can apply this mechanism to track or transfer data packets in the WSNs efficiently.

Mobile Sink Routing Protocol with Registering in Cluster-Based Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are wireless networks consisting of sink nodes and multiple sensor nodes. While the wireless sensor nodes have several advantages, such as the compact size and the low cost, corresponding constraints on resources can result. The greatest challenge among all is the constraint on energy. Therefore, how to minimize the energy consumption while maintaining an extended network lifetime becomes the most critical issue when it comes to the design of the routing protocol for the wireless sensor networks.

Video Presentation Recording and On-Line Broadcasting

Distance learning programs use on-line video records to deliver pre-recorded lectures. And, video communication systems can be used as a discussion tool. In this paper, we start our discussion on a multimedia presentation recording system which we had developed. We then present how the video recording concept can be further extended to realize an augmented video conferencing system, which can be used as a peer-to-peer discussion tool, as well as a lecture broadcasting system. We also point out that an object tracking technology can be further integrated to enhance the tool, to enable a more realistic and useful system for the discussion in distance education.

Software testing and metrics for concurrent computation

Verification and validation are two important technologies to assure the reliability and quality of software. Software testing and metrics are two approaches to execute the verification and validation. In sequential computation, a fairly mature process exists, with various methodologies and tools available for use in building and demonstrating the correctness of a program being tested. The emergence of concurrent computation in recent years, however, introduces new testing problems and difficulties that cannot be solved by the traditional sequential program testing techniques. Many concurrent program testing methodologies have been proposed to solve controlled execution and determinism. There have been few discussions of concurrent software testing from the inter-task viewpoint, even though the common characteristics of concurrent programming are the explicit identification of the large-grain parallel computation units (tasks) and the explicit inter-task communication via a rendezvous-style mechanism. In this paper, we focus on testing concurrent programs through task decomposition. We propose four testing criteria to test a concurrent program. A programmer can choose an appropriate testing strategy depending on the properties of the concurrent programs. Associated with the strategies, four equations are provided to measure the complexity of concurrent programs.

Semantic Representation and Ontology Construction in the Question Answering System

To build an automatic assistance for learning and provide a self-paced learning mechanism are the objectives in the e-learning environment. The paper improves the previous proposed Semantic Question Answering System which applies Link Grammar and WordNet to form a Semantic Tree to represent the meaning of question and further find the relevant answer based on the selected Data Structure Ontology. The paper addresses the improved functions including the flexible answering method which can refine the Semantic Tree to find more relevant answers, the Ontology Extension Module is designed to acquire data from Internet to raise the ontology and the Feedback for System module is designed for the instructors to provide more sufficient knowledge.