Scalability of bloom filter based routing for large scale mobile networks

Large ad hoc networks, which are expected to become common in the Internet of Things, pose new scalability issues for traditional routing protocols. This study configures and compares HRAN, a routing protocol developed to scale to networks up to 1000 nodes, with traditional table based routing protocols for ad hoc networks. HRAN uses a specific type of bloom filter that is able to discard old elements, to store and disseminate topological information. The size and number of these structures is independent of the size or density of the network. Through simulation, we discover the suitable parameters for use on large networks, and compare HRAN with traditional table based routing protocols developed for mobile ad hoc environments.