메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Contention-based neighborhood estimation

Author keywords

Cooperative networks; Neighborhood estimation; Slotted random access

Indexed keywords

APRIORI; BUSY TONE; CONTENTION-BASED; COOPERATIVE NETWORKS; MATHEMATICAL ANALYSIS; MEDIUM ACCESS PROTOCOL; NETWORK TOPOLOGY; NUMERICAL SIMULATION; PROBABILISTIC TECHNIQUE; QUERYING NODES; RANDOM ACCESS; RFID SYSTEMS; TIME PERIODS; TIME SLOTS;

EID: 77954897647     PISSN: 15502252     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VETECS.2010.5493728     Document Type: Conference Paper
Times cited : (7)

References (11)
  • 1
    • 29644436745 scopus 로고    scopus 로고
    • Medium access control protocols for ad hoc wireless networks: A survey
    • S. Kumar, V. S. Raghavan, and J. Deng. Medium access control protocols for ad hoc wireless networks: A survey. Ad Hoc Networks, 4(3):326-358, 2006.
    • (2006) Ad Hoc Networks , vol.4 , Issue.3 , pp. 326-358
    • Kumar, S.1    Raghavan, V.S.2    Deng, J.3
  • 2
    • 0036564997 scopus 로고    scopus 로고
    • Uniform leader election protocols for radio networks
    • May
    • K. Nikano and S. Olariu. Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst., 13(5):516-526, May 2002.
    • (2002) IEEE Trans. Parallel Distrib. Syst. , vol.13 , Issue.5 , pp. 516-526
    • Nikano, K.1    Olariu, S.2
  • 3
    • 77951617276 scopus 로고    scopus 로고
    • CoRe-MAC: A MAC-protocol for cooperative relaying in wireless networks
    • Honolulu, Hawaii, Dec
    • H. Adam, W. Elmenreich, C. Bettstetter, and S. M. Senouci. CoRe-MAC: A MAC-protocol for cooperative relaying in wireless networks. In Proc. IEEE GLOBECOM, Honolulu, Hawaii, Dec 2009.
    • (2009) Proc. IEEE GLOBECOM
    • Adam, H.1    Elmenreich, W.2    Bettstetter, C.3    Senouci, S.M.4
  • 4
    • 0002544335 scopus 로고
    • ALOHA packet system with and without slots and capture
    • L. G. Roberts. ALOHA packet system with and without slots and capture. ACM SIGCOMM Comput. Commun. Rev., 5(2):28-42, 1975.
    • (1975) ACM SIGCOMM Comput. Commun. Rev. , vol.5 , Issue.2 , pp. 28-42
    • Roberts, L.G.1
  • 5
    • 0030230721 scopus 로고    scopus 로고
    • Using anytime algorithms in intelligent systems
    • S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996.
    • (1996) AI Magazine , vol.17 , Issue.3 , pp. 73-83
    • Zilberstein, S.1
  • 6
    • 0030536433 scopus 로고    scopus 로고
    • A comparision of approximate interval estimators for the Bernoulli parameter
    • L. M. Leemis and K. S. Trivedi. A comparision of approximate interval estimators for the Bernoulli parameter. The American Statistician, 50:63-68, 1996.
    • (1996) The American Statistician , vol.50 , pp. 63-68
    • Leemis, L.M.1    Trivedi, K.S.2
  • 8
    • 85088055882 scopus 로고    scopus 로고
    • Fast and reliable estimation schemes in RFID systems
    • Los Angeles, CA, Sep.
    • M. Kodialam and T. Nandgopal. Fast and reliable estimation schemes in RFID systems. In Proc. ACM MobiCom, Los Angeles, CA, Sep. 2006.
    • (2006) Proc. ACM MobiCom
    • Kodialam, M.1    Nandgopal, T.2
  • 9
    • 77954920713 scopus 로고    scopus 로고
    • Estimating the number of neighbours and their distribution in an underwater communication network (UWCN)
    • Canberra, Australia, Nov
    • S. A. Howlader, M. R. Frater, and M. J. Ryan. Estimating the number of neighbours and their distribution in an underwater communication network (UWCN). In Proc. Mil. Commun. Inf. Syst. (MiLCIS), Canberra, Australia, Nov 2007.
    • (2007) Proc. Mil. Commun. Inf. Syst. (MiLCIS)
    • Howlader, S.A.1    Frater, M.R.2    Ryan, M.J.3
  • 10
    • 24944550243 scopus 로고    scopus 로고
    • SDJS: Efficient statistics in wireless networks
    • Berlin, Germany, Oct
    • A. Krohn, M. Beigl, and S. Wendhack. SDJS: Efficient statistics in wireless networks. In Proc. IEEE ICNP, Berlin, Germany, Oct 2004.
    • (2004) Proc. IEEE ICNP
    • Krohn, A.1    Beigl, M.2    Wendhack, S.3
  • 11
    • 0025449292 scopus 로고
    • A linear-time probabilistic counting algorithm for database applications
    • K. Whang, B. T. Vander-Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Sys., 15, 1990.
    • (1990) ACM Trans. Database Sys. , vol.15
    • Whang, K.1    Vander-Zanden, B.T.2    Taylor, H.M.3


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