Inter-vehicle communications (IVC) could potentially improve safety, mobility, and fuel efficiency of a transportation system. However, traditional

Introduction

Inter-vehicle communications (IVC) could potentially improve safety, mobility, and fuel efficiency of a transportation system. However, traditional decentralized approaches based on Dedicated Short Range Communications could take a long time to reach a meaningful market penetration rate. In this study, we attempt to take advantage of ubiquitous smartphones and develop an IVC system based on smartphones. In this system, smartphones on vehicles communicate with a central server and share traffic information with each other. The proposed app can be helpful for current road status, can send alert if any road blockage is there etc. The city can be divided into regions and assign dedicated computing machine will be assigned for the vehicles within a specific region.

. Software and Hardware Requirements

HARDWARE REQUIREMENTS:

System: Intel i5

Hard Disk : 500 GB.

Ram: 16 GB.

Smart Phone : Android based

SOFTWARE REQUIREMENTS:

Operating system : Windows 10/11

Coding Language: JAVA

IDE:Netbeans, android Studio

Database:MYSQL

Cloud : AWS

NET BEANS IDE 8.2

NetBeansIDE is a modular, standards-based integrated development environment (IDE), written in the Javaprogramming language. The NetBeans project consists of afull-featured open source IDEwritten in the Java programming language and arich client application platform, which can be used as a generic framework to build any kind of application.

Fig 3.6: NetBeans IDE 8.2

NetBeans IDE runs on the Java SE Development Kit (JDK) which consists of the Java Runtime Environment and developer tools for compiling, debugging, and running applications written in the Java language. NetBeans IDE sets the standard for developing with cutting edge technologies out of the box. An IDE is much more than a text editor.

The NetBeans Editor indent lines, matches words and brackets, and highlight source code syntactically and semantically. It also provides code templates, coding tips, and refactoring tools.

The editor supports many languages from Java, C/C++, XML and HTML, to PHP, Groovy, Javadoc, JavaScript and JSP. Because the editor is extensible, you can plug in support for many other languages.Keeping a clear overview of large applications, with thousands of folders and files, and millions of lines of code, is ia daunting task. Net Beans IDE provides different views of the data, from multiple project windows to helpful tools for setting up the applications and managing them efficiently, letting to drill down into the data quickly and easily, while giving versioning tools via Subversion, Mercurial, and Get integration out of the box.

3.2.2 MySQL

MySQL ("My Sequel") is (as of 2008) the world's most widely used open source relational database management system (RDBMS) that runs as a server providing multi-user access to a number of databases. The SQL phrase stands for Structured Query Language.

The MySQL development project has made its source code available under the terms of the GNU General Public License, as well as under a variety of proprietary agreements. MySQL was owned and sponsored by a single for-profit firm, the Swedish company MySQL AB, now owned by Oracle Corporation.

MySQL is a popular choice of database for use in web applications, and is a central component of the widely used LAMP open source web application software stack (and other 'AMP' stacks). LAMP is an acronym for "Linux, Apache, MySQL, Perl/PHP/Python." Free-software-open source projects that require a full-featured database management system often use MySQL.

MySQL is a relational database management system (RDBMS), and ships with no GUI tools to administer MySQL databases or manage data contained within the databases. Users may use the included command line tools, or use MySQL "front-ends", desktop software and web applications that create and manage MySQL databases, build database structures, back up data, inspect status, and work with data records. The official set of MySQL front-end tools, MySQL Workbench is actively developed by Oracle, and is freely available for use.

MySQL, like most other transactional relational databases, is strongly limited by hard disk performance. This is especially true in terms of write latency. Given the recent appearance of very affordable consumer grade SATA interface Solid-state drives that offer zero mechanical latency, a fivefold speedup over even an eight drive RAID array can be had for a smaller investment.

Fig.: MySQL Workbench in Windows

NAVICAT 8 LiteNavicatis a series of graphicaldatabase managementand development software produced by Premium soft Cyber Tech Ltd. For MySQL, MariaDB, MongoDB, Oracle, SQLite,PostgreSQLandMicrosoft SQL Server. It has an Explorer-like graphical user interface and supports multipledatabase connectionsfor local and remote databases.

Fig 3.7: Navicat 8 LiteNavicat enables you to easily and quickly transfer data across various database systems, or to a plain text file with the designated SQL format and encoding. Also, batch job for different kind of databases can also be scheduled and run at a specific time. Features in Navicat are sophisticated enough to provide professional developers for all their specific needs, yet easy to learn for users who are new to database server.

