메뉴 건너뛰기




Volumn , Issue , 2009, Pages 106-110

ELHFR: A graph routing in industrial wireless mesh network

Author keywords

[No Author keywords available]

Indexed keywords

AODV ROUTING; BREADTH-FIRST; CONNECTED GRAPH; INDUSTRIAL WIRELESS; INDUSTRIAL WIRELESS NETWORK; INTUITIVE UNDERSTANDING; MESH TOPOLOGIES; NETWORK TOPOLOGY; OMNET++; RELIABILITY AND STABILITY; ROUTING MECHANISM; SHORTEST PATH; SIMULATION RESULT; SUBGRAPHS; WIRELESSHART;

EID: 70449686134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICINFA.2009.5204902     Document Type: Conference Paper
Times cited : (33)

References (13)
  • 1
    • 70449681246 scopus 로고    scopus 로고
    • HART communication foundation. August, HCF SPEC 075 Revision 1.0
    • TDMA Data Link Layer, HCF SPEC 075 Revision 1.0. HART communication foundation. August 2007.
    • (2007) TDMA Data Link Layer
  • 2
    • 70449681247 scopus 로고    scopus 로고
    • HART communication foundation. September, HCF SPEC 290 Revision 1.0
    • Wireless Devices Specification, HCF SPEC 290 Revision 1.0. HART communication foundation. September, 2007.
    • (2007) Wireless Devices Specification
  • 3
    • 74249083622 scopus 로고    scopus 로고
    • HART communication foundation. 27 August, HCF SPEC 085, Revision 1.0
    • Network Management Specification, HCF SPEC 085, Revision 1.0. HART communication foundation. 27 August, 2007.
    • (2007) Network Management Specification
  • 4
    • 0742292815 scopus 로고    scopus 로고
    • Ad hoc On-Demand Distance Vector (AODV) routing
    • C. Perkins, E. M. Royer, and S. Das, "Ad hoc On-Demand Distance Vector (AODV) Routing, " IETF RFC 3561, 2003.
    • (2003) IETF RFC 3561
    • Perkins, C.1    Royer, E.M.2    Das, S.3
  • 8
    • 35148847678 scopus 로고    scopus 로고
    • General compact labeling schemes for dynamic trees
    • DOI 10.1007/s00446-007-0035-z
    • A. Korman. General compact labeling schemes for dynamic trees. J. Distributed Computing, 20(3):179-193, 2007. (Pubitemid 47551819)
    • (2007) Distributed Computing , vol.20 , Issue.3 , pp. 179-193
    • Korman, A.1
  • 10
    • 77957963167 scopus 로고    scopus 로고
    • Meshed multipath routing: An efficient strategy in sensor networks
    • New Orleans, LA, Mar.
    • S. De, C. Qiao, and H. Wu, "Meshed multipath routing: An efficient strategy in sensor networks, " in Proc. IEEE WCNC, New Orleans, LA, Mar. 2003.
    • (2003) Proc. IEEE WCNC
    • De, S.1    Qiao, C.2    Wu, H.3
  • 12
    • 0141621107 scopus 로고    scopus 로고
    • Meshed multipath routing with selective forwarding: an efficient strategy in wireless sensor networks
    • De, S., Qiao, C., Wu, H.: Meshed multipath routing with selective forwarding: an efficient strategy in wireless sensor networks. Computer Networks 43(4), 481-497 (2003)
    • (2003) Computer Networks , vol.43 , Issue.4 , pp. 481-497
    • De, S.1    Qiao, C.2    Wu, H.3
  • 13
    • 0001540595 scopus 로고
    • Publicationes Mathematicae Debrecen
    • Erdo″s, P. and Rényi, A. On Random Graphs I. Publicationes Mathematicae Debrecen, 6:290-297. 1959
    • (1959) On Random Graphs I , vol.6 , pp. 290-297
    • Erdos, P.1    Rényi, A.2


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