Generating random graphs for wireless actuator networks

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM

Volumn , Issue , 2007, Pages

  Onat, Furuzan Atay ^a   Stojmenovic, Ivan ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACTUATORS; AD HOC NETWORKS; DISKS (STRUCTURAL COMPONENTS); GRAPH THEORY; METROPOLITAN AREA NETWORKS; RANDOM PROCESSES; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION NETWORKS; WIRELESS SENSOR NETWORKS;

ACTUATOR NETWORKS; AVERAGE NUMBERS; FAST ALGORITHMS; GRAPH GENERATIONS; NETWORK CONNECTIVITIES; NEW ALGORITHMS; NODE DEGREES; NODE DENSITIES; NODE PLACEMENTS; RANDOM GRAPHS; RANDOM UNIT DISK GRAPHS; SIMULATION STUDIES; SPARSE GRAPHS; WIRELESS ACTUATORS; WIRELESS AD HOC AND SENSOR NETWORKS;

WIRELESS NETWORKS;

EID: 47749117954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WOWMOM.2007.4351712     Document Type: Conference Paper

References (14)

1. M. Jorgic, I. Stojmenovic, M. Hauspie, and D. Simplot-Ryl, "Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks," in Proc. the Third Annual IFIP Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net, June 2004.
2. R. Meester and R. Rahul, Continuum Percolation. Cambridge University Press, 1996.
3. T. K. Philips, S. S. Panwar, and A. N. Tantawi, "Connectivity properties of a packet radio network model," IEEE Transactions on Information Theory, vol. 35, pp. 1044-1047, Sept. 1989.
4. P. Santi and D. M. Blough, "The critical transmitting range for connectivity in sparse wireless ad hoc networks," IEEE Transactions on Mobile Computing, vol. 2, pp. 25- 39, Jan.-March 2003.
5. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications : A Volume in Honor of W.H. Fleming, Boston, pp. 547-566, 1998.
6. O. Dousse, P. Thiran, and M. Hasler, "Connectivity in ad-hoc and hybrid networks," in Proc. IEEE INFOCOM, vol. 2, June 2002.
7. M. Desai and D. Manjunath, "On the connectivity in finite ad hoc networks," IEEE Communications Letters, vol. 10, pp. 437-490, Oct 2002.
8. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, vol. 10, pp. 169-181, 2004.
9. M. D. Penrose, "On k-connectivity for a geometric random graph," Random Structures and Algorithms, vol. 15, pp. 145-164, Sept. 1999.
10. X. Y. Li, Y. Wang, P. J. Wan, and C. W. Yi, "Fault tolerant deployment and topology control in wireless ad hoc networks," Journal of Wireless Communications and Mobile Computing (WCMC), vol. 4, pp. 109-125, Feb. 2004.
11. H. Zhang and J. C. Hou, "On the critical total power for asymptotic k-connectivity in wireless networks," in Proc. IEEE INFOCOM, March 2005.
12. D. Dubashi, O.Haggstrom, L. Orecchia, A. Panconesi, C. Petrioli, and A. Vitaletti, "Localized techniques for broadcasting in wireless sensor networks." Algorithmica, to appear.
13. D. P. Bertsekas, Data Networks, ch. 5, p. 401, Prentice Hall, 2nd ed., 1991.
14. I. Stojmenovic and X. Lin, "Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, pp. 1023-1032, Oct 2001.