Advanced Resource Management Technique in VFC using

BPC Protocol

Sathish K, Ananth Kumar T(Ph.d)

Computer Science And Engineering,IFET College Of Engineering, Villupuram, Tamil Nadu,India

Computer Science And Engineering,IFET College Of Engineering, Villupuram, Tamil Nadu,India

E-mail address: sathish24499@gmail.com, tananthkumar@ifet.ac.in

Abstract: Vehicular Fog Computing(VFC) plays a vital role in the Mobile Ad Hoc Network. In VANET,addition to fog computing,
for the sending of periodical message we utilize a Beacon Power Control (BPC) protocol. This algorithm increases the effectiveness
in the coverage of the broadcast of safety and security-related information and also satisfying the constraints on both the link state
and delay. VANET is one of the real-life application in ad hoc networks which enables the communication between the nearby
stationary equipment, such as roadside equipment and vehicles and also between the vehicles .The resource utilization and resource
contribution are done by the BPC protocol .Finally the resource will be allocate to the VFC by the enhanced protocol

Keywords: VFC,Periodic Message,Beacon Power Control,Broadcast,Link State

1. INTRODUCTION mainly focus on the inter vehicular communication. Vehicles

communicate among them and and also with roadside units
Vehicle-to-infrastructure and also vehicle-to-vehicle
(RSU) with the help of VANET and fog computing. Distributed
communication is facilitated by Vehicular ad hoc network
infrastructure-based commercial services, such as content
(VANET) by using the Dedicated Short-Range
distribution, internet access, real-time traffic management and
Communications (DSRC). The main aim of VANET is to offer
video streaming are supported by a special type of VANET
safety related message communication between the vehicles.
called Service Oriented Vehicular Network. Various security
Vehicular ad hoc network (VANET) can be defined as wireless
threats are emerged against Service Oriented VANETS. These
communication facility embedded cluster of vehicles, by the way
types of privacy and security attacks must be avoided in order
a network is created even they are moving on the road. Here,
to maintain successful delivery system and data acquisition. In
there is no need for central administration, since vehicles itself
this system, fog computing and RSU with internet provides
help us for delivering such safety-related messages in multi hop
different types of data to the VANET users. Social Internet of
paths. The drivers can predict the accidents, abnormal normal
Vehicle (SIoV) has the ability to provide the best driving
behaviour of any other vehicles, and hazardous events by the
experience with high road safety, so, now it is the hot research
avoid accidents with the help of distribution of such messages
topic in industrial as well as academic environment. Nowadays,
between moving vehicles. VANET is planned for traveller
security related and highly user oriented vehicular applications
safety by the exchange of real – time traffic – hazard message
are mostly needed due to the increasing types, on–board
between vehicles through reliable wireless communication.
equipment intelligence, quantity and increasing demand for
VANET offers high-speed Internet connectivity for moving
automobile’s service quality. This method is aims in planning
vehicle to facilitate infotainment service. VANET faces a lot of
of service access system in SIoVs, that concentrates on quality
challenges because of its dynamic wireless communication and
optimization method and reliable assurance strategy. Initially,
unique topology. Movement of vehicles depends upon the
instead of the unstable vehicular devices, an effective access
traffic signals, regulations, street maps and also the movement
service evaluation scheme should be examined, that inspects the
of surrounding vehicles. It results in non – uniform vehicle
potential vehicle’s potential relevance by building social
distribution and in turn random vehicle connectivity. In addition
relationships. Trajectory based interaction time prediction
to that, it may cause communication vulnerable to the collision
algorithm is suggested to deal with increased rate of
and also acts as a interference from hidden and visible nodes
disconnectivity and unstable network topology in SIoVs.
due to unavoidable utilization of common control channel.
Finally, a cooperative quality-aware system model is suggested
VANETS distinctive characteristics results in challenging as
for service access in SIoV VANET is designed for the
well as serious research concerns in the field of routing and
improvement in traffic safety and efficiency. VANET should be
information propagation
reliable to achieve its goal. To assure message reliable in
2. RELATED WORK vehicle-to-vehicle (V2V) communications, we present a
privacy-preserving system. Vehicle must not try to endorse the
Academic and industrial research in the field of similar message more than once in order to maintain its privacy.
transportation system, to improve its efficiency and safety, If the message is found be false even after validity, it may
create a chance of posterior tracing the message generator and
its endorsers. This system contains various features such as
posteriori and a priori countermeasures. Unlike the
predetermined threshold in existing schemes
priori endorsement's threshold can adaptive change depends
upon the traffic context and message urgency. Batch message-
processing techniques are used to accelerate the verification of
V2V messages.[3]. A contract theory which encourages
vehicles to get rewards through participating their computation
resources, These rewards are exchanged for extra resources
from IoV to enhance the application’s QoS, like energy
consumption, delay, task processing, etc,. Here, DRL method is
also use to minimize the implementation of system complexity,
that depends on this proposed contract theory, which makes
system performance more better by offload vehicles tasks and
properly allocates resources of the system.
Figure 1. VFC
In this method, we proposed contract theory related mechanism.
To enhance the vehicle application, QoS ,the system’s resources
such as frequency resources, computation resources can be
exchanged for the previously acquired rewards. RSU gets
vehicle’s idle computational resources when resources and
rewards are offered to the vehicles, in order to increase the RSU
computational power as well as overall system performance
during vehicles offloading tasks. DRL method which is based
on incentive mechanism is To minimize VFC implementation
complexity, incentive mechanism based DRL method is
introduced, which helps VFC to generate offloading decisions
more faster using DNN.
3. INTERNET OF VEHICLES
Here, with the help of RSU all the vehicles undergoes vehicle
to infrastructure (V2I) communication ,like with the assistance
of RSU, two vehicles can undergoes vehicle-to vehicle (V2V)
communication with other vehicles. Every vehicle handles its
task bye local processing else the task should be offloaded to
any place for processing. Let be assume that allocated channels
should be orthogonal and does not interfere to each other to
increase the spectral efficiency. Resource scheduling should be
done by RSU, so RSU has heavy workload in computing the
tasks, in order to reduce this, vehicle contribution
computational resources are used. It results in the improvement
of utility function by minimizing the task processing latency by
less power consumption. So, the tasks are completed quickly
with the minimized usage of system frequency sources.
In some cases, vehicles may use some additional resources,
which are not suitable for this mechanism. To overcome that
DRL is used to reduce complexity in allocating the resources.
Task offloading conflict can occur due to concurrent offloading
decision, in order to avoid that we must use queuing model, by
the way sort the accumulative rewards of vehicles. It gives task
offloading priority to the vehicle having higher cumulative
reward, to avoid concurrent task offloading conflict. Resource
management scheme is planned according to the contract
theory, which contains two contract types, i.e., resource
contribution contract and resource utilization contract. The
number of resources , which vehicle contributes are used to get
reward value, that encourages to provide computation resources
to RSU. The accumulated reward of vehicle is exchanged for
additional wireless transmission bandwidth in order to facilitate
vehicle application’s QoS.The wireless sensor nodes are present
in the road.The vehicles in the road are considered a the fog
nodes.
Figure 2. Internet Of Vehicles
They are communicate to each other by the internet .RSU is
road side unit which can store the information about the
vehicles.The resources are properly managed through the
internet To sum up, reducing the usage of system resources
(spectrum resources) is the key factor to improve the overall
system performance like task completion rate, energy
consumption, delay, etc.
4. PROPOSED SYSTEM
The Beacon Power Control (BPC) protocol is initially used to
first sensed and then examined the channel congestion's
percentage, after that the result we get can be used to
adjustment of transmission power for the safety message to
attain its optimal power. Each and every vehicle transmits a
status message which is called as beacon every 10 ms, it
contains direction, beacon ID, time stamp, position, time
stamp,beacon interval, speed, and the beacon’s importance is to
provide information about the current status to all the vehicles,
thereby reduce the traffic issues, which can be achieved by the
GPS embedded in every vehicles,it provides the current location
of the vehicle.The beacon in turn processed to generate
information about the current network and status the neighbor
vehicles and also it has to hold the information until the receiver
determine the suitable power for transmission.
Figure 3. Flow Chart
The added information about power is piggybacked to the
recent current beacon using in the VANET. Then the received
information from beacon is used to calculate the current
network congestion, and if something prevents it means the
network will not be congested and it does not reach its
destination. Distance between vehicles also play an important
role in this transmission, if the distance between two vehicles
are increasing, then there is less percentage to receive a beacon,
the distances can be calculated with the help of GPS in the
vehicle. The beacon of each vehicle consists the information
about vehicle such as position (GPS), direction, max power for
transmission received and Speed.The difference between
minimum and maximum power received by the vehicle must be
calculate. Minimum power received can be defined as the
minimum amount of power required to send successfully.
5. SENDING PERIODIC MESSAGE USING BPC PROTOCOL
In some case, not only minimum power is enough, so that the
beacon fails to reach the receiver. In order to reach the receiver,
maximum power is needed, but in turn it results in channel
congestion. So, to reduce channel congestion, we have to
decrease the maximum power and for the beacon to reach the
receiver, the minimum power should be increased but it must
not exceed the maximum power. Both this increase and
decrease depends upon the congestion obtained from the
vehicle which reaches the optimal power of the vehicle that it
should transmit its beacons. The channel congestion must be
analyzed per second, as every vehicle should receive 10
beacons from its neighbor vehicle; transmission power is then
adjusted by using the congestion status.Both this increase and
decrease depends upon the congestion obtained from the
vehicle which reaches the optimal power of the vehicle that it
should transmit its beacons. The channel congestion must be
analyzed per second, as every vehicle should receive 10
beacons from its neighbor vehicle; transmission power is then
adjusted by using the congestion status.
Figure 4. Sending periodic message to RSU
6. ADVANTAGES
• Network overhead will be reduced.
• Improved system performance
 • Minimized channel congestion
