메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 663-667

Mobile agent based TDMA slot assignment algorithm for wireless sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLORING; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPHIC METHODS; HEURISTIC METHODS; PROBLEM SOLVING; SENSORS;

EID: 24744447017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itcc.2005.201     Document Type: Conference Paper
Times cited : (13)

References (7)
  • 1
    • 0020765471 scopus 로고
    • Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
    • S. T. McCormick, "Optimal approximation of sparse hessians and its equivalence to a graph coloring problem," In Math programming, 1983.
    • (1983) Math Programming
    • McCormick, S.T.1
  • 2
    • 0027574594 scopus 로고
    • Scheduling algorithms for multihop radio networks
    • Ram Ramnathan and Enrol L. Llyod, "Scheduling algorithms for multihop radio networks," In IEEE Transactions on Networking, 1:166-177, 1993.
    • (1993) IEEE Transactions on Networking , vol.1 , pp. 166-177
    • Ramnathan, R.1    Llyod, E.L.2
  • 3
    • 0029754883 scopus 로고    scopus 로고
    • A new model for scheduling packet radio networks
    • Arunabha Sen and Mark L. Huson, "A new model for scheduling packet radio networks," In IEEE INFOCOM, pages 1116-1124, 1996.
    • (1996) IEEE INFOCOM , pp. 1116-1124
    • Sen, A.1    Huson, M.L.2
  • 4
    • 0029515785 scopus 로고
    • Broadcast scheduling algorithms for radio networks
    • Mark L. Huson and Arunabha Sen, "Broadcast scheduling algorithms for radio networks," In IEEE MILCOM, pages 647-651, 1995.
    • (1995) IEEE MILCOM , pp. 647-651
    • Huson, M.L.1    Sen, A.2
  • 5
    • 0010547147 scopus 로고    scopus 로고
    • On-line coloring of sparse random graphs and random trees
    • B. Pittel, R. Weishaar, "On-line coloring of sparse random graphs and random trees," In Journal on Algorithms, 195-205, 1997.
    • (1997) Journal on Algorithms , pp. 195-205
    • Pittel, B.1    Weishaar, R.2
  • 6
    • 0037202494 scopus 로고    scopus 로고
    • The on-line first-fit algorithm for radio frequency assignment problems
    • Yin-Te Tsai, Yaw-Ling Lin, F.R. Hsub, "The on-line first-fit algorithm for radio frequency assignment problems," In information processing letters, 195-199, 2002.
    • (2002) Information Processing Letters , pp. 195-199
    • Tsai, Y.-T.1    Lin, Y.-L.2    Hsub, F.R.3
  • 7
    • 0035392871 scopus 로고    scopus 로고
    • A five-phase reservation protocol (FPRP) for mobile ad hoc networks
    • July
    • C. Zhu and M. S. Corson, "A five-phase reservation protocol (FPRP) for mobile ad hoc networks," Wireless Networks, vol. 7, pp. 371-384, July 2001.
    • (2001) Wireless Networks , vol.7 , pp. 371-384
    • Zhu, C.1    Corson, M.S.2


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