Trusted Spanning Tree for Delay Tolerant MANETs

Piyatumrong, Apivadee; Bouvry, Pascal; Guinand, Frédéric; Lavangnananda, Kittichai

doi:10.1109/euc.2008.45

Cited by 3 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both the merging and splitting processes of two trees are purely locally operated. Many works also look beyond the topological aspects and attach specific features to nodes; for example, in Piyatumrong et al [2008], nodes are selected for joining the tree in terms of their level of trust in the network, thus creating more reliable topologies. For a more detailed overview of this type of tree-based topologies, please refer to Piyatumrong [2010].…”

Section: Tree-based Topologymentioning

confidence: 99%

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Ruiz

Bouvry

2015

ACM Comput. Surv.

View full text Add to dashboard Cite

Networking at any time and any place paves the way for a large number of possible applications in ad hoc networks, from disaster relief in remote areas to network extension. Thus, for the past decades, many works have been proposed trying to make ad hoc networks a reality. The importance of broadcasting in networking and the broadcast nature of the wireless medium have encouraged researchers to join their efforts on designing efficient dissemination algorithms for Mobile Ad Hoc Networks (MANETs). The many different challenges that MANETs face, such as limited network resources, network partitions, or energy restrictions, gave rise to many different approaches to overcome one or more of those problems. Therefore, literature reveals a huge variety of techniques that have been proposed for efficient message dissemination. In this article, we make an in-depth review of the existing state-of-the-art techniques, as well as propose a new taxonomy that provides a global overview of the most relevant existing algorithms.

show abstract

Section: Tree-based Topologymentioning

confidence: 99%

Survey on Broadcast Algorithms for Mobile Ad Hoc Networks

Ruiz

Bouvry

2015

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…In order to determine robust trusted spanning trees, the previous work [3] introduced quality measurement for a trusted spanning tree by means of two cost functions. In order to assess the quality of overall network or the trusted spanning forest, this work adopts the idea of those two cost functions and introduces three new cost functions for measuring the spanning forest.…”

Section: Robust Trusted Spanning Tree and Forest In Mobile Ad Homentioning

confidence: 99%

“…The weight() function introduced in previous work [3], can be used to assess trust spanning trees with respect to this objective. Having V (γ) as the set of all nodes in a spanning tree γ, the weight() function of a trusted spanning tree can be determined by the following equation:…”

Section: B Weight() Functionmentioning

confidence: 99%

“…'Greedy Trusted Spanning Tree' or G-TRUST [3] is a distributed algorithm constructing trusted spanning trees in a dynamic network like mobile ad hoc DTNs. This algorithm attempts to create robust spanning forest by relying on the cooperative or trust level of each neighbor.…”

Section: Greedy Trusted Spanning Tree (G-trust)mentioning

confidence: 99%

“…Recently, the paper [3] exploits the existence of such trust/reputation level of each station, and proposes 'Greedy Trusted Spanning Tree' (G-TRUST) algorithm for creating of robust trusted spanning trees (tree-based backbone) in mobile ad hoc DTNs. In this system, it tries to push the lower trust level nodes to the leaves of the tree.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A study of token traversal strategies on tree-based backbones for mobile ad hoc - delay tolerant networks

Piyatumrong

Bouvry

Guinand

et al. 2009

2009 International Conference on Ultra Modern Telecommunications &Amp; Workshops

View full text Add to dashboard Cite

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.

show abstract