• Throughput is high
• Safety related information send for every 10ms

7. IMPLEMENTATION

THROUGHPUT

Figure 6. Routing overhead

BROADCASTING SAFETY MESSAGE TO ALL NODES

Figure 5. Throughput

Throughput can be defined as the amount of packets

successfully received in a unit time and it can be represented in
bps. It can be calculated with awk script that process the trace
file then produces the result.

It can be evident that even though the level of attack is

increased, delivery ratio of the proposed approach can be
maintained (does not reduce) therefore, it does not affects the
data transmission of the network. Similarly even the level of
attack is increased, the throughput of the proposed approach can
be also maintained.
ROUTING OVERHEAD
Amount of routing packets needed for network communication
is known as Routing Overhead.It can be represented in bps. It
can be calculated with awk script that process the trace file then
produces the result.
Figure 7. Broadcasting message to all nodes
The maximum power of the channel is increased, when
congestion occurs, so it should be reduced to avoid overhead in
this channel, which could be done in this system. In some
cases, lower power is not enough for the vehicle to transmit
beacon to its neighbors, so the minimum power is important to
ensure the successful transmission.The transmission power
adjustment in system helps to reach the destination with an
optimal power.

s
PACKET DELIVERY RATIO

It can be calculated with awk script that processes trace

file then produces the result

