A study of token traversal strategies on tree-based backbones for mobile ad hoc - Delay tolerant networks
Conference proceedings article
ผู้เขียน/บรรณาธิการ
กลุ่มสาขาการวิจัยเชิงกลยุทธ์
ไม่พบข้อมูลที่เกี่ยวข้อง
รายละเอียดสำหรับงานพิมพ์
รายชื่อผู้แต่ง: Piyatumrong A., Bouvry P., Guinand F., Lavangnananda K.
ผู้เผยแพร่: Hindawi
ปีที่เผยแพร่ (ค.ศ.): 2009
ISBN: 9781424439416
นอก: 0146-9428
eISSN: 1745-4557
ภาษา: English-Great Britain (EN-GB)
บทคัดย่อ
Tree-based backbone establishment and maintenance in Mobile Ad hoc - Delay Tolerant Networks is often operated through the use of traversing tokens. A study and framework are proposed here for various token traversal strategies on tree-based backbones. The proposed strategies execute in a distributed and purely decentralized manner, and require only 1-hop knowledge. Aiming at providing the highest robustness and quality of services, these token-traversal strategies are studied in particular with an algorithm for merging and maintaining the different trees based on the quality of the nodes. For the robustness aspect, the use of a trust-based evaluation framework is assumed and the weights of the different nodes are based on their quality of cooperation. Three cost functions are implemented in order to evaluate the trust based framework proposed, including another function for evaluating tree-convergence time. Results and comparison charts are provided to illustrate the trade-off between the various strategies in terms of performance, cost (memory and communication) and robustness. ฉ2009 IEEE.
คำสำคัญ
Cooperative networks, Purely decentralized and distributed algorithms, Spanning forest, Token-based distributed algorithm, Wireless and mobile techniques for delay tolerant
ติดต่อสอบถามเพิ่มเติมได้ที่