Technical Report CSI-0015

Scaling Properties of Minimal Spanning Trees in Simulated Ad Hoc Wireless Networks

K. A. Hawick

Archived: 2016

Abstract

Ad hoc networks of sensors or other deployable and mobile devices can have surprisingly complex emergent properties arising from combinations of individual interactive effects. We simulate such systems over a range of sizes of network and generate Minimal Spanning Tree connections between nodes. We analyse the scaling properties such as: the total arc length of the generated tree; the all-pairs average path-lengths; the betweenness centrality and its ranking amongst connected nodes; and the number of through-vertices; all as the network size is varied. We find various power-laws describing the scaling behaviour and suggest some relationships between these and the embedding spatial dimension. We discuss the scalability of network properties; the utility of these analysis methods; and their potential applicability to real world problems for sensor and mobile device networks.

Keywords: wireless sensors; ad hoc networks; node placement; power management; modelling; simulation; graph analysis

Full Document Text: PDF version.

Citation Information: BiBTeX database for CSI Notes.

BiBTeX reference:

@InProceedings{CSI-0015,
        Title = {Scaling Properties of Minimal Spanning Trees in Simulated Ad Hoc Wireless Networks},
        Author = {K. A. Hawick},
        Booktitle = {Proc. 15th Int. Conf. on Wireless Networks (ICWN'16)},
        Year = {2016},
        Address = {Las Vegas, USA},
        Editor = {H. Arabnia},
        Month = {25-28 July},
        Note = {ISBN: 1-60132-440-5,},
        Number = {ICW3787},
        Organization = {WorldComp},
        Pages = {3-9},
        Publisher = {CSREA Press},
        Keywords = {wireless sensors; ad hoc networks; node placement; power management; modelling; simulation; graph analysis},
        Owner = {kahawick},
        Timestamp = {2016.06.05}
}