Find Jobs
Hire Freelancers

Route Caching mechanism for AODV Protocol

₹1500-12500 INR

진행 중
게시됨 거의 6년 전

₹1500-12500 INR

제출할때 지불됩니다
1-Each node now has a separate queue (apart from the queue which AODV has for maintaining routing information) which acts as a cache for the routes. For this purpose, we have used the same queue structure which AODV uses for maintaining its routes. 2. To reduce the problem of stale caching, a cache timer is introduced in the caches and an appropriate cache timeout value is found to get the maximum efficiency from the cache even in the case of high mobility (low pause time). So any route that does not get updated within the cache timeout period from the time of its addition to the cache, is discarded as stale. 3. Route request packets (RREQ) should be able to carry the node addresses and latest sequence numbers (It is the same sequence number as used by AODV to check the freshness of a route) of the intermediate nodes they have passed before reaching the destination node. For this purpose, we have implemented a special data structure in the AODV RREQ packet header which forms a link list of node addresses and sequence numbers of the nodes through which the packet has crossed. 4. All the nodes on receiving a route request packet should, apart from doing their already specified tasks, read the node addresses and sequence numbers in the packet and add them to their caches as the nodes reachable from the last node through which the packet is coming. Then before broadcasting the packet to the neighbouring nodes, the nodes should append their own address and a latest unused sequence number into the packet. 5. As AODV is not a source routing protocol like DSR, so caching of routes can cause the problem of looping of data packets because of deletion of routes due to cache timeout. In order to avoid the looping of packets, a packet sequence number is generated by the source node before sending the packet by incrementing by one the last sequence number used by that node. This sequence number is attached with each packet so that the packet sequence number along with the source id uniquely determines a packet and so nodes can detect the packets forwarded by them self. On encountering a packet which has looped, the node drops the packet and deletes the path on which it was last forwarded which resulted in the loop and informs the source of the packet that the path to the destination does not exist any more. 6. Caching of routes enables intermediate nodes to salvage data packets as alternate routes may be available with every node. So if the older route breaks, the intermediate node which detects the route failure first looks for an alternate route in its cache and if it finds any route, it sends the packet on that route. But it informs the source that the old route has expired so that the source can initiate route discovery to find a new route. This prevents over lengthening of routes after many routes have expired.
프로젝트 ID: 17185358

프로젝트 정보

2 제안서
원격근무 프로젝트
활동 중 6년 전

돈을 좀 벌 생각이십니까?

프리랜서 입찰의 이점

예산 및 기간 설정
작업 결과에 대한 급여 수급
제안의 개요를 자세히 쓰세요
무료로 프로젝트에 신청하고 입찰할 수 있습니다
프로젝트를 수여된 사용자:
사용자 아바타
₹10,000 INR 3일에
5.0 (2 건의 리뷰)
0.6
0.6
2 이 프로젝트에 프리랜서들의 평균 입찰은 ₹8,889 INR입니다.
사용자 아바타
hello,sir. I'm a professional programmer with 9 years of experience. I've already done this kind of project before. If you award me, I'll implement all of your requirements in a short time. Route Caching mechanism for AODV Protocol C Programming,
₹7,777 INR 47일에
5.0 (5 건의 리뷰)
6.0
6.0

고객에 대한 정보

국기 (SRI LANKA)
Sri Lanka
0.0
0
결제 수단 확인
4월 23, 2018부터 회원입니다

고객 확인

감사합니다! 무료 크레딧을 신청할 수 있는 링크를 이메일로 보내드렸습니다.
이메일을 보내는 동안 문제가 발생했습니다. 다시 시도해 주세요.
등록 사용자 전체 등록 건수(일자리)
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
미리 보기 화면을 준비 중...
위치 정보 관련 접근권이 허용되었습니다.
고객님의 로그인 세션이 만료되어, 자동으로 로그아웃 처리가 되었습니다. 다시 로그인하여 주십시오.