Tong-Ying Tony Juang

Learn More
The large-scale mobile Underwater Wireless Sensor Network (UWSN) is a useful networking paradigm to explore underwater environments. The characteristics of mobile UWSNs, such as low communication bandwidth, large propagation delay, and floating node mobility are significantly different from wireless sensor networks. In this paper, we propose a new efficient(More)
Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants, in the network, perhaps with some degree of support of virtual channels 1, 14, 15, 18, 23].(More)
Video Surveillance Services is increasingly becoming important part in daily live. For traditional distributed Video Surveillance Services, each video catcher will store its streaming data to server. It will create a great volume of data daily. The approach obviously incurs some problems in keeping daily data into the data center (DC), such as limited(More)
We present an optimistic crash recovery technique without any communication overhead during normal operations of the distributed system. Our technique does not append any information to the application messages, it does not suffer from the domino effect, and each processor rolls back at most once during recovery. We present three distributed rollback(More)
In this paper, a new approach is proposed to reduce handoff operation in IEEE 802.16e network. Traditional mobile approaches, such as mobile IPv6 (MIPv6) and hierarchical MIPv6 (HMIPv6), can support smoothly handoff. These approach, ,unfortunately, suffer large handoff delay and packet lost in macro mobility for mobile users. With the aid of the partner(More)
Recovery from transient processor failures can be achieved by using optimistic message logging and checkpointing. The faulty processorsroll back, and some/all of the non-faulty processors also may have to roll back. This paper formulates the rollback problem as a closure problem. A centralized closure algorithm is presented together with two efficient(More)
The arrangement graph An;k is not only a generalization of star graph (nÿ k ˆ 1), but also more ̄exible. In this investigation, we elucidate the problem of embedding of multiple spanning trees in an arrangement graph with the objective of congestion-free. This result is to report how to exploit 2…nÿ k† edge disjoint spanning trees in an arrangement graph,(More)
In this paper, we propose three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The rst one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the eeectiveness of(More)