Topological Characteristics of Random Multihop Wireless Networks

Authors:
Keqin Li
Affiliations:
Department of Computer Science, State University of New York, New Paltz, 12561
Venue:
Cluster Computing
Year:
2005

Citing 3
Cited 2

Unit disk graphs

Discrete Mathematics - Topics on domination
Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
A new model for scheduling packet radio networks

Wireless Networks

Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks

Journal of Experimental Algorithmics (JEA)
A Model of an Amorphous Computer and Its Communication Protocol

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multihop wireless networks are treated as random symmetric planar point graphs, where all the nodes have the same transmission power and radius, and vertices of a graph are drawn randomly over certain geographical region. Several basic and important topological properties of random multihop wireless networks are studied, including node degree, connectivity, diameter, bisection width, and biconnectivity. It is believed that such study has very useful implication in real applications.