메뉴 건너뛰기




Volumn 2013, Issue 1, 2013, Pages

Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84894188320     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1186/1687-1499-2013-248     Document Type: Article
Times cited : (10)

References (31)
  • 8
    • 50149093082 scopus 로고    scopus 로고
    • Minimizing broadcast latency and redundancy in ad hoc networks
    • R Gandhi, A Mishra, S Parthasarathy, Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4), 840-851 (2008)
    • (2008) IEEE/ACM Trans. Netw. , vol.16 , Issue.4 , pp. 840-851
    • Gandhi, R.1    Mishra, A.2    Parthasarathy, S.3
  • 11
    • 0035865898 scopus 로고    scopus 로고
    • Flooding in wireless ad hoc networks
    • DOI 10.1016/S0140-3664(00)00233-4
    • H Lim, C Kim, Flooding in wireless ad hoc networks. Comput. Commun. 24(3), 353-363 (2001) (Pubitemid 32160641)
    • (2001) Computer Communications , vol.24 , Issue.3-4 , pp. 353-363
    • Lim, H.1    Kim, C.2
  • 19
    • 76849104635 scopus 로고    scopus 로고
    • Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks
    • J Hong, J Cao, W Li, S Lu, D Chen, Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks. IEEE Trans. Vehicular Technol. 59, 307-318 (2010)
    • (2010) IEEE Trans. Vehicular Technol. , vol.59 , pp. 307-318
    • Hong, J.1    Cao, J.2    Li, W.3    Lu, S.4    Chen, D.5
  • 26
    • 34548398442 scopus 로고    scopus 로고
    • Asynchronous random sleeping for sensor networks
    • DOI 10.1145/1267060.1267063
    • C Hua, TSP Yum, Asynchronous random sleeping for sensor networks. ACM Trans. Sensor Netw (2007). doi:10.1145/1267060.1267063 (Pubitemid 47366838)
    • (2007) ACM Transactions on Sensor Networks , vol.3 , Issue.3 , pp. 1267063
    • Hua, C.1    Yum, T.-S.P.2
  • 29
    • 0020781464 scopus 로고
    • Smallest-last ordering and clustering and graph coloring algorithms
    • DW Matula, LL Beck, Smallest-last ordering and clustering and graph coloring algorithms. J. ACM. 30(3), 417-427 (1983)
    • (1983) J. ACM. , vol.30 , Issue.3 , pp. 417-427
    • Matula, D.W.1    Beck, L.L.2
  • 30
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S Guha, S Khuller, Approximation algorithms for connected dominating sets. Algorithmica. 20(4), 374-387 (1998) (Pubitemid 128664048)
    • (1998) Algorithmica (New York) , vol.20 , Issue.4 , pp. 374-387
    • Guha, S.1    Khuller, S.2


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