Navicat is a multi-connections database administration tool which allows to connect with MySQL, SQL Server, and Oracle databases simultaneously within a single application, making database administration to multiple kinds of database so easy. MySQL phrase stands for Structured Query Language. MySQL ("My Sequel") is (as of 2008) the world's most widely used open source relational database management system (RDBMS) that runs as a server providing multi-user access to a number of databases

ANDROID DESCRIPTION

Android is a software stack for mobile devices that includes an operating system, middleware and key applications. The Android SDK provides the tools and APIs necessary to begin developing applications on the Android platform using the Java programming language. The androidmobile operating systemis based on theLinux kernel. Google and other members of theOpen Handset Alliancecollaborated on Android's development and release. The Android Open Source Project (AOSP) is tasked with the maintenance and further development of Android.FeaturesApplication framework enabling reuse and replacement of components

Dalvik virtual machine optimized for mobile devices

Integrated browser based on the open source Web Kit engine

Optimized graphics powered by a custom 2D graphics library; 3D graphics based on the OpenGL ES 1.0 specification (hardware acceleration optional)

SQLite for structured data storage

Media support for common audio, video, and still image formats (MPEG4, H.264, MP3, AAC, AMR, JPG, PNG, GIF)

GSM Telephony (hardware dependent)

Bluetooth, EDGE, 3G, and Wi-Fi (hardware dependent)

Camera, GPS, compass, and accelerometer (hardware dependent)

The rich development environment, including a device emulator, tools for debugging, memory and performance profiling, and a plugin for the Eclipse IDE

APPLICATION

Android applications are written in the Java programming language. The Android SDK tools compile the codealong with any data and resource filesinto anAndroid package, an archive file with an.apksuffix. All the code in a single.apkfile is considered to be one application and is the file that Android-powered devices use to install the application.

Once installed on a device, each Android application lives in its own security sandbox:

The Android operating system, is a multi-user Linux system in which each application is a different user.

By default, the system assigns each application a unique user ID (the ID issued only by the system and is unknown to the application). The system sets permissions for all the files in an application so that only the user ID assigned to that application can access them.

Each process has its own virtual machine (VM), so an application's code runs in isolation from other applications.

By default, every application runs in its own Linux process. Android starts the process when any of the application's components need to be executed, then shuts down the process when it's no longer needed or when the system must recover memory for other applications.

In this way, the Android system implements theprinciple of least privilege. That is, each application, by default, has access only to the components that it requires to do its work and no more. This creates a very secure environment in which an application cannot access parts of the system for which it is not given permission.

However, there are ways for an application to share data with other applications and for an application to access system services:

It's possible to arrange for two applications to share the same Linux user ID, in which case they are able to access each other's files. To conserve system resources, applications with the same user ID can also arrange to run in the same Linux process and share the same VM (the applications must also be signed with the same certificate).

An application can request permission to access device data, such as the user's contacts, SMS messages, the mountable storage (SD card), camera, Bluetooth, and more. All application permissions must be granted by the user at install time.

That covers the basics regarding how an Android application exists within the system. The rest of this document introduces you to:

The core framework components that define your application.

The manifest file in which you declare components and required device features for your application.

Security Requirements

Advanced Encryption Standard

The Advanced Encryption Standard (AES), also known as Rijndael (its original name), is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.

AES is based on the Rijndael cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process. Rijndael is a family of ciphers with different key and block sizes.

For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits.

AES has been adopted by the U.S. government and is now used worldwide. It supersedes the Data Encryption Standard (DES), which was published in 1977. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data.

In the United States, AES was announced by the NIST as U.S. FIPS PUB 197 (FIPS 197) on November 26, 2001. This announcement followed a five-year standardization process in which fifteen competing designs were presented and evaluated, before the Rijndael cipher was selected as the most suitable (see Advanced Encryption Standard process for more details).

Description of the cipher

AES is based on a design principle known as a substitution-permutation network, combination of both substitution and permutation, and is fast in both software and hardware. Unlike its predecessor DES, AES does not use a Feistel network. AES is a variant of Rijndael which has a fixed block size of 128 bits, and a key size of 128, 192, or 256 bits. By contrast, the Rijndael specification per se is specified with block and key sizes that may be any multiple of 32 bits, both with a minimum of 128 and a maximum of 256 bits.

AES operates on a 44 column-major order matrix of bytes, termed the state, although some versions of Rijndael have a larger block size and have additional columns in the state. Most AES calculations are done in a special finite field.

