Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold

Physica A: Statistical Mechanics and its Applications

Volumn 389, Issue 14, 2010, Pages 2841-2848

  Korsnes, Reinert ^a  

^a NORWEGIAN DEFENCE RESEARCH ESTABLISHMENT FFI   (Norway)

Author keywords

Local information; Random systems; Routing protocol; Self organisation; Sensor network

Indexed keywords

COST BENEFIT ANALYSIS; COST EFFECTIVENESS; COST ESTIMATING; FORESTRY; GRAPH ALGORITHMS; PERCOLATION (COMPUTER STORAGE); PERCOLATION (FLUIDS); ROUTING PROTOCOLS; SENSOR NETWORKS; SOLVENTS; TREES (MATHEMATICS);

AD-HOC SENSOR NETWORKS; DIJKSTRA'S ALGORITHMS; DISTRIBUTED APPROACHES; LOCAL INFORMATION; PERCOLATION THRESHOLDS; PHASE TRANSITION PHENOMENON; RANDOM SYSTEMS; SELF ORGANISATION;

SENSOR NODES;

EID: 77951206969     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2010.03.005     Document Type: Article

References (25)

1. Akyildiz I.F., Su W., Sankarasubramaniam Y., and Cayirci E. A survey on sensor networks. IEEE Communications Magazine (2002) 102-114. http://citeseer.ist.psu.edu/akyildiz02survey.html URL: http://citeseer.ist.psu.edu/akyildiz02survey.html
2. Dorogovtsev S.N., and Mendes J.F.F. Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) (2003), Oxford University Press
3. Stojanovic M. On the relationship between capacity and distance in an underwater acoustic communication channel. WUWNet'06: Proceedings of the 1st ACM International Workshop on Underwater Networks (2006), ACM, New York, NY, USA 41-47
4. Wu B.Y., and Chao K.-M. Spanning Trees and Optimization Problems (2004), CRC Press
5. Eppstein D. Spanning trees and spanners. Handbook of Computational Geometry (1999), Elsevier 425-461
6. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
7. Elkin M. Computing almost shortest paths. ACM Transactions on Algorithms 1 2 (2005) 283-323
8. Awerbuch B. Randomized distributed shortest paths algorithms. STOC'89: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing (1989), ACM, New York, NY, USA 490-500
9. Kleinrock L., and Silvester J. Optimum transmission radii in packet radio networks or why six is a magic number. National Telecommunications Conference (1978), IEEE, Birmingham, Alabama 4.3.1-4.3.5
10. Takagi H., and Kleinrock L. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications (1984) 246-257
11. Xue F., and Kumar P.R. The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10 2 (2004) 169-181
12. S. Meguerdichian, F. Koushanfar, M. Potkonjak, M.B. Srivastava, Coverage problems in wireless ad-hoc sensor networks, in: IEEE INFOCOM, 2001, pp. 1380-1387.
13. Flaxman A., Frieze A., and Upfal E. Efficient communication in an ad-hoc network. Journal of the Algorithms 52 1 (2004) 1-7
14. Ding L., and Guan Z.-H. Modeling wireless sensor networks using random graph theory. Physica A: Statistical Mechanics and its Applications 387 12 (2008) 3008-3016
15. B. Krishnamachari, S.B. Wicker, R. Béjar, Phase transition phenomena in wireless ad-hoc networks, in: Global Telecommunications Conference, 2001. GLOBECOM'01. IEEE, vol. 5, 2001, pp. 2921-2925.
16. P. Gupta, P.R. Kumar, Critical power for asymptotic connectivity, in: Proceedings of the 37th IEEE Conference on Decision and Control, Tampa, FL, 1998, pp. 547-566.
17. M. Sánchez, P. Manzoni, Z.J. Haas, Determination of critical transmission range in ad-hoc networks, in: In Multiaccess, Mobility and Teletraffic for Wireless Communications, MMT'99, 1999, pp. 6-8.
18. Muthukrishnan S., and Pandurangan G. The bin-covering technique for thresholding random geometric graph properties. SODA, SIAM (2005) 989-998
19. Stanley H.E. Introduction to Phase Transitions and Critical Phenomena (1971), Clarendon Press, Oxford
20. Goldenfeld N. Lectures on Phase Transitions and the Renormalization Group (1992), Perseus Publishing
21. Kadanoff L.P. Statistical Physics: Statics, Dynamics and Renormalization (2000), World Scientific Pub.
22. Wu Y., and Li Y. Construction algorithms for k-connected m-dominating sets in wireless sensor networks. MobiHoc'08: Proceedings of the 9th ACM International Symposium on Mobile ad hoc Networking and Computing (2008), ACM, New York, NY, USA 83-90
23. Shang W., Yao F., Wan P., and Hu X. On minimum-connected k-dominating set problem in unit disc graphs. Journal of Combinatorial Optimization 16 2 (2008) 99-106
24. Thai M.T., Zhang N., Tiwari R., and Xu X. On approximation algorithms of k-connected m-dominating sets in disk graphs. Theoretical Computer Science 385 1-3 (2007) 49-59
25. Li Y., Thai M.T., Wang F., Yi C.-W., Wan P.-J., and Du D.-Z. On greedy construction of connected dominating sets in wireless networks: research articles. Wireless Communications and Mobile Computing 5 8 (2005) 927-932