Xu Li, Nathalie Mitton, Amiya Nayak, Ivan Stojmenovic
언어
영어(ENG)
URL
https://www.earticle.net/Article/A188459
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
영어
We propose applying the concept of Cost-to-Progress Ratio (CPR) in position-based greedy routing for load reduction and balancing. The load of a node is the percentage of time it is occupied by forwarding traffic or the inability to forward due to interference. The resultant routing protocol, named CPR-routing, is a localised parameter-less approach, optimising the ratio of nodal load and geographic progress. Through extensive simulation, we evaluate it in comparison with an existing parameter-based localised solution, a -routing. Our simulation results indicate that CPR-routing outperforms a-routing in per node load, success rate, and average hop count.
목차
Abstract I. INTRODUCTION II. LOCALISED LOAD-AWARE GEOGRAPHIC ROUTING A. Definition of Load B. a -routing C. CPR-routing III. PERFORMANCE EVALUATION A. Simulation setup B. Random connected UDGs C. Simulation results IV. CONCLUSIONS REFERENCES BIOGRAPHIES
키워드
load awarenessgeographic routingcost-to-progress ratiowireless ad hoc networks
저자
Xu Li [ Inria Lille – Nord Europe, France ]
Nathalie Mitton [ Inria Lille – Nord Europe, France ]
Amiya Nayak [ EECS, University of Ottawa, Canada ]
Ivan Stojmenovic [ EECS, University of Ottawa, Canada ]