By Topic

Trusted Spanning Tree for Delay Tolerant MANETs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Piyatumrong, A. ; CSC, Univ. du Luxembourg, Luxembourg ; Bouvry, P. ; Guinand, F. ; Lavangnananda, K.

Quality of service (QoS) is an important issue in delay tolerant mobile ad-hoc networks (DTMs). This work attempts to improve the QoS in DTMs by relying on spanning forests algorithms. The existing algorithms are improved by introducing the notion of trust and choosing the most robust (trustable) spanning trees among existing opportunities. The robustness/quality of the tree can be assessed based on two cost functions. In order to improve QoS in a DTM, a greedy-based heuristic is proposed to the existing algorithms and becomes G-TRUST. To aid efficient break away of low-trust node, another heuristic, BREAK heuristic, is further incorporated to G-TRUST (G-TRUST BREAK). Simulation on realistic mobility models were carried out on both G-TRUST and G-TRUST BREAK. Their results verified the advantages of incorporating these heuristics.

Published in:

Embedded and Ubiquitous Computing, 2008. EUC '08. IEEE/IFIP International Conference on  (Volume:2 )

Date of Conference:

17-20 Dec. 2008