Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Efficient secure aggregation in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Probabilistic validation of aggregated data in vehicular ad-hoc networks
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Secure Data Aggregation in Wireless Sensor Networks: A Survey
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Probabilistic aggregation for data dissemination in VANETs
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
A fuzzy logic based approach for structure-free aggregation in vehicular ad-hoc networks
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
A fundamental scalability criterion for data aggregation in VANETs
Proceedings of the 15th annual international conference on Mobile computing and networking
Resilient secure aggregation for vehicular networks
IEEE Network: The Magazine of Global Internetworking
Efficient and secure threshold-based event validation for VANETs
Proceedings of the fourth ACM conference on Wireless network security
Identity-Based aggregate signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
In-network aggregation techniques for wireless sensor networks: a survey
IEEE Wireless Communications
| Hi-index | 0.00 |
In vehicular ad-hoc networks (VANETs), a use case for mobile ad-hoc networks (MANETs), the ultimate goal is to let vehicles communicate using wireless message exchange to provide safety, traffic efficiency, and entertainment applications. Especially traffic efficiency applications benefit from wide-area message dissemination, and aggregation of information is an important tool to reduce bandwidth requirements and enable dissemination in large areas. The core idea is to exchange high quality summaries of the current status rather than forwarding all individual messages. Securing aggregation schemes is important, because they may be used for decisions about traffic management, as well as traffic statistics used in political decisions concerning road safety and availability. The most important challenge for security is that aggregation removes redundancy and the option to directly verify signatures on atomic messages. Existing proposals are limited, because they require roads to be segmented into small fixed-size regions, beyond which aggregation cannot be performed. In this paper, we introduce SeDyA, a scheme that allows more dynamic aggregation compared to existing work, while also providing stronger security guarantees. We evaluate SeDyA against existing proposals to show the benefits in terms of information accuracy, bandwidth usage, and resilience against attacks.