상세 보기
초록
Mobile ad hoc network consists of nodes with mobility thus resulting in frequent route breakage. Considering this problem, in this paper, we propose a novel routing algorithm which constrains the distance to next relay node to increase route life time in mobile ad hoc networks (MANET). By limiting the distance to next relay node, our algorithm lengthened route lifetime and enhanced the throughput. In the simulation part, we analyzed the impact of node speed and node density on the proposed algorithm and we used LAR for comparison. Simulation results showed that the proposed algorithm have a longer lifetime and higher throughput than LAR. However, our algorithm has a longer latency than LAR due to the increased hop count.
키워드
Distance to next relay node; Multi hop MANET; Route lifetime; Distance to next relay node; Hop count; Life-times; Multi hop ad hoc networks; Multi hop MANET; Next-hop selection; Node density; Relay node; Route lifetime; Simulation result; Access control; Mobile ad hoc networks; Mobile telecommunication systems; Routing algorithms; Technical presentations; Telecommunication links; Wireless telecommunication systems; Ad hoc networks
- 제목
- Routing algorithm limiting next hop selection distance in multi hop ad hoc networks
- 저자
- Wu, Yong Shou; Lee, Do-Hyeon; Jung, Jae-Il
- 발행일
- 2009-06
- 유형
- Conference Paper
- 저널명
- Proceedings - 2009 IEEE International Conference on Communications Workshops, ICC 2009
- 페이지
- 1 ~ 4