Results 1-4 of 4.
piyatumrong

Bookmark and Share    
Full Text
Peer Reviewed
See detailTransforming Collaboration Data into Network Layers for Enhanced Analytics
Esmaeilzadeh Dilmaghani, Saharnaz UL; Piyatumrong, Apivadee; Bouvry, Pascal UL et al

in International Conference on Optimization and Learning (2019)

We consider the problem of automatically generating networks from data of collaborating researchers. The objective is to apply network analysis on the resulting network layers to reveal supplemental ... [more ▼]

We consider the problem of automatically generating networks from data of collaborating researchers. The objective is to apply network analysis on the resulting network layers to reveal supplemental patterns and insights of the research collaborations. In this paper, we describe our data-to-networks method, which automatically generates a set of logical network layers from the relational input data using a linkage threshold. We, then, use a series of network metrics to analyze the impact of the linkage threshold on the individual network layers. Moreover, results from the network analysis also provide beneficial information to improve the network visualization. We demonstrate the feasibility and impact of our approach using real-world collaboration data. We discuss how the produced network layers can reveal insights and patterns to direct the data analytics more intelligently. [less ▲]

Detailed reference viewed: 29 (10 UL)
Full Text
Peer Reviewed
See detailOptimizing AEDB Broadcasting Protocol with Parallel Multi-objective Cooperative Coevolutionary NSGAII
Dorronsoro, Bernabé UL; Ruiz, Patricia UL; Talbi, El-Ghazali et al

in Optimizing AEDB Broadcasting Protocol with Parallel Multi-objective Cooperative Coevolutionary NSGAII (2014)

Detailed reference viewed: 58 (1 UL)
Full Text
See detailRobust topology management in DT-MANETs: An efficient tree-based decentralized and multi-objective approach
Piyatumrong, Apivadee UL

Doctoral thesis (2010)

Delay-tolerant mobile ad hoc network (DT-MANETs) feature frequent and long duration partitioned MANETs. It is a challenged environment where end-to-end connectivity cannot always be obtained. Furthermore ... [more ▼]

Delay-tolerant mobile ad hoc network (DT-MANETs) feature frequent and long duration partitioned MANETs. It is a challenged environment where end-to-end connectivity cannot always be obtained. Furthermore, communication in such network is heavily relying on collaboration between nodes since there is no central authority. Limited resources of communication nodes present another facet of problems in such network. Moreover, the communication is typically done using wireless technologies which are sharing among communication nodes. In order to provide a better quality of service in such environment, topology management technique is used to help controlling network topology. The aim is to manage network resource and to enhance efficiency of communication. In this work, we proposed to do it by constructing an efficient and robust tree-based topology. We model the environment using dynamic and partitioned graph. Under such circumstances, protocols must withstand topology and condition changing. In summary, doing topology management in DT-MANETs encounters the following issues: cooperation among nodes, limitation of resources of mobile node, sharing medium, dynamic and partitioned topology and unrealistic and unscalable approach of centralized algorithm in such environment. This study focuses on managing tree-based topology in DT-MANETs. A set of active links is managed such that the deterioration of network is avoid and the quality of service in DT-MANETs is enhanced. Efficiency and robustness metrics are proposed accordingly. This work proposed to use different quality criteria based on communication node and edge for the selection topology. Both single- and multi-objectives tree-based topology are studied. Algorithms for managing tree-based topology are proposed according to different objectives. All proposed algorithms are purely decentralized, asynchronous algorithm and use one-hop information. [less ▲]

Detailed reference viewed: 139 (2 UL)
Full Text
Peer Reviewed
See detailToken Traversal Strategies of a Distributed Spanning Forest Algorithm in Mobile Ad hoc - Delay Tolerant Networks
Piyatumrong, Apivadee UL; Ruiz, Patricia UL; Bouvry, Pascal UL et al

in IAIT (2009)

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 ... [more ▼]

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 applications, such as Dynamicity Aware - Graph Relabeling System (DA-GRS). One of the main features of these tree based topologies is the existence of a token traversing in every tree. The use of tokens enables the creation and maintenance of spanning trees in dynamic environments. Subsequently, managing tree-based backbones relies heavily on the token behavior. An efficient and optimal token traversal can highly impact the design of the tree and its usage. In this article, we present a comparison of three distributed and decentralized techniques available for token management, which are Randomness, TABU and Depth First Search. [less ▲]

Detailed reference viewed: 59 (0 UL)