Lightweight and Privacy-Preserving ID-as-a-Service

Provisioning in Vehicular Cloud Computing

T. Saravanan
Dept. of CSE
GITAM School of Technology, GITAM (Deemed to be University)
Bengaluru, India
tsaravcse@gmail.com
 Abstract— Cloud computing is composed of different
circulating Cloud Computing that are constructed instantly by
skillfully fusing unused Cloud Computing resources like
calculating power, stockpiling, etc. the variety of tools used to
access the data and services. We thus provide a lightweight
identity-based authenticated data sharing protocol in this
research to enable safe data sharing across physically distant
clients and devices. The chosen-cipher-text attack (CCA)
resistance of the suggested protocol is proved using the
decisional Strong Diffie-Hellman (SDH) problem's hardness
assumption. We compare the proposed protocol's efficiency
with that of the current data-sharing protocols in terms of
calculation costs, communication costs, and response times. We
first provide an enhanced CPABE (cipher-text-strategy
characteristic-based encryption).
Keywords— Xxx, xxx, xxx, xxx, xxx
I. INTRODUCTION
The coordination of dispersed processing and vehicular
associations known as vehicular conveyed figuring, or VCC,
is gaining attention for its potential to support a variety of
cutting-edge, complex, and challenging applications for
improving traffic flow, energy efficiency, and driving safety,
among other things. VCC may provide unique compact
vehicular cloud organizations for automobiles, similar to
scattered processing providing cloud organizations. VCC
expert communities (VCCSP) usually demand the car's
obvious facts to support its requests, regardless of when a
vehicle needs to arrive at VCC organizations.
The on-demand availability of PC structure resources,
particularly data accumulating (distributed capacity) and
computing power, without direct individual organization by
the consumer is known as circulated registering. The phrase
is frequently used to refer to server farms that are accessible
to different clients online. Huge fogs that are oppressive
nowadays frequently have boundaries that are spread
throughout several locations by central workers. An edge
expert could be assigned if the relationship with the customer
is respectably close. Fogs might be accessible to a variety of
affiliations or constrained to a single affiliation (attempt
fogs) (public cloud).
For coherence and scale economies, circulated
registration depends on resource sharing. Supporters of
public and hybrid fogs point out that distributed accounting
enables organizations to avoid or limit upfront IT
infrastructure investments. Advocates also make sure that
distributed processing encourages risk-takers to develop their
applications for activity faster, with more developed reason,
and with less assistance, and that it engages IT groups to
even more quickly change resources to satisfy varying and
unexpected need, giving the burst enlisting capacity: high
figuring power at specific times of apex interest. Cloud
providers often employ a "pay-all the more just as
expenditures arise" methodology, which, if chiefs are
unfamiliar with cloud-assessing methods, might result in
unexpected operating expenses. Improvement in circulating
figure has been prompted by the openness of high-limit
associations, easy PCs, and limit devices as well as the
specific collection of hardware virtualization, organization
coordinated plan, and autonomic and utility managing.
A type of organization access called distributed
computing aims to openly and widely share a large number
of registered assets. These are hired by a specialized
company to sophisticated clientele, typically online. Due to
the rising number of car accidents and the dissatisfaction of
pedestrians in vehicular organizations, the main focus of the
present solutions offered by clever transportation
frameworks is on ensuring traveler comfort and promoting
street wellbeing. By providing flexible arrangements (i.e.,
elective courses, synchronization of traffic signals, etc.)
required by various street security entertainers like police,
disaster and crisis managements, and fiasco and crisis
administrations, distributed computing innovations can
potentially further develop street wellbeing and travel
experience in ITSs. Another distributed computing
architecture called VANET-Cloud used to vehicle
specifically appointed organizations is offered to further
improve traffic wellness and provide computational forms of
support to street customers. Different VANET- Cloud
transportation services are examined, and a few areas for
further research are highlighted, including security and
protection, information aggregation, energy efficiency,
interoperability, and asset managers.
II. MOTIVATION & OVERVIEW OF THE RESEARCH
VANETs will have unique requirements for
autonomous, highly adaptable, low- dormancy, running
applications, and networks that might not be satisfied by
standard distributed computing. The convergence of mist
processing with the traditional cloud for VANETs is
therefore discussed as a plausible solution in both existing
and future VANETs. The addition of Software-Defined
Network (SDN), which offers flexibility, programmability,
and global information on the company, may also improve
Mist registration.
In order to provide a protected VANET information
sharing plan while preserving the security, adaptability, and
fine- granularity components of the original CP-ABE, we
develop a new multi authority CP- ABE plan. We provide a
client renunciation approach and effective characteristic for
the multi-authority CP-ABE plot in a VANET. We
specifically examine some of the figure- focused encryption
and unscrambling processes, helping to significantly lessen
the impact on resource-required OBU devices in
automobiles. For VANETs, we suggest a productive and
secure information-sharing strategy. introduced the ABE
concept first. In the ABE plot, a predetermined authority
generates a framework public key and framework ace key.
A power that generates keys based on credits has to be
predefined; as a result, the keys will have properties for use
during encryption and unscrambling tasks in the future.
Numerous more refined ABE schemes were created after the
ABE conspiracy was initially unveiled.
Real-time search engines and various mining tools are
emerging with millions of users worldwide to enable
individuals to follow the effect of events and news on social
networking sites. Finding spammers on social networking
sites is crucial. This chapter contains the overall structure of
the present work. The following chapter, Review of
Literature, lists the works that deal with spam detection.
 III. RELATED WORK