For instance, if there are 16 bytes, b0,b1,...,b15, these bytes are represented as this matrix:

The key size used for an AES cipher specifies the number of repetitions of transformation rounds that convert the input, called the plaintext, into the final output, called the ciphertext. The number of cycles of repetition are as follows:

10 cycles of repetition for 128-bit keys.

12 cycles of repetition for 192-bit keys.

14 cycles of repetition for 256-bit keys.

Each round consists of several processing steps, each containing four similar but different stages, including one that depends on the encryption key itself. A set of reverse rounds are applied to transform ciphertext back into the original plaintext using the same encryption key.

High-level description of the algorithm

KeyExpansionsround keys are derived from the cipher key using Rijndael's key schedule. AES requires a separate 128-bit round key block for each round plus one more.

InitialRound

AddRoundKeyeach byte of the state is combined with a block of the round key using bitwise xor.

Rounds

SubBytesa non-linear substitution step where each byte is replaced with another according to a lookup table.

ShiftRowsa transposition step where the last three rows of the state are shifted cyclically a certain number of steps.

MixColumnsa mixing operation which operates on the columns of the state, combining the four bytes in each column.

AddRoundKeyFinal Round (no MixColumns)

SubBytesShiftRowsAddRoundKey.

The SubBytes step

In the SubBytes step, each byte in the state is replaced with its entry in a fixed 8-bit lookup table, S; bij = S(aij).

In the SubBytes step, each byte in the state matrix is replaced with a SubByte using an 8-bit substitution box, the Rijndael S-box. This operation provides the non-linearity in the cipher. The S-box used is derived from the multiplicative inverse over GF(28), known to have good non-linearity properties. To avoid attacks based on simple algebraic properties, the S-box is constructed by combining the inverse function with an invertible affine transformation. The S-box is also chosen to avoid any fixed points (and so is a derangement), i.e., , and also any opposite fixed points, i.e., . While performing the decryption, Inverse SubBytes step is used, which requires first taking the affine transformation and then finding the multiplicative inverse (just reversing the steps used in SubBytes step).

The ShiftRows step

In the ShiftRows step, bytes in each row of the state are shifted cyclically to the left. The number of places each byte is shifted differs for each row.

The ShiftRows step operates on the rows of the state; it cyclically shifts the bytes in each row by a certain offset. For AES, the first row is left unchanged. Each byte of the second row is shifted one to the left. Similarly, the third and fourth rows are shifted by offsets of two and three respectively. For blocks of sizes 128 bits and 192 bits, the shifting pattern is the same. Row n is shifted left circular by n-1 bytes. In this way, each column of the output state of the ShiftRows step is composed of bytes from each column of the input state. (Rijndael variants with a larger block size have slightly different offsets). For a 256-bit block, the first row is unchanged and the shifting for the second, third and fourth row is 1 byte, 3 bytes and 4 bytes respectivelythis change only applies for the Rijndael cipher when used with a 256-bit block, as AES does not use 256-bit blocks. The importance of this step is to avoid the columns being linearly independent, in which case, AES degenerates into four independent block ciphers.

The MixColumns step

In the MixColumns step, each column of the state is multiplied with a fixed polynomial c(x).

In the MixColumns step, the four bytes of each column of the state are combined using an invertible linear transformation. The MixColumns function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes. Together with ShiftRows, MixColumns provides diffusion in the cipher.

During this operation, each column is transformed using a fixed matrix (matrix multiplied by column gives new value of column in the state):

Matrix multiplication is composed of multiplication and addition of the entries. Entries are 8 bit bytes treated as coefficients of polynomial of order x7. Addition is simply XOR. Multiplication is modulo irreducible polynomial x8+x4+x3+x+1. If processed bit by bit then after shifting a conditional XOR with 0x1B should be performed if the shifted value is larger than 0xFF (overflow must be corrected by subtraction of generating polynomial). These are special cases of the usual multiplication in GF(28).

In more general sense, each column is treated as a polynomial over GF(28) and is then multiplied modulo x4+1 with a fixed polynomial c(x) = 0x03 x3 + x2 + x + 0x02. The coefficients are displayed in their hexadecimal equivalent of the binary representation of bit polynomials from GF(2)[x]. The MixColumns step can also be viewed as a multiplication by the shown particular MDS matrix in the finite field GF(28). This process is described further in the article Rijndael mix columns.

The AddRoundKey step

In the AddRoundKey step, each byte of the state is combined with a byte of the round subkey using the XOR operation ().

