Scarcity of frequencies and the demand for more bandwidth is likely to increase the need for devices that utilize the available frequencies more efficiently. Radios must be able to dynamically find other users of the frequency bands and adapt so that they are not interfered, even if they use different radio protocols. As transmitters far away may cause as much interference as a transmitter located nearby, this mechanism can not be based on location alone. Central databases can be used for this purpose, but require expensive infrastructure and planning to scale. In this paper, we propose a decentralized protocol and architecture for discovering radio devices over the Internet. The protocol has low resource requirements, making it suitable for implementation on limited platforms. We evaluate the protocol through simulation in network topologies with up to 2.3 million nodes, including topologies generated from population patterns in Norway. The protocol has also been implemented as proof-ofconcept in real Wi-Fi routers.
In many distributed protocols efficient synchronization of data elements is a determining factor for both bandwidth usage and computational requirements. Earlier works have shown that by using error correcting codes and probabilistic membership tests, sets can be reconciled with near optimal bandwidth complexity. In this paper, we propose an alternative method with low computational requirements. Although the bandwidth requirements are not optimal, we show that our mechanism performs well when the number of differences between the sets are unknown. As the mechanism requires very little state information to be transferred, any node may reply to synchronization requests after receiving a single message. This enables fast synchronization in dynamic networks, as well as simultaneous synchronization of multiple nodes within radio broadcast range. We expect these properties to be desirable for many applications in mobile environments.
Existing service discovery mechanisms for ad hoc networks are often designed with one specific network type in mind. Solutions capable of handling highly mobile nodes usually have high bandwidth requirements, particularly as the number of nodes increases. The bandwidth requirement can be reduced by locally caching state information, but this increases the risk of nodes having outdated state information when mobility is high. Some solutions avoid these two issues by tightly coupling service discovery with the routing mechanism itself. However, this requires that nodes are homogeneous on the network layer.We propose a solution that leverages the special properties inherent in broadcast-based radio networks. In such networks, every node within transmission range will hear a transmission, be it unicast or broadcast. Each node therefore aggregates relevant service information and broadcasts it at regular intervals. Unnecessary transmissions are suppressed by efficiently synchronizing local state information.In this paper, we describe the Mist-protocol, a robust and efficient adaptive service discovery protocol, that supports large, highly mobile networks consisting of heterogeneous nodes. We test the protocol in large scale simulations in both static and mobile environments. Finally, we show that it is feasible to actually implement the design by providing a proof-of-concept prototype, which has been evaluated in a small scale experiment.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.