Recently, wireless multi-hop network using MIMO two-way relaying technique has been attracted much attention owing to its high network efficiency. It is well known that the MIMO two-way multi-hop network (MTMN) can provide its maximum throughput in uniform topology of node location. However, in realistic environments with non-uniform topology, network capacity degrades severely due to unequal link quality. Furthermore, the end-to-end capacity also degrades at high SNR due to far (overreach) interference existing in multi-hop relay scenarios. In this paper, we focus on several power allocation schemes to improve the end-to-end capacity performance of MTMN with non-uniform topology and far interference. Three conventional power allocation schemes are reformulated and applied under the system model of MTMN. The first two are centralized methods, i.e., Eigenvector based Power Allocation (EPA) which employs linear algebra and Optimal Power Allocation (OPA) using convex optimization. The last one is Distributed Power Allocation (DPA) using game theory. It is found from numerical analyses that the power allocation schemes are effective for MTMN in terms of end-to-end capacity improvement, especially in non-uniform node arrangement and at high SNR.

Recently, a number of concurrency control algorithms have been proposed for multidatabase system (MDBS) concurrency control methods (CCMs) and the most challenging issue of them has been a concern about how to ensure global serializability (GSR). In this paper, we examine two concurrency control algorithms of MDBS through simulation approach: optimistic ticket method (OTM) and global ticket method (GTM). In historical note, OTM is known to be the first practical solution, since this approach ensures GSR by way of automatically resolving indirect conflicts among global transactions without making any restrictions on local CCMs. However, OTM is expected to yield poor performance since it enforces all global transactions to take a local ticket which causes direct conflicts between them. In GTM, the global transaction manager in an MDBS assigns a global ticket to global transactions rather than accessing a local ticket as in OTM. Our experimental results showed that GTM outperforms OTM in cases that short timeout values are given. However, in case that the timeout value relatively becomes long, our results demonstrated that OTM outperforms GTM.

Existing research related to RSVP with mobility support has mainly focused on maintaining reservation state along the routing path, which changes continuously with the movements of mobile host (MH), without much overhead and delay. However, problems such as deepening RSVP's inherent scalability problem and requiring significant changes in the existing network infrastructure have not been adequately addressed. In this paper, we propose a new approach, known as Concatenation and Optimization for Reservation Path (CORP), which addresses these issues. In CORP, each BS pre-establishes pseudo reservations to its neighboring BSs in anticipation of the MH's movement. When the MH moves into another wireless cell, the associated pseudo reservation is activated and concatenated to the existing RSVP session to guarantee continuous QoS support. Because a pseudo reservation is recognized as a normal RSVP session by intermediate routers, little change is required in the current Internet environment to support both movements within a single routing domain and between two different routing domains. CORP also dynamically optimizes the extended reservation path to avoid the infinite path extension problem. Multicast addressing is used to further reduce resource consumption in the optimization process. The experimental results of the CORP implementation demonstrate that it significantly reduces the delay and overhead caused by handoffs compared to the case of establishing a new RSVP session. The improvement increases as the distance between the MH and its correspondent host (CH) grows.

In a mobile computing environment, in which communication channels are limited and have low-bandwidths, mobile transactions are long-lived and frequently disconnected with their wireless network in processing. Such peculiarities of mobile transactions make existing transaction scheduling schemes inadequate and raise new challenging research problems. In this paper, we propose a new scheduling scheme called OTS/MT (Optimistic Timestamp Scheme for Mobile Transactions) for mobile transaction scheduling. OTS/MT is based on an optimistic approach that is suitable for low data contention, and prevents indefinite postponement and cascading delay which are major drawbacks of the existing optimistic concurrency control scheme and the timestamp ordering scheme. In addition, the OTS/MT algorithm is inherently a deadlock-free scheduling scheme. In order to schedule mobile transactions, OTS/MT postpones the detection of conflict between mobile transactions until transaction commit time to improve the performance deterioration of TO. In this paper, we attempt to show that this application of optimism to TO is justified by way of simulation.