In the AddRoundKey step, the subkey is combined with the state. For each round, a subkey is derived from the main key using Rijndael's key schedule; each subkey is the same size as the state. The subkey is added by combining each byte of the state with the corresponding byte of the subkey using bitwise XOR.

Optimization of the cipher

On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining the SubBytes and ShiftRows steps with the MixColumns step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables, and utilizes a total of four kilobytes (4096 bytes) of memory one kilobyte for each table. A round can then be done with 16 table lookups and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the AddRoundKey step.

If the resulting four-kilobyte table size is too large for a given target platform, the table lookup operation can be performed with a single 256-entry 32-bit (i.e. 1 kilobyte) table by the use of circular rotates.

Using a byte-oriented approach, it is possible to combine the SubBytes, ShiftRows, and MixColumns steps into a single round operation.

The latitude and longitude

From: FAU To: Boca Tri Rail

https://www.google.com/maps/dir/Florida+Atlantic,+Boca+Raton,+FL+33431/Boca+Raton+Tri-Rail,+Boca+Raton,+FL+33431/@26.3785532,-80.1312693,14z/am=t/data=!4m13!4m12!1m5!1m1!1s0x88d91f6a8f79df19:0xb714ddf374bafb6!2m2!1d-80.1289321!2d26.3683064!1m5!1m1!1s0x88d91e2794df7047:0x4ee119a8b544e6aa!2m2!1d-80.0994055!2d26.3924405https://goo.gl/maps/ea8xwgajfWweroQ77The latitude and longitude

From FAU To: Boca Mall

https://www.google.com/maps/dir/Florida+Atlantic,+Boca+Raton,+FL+33431/Town+Center+at+Boca+Raton,+6000+Glades+Rd,+Boca+Raton,+FL+33431/@26.365203,-80.1346951,16.29z/am=t/data=!3m1!5s0x88d91e79ca0d4375:0x49329c4b623964d0!4m13!4m12!1m5!1m1!1s0x88d91f6a8f79df19:0xb714ddf374bafb6!2m2!1d-80.1289321!2d26.3683064!1m5!1m1!1s0x88d91e79b80cf7bf:0x60bc536703250651!2m2!1d-80.1327541!2d26.3650141https://goo.gl/maps/91v8vb6SZSKh2yoW7The latitude and longitude

From:FAU To: San Marco

https://www.google.com/maps/dir/Florida+Atlantic,+Boca+Raton,+FL+33431/San+Marco+Apartments,+North+Military+Trail,+Boca+Raton,+FL/@26.3818069,-80.1500174,14z/data=!3m2!4b1!5s0x88d91e79ca0d4375:0x49329c4b623964d0!4m13!4m12!1m5!1m1!1s0x88d91f6a8f79df19:0xb714ddf374bafb6!2m2!1d-80.1289321!2d26.3683064!1m5!1m1!1s0x88d91e49ae3763c3:0xddd8d57687593778!2m2!1d-80.1233316!2d26.3976838https://goo.gl/maps/3hWEd7C576EnVxRZAThe latitude and Longitude

From: FAU To:Boca Raton Beach

https://www.google.com/maps/dir/Florida+Atlantic+University,+Glades+Rd,+Boca+Raton,+FL+33431/Boca+Raton,+FL/@26.3697089,-80.1257823,15z/data=!3m2!4b1!5s0x88d91e79ca0d4375:0x49329c4b623964d0!4m13!4m12!1m5!1m1!1s0x88d91e0333f8aa69:0x52043ea122f5fb6a!2m2!1d-80.1019023!2d26.3737473!1m5!1m1!1s0x88d923c2ef36fb27:0xd23ea6eeca6095c9!2m2!1d-80.1289321!2d26.3683064https://goo.gl/maps/wNfgenepqXL8GhvQAThe Latitude and Longitude

From: FAU To:Delray Beach

https://www.google.com/maps/dir/Florida+Atlantic+University,+Glades+Rd,+Boca+Raton,+FL+33431/Delray+Beach,+Delray+Beach,+FL/@26.5334331,-80.2422142,11z/data=!3m2!4b1!5s0x88d91e79ca0d4375:0x49329c4b623964d0!4m13!4m12!1m5!1m1!1s0x88d91e0333f8aa69:0x52043ea122f5fb6a!2m2!1d-80.1019023!2d26.3737473!1m5!1m1!1s0x88d8dffab1ae25d7:0x5fed871f9bd7261!2m2!1d-80.0733448!2d26.4614619https://goo.gl/maps/bADPpJTzd7PoXn5z6