A Framework for Efficient Routing in MANET using Index Routing Tables-based Algorithms

Conventional network routing protocols rely on predefined numerical network unique node ID or group identifier for packet delivery, independent of semantic applications. This compels incorporation of resource/service discovery approaches in the design itself, at higher layers of network, causing additional overhead. This overhead, though tolerable in high speed wired networks, significantly restricts the performance in the infrastructure-less wireless ad hoc networks expending their limited battery resources, which are already consumed due to assigning unique identifiers to the naturally anonymous and high mobile nodes. This study proposes a single routing approach which facilitates descriptive and semantically-rich identification of network’s resources/services. This fusion of the discovery processes of the resources and the path based on their similarity in a single phase significantly reduces traffic load and latency of communication considering the generality too. Further, a framework capable of exploiting application-specific semantics of messages, adaptable to diverse traffic patterns is proposed. Analytical results amply illustrate the scalability and efficacy of the proposed method

Edge Reduce: Eliminating Mobile Network Traffic Using Application-Specific Edge Proxies

Mobile carriers are struggling to cope with the surge in smartphone traffic, which reflects badly on end users who often experience poor connectivity in densely populated urban environments. Data transfers between mobile client applications and their Internet backend services contribute significantly to the contention in radio access networks (RANs). Client applications, however, typically transfer unnecessary data because (i) backend service APIs do not support a fine-grained specification of the data actually required by clients and (ii) clients aggressively prefetch data that is never used. We describe EDGEREDUCE, an automated approach for reducing the data transmitted from backend services to a mobile device. Based on source-level program analysis, EDGEREDUCE generates application-specific proxies for mobile client applications that execute part of the application logic at the network edge to filter data returned by backend API calls and only send used data to the client. EDGEREDUCE also permits the tuning of aggressive prefetching strategies: proxies replace large prefetched objects such as images by futures, whose access by the client triggers the retrieval of the object on-demand. We show that EDGEREDUCE reduces the RAN traffic for real-world iOS client applications by up to 8×, with only a modest increase in response time

Resource Sharing via Planed Relay for HWN

We present an improved version of adaptive distributed cross-layer routing algorithm (ADCR) for hybrid wireless network with dedicated relay stations () in this paper. A mobile terminal (MT) may borrow radio resources that are available thousands mile away via secure multihop RNs, where RNs are placed at pre-engineered locations in the network. In rural places such as mountain areas, an MT may also communicate with the core network, when intermediate MTs act as relay node with mobility. To address cross-layer network layers routing issues, the cascaded ADCR establishes routing paths across MTs, RNs, and cellular base stations (BSs) and provides appropriate quality of service (QoS). We verify the routing performance benefits of over other networks by intensive simulation

Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks

publisher: Elsevier articletitle: Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks journaltitle: Ad Hoc Networks articlelink: http://dx.doi.org/10.1016/j.adhoc.2016.08.005 content_type: article copyright: © 2016 Elsevier B.V. All rights reserved