A review of current mobility prediction techniques for ad hoc networks

Next Generation Networks (3G & beyond) will support real-time multimedia applications through traditional wide-area networking concepts as well as hot-spot (WLAN) and ad hoc networking concepts. In order to fulfil the vision of Next Generation Networks a method of maintaining a real-time flow despite frequent topology changes and irregularity in user movement is required. Mobility Prediction has been identified as having applications in the areas of link availability estimation and pro-active routing in ad hoc networks. In this work we present an overview of current mobility prediction schemes that have been proposed. Simulation results are also presented.

Route maintenance using mobility prediction for mobile ad hoc networks

Next generation networks (3G & beyond) will support real-time multimedia applications through traditional wide-area networking concepts as well as hot-spot (WLAN) and ad hoc networking concepts. In order to fulfill the vision of next generation networks a method of maintaining a real-time flow despite frequent topology changes and irregularity in user movement is required. Mobility prediction has been identified as having applications in the areas of link availability estimation and pro-active routing in ad hoc networks. In this work we present the mobility prediction based algorithm for route maintenance in mobile ad hoc networks. Simulation study of the algorithm proves it to offer significant benefits to dynamic source routing (DSR)

Applying fair intelligent congestion control in a hybrid QoS architecture for wireless environment

This simple and scalable Differentiated Services (DiffServ) QoS control model is acceptable for the core of the network. However, more explicit and stringent admission and reservation based QoS mechanisms are required in the wireless access segment of the network, where available resources are severely limited and the degree of traffic aggregation is not significant, thus rendering the DiffServ principles less effective. In this paper we present a suitable hybrid QoS architecture framework to address the problem. At the wireless access end, the local QoS mechanism is designed in the context of IEEE 802.11 WLAN with 802.11e QoS extensions. At the edge and over the DiffServ domain, the Fair Intelligent Congestion Control (FICC) algorithm is applied to provide fairness among traffic aggregates and control congestion at the bottleneck interface between the wireless link and the network core.

Adaptation of LEACH routing protocol to cognitive radio sensor networks

One of the drawbacks of LEACH protocol is the uncontrolled selection of cluster heads which, in some rounds, leads to the concentration of them in a limited area due to the randomness of the selection procedure. LEACH-C is a variant of LEACH that uses a centralized clustering algorithm and forms good clusters through sink control. According to experimental results, the IEEE 802.15.4 packets are damaged by WLAN interferences in ISM band. It seems that, sensor nodes equipped with cognitive radio capabilities can overcome this problem. In cognitive radio sensor networks (CRSN), routing must be accompanied by channel allocation. This requires spectrum management which can be devolved to cluster heads. For this networks, new duty cycle mechanisms must be designed that jointly consider neighbor discovery, and spectrum sensing/allocation. Cluster-based network architecture is a good choice for effective dynamic spectrum management. In such architecture, cluster heads have a proper spatial distribution and are optimally located all over the network. In this paper, using the physical layer information and preserving the feature of random cluster head selection in LEACH, it has been tried to both move the position of cluster heads to appropriate locations and make their quantity optimal. The simulation results show that the transferal of cluster heads to appropriate locations increases the network lifetime significantly though this comes at the price of early instability appearance. By considering the energy level in cluster head election algorithm, one can overcome the network stability issues too. However, this will move the cluster heads away from their appropriate locations. © 2012 IEEE.