Small-world effects in wireless agent sensor networks

被引：15

作者：

Hawick K.A. ^{[1
]}

James H.A. ^{[1
]}

机构：

[1] Institute of Information and Mathematical Sciences, Massey University - Albany, North Shore 102-904, Auckland

来源：

International Journal of Wireless and Mobile Computing | 2010年 / 4卷 / 03期

关键词：

Optimal coverage; Percolation; Scaling; Small-world network; Wireless agents;

D O I：

10.1504/IJWMC.2010.034213

中图分类号：

学科分类号：

摘要：

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. © 2010 Inderscience Enterprises Ltd.

引用

页码：155 / 164

页数：9

共 22 条

[1]

Barenblatt G.I., Scaling, (2003)

[2]

Barrat A., Weigt M., On the properties of small-world network models, Euro. Physical Journal B., 13, pp. 547-560, (2000)

[3]

Binney J.J., Dowrick N.J., Fisher A.J., Newman M.E.J., The Theory of Critical Phenomena, (1992)

[4]

Bollobas B., Modern Graph Theory, (1991)

[5]

Carle J., Simplot-Ryl D., Energy-efficient area monitoring for sensor networks, IEEE Computer, 37, pp. 40-46, (2004)

[6]

Cipra B., Nothing to sphere but sphere itself, American Mathematical Society, What's Happening in the Mathematical Sciences, 5, pp. 23-31, (2002)

[7]

Corman T.H., Leiserson C.E., Rivest R.K., All Pairs Algorithms - See for Example: 'Introduction to Algorithms', pp. 558-562, (2001)

[8]

Dijkstra E.W., A note on two problems in connexion with graphs, Numerische Mathematik, 1, pp. 269-271, (1959)

[9]

Donev A., Cisse I., Sachs D., Variano E.A., Stillinger F.H., Connelly R., Torquato S., Chaikin P.M., Improving the density of jammed disordered packings using ellipsoids, Science, 303, pp. 990-993, (2004)

[10]

Erdos P., Renyi A., On random graphs, Publicationes Mathematicae, 6, pp. 290-297, (1959)

← 1 2 3 →