Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
Hi-index | 0.00 |
Cognitive Radios (CR) [4] enable flexible and improved radio spectrum utilization by allowing a group of CR nodes to utilize unused channels without interference with the channels' owners [1]. A CR node has a set of available (wireless) channels and this set varies with time, location and activities of the primary (licensed) users. Determining a node's neighborhood and common channels for communication is non-trivial. We propose several efficient distributed algorithms for node discovery and configuration (NDC) for various CR node models. Krishnamurthy et al. [3] proposed a solution for NDC without a control channel. In their model, each node has a single transceiver. If N is the maximum number of nodes and M is the maximum number of channels, their algorithm uses 2NM timeslots for NDC. Other works assume a common control channel, or every node is equipped with a separate radio interface for each channel or an identical frequency distribution at each node. Please see [2] for a thorough discussion of related work. Here, we extend the algorithms of [3] to other CR node models.