Small-world effects in wireless agent sensor networks

Authors:
K. A. Hawick;H. A. James
Affiliations:
Institute of Information and Mathematical Sciences, Massey University – Albany, North Shore 102-904, Auckland, New Zealand.;Institute of Information and Mathematical Sciences, Massey University – Albany, North Shore 102-904, Auckland, New Zealand
Venue:
International Journal of Wireless and Mobile Computing
Year:
2010

Citing 6
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A Geometric Theorem for Network Design

IEEE Transactions on Computers
Guest Editors' Introduction: Ad Hoc Networks

Computer
Energy-Efficient Area Monitoring for Sensor Networks

Computer
The Theory of Critical Phenomena: An Introduction to the Renormalization Group

The Theory of Critical Phenomena: An Introduction to the Renormalization Group

Balanced data gathering strategy based on ant colony algorithm in WSNs

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a model for analysing the coverage graph from physical placement of mobile agents or sensor devices to improve coverage, fault tolerance and network lifetime. The planar graph for the devices is augmented by small-world network 'short-cuts'; the network then has properties intermediate between those of a fixed regular mesh and a random graph. Results from computational physics involving percolation and scaling phenomena help interpret network behaviours. Individual mobile sensors are modelled as points in Euclidean space with a circular region of influence and awareness; clustering algorithms are used to construct connectivity graphs which are analysed using conventional methods.