A literature review on collaborative caching techniques in MANETs: issues and methods used in serving queries

Collaborative cache management in Mobile Ad Hoc Networks (MANETs) environment is considered as an efficient technique to increase data accessibility and availability, by sharing and coordination among mobile nodes. Due to nodes’ mobility, limited battery power and insufficient bandwidth, researchers addressed these challenges by developing many different collaborative caching schemes. The objective of this paper is to review various collaborative caching techniques in MANETs. Collaborative caching techniques are classified by methods used in serving queries, such as: hop-by-hop discovering, broadcasting messages, flooding, and query service differentiation. This review reveals that techniques utilizing hop-by-hop methods have better performance compared to others, especially techniques using additional strategies

On Improving the Robustness of Partitionable Internet-Based Mobile Ad Hoc Networks

Recent technological advances in portability, mobility support, and high speed wireless communications and users' insatiable interest in accessing the Internet have fueled to development of mobile wireless networks. Internet-based mobile ad hoc network (IMANET) is emerging as a ubiquitous communication infrastructure that combines a mobile ad hoc network (MANET) and the Internet to provide universal information accessibility. However, communication performance may be seriously degraded by network partitions resulted from frequent changes of the network topology. In this paper, we propose an enhanced least recently used replacement policy as a part of the aggregate cache mechanism to improve the information accessibility and reduce the access latency in the presence of network partitioning. The enhanced aggregate cache is analyzed and also evaluated by simulation. Extensive simulation experiments are conducted under various network topologies by using three different mobility models: random waypoint, Manhattan grid, and mo -di -fied random waypoint. The simulation results indicate that the proposed policy significantly improves communication performance in varying network topologies, and relieves the network partition problem to a great extent

Enhanced Distributed File Replication Protocol for Efficient File Sharing in Wireless Mobile Ad-Hoc Networks.

File sharing applications in mobile unintended networks (MANETs) have attracted additional and additional attention in recent years. The potency of file querying suffers from the distinctive properties of such networks as well as node quality and restricted communication vary and resource. associate degree intuitive methodology to alleviate this drawback is to form file replicas within the network. However, despite the efforts on file replication, no analysis has targeted on the worldwide optimum duplicate creation with minimum average querying delay. Specifically, current file replication protocols in mobile unintended networks have 2 shortcomings. First, they lack a rule to portion restricted resources to completely different files so as to reduce the typical querying delay. Second, they merely contemplate storage as offered resources for replicas, however neglect the actual fact that the file holders’ frequency of meeting different nodes additionally plays a crucial role in deciding file availableness. Actually, a node that contains a higher meeting frequency with others provides higher availableness to its files. This becomes even additional evident in sparsely distributed MANETs, during which nodes meet disruptively. during this paper, we have a tendency to introduce a replacement conception of resource for file replication, that considers each node storage and meeting frequency. we have a tendency to on paper study the influence of resource allocation on the typical querying delay and derive a resource allocation rule to reduce the typical querying delay. we have a tendency to additional propose a distributed file replication protocol to appreciate the projected rule. intensive trace-driven experiments with synthesized traces and real traces show that our protocol are able to do shorter average querying delay at a lower value than current replication protocols

Trust-Based Security Technique to Curb Cooperative Black Hole Attacks in Mobile Ad Hoc Networks using OTB-DSR Protocol in NS-3

The advent of mobile technology led to the emergence of Mobile Ad-hoc networks (MANETs). These networks have no infrastructure and central authority. Nodes in MANETs act as both routers and hosts. MANET nodes join and leave the network at will making the network topology dynamic. MANETs are prone to both passive and active security attacks. Blackhole is a denial of service attack under active attacks. Blackhole nodes work in collaboration forming cooperative black hole attacks. The attacks drop or redirecting data packets on transit. Cooperative blackhole attacks are dangerous in operations where communication is critica

MELOC - memory and location optimized caching for mobile Ad hoc networks

The advancement of Mobile ad hoc networks (MANET) is tremendous in the field of social and military applications. Caching and Replication are the two common techniques used to improve data access efficiency in Mobile Ad hoc networks. Caching favors data access efficiency by bringing data closer to the source. Existing caching approaches are deficient in reducing the number of cache locations, thus reducing the number of copies, which is needed for many mission critical applications considering safety and security. Conversely, reducing the number of caches should not affect the efficiency of data access. We design an efficient broker based caching model named Memory and Location Optimized Caching (MELOC) , which reduces the number of cache locations, and at the same time preserves data access efficiency. Our caching model mostly chooses centrally located nodes as cache location. In addition, we cache only essential data closer to the source, saving memory. Hence our approach bears the name Memory and Location Optimized caching (MELOC) . Our initial MELOC model suits only small MANET topology of 30 nodes. We further extend our initial caching model to suit large MANET topology of 100 nodes by overcoming certain disadvantages pertaining to large network topology --Abstract, page iv

