메뉴 건너뛰기




Volumn 3816 LNCS, Issue , 2005, Pages 69-81

Self-stabilizing deterministic TDMA for sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

CLOCK DRIFT; DISTRIBUTED ALGORITHMS; MEMORY SHARING; SENSOR NETWORKS;

EID: 33744915015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604655_11     Document Type: Conference Paper
Times cited : (19)

References (25)
  • 2
    • 0009598568 scopus 로고    scopus 로고
    • Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizies using read/write atomicity
    • G. Antonoiu and P. K. Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizies using read/write atomicity. Euro-par'99 Parallel Processing, 1999.
    • (1999) Euro-par'99 Parallel Processing
    • Antonoiu, G.1    Srimani, P.K.2
  • 5
    • 84976834622 scopus 로고
    • Self-stabilizing systems in spite of distributed control
    • E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 1974.
    • (1974) Communications of the ACM
    • Dijkstra, E.W.1
  • 9
    • 33747823178 scopus 로고    scopus 로고
    • SS-TDMA: A self-stabilizing MAC for sensor networks
    • IEEE Press, to appear
    • S. S. Kulkarni and M. Arumugam. SS-TDMA: A self-stabilizing MAC for sensor networks. In Sensor Network Operations. IEEE Press, 2005, to appear.
    • (2005) Sensor Network Operations
    • Kulkarni, S.S.1    Arumugam, M.2
  • 13
    • 33745005488 scopus 로고    scopus 로고
    • BitMAC: A deterministic, collision-free, and robust MAC protcol for sensor networks
    • M. Ringwald and K. Römer. BitMAC: A deterministic, collision-free, and robust MAC protcol for sensor networks. European Workshop on Sensor Networks, 2005.
    • (2005) European Workshop on Sensor Networks
    • Ringwald, M.1    Römer, K.2
  • 19
    • 0034318605 scopus 로고    scopus 로고
    • Self-stabilizing depth-first token circulation in arbitrary rooted networks
    • A. K. Datta, C. Johnen, F. Petit, and V. Villain. Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing, 13:207-218, 2000.
    • (2000) Distributed Computing , vol.13 , pp. 207-218
    • Datta, A.K.1    Johnen, C.2    Petit, F.3    Villain, V.4
  • 21
    • 33744903346 scopus 로고    scopus 로고
    • Self-stabilizing deterministic TDMA for sensor networks
    • Michigan State University
    • M. Arumugam and S. S. Kulkarni. Self-stabilizing deterministic TDMA for sensor networks. Technical Report MSU-CSE-05-19, Michigan State University, 2005.
    • (2005) Technical Report , vol.MSU-CSE-05-19
    • Arumugam, M.1    Kulkarni, S.S.2
  • 23
    • 0027574594 scopus 로고
    • Scheduling algorithms for multihop radio networks
    • April
    • S. Ramanathan and E. L. Lloyd. Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking, 1(2): 166-177, April 1993.
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , Issue.2 , pp. 166-177
    • Ramanathan, S.1    Lloyd, E.L.2
  • 24
    • 0035506896 scopus 로고    scopus 로고
    • Models and approximation algorithms for channel assignment in radio networks
    • S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wireless networks, 2001.
    • (2001) Wireless Networks
    • Krumke, S.O.1    Marathe, M.V.2    Ravi, S.S.3


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