메뉴 건너뛰기




Volumn 12, Issue 6, 2013, Pages 2688-2696

Performance bounds and latency-optimal scheduling for convergecast in wireless HART networks

Author keywords

Convergecast; multi channel communication; TDMA scheduling; WirelessHART

Indexed keywords

COMPUTATIONAL COSTS; CONVERGECAST; INDUSTRIAL MONITORING; MULTICHANNEL COMMUNICATION; PERFORMANCE BOUNDS; SCHEDULING POLICIES; TDMA SCHEDULING; WIRELESSHART;

EID: 84880170039     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2013.050313.120543     Document Type: Article
Times cited : (42)

References (21)
  • 3
    • 79551650385 scopus 로고    scopus 로고
    • Optimal routing and scheduling of deadline-constrained traffic over lossy networks
    • P. Soldati, H. Zhang, Z. Zou, and M. Johansson, "Optimal routing and scheduling of deadline-constrained traffic over lossy networks," in Proc. 2010 IEEE GLOBECOM, pp. 1-6.
    • Proc 2010 IEEE GLOBECOM , pp. 1-6
    • Soldati, P.1    Zhang, H.2    Zou, Z.3    Johansson, M.4
  • 8
    • 38549133821 scopus 로고    scopus 로고
    • Distributed time-optimal scheduling for convergecast in wireless sensor networks
    • S. Gandham, Y. Zhang, and Q. Huang, "Distributed time-optimal scheduling for convergecast in wireless sensor networks," Computer Networks, vol. 52, pp. 610-629, 2008.
    • (2008) Computer Networks , vol.52 , pp. 610-629
    • Gandham, S.1    Zhang, Y.2    Huang, Q.3
  • 11
    • 35448968615 scopus 로고    scopus 로고
    • Cross-layer design for end-to-end throughput and fairness enhancement in multi-channel wireless mesh networks
    • DOI 10.1109/TWC.2007.05934
    • J. Tang, G. Xue, and W. Zhang, "Cross-layer design for end-to-end throughput and fairness enhancement in multi-channel wireless mesh networks," IEEE Trans. Wireless Commun., vol. 20, pp. 3482-3486, 2007. (Pubitemid 47625147)
    • (2007) IEEE Transactions on Wireless Communications , vol.6 , Issue.10 , pp. 3482-3486
    • Tang, J.1    Xue, G.2    Zhang, W.3
  • 17
    • 77649272543 scopus 로고    scopus 로고
    • Joint routing, channel assignment, and scheduling for throughput maximization in general interference models
    • M. Al-Ayyoub and H. Gupta, "Joint routing, channel assignment, and scheduling for throughput maximization in general interference models," IEEE Trans. Mobile Computing, vol. 9, pp. 553-565, 2010.
    • (2010) IEEE Trans. Mobile Computing , vol.9 , pp. 553-565
    • Al-Ayyoub, M.1    Gupta, H.2
  • 18
    • 51849138128 scopus 로고    scopus 로고
    • Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
    • R. Jothi and B. Raghavachari, "Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design," ACM Trans. Algorithms, vol. 1, pp. 265-282, 2005.
    • (2005) ACM Trans. Algorithms , vol.1 , pp. 265-282
    • Jothi, R.1    Raghavachari, B.2


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