An altruistic cross-layer recovering mechanism for ad hoc wireless networks

Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real-time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video-aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.Arce Vila, P.; Guerri Cebollada, JC. (2015). An altruistic cross-layer recovering mechanism for ad hoc wireless networks. Wireless Communications and Mobile Computing. 15(13):1744-1758. doi:10.1002/wcm.2459S174417581513Li J Blake C De Couto DSJ Lee HI Morris R Capacity of ad hoc wireless networks Proceedings of the 7th Annual International Conference on Mobile Computing and Networks (MobiCom) 2001 61 69Akyildiz, I. F., & Xudong Wang. (2005). A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), S23-S30. doi:10.1109/mcom.2005.1509968Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing – A review and the challenges ahead. Computer Networks, 55(15), 3592-3603. doi:10.1016/j.comnet.2011.06.021Huang, X., Zhai, H., & Fang, Y. (2008). Robust cooperative routing protocol in mobile wireless sensor networks. IEEE Transactions on Wireless Communications, 7(12), 5278-5285. doi:10.1109/t-wc.2008.060680Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Mobile Networks and Applications, 6(3), 251-263. doi:10.1023/a:1011478717164Clausen T Jacquet P Optimized Link State Routing Protocol (OLSR), IETF RFC 3626 2003 http://www.rfc-editor.org/rfc/rfc3626.txtMarina, M. K., & Das, S. R. (2006). Ad hoc on-demand multipath distance vector routing. Wireless Communications and Mobile Computing, 6(7), 969-988. doi:10.1002/wcm.432Zhou X Lu Y Ma HG Routing improvement using multiple disjoint paths for ad hoc networks International Conference on Wireless and Optical Communications Networks (IFIP) 2006 1 5Fujisawa H Minami H Yamamoto M Izumi Y Fujita Y Route selection using retransmission packets for video streaming on ad hoc networks IEEE Conference on Radio and Wireless Symposium (RWS) 2006 607 610Badis H Agha KA QOLSR multi-path routing for mobile ad hoc networks based on multiple metrics: bandwidth and delay IEEE 59th Vehicular Technology Conference (VTC) 2004 2181 2184Wu Z Wu J Cross-layer routing optimization for video transmission over wireless ad hoc networks 6th International Conference on Wireless Communications Networks and Mobile Computing (WiCOM) 2010 1 6Schier, M., & Welzl, M. (2012). Optimizing Selective ARQ for H.264 Live Streaming: A Novel Method for Predicting Loss-Impact in Real Time. IEEE Transactions on Multimedia, 14(2), 415-430. doi:10.1109/tmm.2011.2178235Nikoupour M Nikoupour A Dehghan M A cross-layer framework for video streaming over wireless ad-hoc networks 3rd International Conference on Digital Information Management (ICDIM) 2008 340 345Yamamoto R Miyoshi T Distributed retransmission method using neighbor terminals for ad hoc networks Proceedings of the 14th Asia-Pacific Conference on Communications (APCC) 2008 1 5Gravalos I Kokkinos P Varvarigos EA Multi-criteria cooperative energy-aware routing in wireless ad-hoc networks Proceedings of the 9th International Wireless Communications and Mobile Computing Conference (IWCMC) 2013 387 393Abid, R. M., Benbrahim, T., & Biaz, S. (2010). IEEE 802.11s Wireless Mesh Networks for Last-Mile Internet Access: An Open-Source Real-World Indoor Testbed Implementation. Wireless Sensor Network, 02(10), 725-738. doi:10.4236/wsn.2010.210088Yen, Y.-S., Chang, R.-S., & Wu, C.-Y. (2011). A seamless handoff scheme for IEEE 802.11 wireless networks. Wireless Communications and Mobile Computing, 13(2), 157-169. doi:10.1002/wcm.1102Liangzhong Yin, & Guohong Cao. (2006). Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing, 5(1), 77-89. doi:10.1109/tmc.2006.15Biswas S Morris R ExOR: opportunistic multi-hop routing for wireless networks Proceedings of ACM SIGCOMM 2005 133 144Chachulski S Jennings M Katti S Katabi D Trading structure for randomness in wireless opportunistic routing Proceedings of ACM SIGCOMM 2007 169 180Kohler E Handley M Floyd S Datagram Congestion Control Protocol (DCCP), IETF RFC 4340 2006 http://www.rfc-editor.org/rfc/rfc4340.txtSchierl, T., Ganger, K., Hellge, C., Wiegand, T., & Stockhammer, T. (2006). SVC-based multisource streaming for robust video transmission in mobile ad hoc networks. IEEE Wireless Communications, 13(5), 96-103. doi:10.1109/wc-m.2006.250365Iera, A., Molinaro, A., Paratore, S. Y., Ruggeri, G., & Zurzolo, A. (2011). Making a mesh router/gateway from a smartphone: Is that a practical solution? Ad Hoc Networks, 9(8), 1414-1429. doi:10.1016/j.adhoc.2011.03.00