Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A distributed routing algorithm for mobile wireless networks
Wireless Networks
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Adaptive distributed dynamic channel allocation for wireless networks
Journal of Parallel and Distributed Computing - Special issue on wireless networks
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Proceedings of the 9th annual international conference on Mobile computing and networking
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 10th annual international conference on Mobile computing and networking
Interference Power Sum with Log-Normal Components in Ad-Hoc and Sensor Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Handbook of Algorithms for Wireless Networking and Mobile Computing (Chapman & Hall/Crc Computer & Information Science)
A distributed approach for multi-constrained path selection and routing optimization
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Ad Hoc Networking
Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks
Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Analysis of a probabilistic topology-unaware TDMA MAC policy for ad hoc networks
IEEE Journal on Selected Areas in Communications
The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Routing in Distributed Cognitive Radio Networks: A Survey
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We present the CROWN (Collaborative ROuting, scheduling and frequency assignment for Wireless ad hoc Networks) scheme. CROWN is a cross-layer optimization approach for spectrum-agile nodes to adjust their spectrum allocation and transmission scheduling according to the underlying traffic demands. Instead of choosing the optimal route based on predetermined transmission scheduling and frequency assignment results, CROWN incorporates the efficiency of the underlying frequency assignment and scheduling information into the routing metric calculation, so that the route with the maximal joint spatial and frequency reuse is selected. Simulation results show that CROWN efficiently exploits the frequency diversity and spatial reuse features of spectrum-agile radios.