3 research outputs found

    Address reuse in wireless sensor networks

    Full text link
    Sensor Networks have applications in diverse fields. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks, it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose a dynamic addressing mechanism for wireless sensor networks. The scheme enables successful reuse of addresses in event-driven wireless sensor networks. It also eliminates the need for network-wide Duplicate Address Detection (DAD) to ensure uniqueness of network level addresses.<br /

    Route maintenance using mobility prediction for mobile ad hoc networks

    Full text link
    Next generation networks (3G &amp; 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)<br /

    User mobility prediction in hybrid and ad hoc wireless networks

    Full text link
    Next Generation Networks will employ hybrid network architectures using both cellular and ad hoc networking concepts. The vision of real-timemultimedia services requires that mobility management be addressed in a proactive manner. If the user movements can be predicted accurately in ahybrid network environment then handoff/cluster change, resource reservation and context transfer procedures can be efficiently completed as required by node mobility. In this work we propose a sectorized ad hoc mobility prediction scheme for cluster change prediction. Simulation study of the scheme shows it to be efficient in terms of prediction accuracy and prediction related control overhead despite randomness in user movement.<br /
    corecore