Bounds on the Greedy Routing Algorithm for Array Networks

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.53, Iss.3, 1996-12, pp. : 317-327

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Bounds on hop distance in greedy routing approach in wireless ad hoc networks

By De Swades Caruso Antonio Chaira Tamalika Chessa Stefano

International Journal of Wireless and Mobile Computing, Vol. 1, Iss. 2, 2007-02 ,pp. : 131-140

Inderscience Publishers

Access to resources Recommend Favorite

Scheduling in synchronous networks and the greedy algorithm

By Lui K.-S. Zaks S.

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 157-183

Elsevier

Access to resources Recommend Favorite

VLSI implementation of greedy-based distributed routing schemes for ad hoc networks

By Aloisio Alberto Izzo Vincenzo Rampone Salvatore

Soft Computing, Vol. 11, Iss. 9, 2007-07 ,pp. : 865-872

Springer Publishing Company

Access to resources Recommend Favorite

Greedy primal-dual algorithm for dynamic resource allocation in complex networks

By Stolyar Alexander

Queueing Systems, Vol. 54, Iss. 3, 2006-11 ,pp. : 203-220

Springer Publishing Company

Access to resources Recommend Favorite

GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks

By Kumar Manish

International Journal of Communication Networks and Distributed Systems, Vol. 11, Iss. 2, 2013-07 ,pp. : 198-213

Inderscience Publishers

Access to resources Recommend Favorite