메뉴 건너뛰기




Volumn 53, Issue 6, 2010, Pages 1643-1655

Approximation for a scheduling problem with application in wireless networks

Author keywords

Approximation algorithm; Conflict aware; Latency; Many to one data aggregation; Wireless sensor network

Indexed keywords


EID: 85027943061     PISSN: 16747283     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11425-010-3077-9     Document Type: Article
Times cited : (6)

References (13)
  • 1
    • 33646854367 scopus 로고    scopus 로고
    • Minimum data aggregation time problem in wireless sensor networks
    • Chen X, Hu X, Zhu J. Minimum data aggregation time problem in wireless sensor networks. Lect Notes Comput Sci, 2005, 3794: 133-142.
    • (2005) Lect Notes Comput Sci , vol.3794 , pp. 133-142
    • Chen, X.1    Hu, X.2    Zhu, J.3
  • 2
    • 34548362108 scopus 로고    scopus 로고
    • A constant approximation algorithm for interference aware broadcast in wireless networks
    • Piscateway: IEEE
    • Chen Z, Qiao C, Xu J, et al. A constant approximation algorithm for interference aware broadcast in wireless networks. In: Proceedings of IEEE INFOCOM. Piscateway: IEEE, 2007, 740-748.
    • (2007) Proceedings of IEEE INFOCOM
    • Chen, Z.1    Qiao, C.2    Xu, J.3
  • 4
    • 18144424769 scopus 로고    scopus 로고
    • Tuning the carrier sensing range of ieee 802.11 mac
    • Piscateway: IEEE
    • Deng J, Liang B, Varshney P. Tuning the carrier sensing range of ieee 802. 11 mac. In: Proceedings of GLOBECOM. Piscateway: IEEE, 2004, 2987-2991.
    • (2004) Proceedings of GLOBECOM , pp. 2987-2991
    • Deng, J.1    Liang, B.2    Varshney, P.3
  • 5
    • 0242527322 scopus 로고    scopus 로고
    • Minimizing broadcast latency and redundancy in ad hoc networks
    • New York: ACM Press
    • Gandhi R, Parthasarathy S, and Mishra A. Minimizing broadcast latency and redundancy in ad hoc networks. In: Proceedings of MOBIHOC. New York: ACM Press, 2003, 222-232.
    • (2003) Proceedings of MOBIHOC , pp. 222-232
    • Gandhi, R.1    Parthasarathy, S.2    Mishra, A.3
  • 6
    • 32344448716 scopus 로고    scopus 로고
    • Faster communication in known topology radio networks
    • New York: ACM Press
    • Gasieniec L, Peleg D, Xin Q. Faster communication in known topology radio networks. In: Proceedings of PODC. New York: ACM Press, 2005, 129-137.
    • (2005) Proceedings of PODC , pp. 129-137
    • Gasieniec, L.1    Peleg, D.2    Xin, Q.3
  • 7
    • 34548322734 scopus 로고    scopus 로고
    • Minimum-latency broadcast scheduling in wireless ad hoc networks
    • Piscateway: IEEE
    • Huang C H, Wan P J, Jia X, et al. Minimum-latency broadcast scheduling in wireless ad hoc networks. In: Proceedings of IEEE INFOCOM. Piscateway: IEEE, 2007, 733-739.
    • (2007) Proceedings of IEEE INFOCOM , pp. 733-739
    • Huang, C.H.1    Wan, P.J.2    Jia, X.3
  • 8
    • 34548324833 scopus 로고    scopus 로고
    • Nearly constant approximation for data aggregation scheduling in wireless sensor networks
    • Piscateway: IEEE
    • Huang C H, Wan P J, Vu T. et al. Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings of IEEE INFOCOM. Piscateway: IEEE, 2007, 366-372.
    • (2007) Proceedings of IEEE INFOCOM , pp. 366-372
    • Huang, C.H.1    Wan, P.J.2    Vu, T.3
  • 9
    • 84994296501 scopus 로고    scopus 로고
    • The impact of data aggregation in wireless sensor networks
    • Piscateway: IEEE
    • Krishnamachari B, Estrin D, Wicker S. The impact of data aggregation in wireless sensor networks. In: Proceedings of ICDCSW. Piscateway: IEEE, 2002, 575-578.
    • (2002) Proceedings of ICDCSW , pp. 575-578
    • Krishnamachari, B.1    Estrin, D.2    Wicker, S.3
  • 10
    • 57349125628 scopus 로고    scopus 로고
    • An approximation algorithm for conflict-Aware broadcast scheduling in wireless ad hoc networks
    • New York: ACM Press
    • Mahjourian R, Chen F, Tiwari R, et al. An approximation algorithm for conflict-Aware broadcast scheduling in wireless ad hoc networks. In: Proceedings of MOBIHOC. New York: ACM Press, 2008, 331-340.
    • (2008) Proceedings of MOBIHOC , pp. 331-340
    • Mahjourian, R.1    Chen, F.2    Tiwari, R.3
  • 11
    • 0020781464 scopus 로고
    • Smallest-last ordering and clustering and graph coloring algorithms
    • Matula DW, Beck L L. Smallest-last ordering and clustering and graph coloring algorithms. J ACM, 1989, 30: 417-427.
    • (1989) J ACM , vol.30 , pp. 417-427
    • Matula, D.W.1    Beck, L.L.2
  • 12
    • 0012964766 scopus 로고
    • Über endliche kreispackungen in der ebene
    • Wegner G. Über endliche kreispackungen in der ebene. Studia Sci Math Hungar, 1986, 21: 1-28.
    • (1986) Studia Sci Math Hungar , vol.21 , pp. 1-28
    • Wegner, G.1
  • 13
    • 8344239614 scopus 로고    scopus 로고
    • Energy-latency tradeoffs for data gathering in wireless sensor networks
    • Piscateway: IEEE
    • Yu Y, Krishnamachari B, Prasanna V K. Energy-latency tradeoffs for data gathering in wireless sensor networks. In: Proceedings of IEEE INFOCOM. Piscateway: IEEE, 2004, 255-266.
    • (2004) Proceedings of IEEE INFOCOM , pp. 255-266
    • Yu, Y.1    Krishnamachari, B.2    Prasanna, V.K.3


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