메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Yoshihiro Kaneko (Gifu University)
저널정보
대한전자공학회 ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications ITC-CSCC 2015
발행연도
2015.6
수록면
717 - 720 (4page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
An ad-hoc network requires no fixed infrastructure, which is composed of terminals that communicate with each other as well as transmit data like a router. For load balancing, we have proposed to apply node centrality measure, to one of the most popular routing protocol DSDV. Our proposal idea is to avoid nodes located in the central area as far as possible. We have tested its validity on network simulator ns-3. However, its effectiveness seems yet limited at present. Thus, in order to develop our proposal, we observe properties of obtained routes. This paper discusses the relation between relay nodes on those routes and central node in viewpoint of avoidance. First we locate central nodes by three node centrality measures such as closeness, degree and betweenness. We deal with sixty network models with link density 5 to 10%. As a result, we show that betweenness centrality measure always provides single central node. Next we examine how far those obtained routes pass from central node. Finally, of the three measures, we show that closeness centrality-aware routing provides routes whose relay nodes are the most distant on average from central node.

목차

Abstract
1. Introduction
2. Preparation
3. Avoidance from central node
4. Conclusion
References

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2016-569-001694181