The document describes Mercury, a messaging system for intelligent transportation systems that aims to provide reliable, low-latency communication between vehicles and infrastructure. Mercury uses a publish/subscribe model with a centralized broker that aggregates data and calculates relevant message recipients based on location. The system was prototyped and evaluated on a testbed, demonstrating its functional capabilities and latency performance.
INTELLIGENT INFORMATION DISSEMINATION IN VEHICULAR AD HOC NETWORKSijasuc
Vehicular Ad hoc Networks (VANETs) are a compelling application of ad hoc networks, because of the
potential to access specific context information (e.g. traffic conditions, service updates, route planning)
and deliver multimedia services (VOIP, in-car entertainment, instant messaging, etc.). In this paper, we
propose an agent based intelligent information dissemination model for VANETs. Safety information like
cooperative driving, accident, road condition warnings, etc. play a major role for applications of VANET.
Safety information dissemination poses a major challenge of delay-sensitive nature. This paper proposes
an agent based model for intelligent information dissemination in VANETs. Proposed model uses
cognitive agent concept for realizing intelligent information dissemination. To test the efficiency of the
model, proposed scheme is simulated using NS-2 simulator. Some of the performance parameters
analyzed are bandwidth utilized, push latency and push/pull decision latency.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET) communications environment as a part of ITS opens the way for a wide range of applications such as safety applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS such as modelling of wireless transmission and routing issues. These research issues have become more critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET environment which considers as one of a stringent communications environment is a challenging task. The selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different propagation models allow calculating the Received Signal Strength (RSS) based on key environmental properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a specific propagation model and then these values can be used later for routing decision in order to find the best path with high SNR. This paper evaluates the performance of different transmission models (freespace, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic density is decreased.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
This document summarizes a research paper that proposes CafRep, an adaptive congestion control protocol for delay-tolerant networks (DTNs). CafRep uses implicit heuristics based on contact and resource congestion to offload traffic from congested parts of the network to less congested areas. It also adaptively replicates messages at lower rates in different parts of the network with non-uniform congestion levels. The paper evaluates CafRep across three real mobility traces and shows it outperforms state-of-the-art DTN forwarding algorithms in maintaining high delivery rates while keeping low delays and packet loss, especially in congested networks.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
INTELLIGENT INFORMATION DISSEMINATION IN VEHICULAR AD HOC NETWORKSijasuc
Vehicular Ad hoc Networks (VANETs) are a compelling application of ad hoc networks, because of the
potential to access specific context information (e.g. traffic conditions, service updates, route planning)
and deliver multimedia services (VOIP, in-car entertainment, instant messaging, etc.). In this paper, we
propose an agent based intelligent information dissemination model for VANETs. Safety information like
cooperative driving, accident, road condition warnings, etc. play a major role for applications of VANET.
Safety information dissemination poses a major challenge of delay-sensitive nature. This paper proposes
an agent based model for intelligent information dissemination in VANETs. Proposed model uses
cognitive agent concept for realizing intelligent information dissemination. To test the efficiency of the
model, proposed scheme is simulated using NS-2 simulator. Some of the performance parameters
analyzed are bandwidth utilized, push latency and push/pull decision latency.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET) communications environment as a part of ITS opens the way for a wide range of applications such as safety applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS such as modelling of wireless transmission and routing issues. These research issues have become more critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET environment which considers as one of a stringent communications environment is a challenging task. The selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different propagation models allow calculating the Received Signal Strength (RSS) based on key environmental properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a specific propagation model and then these values can be used later for routing decision in order to find the best path with high SNR. This paper evaluates the performance of different transmission models (freespace, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic density is decreased.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
This document summarizes a research paper that proposes CafRep, an adaptive congestion control protocol for delay-tolerant networks (DTNs). CafRep uses implicit heuristics based on contact and resource congestion to offload traffic from congested parts of the network to less congested areas. It also adaptively replicates messages at lower rates in different parts of the network with non-uniform congestion levels. The paper evaluates CafRep across three real mobility traces and shows it outperforms state-of-the-art DTN forwarding algorithms in maintaining high delivery rates while keeping low delays and packet loss, especially in congested networks.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
This document discusses load balancing in 5G networks through offloading traffic between LTE and Wi-Fi networks. It describes the COHERENT architectural framework, which uses network graphs and two main control components - the Central Controller and Coordinator (C3) and Real-Time Controller (RTC) - to manage resource allocation and control tasks like traffic steering and load balancing across heterogeneous networks. Specifically, it focuses on a load balancing use case where traffic is offloaded from overloaded LTE networks to Wi-Fi networks to improve resource utilization and system performance.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
The document discusses transfer reliability and congestion control strategies in opportunistic networks. It begins by stating that opportunistic networks have unpredictable node contacts and rarely have complete end-to-end paths. It then discusses how modified TCP protocols are ineffective for these networks and they require different approaches than intermittently connected networks. The document surveys proposals for transfer reliability using hop-by-hop custody transfer and end-to-end receipts. It also categorizes storage congestion control based on single or multiple message copies. It identifies open research issues including replication management and drop policies for multiple copies.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
This document discusses differential evolution based secured routing protocols for VANETs (vehicular ad hoc networks). It begins with an introduction to VANETs and discusses some of their key characteristics and applications. It then discusses some of the main attacks against VANETs, including identification/authentication attacks, privacy attacks, availability attacks, and routing attacks. It proposes using a differential evolution algorithm and distance bounding technique to design a secure routing protocol to detect and mitigate routing attacks from malicious nodes in VANETs. The paper reviews several related works on security issues and solutions for VANETs and aims to improve routing security through the proposed differential evolution based approach.
Predictive Data Dissemination in VanetDhruvMarothi
Predictive Data Dissemination in Vanet aims to efficiently disseminate data in vehicular ad hoc networks (VANETs) by using predictive mechanisms. The presented techniques take advantage of GPS and map data to select vehicles that will further broadcast information to designated areas. Simulation results showed these techniques can alleviate broadcast storms while effectively disseminating data in both urban and highway scenarios. The document discusses several challenges for future work, including intermittent connectivity, high mobility, heterogeneous vehicles, privacy and security, and enabling network intelligence in large-scale VANETs.
The document summarizes the author's research experience in two main areas: 1) network protocols for traditional distributed systems focusing on requirements like scalability and security for applications like smart grids and transportation systems, and 2) network protocols for mobile distributed systems addressing mobility and wireless characteristics for applications like VANETs and wireless sensor networks. The author has published papers on proposing and evaluating protocols for smart grid communications and highly mobile ad hoc networks. Going forward, their research will focus on applying SDN and NFV to cyber-physical systems, and exploring cooperative communication protocols with increasing 4G/5G bandwidth.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
PERFORMANCE EVALUATION OF LTE NETWORK USING MAXIMUM FLOW ALGORITHMijcsit
In this paper, we propose a new traffic flow model of the Long Term Evaluation (LTE) network for the Evolved Universal Terrestrial Radio Access Network (E-UTRAN). Here only one Evolve Node B (eNB) nearest to the Mobility Management Entity (MME) and Serving Gateway (S-GW) will use the S1 link to
bridge the E-UTRAN and Evolved Packet Core (EPC). All the eNBs of a tracking area will be connected to each other by the X2 link. Determination of capacity of a links of such a network is a challenging job since each node offers its own traffic and at the same time conveys traffic of other nodes. In this paper, we apply maximum flow algorithm including superposition theorem to solve the traffic flow of radio network. Using the total flow per subcarrier, a new traffic model is also developed in the paper. The relation among the traffic parameters: ‘blocking probability’, ‘offered traffic’, ‘instantaneous capacity’, ‘average holding
time’, and ‘number of users’ are shown graphically under both QPSK and 16-QAM. The concept of the network will be helpful to improve the SINR of the received signal ofeNBslocated long distance relative to MME/S-GW.
This white paper discusses new approaches to network planning given convergence of fixed and mobile networks and divergence of applications and services. It proposes optimizing network planning to maximize benefits for investors, suppliers and operators while minimizing risks. The paper outlines challenges like self-similar traffic, dynamic routing and topological constraints. It advocates dividing the network planning problem into smaller subproblems and using techniques like queueing theory, simulation and optimization algorithms to develop short, medium and long-term plans that meet technical, economic and business factors over time as networks and technologies evolve.
Traffic Control System by Incorporating Message Forwarding ApproachCSCJournals
This document summarizes a research paper that proposes a traffic control system using message forwarding in vehicular ad hoc networks (VANETs). The system incorporates scanners that detect abnormal traffic conditions and activate transmitters to broadcast congestion notifications using a reliable directional greedy routing algorithm. The system is simulated using the VEINS simulator. Key aspects of the system include establishing vehicle-to-vehicle and vehicle-to-roadside communication, calculating a roadway congestion index to detect abnormalities, and enabling transmitters to forward messages about detected events to improve traffic flow and safety.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
- The document discusses energy aware geographic routing protocols in mobile ad hoc networks (MANETs). It provides background on geographic routing and its advantages over other routing approaches.
- It reviews previous work on geographic routing protocols that address issues like local maxima, planarization of graphs, and constrained flooding. However, most protocols do not consider energy efficiency or balancing energy consumption across nodes.
- The paper aims to provide an overview of geographic routing in MANETs for new researchers, with a focus on challenges and opportunities for developing energy-aware geographic routing protocols to extend the lifetime of energy-constrained MANETs.
New adaptation method based on cross layer and TCP over protocols to improve ...IJECEIAES
This document proposes a new adaptation method to improve quality of service in mobile ad hoc networks. The method uses a cross-layer approach combining modifications to the IEEE 802.11 MAC standard with a new version of TCP. It takes node mobility, signal strength, and routing protocols into account. Simulation results show the proposal achieves better TCP performance and throughput while improving energy efficiency compared to normal TCP, especially when using the OLSR routing protocol.
The Minimum Cost Forwarding Using MAC Protocol for Wireless Sensor NetworksIJMER
The document discusses the Minimum Cost Forwarding (MCF) routing protocol for wireless sensor networks. MCF establishes optimal routing paths with few message exchanges and is scalable and simple to implement. The authors formally model MCF as timed automata and use model checking to verify its properties. Their analysis identified weaknesses in MCF concerning equal-cost paths and node failures. The authors present improvements to address deficiencies in the original MCF protocol.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Back-Bone Assisted HOP Greedy Routing for VANETijsrd.com
Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc., currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.
International Journal of Computational Engineering Research (IJCER) ijceronline
The document summarizes several routing protocols for Vehicular Ad hoc NETworks (VANETs) that utilize Vehicle-to-Infrastructure (V2I) communication. It first provides background on VANETs and the different types of communication (V2V and V2I). It then overviews 5 specific V2I routing protocols, describing how each protocol utilizes Roadside Units (RSUs) to establish routes for packet forwarding between vehicles and infrastructure. Finally, it discusses challenges and future perspectives for better exploiting RSUs' potential in routing, such as using them as anchors to improve path robustness and load balancing traffic. The document aims to survey V2I routing protocols and analyze the role
IRJET- Efficient and Secure Communication In Vehicular AD HOC NetworkIRJET Journal
The document discusses efficient and secure communication in vehicular ad hoc networks (VANETs). It proposes a Cluster based reliable routing (CRR) protocol. Vehicles are clustered based on their velocity, and a Cluster Controller (CC) is elected based on transmitter heights and position to manage communication among cluster members. The CRR protocol aims to address the challenging routing issues posed by the highly dynamic topology of VANETs.
This document discusses load balancing in 5G networks through offloading traffic between LTE and Wi-Fi networks. It describes the COHERENT architectural framework, which uses network graphs and two main control components - the Central Controller and Coordinator (C3) and Real-Time Controller (RTC) - to manage resource allocation and control tasks like traffic steering and load balancing across heterogeneous networks. Specifically, it focuses on a load balancing use case where traffic is offloaded from overloaded LTE networks to Wi-Fi networks to improve resource utilization and system performance.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
The document discusses transfer reliability and congestion control strategies in opportunistic networks. It begins by stating that opportunistic networks have unpredictable node contacts and rarely have complete end-to-end paths. It then discusses how modified TCP protocols are ineffective for these networks and they require different approaches than intermittently connected networks. The document surveys proposals for transfer reliability using hop-by-hop custody transfer and end-to-end receipts. It also categorizes storage congestion control based on single or multiple message copies. It identifies open research issues including replication management and drop policies for multiple copies.
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANETijsrd.com
It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
This document discusses differential evolution based secured routing protocols for VANETs (vehicular ad hoc networks). It begins with an introduction to VANETs and discusses some of their key characteristics and applications. It then discusses some of the main attacks against VANETs, including identification/authentication attacks, privacy attacks, availability attacks, and routing attacks. It proposes using a differential evolution algorithm and distance bounding technique to design a secure routing protocol to detect and mitigate routing attacks from malicious nodes in VANETs. The paper reviews several related works on security issues and solutions for VANETs and aims to improve routing security through the proposed differential evolution based approach.
Predictive Data Dissemination in VanetDhruvMarothi
Predictive Data Dissemination in Vanet aims to efficiently disseminate data in vehicular ad hoc networks (VANETs) by using predictive mechanisms. The presented techniques take advantage of GPS and map data to select vehicles that will further broadcast information to designated areas. Simulation results showed these techniques can alleviate broadcast storms while effectively disseminating data in both urban and highway scenarios. The document discusses several challenges for future work, including intermittent connectivity, high mobility, heterogeneous vehicles, privacy and security, and enabling network intelligence in large-scale VANETs.
The document summarizes the author's research experience in two main areas: 1) network protocols for traditional distributed systems focusing on requirements like scalability and security for applications like smart grids and transportation systems, and 2) network protocols for mobile distributed systems addressing mobility and wireless characteristics for applications like VANETs and wireless sensor networks. The author has published papers on proposing and evaluating protocols for smart grid communications and highly mobile ad hoc networks. Going forward, their research will focus on applying SDN and NFV to cyber-physical systems, and exploring cooperative communication protocols with increasing 4G/5G bandwidth.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
PERFORMANCE EVALUATION OF LTE NETWORK USING MAXIMUM FLOW ALGORITHMijcsit
In this paper, we propose a new traffic flow model of the Long Term Evaluation (LTE) network for the Evolved Universal Terrestrial Radio Access Network (E-UTRAN). Here only one Evolve Node B (eNB) nearest to the Mobility Management Entity (MME) and Serving Gateway (S-GW) will use the S1 link to
bridge the E-UTRAN and Evolved Packet Core (EPC). All the eNBs of a tracking area will be connected to each other by the X2 link. Determination of capacity of a links of such a network is a challenging job since each node offers its own traffic and at the same time conveys traffic of other nodes. In this paper, we apply maximum flow algorithm including superposition theorem to solve the traffic flow of radio network. Using the total flow per subcarrier, a new traffic model is also developed in the paper. The relation among the traffic parameters: ‘blocking probability’, ‘offered traffic’, ‘instantaneous capacity’, ‘average holding
time’, and ‘number of users’ are shown graphically under both QPSK and 16-QAM. The concept of the network will be helpful to improve the SINR of the received signal ofeNBslocated long distance relative to MME/S-GW.
This white paper discusses new approaches to network planning given convergence of fixed and mobile networks and divergence of applications and services. It proposes optimizing network planning to maximize benefits for investors, suppliers and operators while minimizing risks. The paper outlines challenges like self-similar traffic, dynamic routing and topological constraints. It advocates dividing the network planning problem into smaller subproblems and using techniques like queueing theory, simulation and optimization algorithms to develop short, medium and long-term plans that meet technical, economic and business factors over time as networks and technologies evolve.
Traffic Control System by Incorporating Message Forwarding ApproachCSCJournals
This document summarizes a research paper that proposes a traffic control system using message forwarding in vehicular ad hoc networks (VANETs). The system incorporates scanners that detect abnormal traffic conditions and activate transmitters to broadcast congestion notifications using a reliable directional greedy routing algorithm. The system is simulated using the VEINS simulator. Key aspects of the system include establishing vehicle-to-vehicle and vehicle-to-roadside communication, calculating a roadway congestion index to detect abnormalities, and enabling transmitters to forward messages about detected events to improve traffic flow and safety.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
- The document discusses energy aware geographic routing protocols in mobile ad hoc networks (MANETs). It provides background on geographic routing and its advantages over other routing approaches.
- It reviews previous work on geographic routing protocols that address issues like local maxima, planarization of graphs, and constrained flooding. However, most protocols do not consider energy efficiency or balancing energy consumption across nodes.
- The paper aims to provide an overview of geographic routing in MANETs for new researchers, with a focus on challenges and opportunities for developing energy-aware geographic routing protocols to extend the lifetime of energy-constrained MANETs.
New adaptation method based on cross layer and TCP over protocols to improve ...IJECEIAES
This document proposes a new adaptation method to improve quality of service in mobile ad hoc networks. The method uses a cross-layer approach combining modifications to the IEEE 802.11 MAC standard with a new version of TCP. It takes node mobility, signal strength, and routing protocols into account. Simulation results show the proposal achieves better TCP performance and throughput while improving energy efficiency compared to normal TCP, especially when using the OLSR routing protocol.
The Minimum Cost Forwarding Using MAC Protocol for Wireless Sensor NetworksIJMER
The document discusses the Minimum Cost Forwarding (MCF) routing protocol for wireless sensor networks. MCF establishes optimal routing paths with few message exchanges and is scalable and simple to implement. The authors formally model MCF as timed automata and use model checking to verify its properties. Their analysis identified weaknesses in MCF concerning equal-cost paths and node failures. The authors present improvements to address deficiencies in the original MCF protocol.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
The document proposes a new clustering and routing algorithm for wireless sensor networks that aims to extend network lifetime. Key points:
- The algorithm divides nodes into sensing nodes and relay nodes, with relay nodes responsible for forwarding data to reduce cluster head burden.
- It selects cluster heads and relay nodes based on residual energy to distribute load and avoid early node death.
- A routing tree is constructed among relay nodes to transmit data to the base station in a multi-hop manner, selecting next hops based on residual energy and number of child nodes to balance energy usage.
- The goal is to improve energy efficiency, extend network lifetime, and increase data accuracy through mechanisms like clustering, load balancing, and fault detection
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Back-Bone Assisted HOP Greedy Routing for VANETijsrd.com
Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc., currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.
International Journal of Computational Engineering Research (IJCER) ijceronline
The document summarizes several routing protocols for Vehicular Ad hoc NETworks (VANETs) that utilize Vehicle-to-Infrastructure (V2I) communication. It first provides background on VANETs and the different types of communication (V2V and V2I). It then overviews 5 specific V2I routing protocols, describing how each protocol utilizes Roadside Units (RSUs) to establish routes for packet forwarding between vehicles and infrastructure. Finally, it discusses challenges and future perspectives for better exploiting RSUs' potential in routing, such as using them as anchors to improve path robustness and load balancing traffic. The document aims to survey V2I routing protocols and analyze the role
IRJET- Efficient and Secure Communication In Vehicular AD HOC NetworkIRJET Journal
The document discusses efficient and secure communication in vehicular ad hoc networks (VANETs). It proposes a Cluster based reliable routing (CRR) protocol. Vehicles are clustered based on their velocity, and a Cluster Controller (CC) is elected based on transmitter heights and position to manage communication among cluster members. The CRR protocol aims to address the challenging routing issues posed by the highly dynamic topology of VANETs.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great
interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET)
communications environment as a part of ITS opens the way for a wide range of applications such as safety
applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a
smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS
such as modelling of wireless transmission and routing issues. These research issues have become more
critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network
topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET
environment which considers as one of a stringent communications environment is a challenging task. The
selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different
propagation models allow calculating the Received Signal Strength (RSS) based on key environmental
properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna
height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a
specific propagation model and then these values can be used later for routing decision in order to find the
best path with high SNR. This paper evaluates the performance of different transmission models (free-
space, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of
such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is
evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using
MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it
indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic
density is decreased
Discovery and verification DocumentationSambit Dutta
This document discusses public-key cryptography, which uses two separate but mathematically linked keys - a private key and a public key. The public key can be published without compromising security, while the private key must remain secret. Public-key cryptography allows for encryption with a recipient's public key and digital signatures created with a sender's private key that can be verified by anyone with the sender's public key. This ensures confidentiality for encryption and authenticates messages for digital signatures.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
Comparative study of proactive and reactive routing protocols in vehicular ad...IJECEIAES
In recent years, the vehicular ad-hoc network (VANET), which is an ad-hoc network used by connected autonomous vehicles (CAV) for information processing, has attracted the interest of researchers in order to meet the needs created by the accelerating development of autonomous vehicle technology. The enormous amount of information and the high speed of the vehicles require us to have a very reliable communication protocol. The objective of this paper is to determine a topology-based routing protocol that improves network performance and guarantees information traffic over VANET. This comparative study was carried out using the simulation of urban mobility (SUMO) and network simulator (NS-3). Through the results obtained, we will show that the choice of the type of protocol to use depends on the size of the network and also on the metrics to be optimized.
The Design of a Simulation for the Modeling and Analysis of Public Transporta...CSCJournals
Vehicular ad-hoc networks, when combined with wireless sensor networks, are used in a variety of solutions for commercial, urban, and metropolitan areas, including emergency response, traffic, and environmental monitoring. In this work, we model buses in the Washington, DC Metropolitan Area Transit Authority (WMATA) as a network of vehicular nodes equipped with wireless sensors. A simulation tool was developed, using the actual WMATA schedule, to determine performance metrics such as end-to-end packet delivery delay. In addition, a web-based front-end was developed, using the Google Maps API, to provide a user-friendly display and control of the network map, input parameters, and simulated results. This application will provide users with a simplified method for modifying network parameters to account for a number of parameters and conditions, including inclement weather, traffic congestion, and more.
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS WITH ROADSIDE UNIT INFRASTRUCTURE I...IJCNCJournal
Vehicular ad-hoc networks (VANETs) represent a powerful and active field of research and have given rise to many challenges related to routing protocols and communication problems with other vehicles or fixed infrastructure called roadside units (RSU). The dynamic topology and the obstacles encountered in VANET environments mean that the routing of data and the communication between vehicles is confronted with many problems, and particularly in vehicular applications that require reliable communication and satisfactory quality of service (QoS). This paper promotes the intention of infrastructure in an urban
scenario and studies the performance of routing protocols considering the constraint of mobility. This leads us to analyze a wide range of routing protocols to ensure optimal coverage and continuous connectivity, taking into consideration two types of data traffic in realistic environments that depend on certain performance metrics. The paper also investigates which protocols provide better performance with RSUs by ranking the results for QoS.
MOBILE CROWD SENSING RPL-BASED ROUTING PROTOCOL FOR SMART CITY IJCNCJournal
This document describes a new routing protocol called MCS-RPL for mobile crowd sensing applications in smart cities. MCS-RPL is based on the RPL routing protocol and introduces improvements to address RPL's issues with mobility support. It utilizes a clustering mechanism and 2D grid structure to reduce control overhead from frequent topology changes. The performance evaluation shows MCS-RPL delivers a higher packet delivery ratio and lower power consumption compared to RPL, with reductions in control packet overhead of over 75% in tested scenarios. MCS-RPL provides an alternative for mobile devices in smart city applications to opportunistically send collected sensor data to a central server without using cellular networks.
Master-Slave Clustering Technique for High Density Traffic in Urban VANET Sce...rifat1tasnim
Moving vehicle is never free of traffic congestion especially in the cities. Every day commuters wastes hours in travelling just because of traffic congestion. This has led to the emergence of vehicular management which will be beneficial for Road Transport department to control and manage the traffic flow on congested roads. Thus to support above idea we have Vehicular Ad-Hoc Network, or VANET technology that turns every participating car into a node, allowing cars to connect with each other and in turn create a network. There are wealthy numbers of approaches were highlighted to solve several thriving challenges of VANET. Clustering technique in vehicle is one of them which made a great impact on VANET. But it fails to fulfill a crucial requirement. Several protocols wanted to build a cluster in low density traffic where the numbers of vehicles are less with respect to transmission range & there is a less chance of broadcast storming which is not a practical scenario. So that cluster formation in high density traffic has arisen as an issue where there is a great possibility to broadcast storm. This paper suggests a “Priority Based Master-Slave Cluster Formation Process” in high density traffic for an urban scenario using “fidelity” metric. With the help of this metric it will be easier to find high density traffic & form priority based Master-Slave dynamically by reducing broadcast storm problem.
In this paper CHP function runs on the vehicular environment which carried out to select a vehicle as Master. In this Ad-hoc wireless environment a dataset is assumed which create a proper environment & generate a graph. Graph results can be analyzed to have the highest one selects as a Master. Thus for the final result, real aspects of vehicular traffic is very essential and scenarios play a very crucial role.
Mobile ad hoc network become nowadays more and more used in different
domains, due to its flexibility and low cost of deployment. However, this
kind of network still suffering from several problems as the lack of resources.
Many solutions are proposed to face these problems, among these solutions
there is the clustering approach. This approach tries to partition the network
into a virtual group. It is considered as a primordial solution that aims to
enhance the performance of the total network, and makes it possible to
guarantee basic levels of system performance. In this paper, we study some
schemes of clustering such as Dominating-Set-based clustering, Energyefficient
clustering, Low-maintenance clustering, Load-balancing clustering,
and Combined-metrics based clustering.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
The document describes a new routing protocol called Route Optimization and Load-balancing (ROL) for wireless sensor networks. ROL aims to balance several objectives like prolonging network lifetime, providing timely message delivery, and improving network robustness. It uses a combination of routing metrics that can be configured according to application priorities to optimize overall network performance. Simulation results show that ROL maintains balanced cluster sizes and populations, reduces overhead, end-to-end delays, and improves data delivery ratios compared to other protocols like Mires++.
WS-OLSR: MULTIPOINT RELAY SELECTION IN VANET NETWORKS USING A WINGSUIT FLYING...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and
bandwidth availability make optimizing broadcast message flooding a problem in an Optimized Link State
Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately
been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions
in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based
on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-OLSR) is investigated to enhance the
existing MPR-based solution, arguing that considering a cost function as a further decision measure will
effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced
MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of
mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm
phenomenon in VANETs.
WS-OLSR: Multipoint Relay Selection in VANET Networks using a Wingsuit Flying...IJCNCJournal
The routing protocol is considered the backbone of network communication. However, mobility and bandwidth availability make optimizing broadcast message flooding a
problem in an Optimized Link State Routing (OLSR)-based mobile wireless network. The selection of Multi-Point Relays (MPRs) has lately been proposed as a potential approach that has the added benefit of eliminating duplicate re-transmissions in VANET networks. Wingsuit Flying Search (WFS) is one of the swarm intelligent metaheuristic
algorithms, it enables one to find the minimum number of MPR. In this study, a novel methodology based on (WFS) is called WS-OLSR (Wingsuit Search-OLSR). The (WS-
OLSR) is investigated to enhance the existing MPR-based solution, arguing that considering a cost function as a further decision measure will effectively compute minimum MPR nodes that give the maximum coverage area possible. The enhanced MPR selection powered by (WFS) algorithm leads to decreasing MPR count required to cover 95% of mobile nodes, increasing throughput , and decreasing topology control which mitigates broadcasting storm phenomenon in VANETs
Evaluation of load balancing approaches for Erlang concurrent application in ...TELKOMNIKA JOURNAL
Cloud system accommodates the computing environment including PaaS (platform as a service), SaaS (software as a service), and IaaS (infrastructure as service) that enables the services of cloud systems. Cloud system allows multiple users to employ computing services through browsers, which reflects an alternative service model that alters the local computing workload to a distant site. Cloud virtualization is another characteristic of the clouds that deliver virtual computing services and imitate the functionality of physical computing resources. It refers to an elastic load balancing management that provides the flexible model of on-demand services. The virtualization allows organizations to improve high levels of reliability, accessibility, and scalability by having a capability to execute applications on multiple resources simultaneously. In this paper we use a queuing model to consider a flexible load balancing and evaluate performance metrics such as mean queue length, throughput, mean waiting time, utilization, and mean traversal time. The model is aware of the arrival of concurrent applications with an Erlang distribution. Simulation results regarding performance metrics are investigated. Results point out that in Cloud systems both the fairness and load balancing are to be significantly considered.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Real-World Multimedia Streaming for Software Defined Vehicular Ad Hoc NetworksIJCNCJournal
Multimedia services with required Quality of Service (QoS) is one of the most critical challenges in Software Defined Network (SDN) based Vehicular Ad-Hoc Networks (VANETs). It forms an essential part of the Intelligent Transport System (ITS), where infotainment services play an essential role. Streaming multimedia is one of the most popular applications and has a high demand for VANET infotainment services. The major issues for multimedia streaming on VANET are scalability, mobility of vehicles, frequent connection failures, frequent change in network topology, and distributed architecture with heterogeneous devices. To overcome these problems and provide a better QoS, we propose using a hybridarchitecture with a combination of VANET and SDN called Software-Defined Vehicular Networks (SDVN). This work presents a modified POX controller-based SDN framework for VANETs, especially for multimedia streaming applications in realistic traffic patterns. The proposed work has a real-world setup developed using Simulation of Urban Mobility (SUMO), where iPerf generates multimedia traffic. Also, streaming standard-definition YouTube videos in real-time between the vehicular nodes was done. The modified POX controller could take advantage of the centralised perspective of the network for action determination, and the integrated spanning tree algorithm reduced the redundancy. Despite the dynamic nature of the testing environments, the proposed Modified POX Controller consistently outperformed VANET, with up to 21 to 42% better packet delivery ratio for higher data transfer rates. The overall improvement in QoS parameters also accompanies an improvement in the consumers Quality of Experience (QoE) factors.
Real-World Multimedia Streaming for Software Defined Vehicular Ad Hoc Networks
Mercury
1. Mercury: A Geo-Aware Mobility-Centric Messaging System
Teja Kommineni
teja.kommineni@utah.edu
Kirk Webb
kwebb@cs.utah.edu
School of Computing
University of Utah
50 S. Central Campus Drive
Salt Lake City, UT - 84112
ABSTRACT
Intelligent Transportation Systems require a communication
conduit for the agents in the ecosystem. A variety of safety-
and consumer-service messages are useful, even critical for
coordinating the ongoing state of mobile endpoints. Com-
municating telemetry between these endpoints, along with
data from other devices in the environment, allows them to
work together and improve safety. Moreover, it is important
for centralized services to have a global view and provide
information based on this vantage point. To this end, we have
developed Mercury, an end-to-end messaging system with
lightweight state overhead and publish/subscribe functional-
ity. Mercury is designed to flexibly integrate into the mobile
network environment under which it is deployed. Mercury’s
centralized Broker allows for data aggregation services and
data analysis. The Adapter tunes to the particular network
environment, allowing Client Endpoints a pathway to com-
municate. Concurrent processing and event-driven design
are used to minimize latency to meet demanding low-latency
messaging requirements.
1. INTRODUCTION
Intelligent Transportation Systems (ITS) [31] is an emerg-
ing area that includes many ideas and mechanisms for im-
proving the safety, quality of experience, and communication
capabilities of commuters. One particularly important as-
pect of ITS is vehicle-to-vehicle and infrastructure-to-vehicle
communication. Vehicle area networks (VANETs) [16] have
been introduced to meet the challenges of mobile network
actors with rapidly changing associations arising from dy-
namic proximity to infrastructure and other vehicles. To-
gether with mobile networking a la the 3GPP evolved packet
system [13], robust communication approaches involving
hybrid LTE and 802.11p [17] with dynamic multi-hop cluster-
ing have been proposed [28, 30, 32]. Considering safety and
other types of information exchange in an ITS, applications
and events have been identified that should be supported [11,
25], along with constraints such as latency for delivery and
scope (radius). Publish-subscribe systems provide a means
to efficiently distribute messages and events between infras-
tructure and mobile actors in an ITS. Such pubsub systems
can support peer-to-peer and infrastructure-sourced messages
at scale [24]. While research has been done in the areas
of VANET communication and mobility-aware publish/sub-
scribe systems, holistic compositions of these technologies is
lacking.
Transportation safety issues are also considerable. The
total number of vehicle sales in the United States averaged
15.43 million from 1993 up through 2015. The year 2015
saw a surge in sales, which climbed to 17.76 million vehicles
and is expected to rise with the improving economy [2]. In-
creasing vehicle populations will likely result in increasing
accident rates. A total of 32,675 people died in motor vehi-
cle crashes in 2014 [1]. We argue that technology advances
should be used to mitigate increasing casualties and ensure
safe journey. A key focus in this paper is using state-of-art
5G [3] networks to capture vehicle telemetry and pass along
safety events to vehicles that are relevant to their surround-
ings.
The setting in which any transportation messaging system
operates requires reliable, fast paced communication. How-
ever, the latency incurred by present solutions is not adequate
for time-sensitive interactions (e.g., for real-time inter-vehicle
notifications). Although there are architectures [28] that use
the 802.11p communication paradigm for low latency, they
lack good trust mechanisms. Such ad-hoc networks are also
often unstable, requiring frequent communication path adjust-
ments that result in losses and overhead. 3GPP-style mobile
networks provide advantages in stability, reachability, and
security.
This paper introduces Mercury; a integration of pubsub
systems and client endpoint mechanisms for low-latency mes-
sage transport. Part of the holistic vision that Mercury es-
pouses is mobility-specific geographic areas of interest (AOI).
These areas map to slices of physical locality that are rele-
vant to particular events. For example, a traffic accident and
resulting congestion are relevant to vehicles en route to the
accident location, back past potential egresses to alternate
routes. Mercury takes into account location-specific context
to calculate the relevant dynamic set of vehicles for message
transmission.
This paper makes the following contributions:
1
2. • A holistic end-to-end messaging system design.
The design of Mercury highlights the mechanisms by
which publish/subscribe systems and mobile endpoints
can be realized in 4G or 5G mobile network systems.
Broker aggregation services communicate through Adapters
to Client Endpoints at the edge. Mercury’s design ac-
commodates flexible deployment scenarios.
• A prototype implementation and evaluation of the Mer-
cury ITS messaging system.
We implemented a prototype of the Mercury compo-
nents and evaluated it on the PhantomNet [5] testbed.
This prototype makes use of OpenEPC [12] version 5,
including its simplified emulated radio access network
(RAN) environmnet. We drive the evaluation of Mer-
cury with our own mobility simulator, and report on the
former’s functional and latency characteristics.
The remainder of this paper is organized as follows: Sec-
tion 2 covers background, including putting Mercury into
context within related work, introducing mobile networking
environment concepts, and describing the vehicular endpo-
ing context. Section 3 provides an overview of the design
goals and components of Mercury, while section 4 delves
into the details of the design. Section 5 looks at how Mer-
cury can be positioned within different mobile networking
deployments. Section 6 briefly discusses the Mercury pro-
totype implementation. We cover our vehicle simulator and
provide an evaluation of the prototype in section 7. Section 8
discusses observations resulting from the design and imple-
mentation of Mercury, and where we think it should go next.
Finally, section 9 concludes.
2. BACKGROUND
The mobile network ecosystem is complex, and host to
a number of related efforts in providing context-specific
messages between endpoints in an Intelligent Transporta-
tion System environment. Before we discuss the design and
implementation of Mercury, we couch it in the context of
prior work. In addition, we provide backround on the 3GPP
4G Evolved Packet System [13], which is an important and
widely used mobile networking ecosystem that we position
Mercury within.
2.1 Related Work
There has been plenty of attention paid to effecient and
reliable delivery of messages within VANETs. Much of this
focuses on multi-hop clustering and hybrid use of evolved
packet system RAN (LTE). The VMaSC [28], MDMAC [30],
and NHop [32] systems attempt to form stable mobile 802.11p
clusters, using the LTE network to bridge between discon-
nected clusters. These solutions largely ignore the details of
the mobile core network, glossing over questions of compo-
nent placement and the resulting effects on latency. Moreover,
these systems are complimentary to Mercury in that they can
be used to reduce LTE resource contention and improve reli-
able transfer of messages. Such integration would however
come at the cost of additional complexity, failure modes, and
latency due to additional network path segments.
From the publish-subscribe perspective, there is a large
volume of prior work on traditional pubsub mechanisms [16]
[22] [19] [4]. This work is complementary to ours since it fo-
cuses on the useful aspects of pubsub, which we largely wish
to reuse. There has also been work on pubsub systems fo-
cused on mobile endpoints. The MoPS [24] publish-subscribe
system scales efficiently for large numbers of clients and
deals well with changing broker association. Mercury could
replace the Kafkasystem used in the prototype with MoPS
to better target mobile endpoints. However, MoPS does not
include the area of interest concept, which would continue
to be handled by the Mercury broker. A paper by Pongth-
awornkamol et al [26] looks at pubsub in the context of ad
hoc wireless networks. However, this work only performs
simulations of mechanisms, and does not consider a larger
top-down vantage point (important for coordination in a large
ITS).
Location-aware messaging, or geo-routing, in vehicular
networks has been studied fairly extensively [6]. Neverthe-
less, we find that most work has only proposed and simu-
lated mechanisms. Furthermore, many studies look at ad hoc
networks and fine-grained positioning of endpoints within
vehicle clusters. While such mechanisms may be helpful for
real-time collision avoidance, we argue that they tend to be
overly complex and unnecessarily constrain the communica-
tion domain to clusters of endpoints versus a central system
with a global view. The argument against centralized systems
is frequently that mobile networks are overloaded. This may
be true in instances of particularly high device concentration
(e.g. music festivals), but we found no studies showing a gen-
eral lack of available RAN resources outside of such crowded
contexts. Furthermore, in an ITS environment, vehicle popu-
lations and anticipated growth could be used to properly size
capacity.
The related work outline above focuses on particular as-
pects of messaging. To the best of our knowledge, no mes-
saging system targeted at mobile endpoints simultaneously
incorporates aspects we consider crucial to a holistic messag-
ing platform for Intelligent Transportation Systems. Such a
system should enable a global view of endpoints to facilitate
coordinated decision-making with complete data. It should
take advantage of mobile network environment mechanisms
(e.g. eMBMS [21]) to reduce overhead and latency. It should
consider the placement of components within the mobile
network and the impact of this placement. Finally, an ITS
messaging system should provide a location-aware address-
ing mechanism. The Mercury messaging system is designed
with all of these aspects in mind.
2.2 Mobile Networking Ecosystem
Mercury is primarily framed in the context of the 3GPP
2
3. 4G and emerging 5G mobile networking architectures. There-
fore, we provide some background on these systems. The vast
majority of mobile carriers utilize these Evolved Packet Sys-
tems (EPS), making them an especially relevant environment
in which to operate a mobile messaging system. Note that
Mercury is also amenable to other mobility-friendly network
architectures, such as MobilityFirst [27], but we focus the
discussion in this paper on the 3GPP EPS. The 4G system has
been in active deployment since 2008 [9], and has undergone
a number of revisions. Also in play in some deployment
scenarios (see section 5) are software defined infrastructure
concepts that are expected to be prominent components in
the upcoming 5G EPS [3].
The 4G EPS includes the following key service functions
relevant to Mercury: Mobility Managment Entity (MME),
Home Subscriber Service (HSS), Serving Gateway (SGW),
Packet Data Network Gateway (PDN-GW or more commonly
PGW), evolved NodeB (eNodeB), and User Equipment (UE).
We will briefly describe the role of each of these components,
and their relationships with one another and with Mercury.
The Mercury architecture diagram in figure 1 shows Mercury
components in the context of a 4G EPS.
We will briefly cover the 4G components next. User
Equipment (UE) typically refers to end user devices such as
mobile phones, tablets, and 4G radio equipped laptops. The
Mercury Endpoint component runs on these. The Mobility
Management Entity (MME) is the 4G control plane func-
tion responsible for tracking the live (dynamic) session state
for UEs. The Home Subscriber Service (HSS) is essentially
a database of user (subscriber) information. The Serving
Gateway (SGW) is the first data tunnel anchor point that UE
sessions connect through (GTP tunnels). The Packet Data
Network Gateway (PGW) act as the egress point for a large
number of UE data bearers (GTP tunnels); they fan out to
multiple SGWs. Evolved NodeB (eNodeB) devices are the
wireless access points of the 4G EPS. They bridge the radio
access network (RAN) through which the mobile endpoints
(UEs) directly communicate with the evolved packet core
(EPC). GTP tunnels are established for each UE between
the eNodeB it is associated with and an upstream SGW. The
eNodeB also initiates session setup and default data bearer
establishment when UEs attach, acting as a proxy for UE to
MME control plane signalling. eNodeBs covering adjacent
cells coordinate through the MME and possibly with one
another to accomplish handover as endpoints move.
2.3 The Vehicle Environment
The environment of a vehicle endpoint is highly relevant
context for drivers and passengers. We argue that traffic,
safety issues, and proximity to resources are key to decision
making in this setting. Therefore, related telemetry such as
position, speed, and direction should be relayed for analy-
sis. Vehicle position is almost universally measured using
GPS [23]. Although known radio access points can be used
for rough localization, such positions are often too coarse-
grained. In fact, a better system would make use of computer
vision and/or static environmental sensors to extract lane po-
sition, relative distances to other vehicles, etc. Our work
uses GPS coordinates and leaves more fine-grained place-
ment techniques to future work. Speed is to be collected by
vehicle speedometers, or through monitoring of accelerom-
eters such as are found in most smart phones. Finally, to
acquire direction, digital compass readings can be gathered
from smart phones and are also available in many onboard
vehicle systems. We expect that environmental sensors will
grow in sophistication and accuracy through the proliferation
of self-driving cars and ITS.
3. DESIGN OVERVIEW
Delivering messages, important and casual, to mobile users
and endpoints that are interested in them is the overarching
premise of this work. Our vision for realizing an end-to-end
mobile message delivery service design principles revolve
around four central goals:
• Relevant content
The service should provide mechanisms to target groups
of endpoints which have explicit or implied interest in
messages. A message may be important because an
end user specifically asked for the content based on its
attributes (nearby gas prices). Alternatively, a message
may be deemed relevant for the endpoint because it is
related to an emergent event (vehicle accident ahead).
• Robust, low overhead, low latency communication
Message intent drives content delivery requirements.
For example, different types of emergency service mes-
sages have been identified for VANETs, each having
distinct latency requirements [11]. The service should
strive to minimize latency to provide on-time delivery
with headroom for outlier delays. Messages should
be categoriezed according to their relative importance
and processed accordingly (e.g., emergency info before
consumer content).
• Flexible deployment
Adoption of the service is bolstered by adaptability to
different mobile networking environments. Such ac-
comodation allows for deployment into LTE networks
with different geographic EPC service placements and
degrees of maleability. The service should allow for cen-
tralized metropolitan area integration (CloudRAN) and
distributed edge deployment (peer-to-peer eNodeB).
• Reuse of effective technologies
It is our contention that an end-to-end service should
not supplant existing mechanisms useful for achieve-
ing its composition. Indeed, it is counterproductive
to introduce new service components that induce un-
necessary changes and capital investments. The mes-
saging service should strive to work alongside existing
3
4. mobile network protocols and services. Only where
existing mechanisms do not provide key functionality
or do not give adequate service levels should changes
be introduced. Such changes should be as minimal and
transparent as possible to foster compatibility and ease
of adoption. On the other hand, considering less con-
strained future mobile network architectures [3, 29] is
also important.
We next describe the components of the Mercury messag-
ing system, along with how they fit into the 3GPP 4G mobile
networking architecture.
3.1 Mercury Components
Mercury is comprised of four essential components: mes-
sage broker, publish/subscribe system, message adapter, and
endpoints. These components are visible in the architecture
diagram in figure 1. This diagram shows the Mercury compo-
nents in the context of a 4G mobile network (the latter will
be described after Mercury is covered).
3.1.1 Message Broker
Mercury’s message broker is the brain center of the mes-
saging system. It processes all incoming messages and sends
these to relevant endpoints (via Kafka). The broker calculates
Areas of Interest (see section 4.2) for certain message types
(e.g., emergency notifications). Data analysis (aggregated
decisions, client statistics, etc.) occur at the broker. It does
not concern itself with how to get the messages to the target
endpoint(s); that job falls to the Mercury message adapter.
3.1.2 Publish/Subscribe System
Mercury needs a pubsub system that can serve a high
number of events with low latency. This is because of the
environment in which it operates. We have many agents/end-
points at any given point that interact with the system and for
them to effectively respond to a situation we need to dissipate
the messages quickly. The mobility of the clients creates the
potential for intermitent loss of connectivity with the pubsub
system which has to be re-established. Among the options
considered, Apache Kafka had the best combination of low-
latency and message queueing for recovering lost messages.
At a high-level Kafka gives the following guarantees: Mes-
sages sent by a producer to a particular topic partition will
be appended in the order they are sent. A consumer instance
sees records in the order they are stored in the log. For a topic
with replication factor N, kafka will tolerate up to N-1 server
failures without losing any records committed to the log.
3.1.3 Message Adapter
The Mercury message adapter is the conduit through which
pubsub messages flow through to endpoints. The adapter
coordinates sessions with client endpoints. It forwards client
reports and other content to and from the pubsub. It also
maintains pubsub topic subscriptions for the endpoints. The
prototype implementation described in this paper targets the
4G EPC, but it is possible to target other mobile networking
architectures with different adapters.
3.1.4 Endpoints
Mercury endpoints are the producers and consumers of
most content in the messaging system. Client Endpoints run
as applications on ITS-equipped vehicles. They report in with
telemetry, such as their current position and speed. Client
endpoints also subscribe to particular consumer messages
identified by specified attributes.
Service Endpoints may also be centralized services that
connect to the pubsub, running at the same location as the
Broker, and using the Broker’s services. Examples include
emergency notification processors, and consumer information
aggregators (gas prices).
3.2 Mercury Messages
Messages are the principle and only communication mech-
anism in Mercury. There are two high-level flavors: con-
trol and content. Control messages include session handling
(between broker and endpoints), broker to message adapter
communication, and subscription management (endpoint to
pubsub/broker). Content messages are those relevant to ap-
plications running on endpoints, such as emergency alerts
and consumer information (e.g. gas prices). Periodic session
maintenance messages are sent between the mobile endpoints
and the Mercury Adapter to update status (location) and track
liveness.
Content messages use structured message attributes to sig-
nal category information. This allows content producer and
consumer endpoints to steer messages to one another based
on interests. Most messages (including client reports) flow
through the pubsub system to the broker. This allows the
Broker to perform data aggregation and analysis (triggers
based on thresholds, for example).
Message destination addressing in Mercury includes end-
point, content, and area of interest targetting. Endpoint ad-
dresses are primarily used for session setup and teardown.
Content-specific addressing makes use of subscription at-
tributes to deliver messages. AOI addresses are unique to the
mobile environment. AOI bounds are computed by the broker.
These bounds form the destination address. Message adapters
check bounds to determine if their downstream area cover-
age is relevant before passing along, and endpoints check
their position relative to the bounds. In this way, Mercury
allows messages to be “area multicasted.” As we discuss in
section 4, our prototype restricts itself to simple bounding
models (radius). Complex spatial reasoning for improving
relevancy is left for future work.
4. DESIGN DETAILS
Each Mercury component runs as a self-contained applica-
tion. The Broker and Adapter(s) communicate over unmodi-
fied Kafka. Client Endpoints communicate with the Adapter
over UDP. Client-side applications using Mercury communi-
4
5. Figure 1: Mercury architecture diagram (in 4G mobile network context)
cate over the local loopback with the Client Endpoint process.
Service Endpoints use Kafkato communicate with the Broker
and talk to Clients via Adapter(s).
4.1 The messages and events
The Mercury Broker we have implemented handles differ-
ent types of events. Emergency Event, This is an event that
is published by a vehicle when it senses an emergency situa-
tion. Any message indicating such an event is immediately
processed by the Mercury broker and sends back an area of
interest (AOI) that has to be alerted for this event. Moving
Objects Event, This event indicates that there is an object that
is crossing a road. For such events, whenever a predicate cal-
culated by scheduler evaluates to true we inform the vehicles
in the AOI calculated. There are other types of events such
as Collision, Obstacle, Congestion and Blocked. All, these
events are handled similarly but they differ in two things. One
is the predicate function and the second is the frequency at
which the schedulers run. Our system also supports an other
type of event called Area Of Interest. This is different from
the aoi which is calculated by Mercury broker. In this type
of event the user is interested in knowing about the different
events happening at a particular location. Whenever an event
of type area Of interest is received by the Mercury broker. It
interacts with different handlers and determines the bin for
each event type in which the requested aoi falls into. Then
runs a predicate on these bins and learns about the traffic
conditions in that area which is communicated back to the
user.
Messages must fit into a single UDP packet (maximum of
64K). Each is self contained, with required identifiers, ad-
dresses, and message payload. There are two top-level types
of messages in the Mercury system: session and pubsub.
Session messages are transmitted between Client Endpoints
and associated Adapters. Pubsub messages can essentially
be exchanged between any Mercury components. Table 4.1
shows the fields present in Mercury Session and PubSub
messages. Each Mercury Address contains a destination and
source address. The source address can be an Adapter, a spe-
cific Client, a Service, or the Broker. The destination address
can be any of those listed for source, and additionally may
be a broadcast (all clients, or Area of Interest geo-address).
Each message contains key/value pairs in the payload which
are interpreted by specific applications. For example, emer-
gency alerts published by the Broker may be consumed by
an alert display application at the Client Endpoint. Client
Report message contain mobile telementry information: GPS
location, direction, and speed. These reports have semantic
meaning to Mercury, and so are tracked by the Client End-
point, Adapter, and Broker components. In our prototype
implementation, the Broker has had emergency event mes-
sage handling folded into it’s logic. Therefore, the prototype
Broker also interprets safety messages sent via pubsub top-
ics such as “Collision” and “Object_Hazard”. We envision
5
6. Field Description
UUID Unique identifier for message.
Session ID Identifies session between Client and Adapter.
Message Type Distinguishes intent (to/from Broker, PubSub, etc.)
Source Address Client ID, Service ID, Broker, or Adapter.
Dest Address Client ID, Service ID, Broker, Adapter, or AOI.
Topic Indicates topic message goes to or came from (PubSub only).
KeyVal Generic key-value pairs. Telemetry and other data is encoded here.
Table 1: Message fields found inside individual Mercury messages.
that such message handling would ultimately be moved to an
external Service Endpoint application.
4.2 Areas of Interest
Mercury uses Area of Interest geo-addressing to target
specific sets of Client Endpoints. When the Broker wishes to
send a message that is specific to a location context (e.g., a
warning triggered from multiple collision reports), it embeds
the desired geo-address as the destination, and sends this
along with the message toward the Clients. This message
is picked up from the pubsub by the Adapters. These check
their coverage area and forward the message along to Clients
within the defined geo-address that they serve (or drop if
there is no overlap). When an AOI-addressed message is
received by a Client Endpoint, it checks its current location
to determine if the message applies, and processes if so.
4.3 Mercury broker
Mercury Broker handles events in two steps: In the first
step events published are passed on to the respective han-
dlers where we have a filter that determines the different
locations from which the feeds are coming in for that specific
event.This will give us the messages published at different
locations for an event.Each location can be considered as a
bin. We maintain for each bin the count of messages pub-
lished, the center point and the radius for that bin. Whenever
a message comes into a bin it carries along the coordinates
from which this event has been published. We apply a simple
mean with the existing center point to determine the new
center point. Thus, at every instance we keep updating the
center point and radius.In the second step we have schedulers
for each event that get triggered at equal intervals based on
the event type. These schedulers empty the bins of their re-
spective event and run a predicate on them which is a simple
Boolean formula that checks for a condition. A predicate is
usually defined over some aggregation function expressed on
messages; when the predicate evaluates to true, the Mercury
broker publishes an event to the system with the center point
and the radius which we have calculated for that bin. These
are used to determine the area of interest(AOI), AOI is the re-
gion that is determined by the Mercury broker and constitutes
all the clients that have to be alerted about a situation.
4.4 Pubsub service
Within Mercury we require a publish-subscribe system for
communication between different entities. This requirement
directly arises from the need for each vehicle to send and lis-
ten to particular types of messages. Pubsub systems are well-
suited for these activities as we can publish and subscribe to
different events. In our system components such as Client
Endpoints and the Message Broker publish and subscribe to
events. Given this communication pattern, we developed the
set of requirments we need in a publish-subscribe mechanism
and surveyed available options.
As mentioned in section 3, we selected Apache Kafka as
our pubsub component. It is a distributed streaming platform
which lets users to publish and subscribe to streams of records.
Kafka is run as a cluster on one or more servers. The Kafka
cluster stores streams of records in categories called topics.
Each record consists of a key, a value, and a timestamp.
A topic is a category or feed name to which records are
published. In our case it is the event type. Topics in Kafka
can be multi-subscribed; that is, a topic can have one or more
consumers that subscribe to the data written to it. In our
implementation all the values written to a topic are listened
by Message Broker. But, we could extend this to different
service end points listening on the same topic.
For each topic, the Kafka cluster maintains a partitioned
log. Each partition is an ordered, immutable sequence of
records that is continually appended to a structured commit
log. The records in the partitions are each assigned a sequen-
tial id number called the offset that uniquely identifies each
record within the partition. In our system we create a single
partition for each topic. As within a partition order is main-
tained we can traverse through records using the offset of
the record. Each partition is replicated across a configurable
number of servers for fault tolerance. The Kafka cluster re-
tains all published records whether or not they have been
consumedâ ˘AˇTusing a configurable retention period.
4.5 Mobile network messaging adapter
The Mercury Adapter follows a multi-threaded, event-
driven execution pattern. It is highly modular, with clear
separation between client state tracking, network-specific ad-
dress mapping, and transport functionality. This allows new
modes of core network communication to be added alongside
(or in place of) existing mechanisms. Different threads of ex-
ecution handle pubsub, UDP communication, and scheduled
6
7. tasks (e.g., session checking); all are coordinated through the
main thread.
Mercury is designed so that any number of Adapters can
connect to the Kafkasystem. Each will send client telemetry
reports and pubsub messages along. A single broker message
sent via pubsub reaches all connected Adapters, which filter
as necessary. For example, an Adapter will drop messages
with Area of Interest destinations that do not overlap with its
coverage area. These coverage areas are configured by the
operator.
Endpoint identification/tracking The Adapter implements
client session tracking. When a client comes online, it goes
through a lightweight handshake with the Adapter. An INIT
message is sent to the adapter, which immediately responds
with an ACKNOWLEDGE message. The client includes a
telemetry report in its INIT message so that the Adapter and
Broker have immediate knowledge of its current state. Each
client is provided with a session ID token that must be used
in subsequent messages. The Adapter sends out periodic
HEARTBEAT messages to clients so that they can measure
liveness in the absence of other messages.
The Adapter maintains a small amount of state for each
client. This includes its unique ID, current mobile telemetry
(no history), session ID, and simple statistics (timestamp for
last message received, message count). The Adapter also
maintains a mapping from the client’s ID to its mobile core
network address. Changes in this address are automatically
detected and the mapping updated. The Adapter treats pe-
riodic client reports as heartbeats, and resets corresponding
individual timers as these are received. Sessions are pruned
after not receiving a report for three times the reporting inter-
val, or after receiving an explicit CLOSE message from the
client.
Unicast UDP transport In the prototype implementation,
we use UDP unicast packets for all communication between
Adapter and Client Endpoints. Ideally we would use eMBMS
broadcasts for AOI and broadcast (e.g. heartbeat) messages,
and we plan to do so in future work. Each UDP packet is a
self-contained Mercury message. The contents are encoded
using Google’s Protocol Buffers [7] for performance and
space efficiency. For AOI destination addresses, the Adapter
calculates the set of clients to transmit a message to and
unicasts to each individually. For broadcasts, it transmits to
all clients with valid sessions.
Pubsub passthrough Messages from established clients
that are intended for the pubsub system are directly published
to the indicated topic by the Adapter. Likewise, messages
received from the Broker via pubsub are sent to specific
endpoints or broadcast to all clients handled by the Adapter
(as appropriate).
4.6 Client Endpoint mechanisms
The Mercury Client Endpoint connects to the Adapter
over UDP. It establishes a session using a simple handshake;
an INIT message is sent to the adapter, which it replies to
with an acknowledgement. The client will continue trying to
connect until it receives the acknowledgement, backing off
linearly with random jitter to prevent synchronization with
other clients (prevent in-cast overload). The client will also
try to reestablish its session if it does not receive a heartbeat
from the Adapter after three heartbeat intervals (tunable).
Messages are encoded using Google’s Protocol Buffers.
The client gathers movement telemetry via the local sen-
sors of the device it is running on and sends these along pe-
riodically as report messages to the Adapter. As mentioned,
the Adapter uses these reports to measure the liveness of the
connected clients. Some random jitter is added initially to
the report interval to again avoid synchronization with other
clients.
The client listens over the loopback interface for connec-
tions from local applications. Similar to what the Adapter
does for its Client Endpoints, a Client Endpoint relays sub-
scription requests and messages from applications through to
the pubsub/broker. Protocol Buffers are also used between
clients and applications for encoding the messages.
5. DEPLOYMENT SCENARIOS
A key aspect of the Mercury design is adaptability to dif-
ferent mobile network deployments and architectures. End-
points, broker, and pubsub components are all mobile-environment
agnostic. Mobile endpoint identity is specific to the Mercury
messaging system. One of the message adapter’s primary
functions is to separate the concerns of the messaging sys-
tem with the routing of messages inside the mobile network.
Mercury requires a low-latency vantage point near the mobile
network edge. Message adapters, pubsub, and broker all need
to reside at this vantage point. Such proximity allows for
message delivery to meet timing requirements. Distance to
endpoints incurs a tradeoff between convenience of deploy-
ment and ability to meet timing needs. We show deployment
versus distance/latency requirements in table 5.
ADD REFERENCES TO TABLE
Latency Tolerance Examples Ref
High (> 1 second) Consumer info, Congestion [11, 25]
Medium (< 50 msec) Lane change assistance [18]
Low (< 10 msec) Vehicle control loop [15]
Table 2: Latenct tolerances for different types of vehicu-
lar environment messages.
The message adapter can utilize different techniques to
interface with a mobile network deployment. In the sim-
plest case, it can interact with endpoints via routed network
addresses (e.g. IPv4 or IPv6). Alternatively, it may trans-
parently interpose on encapsulated communication channels
to inject/extract messages (e.g. GTP bearers). Another op-
tion is for the message adapter to operate in concert with
the wireless access point right at the edge. It could do this
by transparently interposing on the access point’s data plane
7
8. Figure 2: Mercury deployment scenarios.
uplink, or via an integrated side channel added into the access
point software. We next present three plausible deployment
scenarios, each of which is shown in figure 2.
5.1 Metropolitan area 4G deployment
Consider a city investing in Intelligent Transportation Sys-
tem infrastructure. Resources include a data center within the
city and wireless coverage via eNodeBs (particularly along
major vehicle corridors). The 4G EPC components reside
in the local data center, including the PGW. Given a maxi-
mum cabling distance from the data center to any eNodeB
of around 100 kilometers, one way speed of light latency
is bounded to less than 5 milliseconds. LTE one-way wire-
less first-hop target latency is 5 ms, but may be more like
10 ms [20] due to UE and eNodeB processing overhead. Fur-
ther switch/router hops within the data center should not
appreciably add to the latency. Egress through SGW/PGW
can add another 5 ms of one-way delay. Total mobile net-
work infrastructure RTT is thus bounded to 40 ms. This
leaves 10 ms for Mercury components to process messages
for low-latency vehicle-to-vehicle coordination (within 50
ms).
In this deployment, the Mercury message adapter, pubsub,
and broker all reside alongside the PGW in the local metro
data center. The message adapter and mobile endpoints com-
municate using native network addresses (i.e. IPv4 or IPv6).
Mercury components communicate via the data center pub-
sub deployment. The endpoints can obtain the address of
their associated message adapter using DNS, DHCP options,
or multicast query.
5.2 Existing mobile carrier 4G network deploy-
ment
In an existing 4G mobile carrier network, there may not be
a centralized upstream network egress location in a particular
metro area of interest. Further, PGW nodes are typically
deployed at a handful of national data centers. Total one-way
latency to egress through a PGW in such deployments is
often over 50 ms [14, Chapter 7]. Installing Mercury at these
national data centers would impair its ability to meet SLAs
for some classes of low-latency messages (see table 5). Many
mobile carriers, however, concentrate regional connectivity at
a Mobile Telephone Switching Office (MTSO). Typical one-
way latency from eNodeB to MTSO is 10 ms [10]. With LTE
RAN latency added, the one way latency between MTSO and
UE is about 20 ms.
Deployed into a MTSO, Mercury message adapters can
interpose on GTP data bearers for UEs in the same way
that SMORE [10] does. Alternatively, lower-capacity (thus
cheaper) combined SGW/PGW functions may be deployed
into the MTSO. This would allow the provider to setup dedi-
cated bearers for services such as Mercury in a MTSO loca-
tion. Using these options, Mercury can operate with slightly
higher RTT compared to metropolitan data center deploy-
ments. However, the additional latency may not meet the
latency requirements for some UE-to-UE (vehicle-to-vehicle)
applications.
5.3 Mobile edge 4G/5G deployments
Mercury can be altered to run at the network edge, on the
mobile wireless access points. If a deployment includes the
ability for running services on the eNodeB (or equivalent)
access points, then Mercury can operate using peer-to-peer
semantics. All components of Mercury would run on each
eNodeB, and some service endpoints as well. The pubsub
is extended to form a connectivity mesh between adjacent
eNodeBs. Mercury’s scope at each eNodeB is smaller, and
so the amount of processing is reduced. When a message
8
9. destination is an area of interest, the local Mercury broker
determines whether parts of this area lie outside of its cover-
age. If so, it sends such messages along (via pubsub mesh)
to neighboring eNodeBs. These handle their portion of the
endpoints in the AOI. Arbitrary consumer content messages
are also sent along to potential subscribers via the pubsub
mesh. This deployment scenario allows for very low-latency
messaging between nodes connected via the same eNodeB
(potentially under 20 ms RTT considering RAN latency).
Inter-eNodeB communication latency depends on the com-
munication path between eNodeBs. This could be only a
handful of milliseconds if there are metro-area-local paths.
A second realization of this deployment scenario is via
a 5G CloudRAN environment [8]. Here eNodeBs are split
into remote radio heads (RRH) connected to base band units
(BBUs). The latter are located in nearby compute aggrega-
tion locations; RRH and BBU functions can only be about
25 km apart in order to maintain the closed control loop
between them. BBU functionality in a compute location
serves multiple RRH units. Mercury components would be
deployed into the compute locations in this case. Multiple
such compute locations may serve an area. Mercury could
be deployed to each with a peer-to-peer pubsub mesh setup
between them. Similar very low latency messaging is possi-
ble in this scenario with a Mercury message adapter working
with the BBUs at its location. An additional advantage is that
the very low latency messaging extends to the (larger) area
covered by all associated RRH units.
6. IMPLEMENTATION
We next briefly cover some of the essential implementa-
tion details of the Mercury prototype. Section 4 discusses
our selection of Kafka for the pubsub component. Google’s
Protocol Buffers were used for efficient on-the-wire binary
encoding of messages. Such encoding is used on all non-
pubsub communication paths. The Mercury prototype was
written in python in about 2,200 lines of code. We chose
Python because it was easy to rapidly produce a working
system in this high-level langauge, and because it has good
support for parallel processing. Integrations exist for Python
for the other technologies used. Concurrent threads are em-
ployed to capture and buffer incoming messages from both
the pubsub and UDP point-to-point channels. An internal
scheduler was implemented to perform periodic tasks, and
supports randomized offsets.
The prototype implementation targets the centralized PGW
deployement scenario where the core Mercury components
(Adapter, Broker, and pubsub) are positioned immediately
on the other side of a standard 3GPP data bearer egress
point. This deployement scenario affords low latency over-
head when EPC core components are located in a datacenter
near the network edge. We covered this deployement scenario
in section 5.1. Note that we did not take advantage of any
specific aspects of the mobile environment in our prototype,
which is left as future work.
7. EVALUATION
We have performed functional and performance (latency)
evaluations of our Mercury prototype. The components oper-
ate functionally as expected, tracking location and responding
to area of interest events where they are verified to be in the
defined region. Micro-benchmarks show that the system can
operate down to 10ms RTT from baseline single message
testing, with a slowly growing response that begins to ramp
up more significantly once the input message rate overtakes
the maximum processing rate of the components. We believe
that introducing more concurrency will both lower the nomi-
nal RTT even for moderate incoming message rates, and push
out the maximum processing rate.
7.1 Vehicle Mobility Simulator
To verify Mercury, we have written a simulator that mimics
real-time vehicular movement. The Simulator provides two
main functionalities. Firstly, to add vehicles to the system.
Secondly, to emulate an event at a given location. Mercury
Simulator has been implemented as follows: We define an
area with in the co-ordinate system in which the vehicles
keep moving. This area depends upon the number of vehicles
a user wants to initialize. Each vehicle is associated with a
unique identifier, x and y co-ordinates that indicate its loca-
tion in the system and speed at which it is moving. Each
vehicle on being initialized binds themselves to a port and
periodically sends reports to the Message Adapter about its
location. While sending a report, we take the vehicles present
speed and its location to determine its new location. Which
in turn is updated on the vehicle and communicated to the
Message Adapter. This is done for each vehicle and thus we
have a simulated vehicle environment. One point to be noted
here is since it is a bounded region we take care that all the
vehicles move within this enclosed area.
Using simulator, we can emulate an event by specifying the
(x,y,r) 3-tuple. All the vehicles enclosed within the region
covered by a circle centered at (x,y) with radius r sense this
event. We have implemented this as follows: Whenever a
simulate event function is invoked with 3-tuple. Since we
have list of all the vehicles within the system for each vehicle
we verify if it falls within the region specified by the 3-tuple.
If yes, we send a message to the Message Adapter on the port
that vehicle is bound.
7.2 Functional Evaluation - Area of Interest
Using the Message Simulator we have verified the func-
tionality of the system. To do this we have initially set up ten
vehicles in the simulated ecosystem. Then mocked an event
collision at location (5,2) with a radius of 2 as in figure 3.
All the vehicles within this region have sensed the event and
published a message to the Mercury. We have taken care
that the number of vehicles that sense the event and publish
the messages to Message Adapter will be greater than the
threshold needed for the Message Broker to trigger an Area
of Interest message. The AOI message from Message Broker
9
10. is represented as bigger circle in the figure 4.
Figure 3: Mercury event simulation.
Figure 4: Mercury Area Of Interest.
By the time AOI message from Message Broker has reached
the vehicles we have observed the vehicle which has sensed
the event at location (6,2) has moved away from the region.
This vehicle didn’t receive any alert from Mercury. There
were two other vehicles that are at location (3,5) and (8,6)
and have moved into the AOI calculated by Message Broker
both these vehicles received the message. And the three of
four vehicles which have sensed the event were still falling
within the Message Broker’s AOI and have received an alert.
Through this experiment we have verified that all the vehi-
cles within the AOI of Message Broker have received an alert
irrespective of sensing the event and those vehicles which are
out of the AOI did not receive it.
7.3 Latency Micro-benchmark
In order to assess the latency response of Mercury under
load, we performed a micro-benchmark involving sending
messages at progressively higher rates, end-to-end. To do
this, we developed an client-side application, “echorate”,
that sends timestamped messages to the Broker. The Broker
responds to these immediately, embedding the timestamp
provided (similar to ICMP ping). The “echorate” app takes
rate and total message count as arguments. For this evaluation,
we took baseline measurements at 1 message per second over
a one minute period, then at rates of 10 messages/second up
through 1,000 messages/second at roughly logarithmic rate
increments. For each increment we increase the count such
that the total test target run time is 10 seconds.
Figure 5: Round trip time (RTT) as a function of message
rate.
The results are presented as a box-and-whisker plot in
figure 5. Message rate appears as discrete values along the
x-axis. Round trip time is plotted using a log scale on the
y-axis. The dots indicate outliers. This graph shows that
the minimum RTT our prototype manages is about 10 mil-
liseconds. However, even at a rate of 10 messages/second,
the RTT jumps by an order of magnitude. The response
stays fairly flat at around 1 second through a rate of 500
messages/second. Somewhere between this latter rate and
750 messages/second, the rate begins a linear climb. This
trend is a result of the Mercury components falling behind in
message processing. As the quartile spread indicates at these
higher rates, the RTT slowly creeps up as message processing
continues to lag behind the incoming message rate.
These results indicate that the prototype needs additional
work to improve its throughput and responsiveness in order
to meet the demand of realistic workloads while maintaining
latency-sensitive message requirements. Our prototype al-
10
11. ready uses parallel processing inside individual components
to queue incoming messages. However, message processing
and sending is single-threaded. We believe that the key to
increasing throughput is to parallelize these tasks. Decreas-
ing the RTT baseline message rate can be accomplished by
reimplementing Mercury in a lower-level language where
individual processing time contributions are easier to manage
and processing overhead is generally lower. Using real-time
scheduler directives would likely also help. We leave such
optimizations as future work.
8. DISCUSSION
The design of Mercury, the possible deployment scenarios
it can accommodate and the evaluation of prototype imple-
mentation of Mercury clearly suggest that Mercury is a fit for
both present and future Intelligent Transportation Systems.
Yet, there are few areas where we can further improve to
make Mercury more appealing.
At present, Mercury uses AOI as a main primitive in deliv-
ering messages to the clients. Mercury Broker determines the
AOI and this is processed by the Message Adapter to deliver
messages to respective Clients. The AOI that we are imple-
menting or envisioned in this paper is based on the circle
centered at a point with a given radius. Clearly, when we are
using the circular region as metrics there could be vehicles
which are not affected by the event yet receive the alert mes-
sage from Mercury because they fall inside this region. This
is where we think AOI calculation should also add another
dimension to its measurement, namely direction. This comes
from the basic concept that an event happening on one side
of the road may or may not affect the vehicles moving on the
other side of the road. Looking at the directions we can also
detect collisions between vehicles using the reports they send
to the system. Hence, this is an interesting future work area.
Presently, the Message Adapter doesn’t implement any sig-
nificant security measures when dealing with the messages
that are moving in and out of the system. We only check
if the sender of the message has a session with Mercury
and then forward it to the Mercury Broker. The verifica-
tion that is done here can be further supplemented by other
methods such as self-certifying endpoint IDs and signed mes-
sages (to prevent spoofing), and data analysis at the Broker
looking for anomalies (to prevent gaming). Without such
protections, miscreants could exploit and/or spoof messages
without sensing an event or in any other anticipated way that
could generate profits to them or cause harm to others.
The Message Broker receives all sensed events from the
Message Adapter and performs computation on them to de-
termine AOI. Here, we can see that Message Broker depends
on the incoming messages to figure out whether an inciden-
t/event is happening. It doesn’t have any other way to know
about an event except for the incoming messages. But, if we
have a close look at Mercury we also have another source of
information; the reports that are periodically sent by vehicles.
We can make the Message Broker intelligent enough to look
at these reports and detect an event. It could further decrease
the latency in the system and we could make more informed
decisions a step before a threshold of vehicles get to sense
this event and report it to the system. For example, all vehi-
cles which are in a region experiencing congestion move at a
slow speed. Looking at the reports from vehicles, we could
detect the slowing down of vehicles in any region and send a
congestion alert to relevant vehicles (via AOI).
Section 5 mentions a handful of different deployment sce-
narios. We would like to extend Mercury into these different
scenarios and measure its performance. In particular, we
would like to make use of eMBMS for broadcasting AOI and
heartbeat messages to Clients. We would also like to explore
the edge deployment scenario. This scenario has the great-
est potential for minimizing latency, and also has interesting
fault tolerance properties and challenges. Keeping a mesh of
agents running at each eNodeB bypasses issues in the core
network, but means manging message routes and maintaining
healthy paths.
Finally, there are a number of things we can do to improve
the performance of Mercury. We could increase the perfor-
mance by increasing parallelism in the system such as scaling
Message Adapter and Message Broker. We could also take
advantage of the consumer groups concept in the Apache
Kafka that help us in instantiating multiple consumers on a
single topic. This way all the messages that come to a single
topic can also be processed by multiple consumer instances
giving us high throughput. We can also take advantage of the
retention period in the Kafka to go back in time and receive
any alert if missed. This could probably be an interesting op-
tion to look at because vehicles may tend to lose connection
to intermittently and when they establish connection again
with the system they might be interested in listening those
events that it missed.
9. CONCLUSION
We have presented Mercury, an end-to end mobility centric
messaging system that improves safety within the vehicular
environment. We have looked at the architecture and differ-
ent components of Mercury. We have discussed the different
deployment scenarios and how Mercury can fit in each of
them. We also analyzed the need of a pubsub system in this
environment and our choice to use Kafka for the implementa-
tion. We evaluated our prototype Mercury implementation in
a 4G deployment context. A vehicle simulator was written
to test functional correctness, and a synthetic echo applica-
tion was used to evaluate rount trip time latency performance.
We conclude that the prototype is functionally accurate, but
requires additional parallelism and tuning to meet latency re-
quirements for realistic workloads. We have also considered
how adding a direction based metric to this system would
make it more precise and how we can incorporate more trust
into Mercury so that it is not misused.
10. REFERENCES
11
12. [1] Insurance institute for highway safety. http:
//www.iihs.org/iihs/topics/t/general-statistics/
fatalityfacts/overview-of-fatality-facts, 2015.
[2] Trading economics. http://www.tradingeconomics.com/
united-states/total-vehicle-sales, 2015.
[3] 5GPPP. 5G Vision - The 5G Infrastructure Public Private Partnership:
the next generation of communication networks and services.
https://5g-ppp.eu/wp-content/uploads/2015/02/
5G-Vision-Brochure-v1.pdf, 2015.
[4] ARANITI, G., CAMPOLO, C., CONDOLUCI, M., IERA, A., AND
MOLINARO, A. Lte for vehicular networking: a survey. IEEE
Communications Magazine 51, 5 (2013), 148–157.
[5] BANERJEE, A., CHO, J., EIDE, E., DUERIG, J., NGUYEN, B.,
RICCI, R., VAN DER MERWE, J., WEBB, K., AND WONG, G.
Phantomnet: Research infrastructure for mobile networking, cloud
computing and software-defined networking. GetMobile: Mobile
Computing and Communications 19, 2 (2015), 28–33.
[6] BILAL, S. M., BERNARDOS, C. J., AND GUERRERO, C.
Position-based routing in vehicular networks: A survey. Journal of
Network and Computer Applications 36, 2 (2013), 685–697.
[7] BUFFERS, P. Googleâ ˘A´Zs data interchange format, 2011.
[8] CHECKO, A., CHRISTIANSEN, H. L., YAN, Y., SCOLARI, L.,
KARDARAS, G., BERGER, M. S., AND DITTMANN, L. Cloud ran for
mobile networksâ ˘AˇTa technology overview. IEEE Communications
surveys & tutorials 17, 1 (2015), 405–426.
[9] CHEN, Y., DUAN, L., AND ZHANG, Q. Financial analysis of 4g
network deployment. In 2015 IEEE Conference on Computer
Communications (INFOCOM) (2015), IEEE, pp. 1607–1615.
[10] CHO, J., NGUYEN, B., BANERJEE, A., RICCI, R., VAN DER
MERWE, J., AND WEBB, K. Smore: software-defined networking
mobile offloading architecture. In Proceedings of the 4th workshop on
All things cellular: operations, applications, & challenges (2014),
ACM, pp. 21–26.
[11] CONSORTIUM, C. V. S. C., ET AL. Vehicle safety communications
project: Task 3 final report: identify intelligent vehicle safety
applications enabled by dsrc. National Highway Traffic Safety
Administration, US Department of Transportation, Washington DC
(2005).
[12] CORICI, M., GOUVEIA, F., MAGEDANZ, T., AND VINGARZAN, D.
Openepc: A technical infrastructure for early prototyping of ngmn
testbeds. In International Conference on Testbeds and Research
Infrastructures (2010), Springer, pp. 166–175.
[13] DAHLMAN, E., PARKVALL, S., AND SKOLD, J. 4G:
LTE/LTE-Advanced for Mobile Broadband, 1st ed. Academic Press,
2011.
[14] GRIGORIK, I. High Performance Browser Networking: What every
web developer should know about networking and web performance. "
O’Reilly Media, Inc.", 2013.
[15] HANSSON, H. A., NOLTE, T., NORSTROM, C., AND PUNNEKKAT,
S. Integrating reliability and timing analysis of can-based systems.
IEEE Transactions on Industrial Electronics 49, 6 (2002), 1240–1250.
[16] HARTENSTEIN, H., AND LABERTEAUX, L. A tutorial survey on
vehicular ad hoc networks. IEEE Communications magazine 46, 6
(2008), 164–171.
[17] JIANG, D., AND DELGROSSI, L. Ieee 802.11 p: Towards an
international standard for wireless access in vehicular environments.
In Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE
(2008), IEEE, pp. 2036–2040.
[18] KARAGIANNIS, G., ALTINTAS, O., EKICI, E., HEIJENK, G.,
JARUPAN, B., LIN, K., AND WEIL, T. Vehicular networking: A
survey and tutorial on requirements, architectures, challenges,
standards and solutions. IEEE Communications Surveys & Tutorials
13, 4 (2011), 584–616.
[19] KIM, H.-Y., KANG, D.-M., LEE, J.-H., AND CHUNG, T.-M. A
performance evaluation of cellular network suitability for vanet. World
Academy of Science, Engineering and Technology, International
Journal of Electrical, Computer, Energetic, Electronic and
Communication Engineering 6, 4 (2012), 448–451.
[20] LANER, M., SVOBODA, P., ROMIRER-MAIERHOFER, P., NIKAEIN,
N., RICCIATO, F., AND RUPP, M. A comparison between one-way
delays in operating hspa and lte networks. In Modeling and
Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2012
10th International Symposium on (2012), IEEE, pp. 286–292.
[21] LECOMPTE, D., AND GABIN, F. Evolved multimedia
broadcast/multicast service (embms) in lte-advanced: overview and
rel-11 enhancements. IEEE Communications Magazine 50, 11 (2012),
68–74.
[22] MIR, Z. H., AND FILALI, F. Lte and ieee 802.11 p for vehicular
networking: a performance evaluation. EURASIP Journal on Wireless
Communications and Networking 2014, 1 (2014), 1.
[23] MISRA, P., AND ENGE, P. Global Positioning System: Signals,
Measurements and Performance Second Edition. Lincoln, MA:
Ganga-Jamuna Press, 2006.
[24] NASIM, R., KASSLER, A. J., ANTONIC, A., ET AL. Mobile
publish/subscribe system for intelligent transport systems over a cloud
environment. In Cloud and Autonomic Computing (ICCAC), 2014
International Conference on (2014), IEEE, pp. 187–195.
[25] PAPADIMITRATOS, P., DE LA FORTELLE, A., EVENSSEN, K.,
BRIGNOLO, R., AND COSENZA, S. Vehicular communication
systems: Enabling technologies, applications, and future outlook on
intelligent transportation. IEEE Communications Magazine 47, 11
(2009), 84–95.
[26] PONGTHAWORNKAMOL, T., NAHRSTEDT, K., AND WANG, G. The
analysis of publish/subscribe systems over mobile wireless ad hoc
networks. In Mobile and Ubiquitous Systems: Networking & Services,
2007. MobiQuitous 2007. Fourth Annual International Conference on
(2007), IEEE, pp. 1–8.
[27] RAYCHAUDHURI, D., NAGARAJA, K., AND VENKATARAMANI, A.
Mobilityfirst: a robust and trustworthy mobility-centric architecture
for the future internet. ACM SIGMOBILE Mobile Computing and
Communications Review 16, 3 (2012), 2–13.
[28] UCAR, S., ERGEN, S. C., AND OZKASAP, O. Multihop-cluster-based
ieee 802.11 p and lte hybrid architecture for vanet safety message
dissemination. IEEE Transactions on Vehicular Technology 65, 4
(2016), 2621–2636.
[29] VENKATARAMANI, A., KUROSE, J. F., RAYCHAUDHURI, D.,
NAGARAJA, K., MAO, M., AND BANERJEE, S. Mobilityfirst: a
mobility-centric and trustworthy internet architecture. ACM
SIGCOMM Computer Communication Review 44, 3 (2014), 74–80.
[30] WOLNY, G. Modified dmac clustering algorithm for vanets. In 2008
Third International Conference on Systems and Networks
Communications (2008), IEEE, pp. 268–273.
[31] ZHANG, J., WANG, F.-Y., WANG, K., LIN, W.-H., XU, X., AND
CHEN, C. Data-driven intelligent transportation systems: A survey.
IEEE Transactions on Intelligent Transportation Systems 12, 4 (2011),
1624–1639.
[32] ZHANG, Z., BOUKERCHE, A., AND PAZZI, R. A novel multi-hop
clustering scheme for vehicular ad-hoc networks. In Proceedings of
the 9th ACM international symposium on Mobility management and
wireless access (2011), ACM, pp. 19–26.
12