To provide convenient wireless access, wireless mesh networks (WMNs) can be rapidly deployed and connected for mobile clients. Although route redirection traffic control schemes and dynamic routing metrics can be used to improve the performance of WMNs, more of the available network bandwidth will be consumed by control message exchange. This paper proposes a capacity-aware and multipath supported traffic control framework in WMNs. The proposed framework can be used to dispatch data traffic in a multipath manner to improve the utilization of wireless links and forwarding latency. A hierarchical queue architecture is proposed to monitor and classify network traffic without the effort of control message exchange. Our traffic control strategy, which is based on local minimization of the forwarding latency, consists of two phases to automatically adapt to the utilization rate of the network links. In the first phase, the incoming packets are dispatched to the lower level queues according to the Internet gateway capacity. In the second phase, the packets are dispatched to the related network links according to the link load. The current study implements the proposed traffic control system on NS2 for simulation and on Linux 2.6 for real traffic analysis. Experimental results show that the proposed framework improves the throughput and reduces forwarding delay with an approximate minimum delay time. The results also show that the behavior of the long-term delay model can be applied to short-term traffic control methods in WMNs.

To enhance throughput and reuse bandwidth, clustering techniques can effectively manage nodes in multi-hop wireless networks. However, in such networks, hidden terminal interference degrades the system performance and increases the average packet delay time. Therefore, this work presents novel two-level cluster-based code assignment techniques to resolve the hidden terminal problems. At the low level, five basic and an optimized intra-cluster code assignment schemes are developed to calculate the number of codes used in each cluster. At the high level, two inter-cluster code assignment schemes (coarse-grained and fine-grained controls) are proposed to obtain the minimal number of code sets. The merits of our schemes include low execution time, low probability of code re-assignment, and low overhead. Furthermore, the proposed schemes allow us to regionally update orthogonal codes when the topology varies. Experimental results demonstrate that the proposed schemes outperform conventional techniques. Among the five basic intra-cluster code assignment schemes, the ordering criteria of increasing number of one-hop neighbors is the best in terms of the number of orthogonal codes to avoid hidden terminal interference. The optimized intra-cluster code assignment scheme generally obtains fewer orthogonal codes than other schemes. For inter-cluster code assignment schemes, the coarse-grained control has a lower code allocation time. However, the fine-grained control requires fewer orthogonal codes.

In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selecting unsuitable clusterheads. In order to resolve the clusterhead change problem, the DL scheme restricts the number of clusterhead changes. The DL scheme also restricts the size of the virtual backbone by reducing the number of clusters. This scheme is distributed and can be executed at each node with only the knowledge of one-hop neighbors. The simulation results demonstrate that our scheme outperforms other clustering schemes in terms of the number of clusters, stability of the clusters and control overhead when the topology changes.

This work presents two novel algorithms to prevent rollback propagation for independent checkpointing: an efficient adaptive independent checkpointing algorithm and an optimized adaptive independent checkpointing algorithm. The last opportunity strategy that yields a better performance than the conservation strategy is also employed to prevent useless checkpoints for both causal rewinding paths and non-causal rewinding paths. The two methods proposed herein are domino effect-free and require only a limited amount of control information. They also take less unnecessary adaptive checkpoints than other algorithms. Furthermore, experimental results indicate that the checkpoint overhead of our techniques is lower than that of the coordinated checkpointing and domino effect-free algorithms for service-providing applications.

Distributed domino effect-free checkpointing techniques can be divided into two categories: coordinated and communication-induced checkpointing. The former is inappropriate for mobile computing systems because it either forces every mobile host to take a new checkpoint or blocks the underlying computation during the checkpointing process. The latter makes every mobile host take the checkpoint independently. However, each mobile host may need to store multiple local checkpoints in stable storage. This investigation presents a novel three level synchronous checkpointing algorithm that combines the advantages of above two methods for mobile computing systems. The algorithm utilizes pre-synchronization, quasi-synchronization, and post-synchronization techniques and has the following merits: (1) Consistent global checkpoints can be ensured. (2) No mobile host is blocked during checkpointing. (3) Only twice the checkpoint size is required. (4) Power consumption is low. (5) The disconnection problem of mobile hosts can be resolved. (6) Very few mobile hosts in doze mode are disturbed. (7) It is simple and easy to implement. The proposed algorithm's numerical results are also provided in this work for comparison. The comparison reveals that our algorithm outperforms other algorithms in terms of checkpoint overhead, maintained checkpoints, power consumption, and disturbed mobile hosts.