A. Light weight delegatable proofs of storage
According to J. Xu, A. Yang, J. Zhou, and D. S. Wong et
al., cloud storage is now widely used, which lessens the
strain of users having to store their own data locally.
Researchers have also paid a great deal of attention to
ways to guarantee the security and integrity of the
outsourced data kept in a cloud storage server. The primary
solution proposed to overcome this issue is proofs of storage
(POS). Publicly verified POS considerably increases the
scalability of cloud services by enabling a third party to
validate the data integrity on the data owner's behalf. Due to
numerous expensive group exponentiation operations, the
majority of publicly verifiable POS schemes in use today
compute authentication tags for all data blocks very slowly
—much more slowly than the typical upload speed of a
network. As a result, this phase of the POS scheme's setup
becomes the bottleneck. We provide a brand-new alternative
formulation in this article termed "Delegable Proofs of
Storage (DPOS)". Then, we build a simple privacy-
preserving DPOS scheme that is near to the features of
publicly verifiable POS schemes on the one hand, and as
efficient as private POS schemes on the other. It also
supports third party auditors and may swap auditors at any
moment. We increase the tag creation process' speed by at
least several hundred times when compared to conventional
publicly verifiable POS systems, without losing any other
areas of efficiency. Due to the many advantages, it offers,
such as reduced infrastructure costs, rapid scalability, and
availability, LOUD computing has been widely adopted and
used in our daily lives. As the need for local storage grows,
more and more individuals rely on cloud storage services. In
particular, data is sent to a cloud server and made available
for eventual demand-driven access. In the meanwhile, it is
crucial to address how to guarantee the security and
integrity of the outsourced data without preserving a local
copy for data owners. Applying proofs of storage (POS),
also known as proofs of retrievability (POR) or proofs of
data possession (PDP), is one of the key solutions since it
allows one to verify the integrity of data kept on a cloud
server without having to download all of the data. The
fundamental concept is to split the whole data file into
numerous blocks, each of which is used to create a
homomorphic verifiable tag (HVT), which is then delivered
together with the data file to the cloud server. Numerous
attempts have been made since the original POR and PDP
schemes were introduced in 2007 to create proofs of storage
schemes with more sophisticated characteristics including
public key verifiability, data dynamics (i.e.,
changing/adding/deleting data blocks), numerous cloud
servers, and data sharing. We concentrate on the first two
features: support for data dynamics and public verifiability.
B. Hybrid provable data possession at untrusted stores in
cloud computing
R. Burns, R. Curtmola, and others have proposed Cloud
computing has steadily risen to the top of the Internet
services in recent years. In order to accomplish random
access, data collecting, cost reduction, and the ease of
sharing other services, businesses and users will store a
massive quantity of data in remote cloud storage devices
once cloud computing settings are at their most ideal.
However, when data is kept for a long time in a cloud
storage device, businesses and users inevitably start to
worry about security. They worry that the data is actually
kept in the cloud but is still in the storage device or cannot
be accessed for a long time because the cloud server has
been removed or destroyed, which prevents users and
businesses from accessing or restoring the data files in the
future. This project aims to investigate and build for proven
cloud computing platforms for data storage. When data is
saved in the cloud, researchers and developers work to
create a secure and effective proof-storage protocol. Users
may also assign or permit others to publicly verify if the
data is truly stored in cloud storage devices.
C. Dynamic provable data possession
The proposal was made by C. Erway, A. Kupcu, C.
Papamanthou, et al. Data security has been given a lot more
consideration in cloud storage environments than it did
previously. Important data files owned by users must be
hosted on various cloud service providers in order to
guarantee the dependability and availability of outsourced
data, increase catastrophe resilience, and improve data
recovery ability (CSPs). However, we are aware that CSP is
never trustworthy. A new dynamic multiple-replica provable
data possession (DMR-PDP) approach is suggested in this
case to simultaneously check the integrity of replica files
saved by users on various CSPs. Additionally, we use vector
dot products rather than the modular power calculation in
the conventional PDP approach, which significantly
decreases the calculation time and storage space utilization.
This is done since the tag set is so important. Additionally,
the divided address version mapping table (DAVMT), a
brand-new dynamic data structure, is introduced and used to
address the issue of data dynamic operation. In the end, a
real-world test confirms the viability of our suggested
strategy. Data integrity becomes a challenge in the cloud
storage scenario because when a user uploads local data to
the cloud, control over the outsourced data may be
completely lost. The PDP plan [5] was put up in 2007 to
ensure the accuracy of the data that was outsourced.
According to the PDP system, the data owner (DO)
generates a set of homomorphic tags for the outsourced data,
uploads them together with the encrypted file to the CSP,
and then deletes the local file while retaining the secret key.
The DO sends a challenge to the CSP, the CSP answers to
the challenge, and the DO validates the response when they
need to confirm the accuracy of the data stored in the cloud.
The DO employs a sampling mechanism with probability in
the integrity verification phase of the PDP system, which is
different from the conventional integrity verification
scheme. Although other dynamic PDP methods have been
presented, the PDP strategy in [5] is only applicable to static
data and cannot implement the data's dynamic activity (such
as update or append).
MR-PDP: Multiple-replica provable data possession- R.
Burns, O. Khan, R. Curtmola, and others have proposed to
enhance the availability and longevity of data on unreliable
storage systems, many storage systems rely on replication.
As of right now, these storage technologies offer no
conclusive proof that numerous copies of the data are truly
kept. Storage servers can work together to conceal the fact
that they are only storing one copy of the data while giving
the impression that they are keeping multiple copies. By
using multiple-replica provable data possession (MR-PDP),
we solve this weakness: A provably secure scheme that
enables a client to store t replicas of a file in a storage
system to confirm via a challenge-response protocol that (2)
the storage system uses t times the storage necessary to store
a single replica and that (1) each unique replica can be
produced at the time of the challenge. In a client/server
storage system, the MR-PDP builds on earlier research on
data possession proofs for a single copy of a file (Ateniese
et al., 2007). It is computationally considerably more
effective to store t replicas using MR-PDP than it is to store
t independent, unconnected files using a single-replica PDP
approach (e.g., by encrypting each file separately prior to
storing it). Another benefit of MR-PDP is that when some of
the current copies fail, it may quickly and cheaply construct
further replicas.
D. Privacy-preserving
public auditing for shared data in the cloud
Data sharing across numerous users as well as cloud
storage are both prevalent with cloud storage providers.
However, maintaining identity privacy while allowing for
public auditing of such shared data is still a difficulty. The
first privacy-preserving technique that permits open auditing
of shared data kept in the cloud is proposed in this work. We
use ring signatures in particular to compute the verification
data required to audit the integrity of shared data. Our
system allows a third-party auditor (TPA) to still check the
integrity of shared data without having to download the
complete file while maintaining the privacy of the signer on
each block. Our experimental findings show how well our
suggested technique performs when auditing shared data. By
using cloud storage, users may store their data remotely and
take use of high-quality on-demand apps and services from
a shared pool of reconfigurable computing resources
without having to worry about maintaining and storing their
data locally. However, since users no longer physically hold
the outsourced data, protecting its integrity in the cloud is a
challenging issue, particularly for users with limited
computer power. Additionally, users should not need to
worry about checking the integrity of the cloud storage; they
should just be able to utilize it as if it were local. Therefore,
it is crucial to enable public auditability for cloud storage so
that consumers may utilise a third-party auditor (TPA) to
verify the accuracy of outsourced data and be at ease. The
auditing procedure should not present any new risks to the
privacy of user data or increase the user's online workload in
order to deploy a TPA safely. In this research, we provide a
private public auditing mechanism for a secure cloud
storage system. We further expand our finding such that the
TPA may effectively and simultaneously conduct audits for
a number of consumers. The suggested techniques are
provably secure and extremely effective, according to a
thorough investigation of security and performance. Our
initial test, carried out on an Amazon EC2 instance, further
confirms the design's quick performance. In this work, we
suggest Oruta, the first public auditing tool for shared data
in the cloud that protects privacy. With Oruta, the TPA can
easily verify the consistency of shared data without being
able to see who signed each block, protecting user identify
privacy. How to effectively audit the integrity of shared data
with dynamic groups while yet protecting the identity of the
signer on each block from the third-party auditor is an
intriguing challenge that will be addressed in our future
work.
E. Secure cloud storage public auditing with privacy
preserving
By using cloud storage, users may store their data
remotely and take use of high-quality on-demand apps and
services from a shared pool of reconfigurable computing
resources without having to worry about maintaining and
storing their data locally. However, since users no longer
physically hold the outsourced data, protecting its integrity
in the cloud is a challenging issue, particularly for users
with limited computer power. Additionally, users should not
need to worry about checking the integrity of the cloud
storage; they should just be able to utilize it as if it were
local. Therefore, it is crucial to enable public auditability for
cloud storage so that consumers may utilize a third-party
auditor (TPA) to verify the accuracy of outsourced data and
be at ease. The auditing procedure should not present any
new risks to the privacy of user data or increase the user's
online workload in order to deploy a TPA safely. In this
research, we provide a private public auditing mechanism
for a secure cloud storage system. We further expand our
finding such that the TPA may effectively and
simultaneously conduct audits for a number of consumers.
The suggested techniques are provably secure and extremely
effective, according to a thorough investigation of security
and performance. Our initial test, carried out on an Amazon
EC2 instance, further confirms the design's quick
performance.
In this research, we provide a public auditing
mechanism for cloud computing data storage security that
protects privacy. In order to ensure that the TPA won't
discover any information about the data content stored on
the cloud server during the effective auditing process, we
use the homomorphic linear authenticator and random
masking. This not only relieves the cloud user's burden of
performing the time- consuming and potentially expensive
auditing task, but also allays the users' concerns about the
leakage of their outsourced data. We further expand our
privacy-preserving public auditing protocol into a multiuser
context, where the TPA may do numerous auditing jobs in a
batch manner for greater speed. TPA may concurrently
manage several audit sessions from various users for their
outsourced data files. Our methods are very effective and
provably secure, according to extensive examination.
F. The applications of polynomials and constant- size
commitments to polynomials
Gregory M. Zaverucha, G. Aniket Kate, and others have
suggested, Polynomial commitment systems are introduced,
properly defined, and given two effective constructions. A
committer can commit to a polynomial using a polynomial
commitment scheme and a brief string that a verifier can use
to validate the stated evaluations of the committed
polynomial. The magnitude of the commitments made by
the homomorphic commitment techniques described in the
literature can be utilised to accomplish this purpose, but they
are linear in the degree of the committed polynomial. On the
other hand, our schemes' polynomial obligations are always
of the same magnitude (single elements). Initiating a
commitment has a continual overhead as well; even opening
several assessments merely need a consistent level of
communication. Our techniques can thus be effective
instruments for lowering the communication expense in
cryptographic systems. Regarding that, we use our
polynomial commitment approaches to tackle four
cryptographic issues: verifiable secret sharing, zero-
knowledge sets, credentials, and content extraction
signatures. Several cryptographic protocols are
fundamentally composed of commitment schemes. Using a
commitment system, a committer can attach herself to a
message (the binding) by publishing a value known as the
commitment (hiding). She may open the commitment later
and show the committed message to the verifier so they
could see if it is in line with the commitment. We go
through three popular approaches a committer might use to
commit to a message. Give two random number generators
of the group G of prime order p, g and h. Simply by writing
Cg(m) = gm, the committer can commit to a message m R
Zp. Under the premise that the discrete logarithm (DL) issue
is challenging in G, this technique is computationally
concealing and unconditionally binding. The second
strategy, often referred to as a Pedersen commitment [31],
has the formula Cg,h(m, r) = gmhr, where r R Zp. Pedersen
obligations are computationally enforceable and
unconditionally hidden. This paper also has an expanded
version [24]. Under the DL assumption, this study was
finished at the University of Waterloo. Third, for each one-
way function H, the committer may publish H(m) or H(m||
r). A collision-resistant hash function is often employed in
practice. Commitment plans are covered in great length in a
survey by Damgard [16].
IV. PROPOSED METHODOLOGY
A. Suggestive methodology
This computation is called Character Based
Online/Offline Digital Signature (IBOOS). We employ a
successful and beneficial tactic called grouping to construct
the display of WSNs. Concerns concerning secure
information transmission for cluster-based wireless sensor
networks are raised in the evaluation (CWSN). We have
introduced two new Secure and Efficient Data Transmission
(SET) protocols to achieve energy skill. By incorporating
the more advanced CP-ABE, the Identity-Based
Online/Offline Digital Signature (IBOOS) scheme, which is
dependent on the Identity- Based Digital Signature (IBS)
plan, improves the present lightweight CP-ABE plot. This
scheme defies damnation man calculation. The data is
encoded using the developed recommended approach and
sent to the VC as code text to acknowledge secure access
clients. The interest in trusted authority is first reduced,
which might lower the correspondence burden on both
trusted power and each VC. There is a focal regulator that
holds information about the content server, RSU (ROAD
SIDE UNIT), and vehicle. With the rsu, an unlimited
number of control servers may be created, and the visible
substance server id will be shown in the regarded
substructure. The rush can be connected to the substance
server as needed by the client, and the substructure will
show the intricacies of the vehicle hub. Given that the
nearest rsu is reachable, information replication in the car
should be doable.
B. Server of Central Control
The available substance server id, the reaching the
nearest vehicle using rsu, and all other rsu subtleties may be
tracked in the central regulator module. As the rsu passes
beneath the substance server, the area id and the rsu id can
be observed and created in the server. This module holds as
the focal point. Replication of information is carried out in a
server component as well as in the car. Programming-
defined organizations may be set up automatically, allowing
network administrators to create their own SDN projects to
design, manage, secure, and improve network assets using
automated scripts. As we stated, an open and VANET
strategy is needed for this. Open application programming
interfaces (APIs) provide the benefit of preventing server
lock-in. Comparatively speaking to PCs, it doesn't matter
what equipment is used throughout this discussion.
C. Bilingual paring module
It has been noted that the most expensive operation in
blending-based cryptographic standards is the computation
of bilinear pairings. For bilinear pairings in the two
untrusted programmer paradigm, we first provide an
efficient and safe re- appropriating calculation in this study.
Our suggested calculation differs from the state- of-the-art
calculation in that the (asset- obligated) outsourcer is not
required to do any expensive operations, such as point
augmentations or exponentiations. Additionally, we
implement a subroutine using this computation to
accomplish reevaluating secure character-based encryptions
and markings.
D. Module for data replication
If the RSU in the vehicle adhoc network is more precise
and each RSU has its own adhoc module where the copy
records are identified and the individual copy records are
broken down, information replication is possible in this
module. The information and the replication module will be
distinguished by the records that are coordinated with the
other rsu. The unique vehicle adhoc network is dealt with by
each vehicle adhoc network in the rsu unit. The Database
Replication module may be used to import data from
existing data sets. It is also possible to create complex
mappings over many tables joins. You have the option of
designing yourself or using Java.
V. EXPERIMENTAL SETUP
We calculate the square's runtime for each circle and
multiply it by the number of times the programmer will
rehash the circle. All rings that grow according to the
amount of the information produce some direct memory
complexity O(n). Time intricacy considers the number of
times an assertion is carried out; even if you circle through
50% of the display, it is still O(n). Since that depends on
several factors, such as the information, this will return in a
defined, constrained amount of time, the complexity of a
computation does not accurately reflect the actual time
required to run a particular code.
Fig 1. Time.
TABLE I. ALGORITHM AND TIME.
 Algorithm Time(ms) C. Communication Complexity