. among vehicles, VANET with fog computing is the best
Figure 8. PDR
The Packet Delivery Ratio (PDR) is calculated with received
and generated packets which are maintained in the trace file.
The ratio between packets received by the destination and the
packets generated by the source is known as PDR
SENDING PERIODIC MESSAGE
Figure 9.Sending periodic message to RSU
The beacon is a safety related message carrier which carries direction,
beacon ID, time stamp, position, time stamp,beacon interval,
speed, and the beacon’s importance is to provide information
about the current status to all the vehicles.
5. CONCLUSION
To improve road safety and communication services
technology. The communication between vehicles and road side
equipment continuously update the current status of their
respective circles,but in case it may lead to network overhead
and also channel congestion,so we have to concentrate on
eliminating such issues. This system will help to monitor the
physical world with wireless sensor which can sense, process
and communicate and the beacons send to the other node with
every 10ms ,so that the vehicle know much before the uncertain
events occurs.out proposed BPC protocol will improve the
efficiency of the VANET.The vehicles are act as a fog node and
the RSU store the information from the vehicles.The resource
utilization and resource contribution for the vehicular fog
computing is done with advanced protocol.
6. FUTURE SCOPE
The vehicular fog computing cars network that can
continuously communicate each other. In this BPC protocol,
each and every car knows it’s location, where it’s going and
generally any other measurable quantities which are related to
it. The most important thing in traveling is road safety. When
each car can able to identify the location and information about
each other cars in their surroundings,it is easy to avoid crashes
by warning the drivers about any abnormal behaviour of
vehicles. The communication not only ends with drivers,it can
also reach the Road Side equipment such as traffic lights,which
can facilities smooth traveling by efficiently handling the real
time traffics. This entire system satisfies all the current needs
of users.In future, we can expand this facility to all
automobiles, not only cars. In future ,the VFC can be
implemented by using various technology and improving the
channel performance for all type of vehicles.
REFERENCE
[1] S. S. Al-Riyami and K. G. Paterson, “Certificateless public
key cryptography,”
in Asiacrypt, vol. 2894. Springer, 2003, pp. 452–473.
[2] L. Atzori, A. Iera, and G. Morabito, “The internet of things:
A survey,” Computer networks, vol. 54, no. 15, pp. 2787–2805,
2010.
[3] D. Boneh and X. Boyen, “Short signatures without random
oracles,” in International Conference on the Theory and
Applications of Cryptographic Techniques. Springer, 2004, pp.
56–73.
[4] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano,
“Public key encryption with keyword search,” in International
conference on the theory and applications of cryptographic
techniques. Springer, 2004, pp. 506–522.
[5] A. A. Cardenas, P. K. Manadhata, and S. P. Rajan, “Big data
analytics for security,” IEEE Security & Privacy, vol. 11, no. 6,
pp. 74–76, 2013.
[6] L. Chen and Z. Cheng, “Security proof of sakai-kasaharaŠs
identity-based encryption scheme,” in IMA International
Conference on Cryptography and Coding. Springer, 2005, pp.
442–459.
[7] J. Daemen and V. Rijmen, The design of Rijndael: AES-the
advanced encryption standard. Springer Science & Business
Media, 2013.
[8] C. Esposito, A. Castiglione, B. Martini, and K.-K. R. Choo, system for social internet of vehicles,” IEEE Internet of Things
“Cloud manufacturing: security, privacy, and forensic Journal, vol. 5, no. 4, pp. 2506–2517, 2018.
concerns,” IEEE Cloud Computing, vol. 3, no. 4, pp. 16–22, [23] H. Qu, Z. Yan, X.-J. Lin, Q. Zhang, and L. Sun,
2016. “Certificateless public key
[9] J. A. Guerrero-Ibanez, S. Zeadally, and J. Contreras- encryption with equality test,” Information Sciences, vol. 462,
Castillo, “Integration challenges of intelligent transportation pp. 76–92,2018.
systems with connected vehicle, cloud computing, and internet [24] Q. Tang, “Towards public key encryption scheme
of things technologies,” IEEE Wireless Communications, vol. supporting equality test
22, no. 6, pp. 122–128, 2015. with fine-grained authorization,” in Australasian Conference on
[10] L. Guo, M. Dong, K. Ota, Q. Li, T. Ye, J. Wu, and J. Li, Information Security and Privacy. Springer, 2011, pp. 389–406.
“A secure mechanism for big data collection in large scale [25] “Public key encryption schemes supporting equality test
internet of vehicle,” IEEE Internet of Things Journal, vol. 4, no. with authorisation of different granularity,” International
2, pp. 601–610, 2017. [11] K. Huang, R. Tso, Y.-C. Chen, S. M. journal of applied cryptography, vol. 2, no. 4, pp. 304–321,
M. Rahman, A. Almogren, and 2012
A. Alamri, “Pke-aet: public key encryption with authorized
equality test,” The Computer Journal, vol. 58, no. 10, pp. 2686–
2697, 2015.
[12] O. Kaiwartya, A. H. Abdullah, Y. Cao, A. Altameem, M.
Prasad, C.-T. Lin, and X. Liu, “Internet of vehicles: Motivation,
layered architecture, network model, challenges, and future
aspects,” IEEE Access, vol. 4, pp. 5356–5373, 2016.
[13] N. Kumar, J. J. Rodrigues, and N. Chilamkurti, “Bayesian
coalition game as-a-service for content distribution in internet
of vehicles,” IEEE Internet of Things Journal, vol. 1, no. 6, pp.
544–555, 2014.
[14] H. Li, X. Lin, H. Yang, X. Liang, R. Lu, and X. Shen,
“Eppdr: an efficient privacy-preserving demand response
scheme with adaptive key evolution in smart grid,” IEEE
Transactions on Parallel and Distributed Systems, vol. 25, no. 8,
pp. 2053–2064, 2014.
[15] H. Li, Y. Yang, T. H. Luan, X. Liang, L. Zhou, and X. S.
Shen, “Enabling fine-grained multi-keyword search supporting
classified sub-dictionaries over encrypted cloud data,” IEEE
Transactions on Dependable and Secure Computing, vol. 13,
no. 3, pp. 312–325, 2016.
[16] C. Liu, X. Zhang, C. Liu, Y. Yang, R. Ranjan, D.
Georgakopoulos, and J. Chen, “An iterative hierarchical key
exchange scheme for secure scheduling of big data applications
in cloud computing,” in 2013 12th IEEE International
Conference on Trust, Security and Privacy in Computing and
Communications. IEEE, 2013, pp. 9–16.
[17] B. Lynn, “The stanford pairing based crypto library,”
Privacy Preservation
Scheme for Multicast Communications in Smart Buildings of
the Smart Grid, vol. 324, 2013.
[18] S. Ma, “Identity-based encryption with outsourced equality
test in cloud computing,” Information Sciences, vol. 328, pp.
389–402, 2016.
[19] S. Ma, Q. Huang, M. Zhang, and B. Yang, “Efficient
public key encryption
with equality test supporting flexible authorization,” IEEE
Transactions on Information Forensics and Security, vol. 10,
no. 3, pp. 458–470, 2015.
[20] S. Ma, M. Zhang, Q. Huang, and B. Yang, “Public key
encryption with delegated equality test in a multi-user setting,”
The Computer Journal, vol. 58, no. 4, pp. 986–1002, 2015.
[21] K. Mershad and H. Artail, “A framework for secure and
efficient data acquisition in vehicular ad hoc networks,” IEEE
Transactions on vehicular technology, vol. 62, no. 2, pp. 536–
551, 2013.
[22] Z. Ning, X. Hu, Z. Chen, M. Zhou, B. Hu, J. Cheng, and
M. S. Obaidat, “A cooperative quality-aware service access