| A Probabilistic Routing Mechanism Considering the Encounter Frequency in the Battlefield Environment |
|
Jongmok Lee, Kyungran Kang, Young-Jong Cho |
|
Ajou University |
| 전장 환경에서 접촉 횟수 정보를 고려한 확률적 라우팅 기법 |
|
이종목, 강경란, 조영종 |
|
아주대학교 |
|
|
| Abstract |
|
The network nodes in a tactical network moves continuously and due to the physical and electronic obstacles, the connections are not always available. Due to the frequent disconnections, it is hard to discover the path among the nodes in a DTN. According to PROPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity), one of the most well-known DTN routing protocols, a DTN node determines whom to forward a packet according to the packet delivery probability. From the viewpoint of a node, the packet delivery probability of another node is degraded while the nodes are disconnected whereas it is improved when they encounter. In this paper, we enhance the algorithm estimating the packet probability by considering the encounter count as an additional parameter. Our algorithm prefers the node that encounters the destination more frequently in selecting the next hop toward the destination. We evaluated the performance of our algorithm by simulating military operations using a DTN-dedicated simulator. Through the simulations, we show that our proposed algorithm achieve higher packet delivery ratio with similar overhead compared with PROPHET. |
| Key Words:
PROPHET, Probabilistic Routing, Encounter Frequency, DTN, Tactical Network |
|
PDF Links
Full text via DOI
Download Citation
