Browse
Submit Data
Databases
API
Help

Dataset Information

36 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Emergency Situation Prediction Mechanism: A Novel Approach for Intelligent Transportation System Using Vehicular Ad Hoc Networks.

ABSTRACT: In Indian four-lane express highway, millions of vehicles are travelling every day. Accidents are unfortunate and frequently occurring in these highways causing deaths, increase in death toll, and damage to infrastructure. A mechanism is required to avoid such road accidents at the maximum to reduce the death toll. An Emergency Situation Prediction Mechanism, a novel and proactive approach, is proposed in this paper for achieving the best of Intelligent Transportation System using Vehicular Ad Hoc Network. ESPM intends to predict the possibility of occurrence of an accident in an Indian four-lane express highway. In ESPM, the emergency situation prediction is done by the Road Side Unit based on (i) the Status Report sent by the vehicles in the range of RSU and (ii) the road traffic flow analysis done by the RSU. Once the emergency situation or accident is predicted in advance, an Emergency Warning Message is constructed and disseminated to all vehicles in the area of RSU to alert and prevent the vehicles from accidents. ESPM performs well in emergency situation prediction in advance to the occurrence of an accident. ESPM predicts the emergency situation within 0.20 seconds which is comparatively less than the statistical value. The prediction accuracy of ESPM against vehicle density is found better in different traffic scenarios.

SUBMITTER: Ganeshkumar P

PROVIDER: S-EPMC4442019 | biostudies-other | 2015

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

A group based key sharing and management algorithm for vehicular ad hoc networks.

Project description:Vehicular ad hoc networks (VANETs) are one special type of ad hoc networks that involves vehicles on roads. Typically like ad hoc networks, broadcast approach is used for data dissemination. Blind broadcast to each and every node results in exchange of useless and irrelevant messages and hence creates an overhead. Unicasting is not preferred in ad-hoc networks due to the dynamic topology and the resource requirements as compared to broadcasting. Simple broadcasting techniques create several problems on privacy, disturbance, and resource utilization. In this paper, we propose media mixing algorithm to decide what information should be provided to each user and how to provide such information. Results obtained through simulation show that fewer number of keys are needed to share compared to simple broadcasting. Privacy is also enhanced through this approach.

| S-EPMC3919045 | biostudies-other

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

Project description:We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

| S-EPMC4165744 | biostudies-other

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.

Project description:Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

| S-EPMC5877352 | biostudies-literature

Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks.

Project description:Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV.

| S-EPMC4892561 | biostudies-literature

Data management issues in mobile ad hoc networks.

Project description:Research on mobile ad hoc networks (MANETs) has become a hot research topic since the middle 1990's. Over the first decade, most research focused on networking techniques, ignoring data management issues. We, however, realized early the importance of data management in MANETs, and have been conducting studies in this area for 15 years. In this review, we summarize some key technical issues related to data management in MANETs, and the studies we have done in addressing these issues, which include placement of data replicas, update management, and query processing with security management. The techniques proposed in our studies have been designed with deep considerations of MANET features including network partitioning, node participation/disappearance, limited network bandwidth, and energy efficiency. Our studies published in early 2000's have developed a new research field as data management in MANETs. Also, our recent studies are expected to be significant guidelines of new research directions. We conclude the review by discussing some future directions for research.

| S-EPMC5489434 | biostudies-other

MAC protocol for ad hoc networks using a genetic algorithm.

Project description:The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput.

| S-EPMC4130326 | biostudies-other

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.

Project description:Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

| S-EPMC5539509 | biostudies-other

Collaborative caching discovery management in mobile ad hoc networks environments.

Project description:Accessing distant data items in mobile ad hoc networks (MANETs) environments pose a huge challenge due to mobility and resource constraints. A number of research studies have been developed to enhance data accessibility and decrease the number of pending queries. A collaborative caching technique is considered as an efficient mechanism to increase data accessibility and decrease the latency which in turn reduces the pending queries. However, the processing queries that based on their classifications along with distributed indexing have not been tackled in previous works to reduce the number of pending queries and increase the number of replied queries. A collaborative caching discovery which based on service providers (CCD) is proposed in this article, which process requests depending on their status either priority or normal. This ensures that the number of pending queries is reduced with minimum cache discovery overhead. The results of the experiment reveal that the proposed strategy increased collaborative caching discovery efficiency and outperformed the cooperative and adaptive system (COACS) in terms of increasing the number of replied queries and reduction of the pending queries by 24.21 percent.

| S-EPMC10280438 | biostudies-literature

A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

Project description:The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

| S-EPMC4127208 | biostudies-other

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

Project description:In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

| S-EPMC4475759 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data