Trusted spanning trees for delay tolerant mobile ad hoc networks
Conference proceedings article
ผู้เขียน/บรรณาธิการ
กลุ่มสาขาการวิจัยเชิงกลยุทธ์
ไม่พบข้อมูลที่เกี่ยวข้อง
รายละเอียดสำหรับงานพิมพ์
รายชื่อผู้แต่ง: Piyatumrong A., Bouvry P., Guinand F., Lavangnananda K.
ผู้เผยแพร่: Hindawi
ปีที่เผยแพร่ (ค.ศ.): 2008
หน้าแรก: 131
หน้าสุดท้าย: 136
จำนวนหน้า: 6
ISBN: 9781424437825
นอก: 0146-9428
eISSN: 1745-4557
ภาษา: English-Great Britain (EN-GB)
บทคัดย่อ
Delay Tolerant Networks (DTNs) are an extension of Mobile Ad-Hoc Networks (MANETs). Global knowledge in DTNs cannot be obtained or guaranteed due to their dynamicity, decentralized nature and non-permanent structure. Managing such networks optimally is very difficult, if not impossible. Trust management in such networks receives much attention recently due to their potential application. One solution for managing information within DTNs lies in constructing and maintaining spanning forests. DA-GRS is a local computation based model for the description of decentralized algorithms designed for dynamically distributed environments like Delay-Tolerant MANETs (DTMs). DA-GRS proposes a framework for constructing and maintaining a spanning forest in such an environment. This work introduces the notion of trust into DA-GRS resulting in T-DA-GRS algorithm. The goal of the proposed algorithms is to construct and maintain robust trusted spanning tree where less trustable nodes are leaves. Three cost functions are suggested as means to assess the robustness of trusted spanning trees. T-DAGRS is also further improved by incorporating greedy algorithm to become T-GDA-GRS. These algorithms were tested with four different networks generated by a DTM simulator known as Madhoc. Efficiency of these algorithms is compared with optimal values. ฉ2008 IEEE.
คำสำคัญ
ไม่พบข้อมูลที่เกี่ยวข้อง
ติดต่อสอบถามเพิ่มเติมได้ที่