High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.

In wireless sensor networks, an improved throughput capacity region can be achieved by equipping multiple channels. However, such approach inevitably brings the issue of solving the coupled channel assignment and scheduling problem. This paper put forward a low-complexity distributed channel assignment and scheduling policy for multichannel wireless sensor networks with single-hop traffic flows, named LDCS, as well as its multihop multipath extension. Under the proposed algorithms, random access and backoff time techniques are introduced to keep the complexity low and independent of the number of links and channels. Through theoretical analysis and simulation experiments, it is proved that the proposed algorithms are throughput guaranteed, and in some network scenarios, the achieved capacity region can be larger than that of other comparable distributed algorithms.

Due to the existence of channel difference, allocating network resources reasonably in multi-channel scenarios is much more complicated than that in single-channel cases. This paper designs a distributed channel assignment and scheduling algorithm for multi-channel multi-interface wireless networks, i.e., a resource allocation scheme in MAC layer. Via employing the random access technique and a tuple-based model, the proposed mechanism is proved to be able to guarantee a reliable throughput capacity region with complexity independent of the network size. On the other hand, the diversity of interfaces is further considered in addition to channel difference, which improves the adaptability of the developed algorithm.

Considering more practical scenarios in the designing of joint routing, channel‐assignment and scheduling algorithms in multichannel wireless networks, a modified routing selection scheme based on a performance guaranteed MP mechanism is put forward. The assumption made in MP, that the balance factor chosen for each link α _l = α for all links l is not reasonable, is pointed out and may influence the performance of MP badly in the case of channels with large diversity. Focusing on this point, a balance factor used for channel assignment in MP is taken into account in the stage of route selection and the limitation of original MP is relaxed. As a result, the proposed joint algorithm is able to better adapt to the condition of channels with large diversity. It is proved that the modified policy for MP is able to achieve the same capacity region as that of original MP.

In wireless networks, MAC scheduling methods can be divided into two types according to the implementation model: centralized and distributed scheduling. By reasonably designing MAC scheduling policies, both centralized and distributed schedulers can ensure a reliable throughput capacity region, i.e., realizing throughput-guaranteed. However, it can be found that some existing throughput-guaranteed scheduling schemes cannot further ensure bounded end-to-end average delay, and the reason for this phenomenon has not been deeply analyzed. In practical communication networks, throughput and delay are equally important. Based on this idea, the existing MAC scheduling strategies are investigated systematically in this paper from two aspects of throughput and delay, and their performances are evaluated and compared through both theoretical analysis and simulation experiments. The work of this paper provides a theoretical basis for the improvement of MAC scheduling technology in the next-generation wireless networks.