메뉴 건너뛰기




Volumn 23, Issue 1, 2012, Pages 110-117

Minimum latency broadcast scheduling in duty-cycled multihop wireless networks

Author keywords

approximation algorithms; Broadcast scheduling; duty cycle; multihop wireless networks

Indexed keywords

APPROXIMATION RATIOS; BROADCAST SCHEDULING; DUTY CYCLE; EXTENSIVE SIMULATIONS; MESSAGE MODEL; MULTIHOP WIRELESS NETWORK; NODE DEGREE; NP-HARD; TIME SLOTS;

EID: 82555186943     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2011.106     Document Type: Article
Times cited : (61)

References (29)
  • 1
    • 0037205804 scopus 로고    scopus 로고
    • On adaptive deterministic gossiping in ad hoc radio networks
    • DOI 10.1016/S0020-0190(01)00312-X, PII S002001900100312X
    • L. Gasieniec and A. Lingas, "On Adaptive Deterministic Gossiping in Ad Hoc Radio Networks," Information Processing Letters, vol. 83, no. 2, pp. 89-93, 2002. (Pubitemid 34524351)
    • (2002) Information Processing Letters , vol.83 , Issue.2 , pp. 89-93
    • Gasieniec, L.1    Lingas, A.2
  • 5
    • 34548362108 scopus 로고    scopus 로고
    • A constant approximation algorithm for interference aware broadcast in wireless networks
    • Z. Chen, C. Qiao, J. Xu, and T. Lee, "A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks," Proc. IEEE INFOCOM, 2007.
    • (2007) Proc. IEEE INFOCOM
    • Chen, Z.1    Qiao, C.2    Xu, J.3    Lee, T.4
  • 7
    • 52449130056 scopus 로고    scopus 로고
    • Broadcast scheduling in interference environment
    • Nov.
    • S. C.-H. Huang, P.-J. Wan, J. Deng, and Y. S. Han, "Broadcast Scheduling in Interference Environment," IEEE Trans. Mobile Computing, vol. 7, no. 11, pp. 1338-1348, Nov. 2008.
    • (2008) IEEE Trans. Mobile Computing , vol.7 , Issue.11 , pp. 1338-1348
    • Huang, S.C.-H.1    Wan, P.-J.2    Deng, J.3    Han, Y.S.4
  • 10
    • 0042474515 scopus 로고    scopus 로고
    • On-demand power management for ad hoc networks
    • R. Zheng and R. Kravets, "On-Demand Power Management for Ad Hoc Networks," Proc. IEEE INFOCOM, 2003.
    • (2003) Proc. IEEE INFOCOM
    • Zheng, R.1    Kravets, R.2
  • 12
    • 34548398442 scopus 로고    scopus 로고
    • Asynchronous random sleeping for sensor networks
    • C. Hua and T.-S. P. Yum, "Asynchronous Random Sleeping for Sensor Networks," ACM Trans. Sensor Networks, vol. 3, no. 3, p. 15, 2007.
    • (2007) ACM Trans. Sensor Networks , vol.3 , Issue.3 , pp. 15
    • Hua, C.1    Yum, P.T.-S.2
  • 13
    • 70449479008 scopus 로고    scopus 로고
    • Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks
    • J. Hong, J. Cao, W. Li, S. Lu, and D. Chen, "Sleeping Schedule-Aware Minimum Latency Broadcast in Wireless Ad Hoc Networks," Proc. IEEE Int'l Conf. Comm., 2009.
    • (2009) Proc. IEEE Int'l Conf. Comm.
    • Hong, J.1    Cao, J.2    Li, W.3    Lu, S.4    Chen, D.5
  • 14
    • 0022184360 scopus 로고
    • On broadcasting in radio networks - Problem analysis and protocol design
    • I. Chlamtac and S. Kutten, "On Broadcasting in Radio Networks - Problem Analysis and Protocol Design," IEEE Trans. Comm., vol. C-33, no. 12, pp. 1240-1246, Dec. 1985. (Pubitemid 16539622)
    • (1985) IEEE Transactions on Communications , vol.COM-33 , Issue.12 , pp. 1240-1246
    • Chlamtac, I.1    Kutten, S.2
  • 15
    • 0026122424 scopus 로고
    • The wave expansion approach to broadcasting in multihop radio networks
    • Mar.
    • I. Chlamtac and O. Weinstein, "The Wave Expansion Approach to Broadcasting in Multihop Radio Networks," IEEE Trans. Comm., vol. 39, no. 3, pp. 426-433, Mar. 1991.
    • (1991) IEEE Trans. Comm. , vol.39 , Issue.3 , pp. 426-433
    • Chlamtac, I.1    Weinstein, O.2
  • 16
    • 0001002898 scopus 로고
    • Tree-based broadcasting in multihop radio networks
    • Oct.
    • I. Chlamtac and S. Kutten, "Tree-Based Broadcasting in Multihop Radio Networks," IEEE Trans. Computers, vol. C-36, no. 10, pp. 1209-1223, Oct. 1987.
    • (1987) IEEE Trans. Computers , vol.C-36 , Issue.10 , pp. 1209-1223
    • Chlamtac, I.1    Kutten, S.2
  • 18
    • 0037547762 scopus 로고    scopus 로고
    • On reducing broadcast redundancy in mobile ad hoc networks
    • W. Lou and J. Wu, "On Reducing Broadcast Redundancy in Mobile Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 1, no. 2, pp. 111-123, 2002.
    • (2002) IEEE Trans. Mobile Computing , vol.1 , Issue.2 , pp. 111-123
    • Lou, W.1    Wu, J.2
  • 20
    • 0036591068 scopus 로고    scopus 로고
    • Fast broadcasting and gossiping in radio networks
    • M. Chrobak, L. Gasiniec, and W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks," J. Algorithms, vol. 43, no. 2, pp. 177-189, 2002.
    • (2002) J. Algorithms , vol.43 , Issue.2 , pp. 177-189
    • Chrobak, M.1    Gasiniec, L.2    Rytter, W.3
  • 23
    • 70349661806 scopus 로고    scopus 로고
    • Duty-cycle-aware broadcast in wireless sensor networks
    • F. Wang and J. Liu, "Duty-Cycle-Aware Broadcast in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.
    • (2009) Proc. IEEE INFOCOM
    • Wang, F.1    Liu, J.2
  • 24
    • 70450231628 scopus 로고    scopus 로고
    • Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
    • S. Guo, Y. Gu, B. Jiang, and T. He, "Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links," Proc. ACM MobiCom, 2009.
    • (2009) Proc. ACM MobiCom
    • Guo, S.1    Gu, Y.2    Jiang, B.3    He, T.4
  • 25
    • 1642408650 scopus 로고    scopus 로고
    • Distributed construction of connected dominating set in wireless ad hoc networks
    • P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Mobile Networks and Applications, vol. 9, no. 2, pp. 141-149, 2004.
    • (2004) Mobile Networks and Applications , vol.9 , Issue.2 , pp. 141-149
    • Wan, P.-J.1    Alzoubi, K.M.2    Frieder, O.3
  • 26
    • 0020781464 scopus 로고
    • Smallest-last ordering and clustering and graph coloring algorithms
    • D. W. Matula and L. L. Beck, "Smallest-Last Ordering and Clustering and Graph Coloring Algorithms," J. Assoc. of Computing Machinery, vol. 30, no. 3, pp. 417-427, 1983.
    • (1983) J. Assoc. of Computing Machinery , vol.30 , Issue.3 , pp. 417-427
    • Matula, D.W.1    Beck, L.L.2
  • 27
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , Issue.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 28
    • 70349658421 scopus 로고    scopus 로고
    • Distributed data aggregation scheduling in wireless sensor networks
    • B. Yu, J. Li, and Y. Li, "Distributed Data Aggregation Scheduling in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.
    • (2009) Proc. IEEE INFOCOM
    • Yu, B.1    Li, J.2    Li, Y.3


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