A distributed routing algorithm for band,delay and cost-constrained in wireless unicast network
Qing-Ge Zhu · Journal of Changsha Telecommunications and Technology Vocational College · 2007
This paper introduces the present research of Unicast Routing,then puts forward the band,delay and cost-constrained routing problem BDCFC(Band,Delay and Cost-Constrained Fewest Consume)and the BDUR(Band-Delay Unicast-Routing) algorithm using time multinomial.The worst case message complexity of BDUR is O(│V│4),where │V│ is the number of nodes.