Performance and reliability of content access in mobile networks is
conditioned by the number and location of content replicas deployed at the
network nodes. Location theory has been the traditional, centralized approach
to study content replication: computing the number and placement of replicas in
a static network can be cast as a facility location problem. The endeavor of
this work is to design a practical solution to the above joint optimization
problem that is suitable for mobile wireless environments.
Many significant functionalities of vehicular ad hoc networks (VANETs)
require that nodes have knowledge of the positions of other vehicles, and
notably of those within communication range. However, adversarial nodes could
provide false position information or disrupt the acquisition of such
information. Thus, in VANETs, the discovery of neighbor positions should be
performed in a secure manner.
Performance and reliability of content access in mobile networks is
conditioned by the number and location of content replicas deployed at the
network nodes. Facility location theory has been the traditional, centralized
approach to study content replication: computing the number and placement of
replicas in a network can be cast as an uncapacitated facility location
problem. The endeavour of this work is to design a distributed, lightweight
solution to the above joint optimization problem, while taking into account the
network dynamics.