This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like disappearance of mobile devices, connection disruptions, network partitioning, etc. Techniques based on tree topologies are well known for increasing the efficiency of network protocols and/or...

This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably elimi...

Wireless Sensor Networks (WSNs) have an important issue in dynamically organizing the sensors into a network and routing the data from sensors to the base station. Clustering in WSNs is an effective technique for prolonging the network lifetime. The effectiveness of WSNs purely depends on the data collection scheme. Various data collection schemes such as multipath routing, tree, clustering and...

The attributes’ interdependencies have strong effect on understandability of tree based models. If strong dependencies between the attributes are not recognized and these attributes are not used as splits near the root of the tree this causes node replications in lower levels of the tree, blurs the description of dependencies and also might cause drop of accuracy. If Relief family of algorithms...

An edge-coloured graph G is called rainbow-connected if any two vertices are connected by a path whose edges have different colours. This concept of rainbow connection in graphs was recently introduced by Chartrand et al. in [4]. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. An easy ob...

This work provides a general framework for the analysis and synthesis of a class of linear networked dynamic systems (NDS). We focus our attention on NDS where the underlying connection topology couples the agents at their outputs. A distinction is made between NDS with homogeneous agent dynamics and NDS with heterogeneous agent dynamics. In the homogeneous setting, the H2 norm expression reduc...

Tujuan penelitian ini adalah untuk memberikan Quality of Service yang baik bagi seluruh pengguna internet dalam suatu jaringan dengan cara memanajemen bandwidth metode Peer Connection Queue (PCQ) menggunakan Tree. Dengan menerapkan Tree, maka setiap user mengakses akan mendapatkan alokasi merata. Pengujian Mikrotik RouterBoard beberapa komputer disambungkan via wired dan perangkat melalui wirel...