A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
TrafficView: traffic data dissemination using car-to-car communication
ACM SIGMOBILE Mobile Computing and Communications Review
Scale-free aggregation in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Decentralized discovery of free parking places
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Efficient secure aggregation in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Probabilistic aggregation for data dissemination in VANETs
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Catch-up: a data aggregation scheme for vanets
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Data-aggregation techniques in sensor networks: a survey
IEEE Communications Surveys & Tutorials
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
Resilient secure aggregation for vehicular networks
IEEE Network: The Magazine of Global Internetworking
Caching dynamic information in vehicular ad hoc networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A change in perspective: information-centric modeling of inter-vehicle communication
VANET '11 Proceedings of the Eighth ACM international workshop on Vehicular inter-networking
Journal of Network and Computer Applications
Peer-to-peer data structures for cooperative traffic information systems
Pervasive and Mobile Computing
Using Fuzzy Logic for Data Aggregation in Vehicular Networks
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
SeDyA: secure dynamic aggregation in VANETs
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Review: Information management in vehicular ad hoc networks: A review
Journal of Network and Computer Applications
A Framework For Handling Local Broadcast Storm Using Probabilistic Data Aggregation In VANET
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The distribution of dynamic information from many sources to many destinations is a key challenge for VANET applications such as cooperative traffic information management or decentralized parking guidance systems. In order for these systems to remain scalable it has been proposed to aggregate the information within the network as it travels from the sources to the destinations. However, so far it has remained unclear by what amount the aggregation scheme needs to reduce the original data in order to be considered scalable. In this paper we prove formally that any suitable aggregation scheme must reduce the bandwidth at which information about an area at distance d is provided to the cars asymptotically faster than 1/d2. Furthermore, we constructively show that this bound is tight: for any arbitrary ε0, there exists a scalable aggregation scheme that reduces information asymptotically like 1/d(2+ε).