Kondareddy, Yogesh R and Agrawal, Prathima (2010) A Graph Based Routing Algorithm for Multi-hop Cognitive Radio Networks. In: 4th International ICST Conference on Wireless Internet.
![[thumbnail of 10080.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "10080.pdf")
PDF
10080.pdf
Download (277kB)
Abstract
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterized by dynamically changing channel sets at each node. The graph theoretic approach used in traditional multi-hop networks
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:53 |
| Last Modified: | 18 Apr 2026 04:58 |
| URI: | http://eprints.eai.eu/id/eprint/1994 |
Actions (login required)
- View Item