Introduction to algorithms
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Theoretical Computer Science - Foundations of software science and computation structures
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
JENNA: a jamming evasive network-coding neighbor-discovery algorithm for cognitive radio networks
IEEE Wireless Communications
Hi-index | 0.00 |
A cognitive radio node is a radio device capable of operating over multiple channels. As a result, a network consisting of one or more cognitive radio nodes can adapt to varying channel availability in its geographical region by dynamically changing the channel (or channels) nodes are using for communication. We investigate the problem of designing a fast deterministic algorithm for neighbor discovery in an undirected network consisting of one or more cognitive radio nodes when different nodes may have different subsets of channels available for communication at their location. We say that a neighbor discovery algorithm is fast if its time-complexity is polynomial in actual network-size. We prove that it is impossible to devise a fast algorithm to solve the neighbor discovery problem if nodes are neither size-aware nor collision-aware. When nodes are collision-aware, we present a fast algorithm for neighbor discovery with time-complexity of O(pmlogn), where p denotes the actual number of nodes present in the network, n denotes the size of space used for assigning labels to the nodes, and m denotes the number of channels over which nodes can operate. Our algorithm has the desirable property that every node knows when the neighbor discovery has completed and, moreover, all nodes terminate at the same time. When nodes are size-aware, we use a gossiping algorithm for a single-channel network with large labels that was proposed recently to derive a fast adaptive algorithm for neighbor discovery. We also investigate the neighbor discovery problem when the network may be directed. Finally, we describe a way to speed up neighbor discovery when nodes are collision-aware and channel availability sets of neighboring nodes do not vary significantly.