Opportunistic resource exchange in inter-vehicle ad-hoc networks
read more
Citations
Names to Rule Them All: Unifying Vehicular Networking via Named Secured Data
Local information storage protocol for urban vehicular networks
A correlation-aware partial materialization scheme for near real-time automotive queries
Agrégation et extraction des connaissances dans les réseaux inter-véhicules
A Survey on RCF Based Data Dissemination Techniques for VANETs
References
Epidemic routing for partially-connected ad hoc networks
A review of current routing protocols for ad hoc mobile wireless networks
Adaptive protocols for information dissemination in wireless sensor networks
Related Papers (5)
Frequently Asked Questions (19)
Q2. What have the authors stated for future works in "Opportunistic resource exchange in inter-vehicle ad-hoc networks" ?
However, another possibility which the authors plan to investigate in future research, involves query delivery to all the vehicles in a geographic area, and the collection of results.
Q3. How many parameters are used for each simulation run?
There are three parameters for each simulation run, namely the memory allocation M, the transmission range r, the constant speed v, and the traffic density d (i.e. the number of objects per square mile).
Q4. What is the significance of the analysis?
The analysis suggests that the opportunistic exchange algorithm automatically restricts the propagation of a resource to a limited spatial area and a limited temporal interval.
Q5. What is the relevance of R for O at t?
Since R is rejected or purged by O at t, the relevance of the least relevant resource in O s memory at t cannot be lower than)()( 00 ttvtt −⋅⋅−−⋅− βα .
Q6. What is the reason for the jump in the boundary radius?
If an object happens to travel a relatively long distance without interacting with any other object, then the boundary radius for a resource it carries will have a jump.
Q7. What is the effect of a higher transmission range on the speed of a vehicle?
An increased transmission range results in a vehicle receiving a greater number of resources in a given time interval, thus causing greater contention for thememory, and causing entries to be bumped out of the memory sooner.
Q8. What are the main components of the resource discovery architecture?
Typically these architectures consist of a dedicated directory agent that stores information about different services or data, a set of protocols that allows resource providers to find a directory agent and to register with it, and a naming convention for resources.
Q9. What is the effect of traffic density on a resource?
as the traffic density increases, a vehicle receives new resources more frequently, and therefore a resource is likely to be purged sooner.
Q10. Why does a vehicle refuse a resource?
Because the relevance of a resource for a moving vehicle is dynamic, a vehicle may refuse a resource at one time and then later find it of interest.
Q11. What is the purpose of this paper?
In this paper the authors devised a model for discovery of spatio-temporal resources in an infrastructure-less environment, in which the database is distributed among the moving objects.
Q12. What is the distribution of R at each time unit during a simulation run?
During a simulation run, the authors trace the distribution of each resource R at each time unit during R s lifetime (R s lifetime is the time period from the time when R is generated up to the time when it disappears from the system).
Q13. What is the relevance of the least relevant resource in the system?
If R is rejected or purged by an object O at time t (t≥t0), then at any time point t after t, the relevance of the least relevant resource in O s memory is higher than or equal to )'()( 0ttv −⋅⋅+− βα .Proof: Consider the relevance of R to O at time t. Since R is created at t0 and the transmission range is 0, the distance between the location of O at t and the home of R cannot exceed )( 0ttv −⋅ .
Q14. What is the effect of a larger transmission range on the coverage of a resource?
It can be seen from Figure 6 that, (i) with a bigger transmission range, the coverage of a resource expands to the maximum value sooner; (ii) as the size of transmission range increases, the length of lifetime decreases.
Q15. What is the relevance of the least relevant resource in O s memory at t?
According to Lemma 1, the relevance of the least relevant resource in O s memory at t is higher than or equal to)()()( 0 vK Mttv ⋅+⋅−≥−⋅⋅+− βαβα .
Q16. What is the effect of the traffic density on the lifetime of a resource?
It can be seen from Figure 5 that, (i) with higher memory allocation, the coverage of a resource expands to a higher maximum value and it expands to that value later; (ii) as the memory allocation increases, the length of the lifetime increases.
Q17. What is the effect of the traffic density on the life of a resource?
It can be seen from Figure 7 that, as the traffic speed increases, the coverage of a resource expands to the maximum value sooner and the length of lifetime is shorter.
Q18. What is the relevance of R to O at time t?
If R is received by an object O at time t (t≥t0), then at any time point t after t, the relevance of R for O at t is not lower than )'()( 0ttv −⋅⋅+− βα .Proof: Consider the relevance of R to O at time t. Since R is created at t0 and the transmission range is 0, the distance between the location of O at t and the home of R cannot exceed )( 0ttv −⋅ .
Q19. How do the authors prove the relevance of R?
Now the authors prove that at any point in time, there is no copy of R at any location that is more than K Mv ⋅ distance units away from the home of R. Consider the relevance of R for an object O that is more thanK Mv ⋅ away from the home of R.