26,546 research outputs found

    Cross-Layer Design of Dynamic Link Prediction Power Control Algorithm in Wireless Ad hoc Networks

    Get PDF
    In wireless communication era, Dynamic Link Prediction based Cross-Layer Power Control Algorithm (DLP-CLPCA) in wireless ad hoc networks provides a joint solution for the power consumption protocol as well as nodes link availability.  The Conventional design of ad-hoc network protocols is built on the standard OSI model which has failed to relate with RSS problems, whereas the physical, datalink, network and transport layer has been influenced.  Due to this, the early unavailability of nodes occurs and frequent route break during the transmission. To overcome the constraint, developed the Dynamic Link Prediction based Cross-Layer Power Control Protocol to forecast the route earlier maximizes the link availability and create the optimum routing path during the transmission. The proposed link prediction algorithm is implemented in NS-2 simulator with the performance metrics as throughput, delay and energy consumption as a parameter values

    An Analysis Framework for Mobility Metrics in Mobile Ad Hoc Networks

    Get PDF
    Mobile ad hoc networks (MANETs) have inherently dynamic topologies. Under these difficult circumstances, it is essential to have some dependable way of determining the reliability of communication paths. Mobility metrics are well suited to this purpose. Several mobility metrics have been proposed in the literature, including link persistence, link duration, link availability, link residual time, and their path equivalents. However, no method has been provided for their exact calculation. Instead, only statistical approximations have been given. In this paper, exact expressions are derived for each of the aforementioned metrics, applicable to both links and paths. We further show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. These expressions can, therefore, be employed in a number of ways to improve performance of MANETs such as in the development of efficient algorithms for routing, in route caching, proactive routing, and clustering schemes

    Effective link operation duration: a new routing metric for mobile ad hoc networks

    Get PDF
    The dynamic topology of mobile ad hoc networks (MANETs) is caused by node mobility and fading of the wireless link. Link reliability is often measured by the estimated lifetime and the stability of a link. In this paper we propose that the stability of a link can be represented by the time duration in which the two nodes at each end of a link are within each other’s transmission range and the fading is above an acceptable threshold. A novel routing metric, called effective link operation duration (ELOD), is proposed and implemented into AODV (AODV-ELOD). Simulation results show that proposed AODVELOD outperforms both AODV and the Flow Oriented Routing Protocol (FORP)

    Improving network reliability by exploiting path diversity in ad hoc networks with bursty losses

    Get PDF
    In wireless mobile ad hoc networks, end-to-end connections are often subject to failures which do not make the connection non-operational indefinitely but interrupt the communication for intermittent short periods of time. These intermittent failures usually arise from the mobility of hosts, dynamics of the wireless medium or energy-saving mechanisms, and cause bursty packet losses. Reliable communication in this kind of an environment is becoming more important with the emerging use of ad hoc networks for carrying diverse multimedia applications such as voice, video and data. In this thesis, we present a new path reliability model that captures intermittent availability of the paths, and we devise a routing strategy based on our path reliability model in order to improve the network reliability. Our routing strategy takes the advantage of path diversity in the network and uses a diversity coding scheme in order not to compromise efficiency. In diversity coding scheme, if the original information is encoded by using a (N,K) code, then it is enough for the destination to receive any K bits correctly out of N bits to successfully decode the original information. In our scheme, the original information is divided into N subpackets and subpackets are distributed among the available disjoint paths in the network. The distribution of subpackets among the diverse paths is a crucial decision. The subpackets should be distributed 'intelligently' so that the probability of successful reconstruction of the original information is maximized. Given the failure statistics of the paths, and the code rate (N, K), our strategy determines the allocation of subpackets to each path in such a manner that the probability of reconstruction of the original information at the destination is maximized. Simulation results justify the accuracy and efficiency of our approach. Additionally, simulation results show that our multipath routing strategy improves the network reliability substantially compared to the single path routing. In wireless networks, a widely used strategy is to place the nodes into a low energy consuming sleep mode in order to prolong the battery life. In this study, we also consider the cases where the intermittent availability of the nodes is due to the sleep/awake cycles of wireless nodes. A sleep/awake scheduling strategy is proposed which minimizes the packet latency while satisfying the energy saving ratio specified by the energy saving mechanism
    corecore