Earticle

현재 위치 Home

An Effective RSU Allocation Strategy for Maximizing Vehicular Network Connectivity

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJCA) 바로가기
  • 간행물
    International Journal of Control and Automation SCOPUS 바로가기
  • 통권
    Vol.6 No.4 (2013.08)바로가기
  • 페이지
    pp.259-270
  • 저자
    Jeonghee Chi, Yeongwon Jo, Hyunsun Park, Taehyeon Hwang, Soyoung Park
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A207813

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
Roadside Unit (RSU) in Vehicular Ad-hoc Network (VANET) is an essential unit usually placed at intersections to collect and analyze traffic data given from smart vehicles. Due to the costs of RSU setup, effective RSU allocation is one of important issues in VANET. In this paper, we provide an optimal RSU allocation algorithm with a concept of intersection-connectivity between intersections. We initially find optimal RSU candidate intersections which can cover the entire intersections, in the meantime minimizing the overlapped transmission coverage of RSUs. Then we repeatedly eliminate RSU candidates by the value of intersection-connectivity between RSU candidate intersections. The intersection-connectivity between two intersections is basically measured by the number of vehicles with the same moving pattern such that pass through both intersections. Thus, a high value of intersection-connectivity between two intersections stands for that the traffic information obtained at one intersection can be carried-and-forwarded to the other intersection with a high probability by those vehicles. With this feature, we repeatedly remove RSUs having high intersection-connectivity with its neighbors. Finally, we provide simulated analyses of our algorithms using real urban roadmaps of JungGu and Seochogu in Seoul. We analyze how our algorithms work in different types of roadways with real traffic data, and find the optimal number and positions of RSUs in these areas.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Assumption and Definition
  3.1 RSU Configuration
  3.2 Intersection Priority
  3.3 Intersection Connectivity
  3.4 RSU Connectivity and Coverage
  3.5 Notation
 4. Intersection Connectivity-based RSU Allocation
  4.1 Initial RSU Candidate Selection
  4.2 RSU Connectivity Network Construction
  4.3 RSU Candidate Elimination
 5. Simulation Results
  5.1 Simulation Environment
  5.2 Analysis of Simulation Results
 6. Conclusion
 Acknowledgements
 References

키워드

RSU Allocation Optimal Algorithm Intersection Connectivity VANET

저자

  • Jeonghee Chi [ Department of Internet and Media Engineering, Konkuk University ]
  • Yeongwon Jo [ Department of Internet and Media Engineering, Konkuk University ]
  • Hyunsun Park [ Department of Internet and Media Engineering, Konkuk University ]
  • Taehyeon Hwang [ Department of Internet and Media Engineering, Konkuk University ]
  • Soyoung Park [ Department of Internet and Media Engineering, Konkuk University ] Corresponding Author

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJCA) [Science & Engineering Research Support Center, Republic of Korea(IJCA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Control and Automation
  • 간기
    월간
  • pISSN
    2005-4297
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Control and Automation Vol.6 No.4

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장