|
[1] Fei Dai and Jie Wu (2004). An Extended Localized Algorithm for Connected Dominating Set Formation in AD Hoc Wireless Networks. Parallel and Distributed Systems, Vol. 15. pp 908- 920. [2] Si-Ho Cha ; Dept. of Multimedia Sci., Chungwoon Univ., Incheon, South Korea ; Min-Woo Ryu ; Kyu-Ho Kim ; Byoung-Chan Jeon (2013). Applying Connected Dominating Set to Broadcasting in Vehicular Ad Hoc Networks.ICISA. pp1-2. [3] S.K. Tseng, B. J. Kang, K. C. Lin, and T. H. Su (2009). An Introduction to IEEE 1609 for Wireless Access in Vehicular Environments. ICL Technical Journal, no. 130, pp. 130-135. [4] Standard for Wireless Access in Vehicular Environments (WAVE) - Networking Services. Revision of IEEE Std 1609.2-2006. pp1 - 289. [5] Yousefi, S. ; Iran Univ. of Sci. &; Technol., Tehran ; Mousavi, M.S. ; Fathy, M. (2006). Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives. ITST, pp. 761-766. [6] Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu (1999) . The Broadcast Storm Problem in a Mobile Ad Hoc Network. Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking. pp 151-162. [7] H. Karami, S. M. Sheikholeslami, A. Khodkar, D. B. West (2012). Connected Domination Number of a Graph and its Complement. Graphs and Combinatorics, vol. 28, no. 1, pp. 123-131. [8] M. R. Garey, D.S. Johnson, (1978). Computers and interactability: a guide to the theory of NP-completeness. W. H. Freeman &; Co. New York.
|