High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

Routing is the process of delivering a packet from a source to a destination in the network using a routing algorithm that tries to create an efficient path. The path should be created with minimum overhead and bandwidth consumption. In literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the classification based on the number of hops to reach the destination node. In literature, these are single-hop and multi-hops protocols. We first discuss the two types and then compare the MDDV (multi-hops protocol) with VADD (single-hop protocol). The comparison is theoretically and experimentally implemented by providing a network environment consisting of SUMO, VIENS and

Transport layer is responsible for delivering data to the appropriate application process on the host computers. The two most popular transport layer protocols are Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). TCP is considered one of the most important protocols in the Internet. UDP is a minimal message-oriented Transport Layer protocol. In this paper we have compared the performance of TCP and UDP on the wired network. Network Simulator (NS2) has been used for performance Comparison since it is preferred by the networking research community. Constant bit rate (CBR) traffic used for both TCP and UDP protocols.

Zigbee, which has the standard IEEE 802.15.4. It is advisable method to build wireless personal area network (WPAN) which demands a low power consumption that can be produced by Zigbee technique. Our paper gives measuring efficiency of Zigbee involving the Physical Layer (PL) and Media Access Control (MAC) sub-layer , which allow a simple interaction between the sensors. We model and simulate two different scenarios, in the first one, we tested the topological characteristics and performance of the IEEE802.15.4 standard in terms of throughput, node to node delay and figure of routers for three network layouts (Star, Mesh and Cluster Tree) using OPNET simulator. The second scenario investigates the self-healing feature on a mesh

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f