F. T. Leighton, B. M. Maggs, and S. B. Rao, "Packet routing and job-shop scheduling in 0(congestion+dilation) steps," Combinatorica, vol. 14, pp. 167--186, 1994.  Home/Search   Document Not in Database   Summary   Related Articles

.... in [9] Also relevant to our research is the so called packet routing problem which consists in moving packets of data from one location to another as quickly as possible in a network and has been extensively studied in conjunction with wireline and wireless network models (see for example [10], This work was performed at Caltech and supported by The Lee Center for Networking. 11] 12] and [13] To the best of our knowledge however no results specific to sensor networks where, in particular, non uniform data distribution over the network is assumed had yet been derived. In [1] the ....

F. T. Leighton, B. M. Maggs, and S. B. Rao, "Packet routing and job-shop scheduling in 0(congestion+dilation) steps," Combinatorica, vol. 14, pp. 167--186, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC