Fast track article: Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks

Authors:
Furuzan Atay Onat;Ivan Stojmenovic;Halim Yanikomeroglu
Affiliations:
Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada;Electronic, Electrical and Computer Engineering, The University of Birmingham, Birmingham, United Kingdom and SITE, University of Ottawa, Ottawa, Ontario, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada
Venue:
Pervasive and Mobile Computing
Year:
2008

Citing 10
Cited 4

Data networks

Data networks
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles

Wireless Communications & Mobile Computing - Performance Evaluation of Wireless Networks
Localized Sensor Area Coverage with Low Communication Overhead

PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Localized Techniques for Broadcasting in Wireless Sensor Networks

Algorithmica
Data replication approaches for ad hoc wireless networks satisfying time constraints

International Journal of Parallel, Emergent and Distributed Systems
Connectivity properties of a packet radio network model

IEEE Transactions on Information Theory

Auction Aggregation Protocols for Wireless Robot-Robot Coordination

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Towards trustworthy shared networked sensor-actuator systems

Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
From real neighbors to imaginary destination: emulation of large scale wireless sensor networks

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Auctions and iMesh based task assignment in wireless sensor and actuator networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider generation of graphs that represent specific scenarios that appear in wireless ad hoc, actuator, sensor and Internet networks. Most simulation studies for these networks use connected random unit disk graphs generated by placing nodes randomly and independently from each other. However, in real life usually networks are created in a cooperative manner; certain restrictions are imposed during the placement of a new node in order to improve network connectivity and functionality. This article is an initial study on how constrained connected random unit graphs (C-CRUG) can be generated by fast algorithms and what kind of desirable characteristics can be achieved compared to completely random graphs, especially for sparse node densities.