Small-world effects in wireless agent sensor networks

International Journal of Wireless and Mobile Computing

Volumn 4, Issue 3, 2010, Pages 155-164

  Hawick, K A ^a   James, H A ^a  

^a MASSEY UNIVERSITY   (New Zealand)

Author keywords

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

Indexed keywords

CLUSTERING ALGORITHMS; FAULT TOLERANCE; GRAPH THEORY; MOBILE AGENTS; PERCOLATION (SOLID STATE); SMALL-WORLD NETWORKS; SOLVENTS;

COMPUTATIONAL PHYSICS; CONNECTIVITY GRAPH; CONVENTIONAL METHODS; OPTIMAL COVERAGE; SCALING; SCALING PHENOMENON; SMALL-WORLD EFFECT; WIRELESS AGENTS;

WIRELESS SENSOR NETWORKS;

EID: 77955105936     PISSN: 17411084     EISSN: 17411092     Source Type: Journal    
DOI: 10.1504/IJWMC.2010.034213     Document Type: Article

References (21)

1. Barenblatt, G.I. (2003) Scaling, Cambridge University Press, ISBN 0-521-82657-8.
2. Barrat, A. and Weigt, M. (2000) 'On the properties of small-world network models', Euro. Physical Journal B., Vol.13, pp.547-560.
3. Binney, J.J., Dowrick, N.J., Fisher, A.J. and Newman, M.E.J. (1992) The Theory of Critical Phenomena, Oxford Univ. Press, Oxford Science Series, ISBN 0-19-851393-3.
4. Bollobas, B. (1991) Modern Graph Theory, Springer, Graduate Texts in Mathematics No. 184, ISBN 0-387-98491-7.
5. Carle, J. and Simplot-Ryl, D. (2004) 'Energy-efficient area monitoring for sensor networks', IEEE Computer, Vol.37, pp.40-46.
6. Cipra, B. (2002) 'Nothing to sphere but sphere itself', American Mathematical Society, What's Happening in the Mathematical Sciences, Vol.5, pp.23-31.
7. Corman, T.H., Leiserson, C.E. and Rivest, R.K. (2001) All Pairs Algorithms - See for Example: 'Introduction to Algorithms', Section 26.2, 2nd ed., MIT Press, pp.558-562, ISBN: 0262032937.
8. Dijkstra, E.W. (1959) 'A note on two problems in connexion with graphs', Numerische Mathematik, Vol.1, pp.269-271.
9. Donev, A., Cisse, I., Sachs, D., Variano, E.A., Stillinger, F.H., Connelly, R., Torquato, S. and Chaikin, P.M. (2004) 'Improving the density of jammed disordered packings using ellipsoids', Science, Vol.303, pp.990-993.
10. Erdös, P. and Rényi, A. (1959) 'On random graphs', Publicationes Mathematicae, Vol.6, pp.290-297.
11. Ford Jr., L.R. and Fulkerson, D.R. (1962) Flows in Networks, Princeton University Press, Princeton.
12. Franceschetti, M., Cook, M. and Bruck, J. (2004) 'A geometric theorem for network design', IEEE Trans. on Computers, Vol.53, No.4, pp.483-489.
13. Knuth, D.E. (1997) Fundamental Algorithms, 3rd ed., Vol.1 of The Art of Computer Programming, Addison-Wesley, Reading, MA.
14. Malpani, N., Welch, J.L. and Vaidya, N. (2000) 'Leader election algorithms for mobile ad hoc networks,' Proc. 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility), Boston, Massachusetts, USA, pp.96-103.
15. Milgram, S. (1967) 'The small world problem', Psychology Today, Vol.2, pp.60-67.
16. Smart Dust and the Scottish Speckled Computing Consortium (2004) http://www.SpeckNet.org, last visited May.
17. Watts, D.J. (2003) Six Degrees - The Science of a Connected Age, William Heinemann, ISBN 0-434-00908-3.
18. Watts, D.J., and Strogatz, S.H. (1998) 'Collective dynamics of 'small-world' networks', Nature, Vol.393, pp.440-442.
19. Weiss, P. (2004) 'Candy science: M&Ms pack more tightly than spheres', Science News Online, Vol.165, No.7, p.102.
20. Wu, J. and Stojmenovic, I. (2004) 'Ad-hoc networks', Editorial in Special Issue of IEEE Computer, Vol.2, pp.29-31.
21. Wang, Z., Thomas, R.J. and Haas, Z. (2002) 'Bluenet a new scatternet formation scheme', Proc. 35th Hawaii Int. Conf. on System Sciences, Vol.2, pp.61-69.