A Clustering Scheme for Hierarchical Routing in Wireless Networks

Simple item page
dc.contributor.authorBanerjee, Sumanen_US
dc.contributor.authorKhuller, Samiren_US
dc.date.accessioned2004-05-31T21:08:47Z
dc.date.available2004-05-31T21:08:47Z
dc.date.created2000-02en_US
dc.date.issued2000-03-01en_US
dc.description.abstractIn this paper we present a clustering scheme to create hierarchies for wireless networks. A cluster is defined as a subset of vertices, whose induced graph is connected. In addition, a cluster is required to obey certain constraints that are useful for hierarchical routing. While all these constraints cannot be met simultaneously for general graphs, we show how for wireless network topologies, such a clustering can be obtained. We also present simulation results from a distributed implementation of this scheme to demonstrate its convergence and stability properties.en_US
dc.format.extent316080 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/512
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4103en_US
dc.titleA Clustering Scheme for Hierarchical Routing in Wireless Networksen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-4103.ps
Size:
308.67 KB
Format:
Postscript Files
Download
Thumbnail Image
Name:
CS-TR-4103.pdf
Size:
300.55 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-4103.ps
Download

Collections

Technical Reports of the Computer Science Department