Concepts of graph theory relevant to ad-hoc networks

International Journal of Computers, Communications and Control

Volumn 3, Issue SPL. ISS., 2008, Pages 465-469

  Rajan, M A ^a   Chandra, M Girish ^b   Reddy, Lokanatha C ^c   Hiremath, Prakash ^d  

^a DRAVIDIAN UNIVERSITY   (India)

^b Embedded Systems Lab ^*  (India)

^c Professor DU   (India)

^d GULBARGA UNIVERSITY   (India)

Author keywords

Connectivity; Graph spanners; Graphs; MANET; Proximity

Indexed keywords

EID: 84876955926     PISSN: 18419836     EISSN: 18419844     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. ChipElliot and Bob Heile Self-Organizing, Self-Healing Wireless Networks Technical report, BBN Technologies, Cambridge, MA, 2001.
2. C. F. Huang, Y. C, Tseng, S. L. Wu, and J. P. Sheu, "Increasing the throughput of multihop packet radio networks with power adjustment," Procedings of International conference on Computer Communications and Netwoks, pp. 220-225, 2001.
3. J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking(Mobicom98), ACM, October 1998.
4. Christian Bettstetter, "On the minimum node degree and connectivity of a wireless multihop network," in Proceedings of the 3rd ACM international symposium on Mobile Computer Science Department, UCLA, 1976.
5. G. Di Battista and R. Tamassia. On-line Maintenance of TriconnectedComponents with SPQR-trees. Algorithmica,15:302-318, 1996.
6. T. K. Philips, S. S. Panwar, and A. N. Tantawi, "Connectivity properties of a packet radio network model," IEEE Trans. Inform. Theory, vol. 35, pp. 1044-1047, Bollob́as, B., Erdos, P.,
7. Graphs of extremal weights, Ars Combinatoria 50 (1998),225-233, 1989.
8. F. Harary, Graph Theory, Narosa Publishing House
9. Charles E. Perkins. Ad-hoc networking. Addison-Wesley, Boston, 2001.
10. D. Peleg and A. A. Schäffer, Graph Spanners, Journal of Graph Theory,13:99-116, 1989.
11. E. W Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, 1959.
12. M. D. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
13. O. Häggström and R. Meester, "Nearest neighbor and hard sphere models in continuum percolation," Random Structures and Algorithms, vol. 9, pp. 295-315, 1996.
14. Dragos M. Cvetkovic Michael Doob Horst Sachsp, "Spectra of Graphs, Theory and Application", Academic Press
15. X.-Y. Li and I. Stojmenovic, Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation, in: Proc. AD-HOC NetwOrks and Wireless (ADHOC-NOW), Fields Institute, Toronto, 2002.
16. R. Albert and A. L. Barab́asi, Statistical mechanics of complex networks, Rev. Modern Physics, 74, 47-97, 2002.
17. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
18. M.A.Rajan, M. Girish Chandra, Lokanatha C. Reddy and Prakash Hiremath, A Study Of Connectivity Index of Graph Relevant to Adhoc Networks, IJCSNS VOL.7 No.11, November, 198-204, 2007.
19. M.A.Rajan, M. Girish Chandra, "A Study of Graph Thoery Concepts Relevant to MANETS", Technical Report, TCSL, October 2006.