A topology-oblivious routing protocol for NDN-VANETs

Vehicular Ad Hoc Networks (VANETs) are characterized by intermittent connectivity, which leads to failures of end-to-end paths between nodes. Named Data Networking (NDN) is a network paradigm that deals with such problems, since information is forwarded based on content and not on the location of the hosts. In this work, we propose an enhanced routing protocol of our previous topology-oblivious Multihop, Multipath, and Multichannel NDN for VANETs (MMM-VNDN) routing strategy that exploits several paths to achieve more efficient content retrieval. Our new enhanced protocol, i mproved MMM-VNDN (iMMM-VNDN), creates paths between a requester node and a provider by broadcasting Interest messages. When a provider responds with a Data message to a broadcast Interest message, we create unicast routes between nodes, by using the MAC address(es) as the distinct address(es) of each node. iMMM-VNDN extracts and thus creates routes based on the MAC addresses from the strategy layer of an NDN node. Simulation results show that our routing strategy performs better than other state of the art strategies in terms of Interest Satisfaction Rate, while keeping the latency and jitter of messages low

A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST), Pakistan, and the Higher Education Commission, Pakistan

Service discovery using Bloom filters

A protocol to perform service discovery in adhoc networks is introduced in this paper. Attenuated Bloom filters are used to distribute services to nodes in the neighborhood and thus enable local service discovery. The protocol has been implemented in a discrete event simulator to investigate the behavior in case of a multihop mobile ad-hoc network with nodes that all have services to offer. Methods to optimize the used bandwidth, which is a scarce resource in wireless networks, are investigated. Experiments performed with the simulator suggest that the proposed service discovery system enables users to find local services in a multihop ad-hoc network efficiently. The costs for advertising can be kept low, whereas the additional costs for queries set due to so-called false positives are moderate

A COMMUNICATION FRAMEWORK FOR MULTIHOP WIRELESS ACCESS AND SENSOR NETWORKS: ANYCAST ROUTING & SIMULATION TOOLS

The reliance on wireless networks has grown tremendously within a number of varied application domains, prompting an evolution towards the use of heterogeneous multihop network architectures. We propose and analyze two communication frameworks for such networks. A first framework is designed for communications within multihop wireless access networks. The framework supports dynamic algorithms for locating access points using anycast routing with multiple metrics and balancing network load. The evaluation shows significant performance improvement over traditional solutions. A second framework is designed for communication within sensor networks and includes lightweight versions of our algorithms to fit the limitations of sensor networks. Analysis shows that this stripped down version can work almost equally well if tailored to the needs of a sensor network. We have also developed an extensive simulation environment using NS-2 to test realistic situations for the evaluations of our work. Our tools support analysis of realistic scenarios including the spreading of a forest fire within an area, and can easily be ported to other simulation software. Lastly, we us our algorithms and simulation environment to investigate sink movements optimization within sensor networks. Based on these results, we propose strategies, to be addressed in follow-on work, for building topology maps and finding optimal data collection points. Altogether, the communication framework and realistic simulation tools provide a complete communication and evaluation solution for access and sensor networks

An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols

The various routing protocols in Mobile Ad hoc Networks follow different strategies to send the information from one node to another. The nodes in the network are non static and they move randomly and are prone to link failure which makes always to find new routes to the destination. This research mainly focused on the study of the characteristics of multipath routing protocols in MANETS. Two of the multipath routing protocols were investigated and a comparative study along with simulation using NS2 was done between DSR and AODV to propose an enhanced approach to reach the destination maintaining the QoS. A possible optimization to the DSR and AODV routing protocols was proposed to make no node to be overburdened by distributing the load after finding the alternate multipath routes which were discovered in the Route discovery process. The simulation shows that the differences in the protocol highlighted major differences with the protocol performance. These differences have been analyzed with various network size, mobility, and network load. A new search table named Search of Next Node Enquiry Table (SONNET) was proposed to find the best neighbor node. Using SONNET the node selects the neighbor which can be reached in less number of hops and with less time delay and maintaining the QoS