Please login first
Yezid Donoso   Professor  Senior Scientist or Principal Investigator 
Timeline See timeline
Yezid Donoso published an article in February 2019.
Top co-authors See all
Tilman Wolf

151 shared publications

Department of Electrical and Computer Engineering, University of Massachusetts, Amherst

Anna Nagurney

62 shared publications

Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst, USA

Pere Vilà

34 shared publications

Universitat de Girona, Institut d’ Informática i Aplicacions, Girona, spain

Harold Castro

30 shared publications

Systems and Computing Engineering Department, Universidad de los Andes, Colombia

Carlos Lozano-Garzon

10 shared publications

Systems and Computing Engineering Department, Universidad de los Andes, Bogotá, Colombia

66
Publications
17
Reads
0
Downloads
38
Citations
Publication Record
Distribution of Articles published per year 
(2004 - 2019)
Total number of journals
published in
 
22
 
Publications See all
Article 0 Reads 0 Citations A Prediction Algorithm based on Markov Chains for finding the Minimum Cost Path in a Mobile WSNs Germán A. Montoya, Yezid Donoso Published: 14 February 2019
International Journal of Computers Communications & Control, doi: 10.15837/ijccc.2019.1.3487
DOI See at publisher website ABS Show/hide abstract
In this paper we propose the usage of a prediction technique based on Markov Chains to predict nodes positions with the aim of obtain short paths at minimum energy consumption. Specifically, the valuable information from the mobility prediction method is provided to our distributed routing algorithm in order to take the best network decisions considering future states of network resources. In this sense, in each network node, the mobility method employed is based on a Markov model to forecast future RSSI states of neighboring nodes for determining if they will be farther or closer within the next steps. The approach is evaluated considering different algorithms such as: Distance algorithm, Distance Away algorithm and Random algorithm. In addition, with the aim of performing comparisons against optimal values, we present a mathematical optimization model for finding the minimum cost path between a source and a destination node considering all network nodes are mobile. This paper is an extended variant of [8].
Article 0 Reads 0 Citations Sub-flow assignment model of multicast flows using multiple P2MP LSPs Fernando Solano, Ramón Fabregat, Yezid Donoso Published: 28 July 2018
CLEI Electronic Journal, doi: 10.19153/cleiej.8.1.4
DOI See at publisher website ABS Show/hide abstract
In previous works, a multi-objective traffic engineering scheme (MHDB-S model) using different distribution trees to multicast several flows were proposed. Because the flow assignment cannot be mapped directly into MPLS architecture, in this paper, we propose a liner system equation to create multiple point-2-multipoint LSPs based on the optimum sub-flow values obtained with our MHDB-S model.
PROCEEDINGS-ARTICLE 0 Reads 0 Citations A prediction algorithm based on Markov chains for finding the minimum cost path in a mobile wireless sensor network German A. Montoya, Yezid Donoso Published: 01 May 2018
2018 7th International Conference on Computers Communications and Control (ICCCC), doi: 10.1109/icccc.2018.8390455
DOI See at publisher website
PROCEEDINGS-ARTICLE 0 Reads 0 Citations A multi attribute planning algorithm for the selection of joint processing schemes in a smart cities environment Carlos Lozano-Garzon, Yezid Donoso Published: 01 May 2018
2018 7th International Conference on Computers Communications and Control (ICCCC), doi: 10.1109/icccc.2018.8390463
DOI See at publisher website
Article 4 Reads 1 Citation Delay/Disruption Tolerant Networking-Based Routing for Rural Internet Connectivity (DRINC) Carlos Velásquez-Villada, Yezid Donoso Published: 02 December 2016
International Journal of Computers Communications & Control, doi: 10.15837/ijccc.2017.1.2788
DOI See at publisher website ABS Show/hide abstract
Rural networking connectivity is a very dynamic and attractive research field. Nowadays big IT companies and many governments are working to help connect all these rural, disconnected people to Internet. This paper introduces a new routing algorithm that can bring non-real-time Internet connectivity to rural users. This solution is based on previously tested ideas, especially on Delay/Disruption Tolerant Networking technologies, since they can be used to transmit messages to and from difficult to access sites. It introduces the rural connectivity problem and its context. Then, it shows the proposed solution with its mathematical model used to describe the problem, its proposed heuristic, and its results. The advantage of our solution is that it is a low-cost technology that uses locally available infrastructure to reach even the most remote towns. The mathematical model describes the problem of transmitting messages from a rural, usually disconnected user, to an Internet connected node, through a non-reliable network using estimated delivery probabilities varying through time. The forwarding algorithm uses local knowledge gathered from interactions with other nodes, and it learns which nodes are more likely to connect in the future, and which nodes are more likely to deliver the messages to the destination. Our algorithm achieves an equal or better performance in delivery rate and delay than other well-known routing protocols for the rural scenarios tested. This paper adds more simulation results for the proposed rural scenarios, and it also extends the explanation of the mathematical model and the heuristic algorithm from the conference paper "Delay/Disruption Tolerant Networks Based Message Forwarding Algorithm for Rural Internet Connectivity Applications" [1] (doi: 10.1109/ICCCC. 2016.7496732).
Article 3 Reads 0 Citations Delay-Sensitive Optimization Models and Distributed Routing Algorithms for Mobile Wireless Sensor Networks Germán A. Montoya, Yezid Donoso Published: 17 October 2016
International Journal of Computers Communications & Control, doi: 10.15837/ijccc.2016.6.2745
DOI See at publisher website ABS Show/hide abstract
Communication disruptions caused by mobility in wireless sensor networks introduce undesired delays which affect the network performance in delay sensitive applications in MWSN. In order to study the negative effects caused by mobility, we propose two mathematical models to find the minimum cost path between a source node and a destination node considering the nodes position changes across time. Our mathematical models consider the usage of buffers in the nodes to represent the fact of storing a message if there is not an appropriate forwarding node for transmitting it. In order to contrast our mathematical models results we have designed two kinds of algorithms: the first one takes advantage of the closest neighbours to the destination node in order to reach it as fast as possible from the source node. The second one simply reaches the destination node if a neighbour node is precisely the destination node. Finally, we compare the delay performance of these algorithms against our mathematical models to show how efficient they are for reaching a destination node. This paper is an extension of [10].a The mathematical model proposed in [10] is improved by adding two new binary variables with the aim of make it more readable and compact mathematically. This means a post-processing algorithm is added only for evaluating if a solution is at the first network state.
Top