메뉴 건너뛰기




Volumn 1, Issue 2, 2009, Pages 175-191

A BETTER APPROXIMATION for MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM in 2-D UNDERWATER SENSOR NETWORKS

Author keywords

Polynomial time approximation scheme; underwater sensor networks; wireless network clustering

Indexed keywords


EID: 77958593923     PISSN: 17938309     EISSN: 17938317     Source Type: Journal    
DOI: 10.1142/S1793830909000142     Document Type: Article
Times cited : (9)

References (11)
  • 1
    • 13944252629 scopus 로고    scopus 로고
    • Underwater acoustic sensor networks: Research challenges
    • I. F. Akyildiz, D. Pompili and T. Melodia, Underwater acoustic sensor networks: research challenges, J. Ad Hoc Netw. 3 (2005) 257-279.
    • (2005) J. Ad Hoc Netw. , vol.3 , pp. 257-279
    • Akyildiz, I.F.1    Pompili, D.2    Melodia, T.3
  • 2
    • 84892572090 scopus 로고    scopus 로고
    • A survey of clustering schemes for mobile ad hoc networks
    • J. Y. Yu and P. H. J. Chong, A survey of clustering schemes for mobile ad hoc networks, IEEE Commun. Surv. Tutorials 7 (2005) 32-48.
    • (2005) IEEE Commun Surv. Tutorials , vol.7 , pp. 32-48
    • Yu, J.Y.1    Chong, P.H.J.2
  • 4
    • 38549140262 scopus 로고    scopus 로고
    • Distributed minimum-cost clustering protocol for underwater sensor networks (UWSNs
    • June
    • P. Wang, C. Li and J. Zheng, Distributed minimum-cost clustering protocol for underwater sensor networks (UWSNs), IEEE Int. Conf. Commun. (ICC 2007), June, (2007), pp. 3510-3515.
    • (2007) IEEE Int. Conf. Commun. (ICC 2007) , pp. 3510-3515
    • Wang, P.1    Li, C.2    Zheng, J.3
  • 5
    • 0042976442 scopus 로고    scopus 로고
    • Multi-level hierarchies for scalable ad hoc routing
    • E. M. Belding-Royer, Multi-level hierarchies for scalable ad hoc routing, Wirel. Netw. 9 (2003) 461-478.
    • (2003) Wirel. Netw. , vol.9 , pp. 461-478
    • Belding-Royer, E.M.1
  • 6
    • 85073169699 scopus 로고    scopus 로고
    • Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
    • to appear
    • D. Kim, W. Wang, L. Ding, J. Lim, H. Oh and W. Wu, Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks, to appear in Optim. Lett.
    • Optim Lett
    • Kim, D.1    Wang, W.2    Ding, L.3    Lim, J.4    Oh, H.5    Wu, W.6
  • 7
    • 59049089756 scopus 로고    scopus 로고
    • A (5 + e)-approximation algorithm for minimum weighted dominating set in unit disk graph
    • D. Dai and C. Yu, A (5 + e)-approximation algorithm for minimum weighted dominating set in unit disk graph, Theor. Comput. Sci. 410 (2008) 756-765.
    • (2008) Theor. Comput. Sci. , vol.410 , pp. 756-765
    • Dai, D.1    Yu, C.2
  • 10
    • 33745613297 scopus 로고    scopus 로고
    • A PTAS for the minimum dominating set problem in unit disk graphs
    • eds. T. Erlebach and G. Persiano, LNCS 3879, Berlin Heidelberg Springer-Verlag
    • T. Nieberg and J. Hurink, A PTAS for the minimum dominating set problem in unit disk graphs, in WAOA 2005, eds. T. Erlebach and G. Persiano, LNCS 3879, (Berlin Heidelberg Springer-Verlag, 2006), pp. 296-306.
    • (2006) WAOA 2005 , pp. 296-306
    • Nieberg, T.1    Hurink, J.2
  • 11
    • 0002794707 scopus 로고
    • Planar formulae and their uses
    • D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
    • (1982) SIAM J. Comput. , vol.11 , pp. 329-343
    • Lichtenstein, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.