IBOOS 1250
The suggested conspires correspondence complexity
DEFFIE HELLMAN 2200
is contrasted with that of plots. In the suggested plot, n
gatherings only need to exchange messages twice, or 2
Iboos computation took the least amount of time to run rounds, as opposed to n times, or 1 round. Additionally,
in the aforementioned complexity, taking an average of
1250 MS, while Diffie Hellman took the most time. the correspondence complexity of plans had to have
been incorporated in order to communicate information
A. Cryptography Cost to other vehicles present in the group. The analysis of
Although encryption and decoding can be done the capacity overhead and correspondence complexity
simultaneously, encryption should be done sequentially. In
this way, bios encryption and decoding perform often faster shows that Ibos outcomes are more productive, as
than existing techniques on a VANET execution, resulting shown in fig 4.
CRYPTOGRAPHY
in less time spent with safety, as shown in fig 2.
COST(BYTES)
200 Communication
150
100
complexity (bits)
Cryptography
50 cost(bytes) 60
0 50
IBOOS DEFFIE 40 Communication
HELLMAN 30 complexity y
(bits)
20
10
0 IBOOS DEFFIE
Fig 2. Cryptography Cost. HELLMAN
Fig 4. Communication complexity.
TABLE II. ALGORITHM AND CRYPTOGRAPHY COST.
Algorithm Cryptography cost(bytes) TABLE IV. ALGORITHM AND COMMUNICATION COMPLEXITY.
IBOOS 145 Algorithm Communication complexity
DEFFIE HELLMAN 120 (bits)
B. Storage Overhead IBOOS 6
DEFFIE HELLMAN 49
The planned plot's capacity overhead is compared in the
section to significant VANETs proposals. Since the vehicle
In Fig.3 and Fig.3, each color represents traffic density
and RSU capacities are sufficient, this correlation just draws at that timestamp. It concludes that maximum traffic density
attention to the cloud server's capacity overhead. so that for Circle-Fix-02 occurs at 18:14:58 pm, whereas Nav
the capacity may be used effectively by the vehicle and Sandhkuva Circle-PTZ-01 occurs at 18:16:18 pm.
effectively, as shown in fig 3. The maximum traffic density difference between both
locations is 6.8% which happens at timestamp 18:14:58. The
riders can be redirected from Nav Sandhkuva Circle-Fix-02
(high traffic density region) to Nav Sandhkuva Circle-PTZ-
Storage 01(low traffic density region).
overhead VI. CONCLUSION
800
0
(bits) The In order to share information among multiple
application expert co-ops and distributed storage
frameworks for automobiles in a VANET, we suggested a
600
Storage convincing information access control CP- ABE plan in this
0 assignment. Our strategy offers disavowals of both clients
overhead
400 () and traits based on many criteria. Additionally, we made use
0 IBOOS DEFFIE of cloud process hubs to distribute the computational load
HELLMA associated with encryption and decoding in order to support
200 asset-reliant devices; this approach makes CP-ABE careful
Fig 3. 0Storage Overhead. N
the IBOOS more suitable for VANETs. We demonstrate the
0 effectiveness of our solution in maintaining client security
TABLE III. ALGORITHM AND STORAGE OVERHEAD.
as well as being secure against various attacks by the
Algorithm Storage overhead(bits) findings of the extensive security research and exploratory
IBOOS 500
DEFFIE HELLMAN 6789

