VANETs Multipath Video Data Streaming Considering Road Features

Multipath video streaming in Vehicular Ad-hoc Networks (VANETs) is an evolving research topic. The adoption of video transmission in VANETs communication has become essential due to the comprehensiveness and applicability of video data for on-road advertisement and infotainment. Meanwhile, several research studies have considered how to apply and improve the transmission of the video quality. Due to this, the concurrent multipath transmission has been employed in order to achieve load balancing and path diversity, because of the high data rate of the video data.  However, the main nature of the road, which is the pathway for VANET nodes has not been considered explicitly. In this paper, the road features are considered for VANETs multipath video streaming based on the greedy geographical routing protocol. Thus, VANETs Multipath Video Streaming based on Road Features (VMVS-RF) protocol has been proposed. The protocol was compared with an ordinary Multipath Video Streaming (MVS). The result demonstrates that the proposed VMVS-RF protocol outperforms the MVS in terms of Data Receiving Rate (DRR), Structural Similarity (SSIM) index and Packet Loss Ratio (PLR)

Exploiting Parallelism in the Design of Peer-to-Peer Overlays

Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network. We propose criteria for assessing when multicast routing can effectively be used, and compare multi-destination multicast and host group multicast using these criteria. We show that the assumptions underlying the Chuang-Sirbu multicast scaling law are valid in large-scale peer-to-peer overlays, and thus Chuang-Sirbu is suitable for estimating the message reduction when replacing unicast overlay messages with multicast messages. Using simulation, we evaluate message savings in two overlay algorithms when multi-destination multicast routing is used in place of unicast messages. We further describe parallelism in a range of overlay algorithms including multi-hop, variable-hop, load-balancing, random walk, and measurement overlay

Deployment Adviser Tool for Wireless Sensor Networks

This paper presents a system for the purpose of field deployment of nodes in wireless sensor networks. We propose a mobile phone based deployment adviser tool which is robust as well as practically implementable. The tool advises a layman deployer to create a optimized wireless sensor network by placing of the nodes according to application requirements. The tool is presented here as logically linked sub-modules. Each sub-modules are described in detail. Also we propose an algorithm which helps in distributing the power consumption among the nodes in the network, thus, increasing the network lifetime. The adviser tool has been verified by implementing it in IITH mote. The tool we propose has significant implication since it greatly eases, but more importantly extracts the best performance possible while deploying the wireless sensor network

Communication technologies to design vehicle-to-vehicle and vehile-to-infrastructures applications

Intelligent Transport Systems use communication technologies to offer real-time traffic information services to road users and government managers. Vehicular Ad Hoc Networks is an important component of ITS where vehicles communicate with other vehicles and road-side infrastructures, analyze and process received information, and make decisions according to that. However, features like high vehicle speeds, constant mobility, varying topology, traffic density, etc. induce challenges that make conventional wireless technologies unsuitable for vehicular networks. This paper focuses on the process of designing efficient vehicle-to-vehicle and vehicle-to road-side infrastructure applications.Peer ReviewedPostprint (published version

Blacklisting Malicious Websites using Peer-to-Peer Technology

The misuse of websites to serve exploit code to compromise hosts on the Internet has increased drastically in the recent years. With new methods like Fast- or Domain Fluxing the attackers have found ways to generate thousands of links leading to malicious webservers in a very short time. With the help of the distributed blacklist solution we propose in this paper we are able to quickly respond to new threats and have the ability to involve different sources to collect information about malicious websites. It is therefore possible to protect networks from threats that they have not even been targeted for yet, by sharing attack information globally

Study on Different Topology Manipulation Algorithms in Wireless Sensor Network

Wireless sensor network (WSN) comprises of spatially distributed autonomous sensors to screen physical or environmental conditions and to agreeably go their information through the network to a principle area. One of the critical necessities of a WSN is the efficiency of vitality, which expands the life time of the network. At the same time there are some different variables like Load Balancing, congestion control, coverage, Energy Efficiency, mobility and so on. A few methods have been proposed via scientists to accomplish these objectives that can help in giving a decent topology control. In the piece, a few systems which are accessible by utilizing improvement and transformative strategies that give a multi target arrangement are examined. In this paper, we compare different algorithms' execution in view of a few parameters intended for every target and the outcomes are analyzed. DOI: 10.17762/ijritcc2321-8169.15029