evaluation. Our strategy also guarantees adaptability and
efficiency. In further work, we will evaluate our strategy in
a real environment and gauge the synchronization latencies
between components.
REFERENCES
[1]. T. Rawal and V. Devadas, “Intelligent Transportation System in
India- A Review,” Journal of Development Management and
Communication, Volume II, No.3, pp: 299-308, July-September,
2015.
[2]. P Indhiradevi, P Saravanakumar, R Varsha, S Shahithya & S Naveen
Prabhu, "A Review on Smart Traffic Management System", IOP
Conference Series Materials Science and Engineering
1145(1):012090, 2021
[3]. Handalage, Upulie & Kuganandamurthy, Lakshini.,“ Real-Time
Object Detection using YOLO: A review”.
10.13140/RG.2.2.24367.66723, 2021.
[4]. Saravanan, T., & Sasikumar, P. (2022). Automated Systems using AI
in the Internet of Robotic Things: A New Paradigm for Robotics.
Machine Learning Methods for Engineering Application
Development, 127.
[5]. K. Zaatouri and T. Ezzedine, "A Self-Adaptive Traffic Light Control
System Based on YOLO," International Conference on Internet of
Things, Embedded Systems and Communications (IINTEC), pp. 16-
19, 2018.
[6]. Ministry of Road Transport & Highways, Government of India, Road
Accidents in India - 2018, pp. 8, 2019.
[7]. Saravanan, T., & Saravanakumar, S. (2022, August). Enhancing
reliable communication to improve network lifetime in Wireless
Sensor Networks by Displacement and Direction Conscious Adhoc
On-Demand Multipath Distance Vector routing protocol. In
Proceedings of the 2022 Fourteenth International Conference on
Contemporary Computing (pp. 597-606).
[8]. W.-H. Lee and C.-Y. Chiu, “Design and Implementation of a Smart
Traffic Signal Control System for Smart City Applications,” Sensors,
vol. 20, no. 2, p. 508, Jan. 2020.
[9]. M. Gohar, M. Muzammal and A. U. Rahman, “SMART TSS:
Defining transportation system behavior using big data analytics in
smart cities,” Sustainable Cities and Society, vol.41, 2018.
[10]. Al-Smadi, M., Abdulrahim, K., Salam, R.A., “Traffic surveillance: A
review of vision-based vehicle detection, recognition, and tracking”,
International Journal of Applied Engineering Research, Vol.11(1),
713–726, 2016.
[11]. Saravanan, T., & Rajulu, G. G. (2022, December). A Reliable and
efficient data transfer on wireless sensor networks by using
Optimization algorithms. In 2022 4th International Conference on
Advances in Computing, Communication Control and Networking
(ICAC3N) (pp. 1774-1778). IEEE.
[12]. Radhakrishnan, M., “Video object extraction by using background
subtraction techniques for sports applications”, Digital Image
Processing, Vol.5(9), 91–97, 2016.
[13]. Qiu-Lin, L.I., & Jia-Feng, H.E., “Vehicles detection based on the
three-frame-difference method and cross-entropy threshold method”
Computer Engineering, Vol. 37(4), 172–174, 2018.
[14]. Saravanan, T., Babu, M. D., Vinotha, D., & Saravanakumar, S. (2022,
April). Arduino Based Road Congestion Management System in a
City. In 2022 2nd International Conference on Advance Computing
and Innovative Technologies in Engineering (ICACITE) (pp. 1834-
1839). IEEE.
[15]. Liu, Y., Yao, L., Shi, Q., Ding, J., “Optical flow-based urban road
vehicle tracking”, 19th IEEE International Conference on
Computational Intelligence and Security, 2013.
[16]. Saravanan, T., & Saravanakumar, S. (2022, February). Modeling an
Energy Efficient Clustering Protocol with Spider Cat Swarm
Optimization for WSN. In 2022 IEEE VLSI Device Circuit and
System (VLSI DCS) (pp. 188-193). IEEE.
[17]. M Lokanath, K Sai Kumar & E Sanath Keerthi, "Accurate object
classification and detection by faster-RCNN", IOP Conference Series
Materials Science and Engineering, Vol. 263(5):052028, November
2017.
[18]. Saravanan, T., Saravanakumar, S., Rathinam, G. O. P. A. L.,
Narayanan, M., Poongothai, T., Patra, PSK., & Sengan, Sudhakar.
(2022). Malicious attack alleviation using improved time-based
dimensional traffic pattern generation in UWSN. Journal of
Theoretical and Applied Information Technology, 100(3).
[19]. Zhao, Z.Q., Zheng, P., Xu, S.T., Wu, X., “Object detection with deep
learning: A review”, IEEE Transactions on Neural Networks and
Learning Systems, Vol.30(11), pp:3212-3232, 2018.
[20]. Saravanan, T., & Saravanakumar, S. (2021, December). Privacy
Preserving using Enhanced Shadow Honeypot technique for Data
Retrieval in Cloud Computing. In 2021 3rd International Conference
on Advances in Computing, Communication Control and Networking
(ICAC3N) (pp. 1151-1154). IEEE.
[21]. Liu, W., Anguelov, D., Erhan, D., Szegedy, C., Reed, S., Fu, C.Y.,
Berg, A.C., “SSD: Single shot multibox detector”, European
conference on computer vision, ECCV, pp. 21–37, 2016.
[22]. Saravanan, T., & Sasikumar, P. (2021). Assessment and analysis of
action degeneracy due to blackhole attacks in wireless sensor
networks. In Proceedings of 6th International Conference on Recent
Trends in Computing: ICRTC 2020 (pp. 345-355). Springer
Singapore.
[23]. Hu, X., Xu, X., Xiao, Y., Hao, C., He, S., Jing, Q., Heng, P.A.,
“Sinet: A scale-insensitive convolutional neural network for fast
vehicle detection”, IEEE Transactions on Intelligent Transportation
Systems, Vol (99), pp:1–10, 2018.
[24]. Saravanan, T., & Nithya, N. S. (2019). Modeling displacement and
direction aware ad hoc on-demand distance vector routing standard
for mobile ad hoc networks. Mobile Networks and Applications, 24,
1804-1813.
[25]. R. Girshick, “Fast R-CNN,” IEEE International Conference on
Computer Vision (ICCV), pp. 1440-1448, 2015.
[26]. Saravanan, T., & Nithya, N. S. (2019). Design of Dynamic Source
Routing with the Aid of Fuzzy Logic for Cross Layered Mobile Ad
Hoc Networks. International Journal of Engineering and Advanced
Technology, 8(6), 4241-4247.
[27]. Bochkovskiy, Alexey & Wang, Chien-Yao & Liao, Hong-yuan.
(2020). YOLOv4: Optimal Speed and Accuracy of Object Detection.
[28]. A. Karnawat, "A Survey on Easy OCR Techniques used to build
System for Visually Impaired People", Vol: 6, pp:1425-1429, January
2018.
[29]. T. Carneiro, R.V.M.D. Nobrega, T. Nepomuceno, G.-B. Bian,
V.H.C.D. Albuquerque and P.P.R. Filho, “Performance Analysis of
Google Colaboratory as a Tool for Accelerating Deep Learning
Applications,” IEEE Access, pp. 1-1, 2018.
[30]. Mohamed, Elhassan & Sirlantzis, Konstantinos & Howells, Gareth.
"Application of Transfer Learning for Object Detection on Manually
Collected Data”, Advances in Intelligent Systems and Computing vol:
1037, 2019.