Bambang Soelistijanto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bambang Soelistijanto has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Agung Hadhiatma
Universitas Sanata Dharma
2 shared publicationsAgung Hernawan
Universitas Sanata Dharma
2 shared publications- Vittalis Ayu
School of Computer Science, The University of Nottingham, Nottingham NG8 1BB, UK
2 shared publications Elisabeth Kusuma Adi Permatasari
Sanata Dharma University,Department of Informatics,Yogyakarta,Indonesia
1 shared publicationJordan Vincent
Department of Informatics, Sanata Dharma University
1 shared publicationJunandus Sijabat
Department of Informatics, Sanata Dharma University, Yogyakarta, Indonesia
1 shared publication
Latest Publications
- Open Access
- 30 January 2026
- Published by Universitas Atma Jaya Yogyakarta in Jurnal Atma Inovasia
- Vol. 6 (1) , 51-57
Pemanfaatan E-learning dan Kecerdasan Buatan untuk Meningkatkan Kualitas Materi dan Evaluasi Pembelajaran pada Pendidikan Dasar
E-learning has been proven to significantly improve the quality of learning. This ICT-based learning allows the teaching and learning process to take place anywhere and anytime (ubiquitous learning). Furthermore, artificial intelligence (AI) can be applied to improve the quality of teaching materials and evaluation process. In this community service program (PkM), we implemented AI-assisted e-learning in the teaching and learning process at Sawah Elementary School, Panggang, Gunung Kidul. To this end, we first built the ICT infrastructure to support e-learning. A computer server was installed using Moodle as the learning management system (LMS). Following this, a series of training sessions were held, including Moodle administrator training for one teacher, digital classroom management and Moodle question creation training for all teachers, and Moodle training for students, which included online quizzes. At the end of the PkM, we conducted an evaluation with the teachers and students to measure their abilities and responses after all the training. Although teachers and students’ abilities on average showed average results in Moodle and AI mastery, their satisfaction with the training was very high, and they expected that this training could continue in the coming years.
- 30 January 2026
- Published by Universitas Atma Jaya Yogyakarta in Jurnal Atma Inovasia
- Vol. 6 (1) , 51-57
Open AccessPemanfaatan E-learning dan Kecerdasan Buatan untuk Meningkatkan Kualitas Materi dan Evaluasi Pembelajaran pada Pendidikan Dasar
E-learning has been proven to significantly improve the quality of learning. This ICT-based learning allows the teaching and learning process to take place anywhere and anytime (ubiquitous learning). Furthermore, artificial intelligence (AI) can be applied to improve the quality of teaching materials and evaluation process. In this community service program (PkM), we implemented AI-assisted e-learning in the teaching and learning process at Sawah Elementary School, Panggang, Gunung Kidul. To this end, we first built the ICT infrastructure to support e-learning. A computer server was installed using Moodle as the learning management system (LMS). Following this, a series of training sessions were held, including Moodle administrator training for one teacher, digital classroom management and Moodle question creation training for all teachers, and Moodle training for students, which included online quizzes. At the end of the PkM, we conducted an evaluation with the teachers and students to measure their abilities and responses after all the training. Although teachers and students’ abilities on average showed average results in Moodle and AI mastery, their satisfaction with the training was very high, and they expected that this training could continue in the coming years.
- Open Access
- 15 January 2026
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 687, 01013
Energy Efficient Random Search in Euclidean Space using Lévy Flight
Agents operating in unknown environments commonly rely on fundamental random search strategies to locate targets without prior knowledge of their surroundings. This research is motivated by the need to identify the most efficient movement strategy in autonomous robotics applications. Previous works often focus on specific aspects, lacking a comparative analysis of the random walk movements. Here, we investigate the comparative performance of agents utilizing random walk movements such as Random Waypoint, Brownian Motion, and Lévy Flight. The simulations were performed using the Opportunistic Network Environment (ONE) simulator. Each movement was tested under similar conditions, where targets were spread using a spatial Poisson random distribution and a spatial clustered distribution. We evaluated their performance based on the coverage over time for each movement under various target distributions and analyzed the best parameter for Lévy Flight on the defined target distributions. Results offer practical insights for agent designs during random search and validate whether Lévy Flight demonstrates superior performance as suggested in previous studies.
- 15 January 2026
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 687, 01013
Open AccessEnergy Efficient Random Search in Euclidean Space using Lévy Flight
Agents operating in unknown environments commonly rely on fundamental random search strategies to locate targets without prior knowledge of their surroundings. This research is motivated by the need to identify the most efficient movement strategy in autonomous robotics applications. Previous works often focus on specific aspects, lacking a comparative analysis of the random walk movements. Here, we investigate the comparative performance of agents utilizing random walk movements such as Random Waypoint, Brownian Motion, and Lévy Flight. The simulations were performed using the Opportunistic Network Environment (ONE) simulator. Each movement was tested under similar conditions, where targets were spread using a spatial Poisson random distribution and a spatial clustered distribution. We evaluated their performance based on the coverage over time for each movement under various target distributions and analyzed the best parameter for Lévy Flight on the defined target distributions. Results offer practical insights for agent designs during random search and validate whether Lévy Flight demonstrates superior performance as suggested in previous studies.
- Open Access
- 30 September 2024
- Published by Universitas Atma Jaya Yogyakarta in Jurnal Atma Inovasia
- Vol. 4 (5) , 202-206
Pengembangan Sumber dan Evaluasi Pembelajaran Sekolah Dasar Menggunakan Moodle Berbasis Virtual Machine
Information technology-based learning has become a significant method to enhance the quality of education. Information technology allows students to learn without being limited by time and space. Students can also study and practice independently according to their capacity and needs. E-learning is a learning methodology that requires information technology. One of the information technologies that has been used for learning is Moodle. Moodle is a learning management system" (LMS) used to organize, deliver learning materials, and assess students' competencies. Like a general web page, Moodle has features for presenting classes and courses, where teachers can upload teaching materials, questions, and assignments. Students can log into Moodle and select the classes provided or registered for them. Student activities in Moodle will be monitored for learning progress and evaluation grades. In Indonesia, Moodle has been used by secondary schools, universities, and companies for e-learning. This workshop on Learning Management Systems (LMS) especially for rural students is considered as their level of computer literacy still needs improvement.
- 30 September 2024
- Published by Universitas Atma Jaya Yogyakarta in Jurnal Atma Inovasia
- Vol. 4 (5) , 202-206
Open AccessPengembangan Sumber dan Evaluasi Pembelajaran Sekolah Dasar Menggunakan Moodle Berbasis Virtual Machine
Information technology-based learning has become a significant method to enhance the quality of education. Information technology allows students to learn without being limited by time and space. Students can also study and practice independently according to their capacity and needs. E-learning is a learning methodology that requires information technology. One of the information technologies that has been used for learning is Moodle. Moodle is a learning management system" (LMS) used to organize, deliver learning materials, and assess students' competencies. Like a general web page, Moodle has features for presenting classes and courses, where teachers can upload teaching materials, questions, and assignments. Students can log into Moodle and select the classes provided or registered for them. Student activities in Moodle will be monitored for learning progress and evaluation grades. In Indonesia, Moodle has been used by secondary schools, universities, and companies for e-learning. This workshop on Learning Management Systems (LMS) especially for rural students is considered as their level of computer literacy still needs improvement.
- Open Access
- 6 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 128498-128513
Construction of Optimal Membership Functions for a Fuzzy Routing Scheme in Opportunistic Mobile Networks
This article proposes FRIMF, a fuzzy routing scheme for opportunistic mobile networks (OMNs). In FRIMF, we exploit the pairwise intercontact times to evaluate the connection strength between nodes. Instead of assuming a random movement model, in the present case we consider node contact processes in OMNs as bursty events. Consequently, we introduce a burstiness parameter to characterize the variability in the dynamics of pairwise interactions. This variance metric, along with the statistical mean of pairwise intercontact times, is used to define a single FRIMF routing metric called closeness through a fuzzy inference system. This reflects the tie strength of the pair nodes. To improve the transmission environment, we further propose a method to develop optimal membership functions for the FRIMF’s fuzzy parameters based on the contact information. Particularly, we leverage the membership function elicitation techniques commonly used in collective opinion aggregations based on a direct rating process to establish the relevancy between vagueness estimates of the routing parameters and statistical distributions of the pairwise intercontact times in a way that eventually presents asymmetric triangular fuzzy numbers. In turn, these TFNs are used to properly define the fuzzy sets of the FRIMF’s routing parameters. Through simulations in the real human mobility environments, we show that FRIMF utilizing the enhanced asymmetric TFNs can outperform that using the typical symmetric TFNs developed based on our subjective preferences. Lastly, comparing with several algorithm benchmarks, we confirm the efficiency of FRIMF in transmission cost and delay.
- 6 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 128498-128513
Open AccessConstruction of Optimal Membership Functions for a Fuzzy Routing Scheme in Opportunistic Mobile Networks
This article proposes FRIMF, a fuzzy routing scheme for opportunistic mobile networks (OMNs). In FRIMF, we exploit the pairwise intercontact times to evaluate the connection strength between nodes. Instead of assuming a random movement model, in the present case we consider node contact processes in OMNs as bursty events. Consequently, we introduce a burstiness parameter to characterize the variability in the dynamics of pairwise interactions. This variance metric, along with the statistical mean of pairwise intercontact times, is used to define a single FRIMF routing metric called closeness through a fuzzy inference system. This reflects the tie strength of the pair nodes. To improve the transmission environment, we further propose a method to develop optimal membership functions for the FRIMF’s fuzzy parameters based on the contact information. Particularly, we leverage the membership function elicitation techniques commonly used in collective opinion aggregations based on a direct rating process to establish the relevancy between vagueness estimates of the routing parameters and statistical distributions of the pairwise intercontact times in a way that eventually presents asymmetric triangular fuzzy numbers. In turn, these TFNs are used to properly define the fuzzy sets of the FRIMF’s routing parameters. Through simulations in the real human mobility environments, we show that FRIMF utilizing the enhanced asymmetric TFNs can outperform that using the typical symmetric TFNs developed based on our subjective preferences. Lastly, comparing with several algorithm benchmarks, we confirm the efficiency of FRIMF in transmission cost and delay.
- Open Access
- 22 June 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (7) , 222
Improving Traffic Load Distribution Fairness in Mobile Social Networks
Mobile social networks suffer from an unbalanced traffic load distribution due to the heterogeneity in mobility of nodes (humans) in the network. A few nodes in these networks are highly mobile, and the proposed social-based routing algorithms are likely to choose these most “social” nodes as the best message relays. Finally, this could lead to inequitable traffic load distribution and resource utilisation, such as faster battery drain and/or storage consumption of the most (socially) popular nodes. We propose a framework called Traffic Load Distribution Aware (TraLDA) to improve traffic load balancing across network nodes. We present a novel method for calculating node popularity which takes into account both node inherent and social-relations popularity. The former is purely determined by the node’s sociability level in the network, and in TraLDA is computed using the Kalman prediction which considers the node’s periodicity behaviour. However, the latter takes the benefit of interactions with more popular neighbours (acquaintances) to boost the popularity of lower (social) level nodes. Using extensive simulations in the Opportunistic Network Environment (ONE) driven by real human mobility scenarios, we show that our proposed strategy enhances the traffic load distribution fairness of the classical, yet popular social-aware routing algorithms BubbleRap and SimBet without negatively impacting the overall delivery performance.
- 22 June 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (7) , 222
Open AccessImproving Traffic Load Distribution Fairness in Mobile Social Networks
Mobile social networks suffer from an unbalanced traffic load distribution due to the heterogeneity in mobility of nodes (humans) in the network. A few nodes in these networks are highly mobile, and the proposed social-based routing algorithms are likely to choose these most “social” nodes as the best message relays. Finally, this could lead to inequitable traffic load distribution and resource utilisation, such as faster battery drain and/or storage consumption of the most (socially) popular nodes. We propose a framework called Traffic Load Distribution Aware (TraLDA) to improve traffic load balancing across network nodes. We present a novel method for calculating node popularity which takes into account both node inherent and social-relations popularity. The former is purely determined by the node’s sociability level in the network, and in TraLDA is computed using the Kalman prediction which considers the node’s periodicity behaviour. However, the latter takes the benefit of interactions with more popular neighbours (acquaintances) to boost the popularity of lower (social) level nodes. Using extensive simulations in the Opportunistic Network Environment (ONE) driven by real human mobility scenarios, we show that our proposed strategy enhances the traffic load distribution fairness of the classical, yet popular social-aware routing algorithms BubbleRap and SimBet without negatively impacting the overall delivery performance.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-29
Periodicity Detection of Node Behaviour in Opportunistic Mobile Social Networks
The recent rise of networks that rely on human mobility, such as opportunistic mobile social networks (OMSNs), has prompted the need for methods that detect the periodic patterns of node movements. Knowledge of the periodicity of node behaviour is essential to design effective and efficient network protocols in such networks. Node behaviour in OMSNs is typically characterized by the node contact patterns. In fact, node connections in these networks occur intermittently, resulting in sparse contact data. Consequently, the traditional periodicity detection methods, e.g. the FFT periodogram and autocorrelation, that favour complete, regularly-sampled time-series data are unsuitable in this setting. In this paper, we exploit the Lomb-Scargle periodogram, initially designed to handle incomplete or irregular sampling data, to identify node behaviour periodicity in OMSNs. Using simulation driven by real human contact traces, we show that the technique is able to accurately detect the behaviour periodicity of majority nodes in the network, even for those with a high level of sparsity contact data.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-29
Periodicity Detection of Node Behaviour in Opportunistic Mobile Social Networks
The recent rise of networks that rely on human mobility, such as opportunistic mobile social networks (OMSNs), has prompted the need for methods that detect the periodic patterns of node movements. Knowledge of the periodicity of node behaviour is essential to design effective and efficient network protocols in such networks. Node behaviour in OMSNs is typically characterized by the node contact patterns. In fact, node connections in these networks occur intermittently, resulting in sparse contact data. Consequently, the traditional periodicity detection methods, e.g. the FFT periodogram and autocorrelation, that favour complete, regularly-sampled time-series data are unsuitable in this setting. In this paper, we exploit the Lomb-Scargle periodogram, initially designed to handle incomplete or irregular sampling data, to identify node behaviour periodicity in OMSNs. Using simulation driven by real human contact traces, we show that the technique is able to accurately detect the behaviour periodicity of majority nodes in the network, even for those with a high level of sparsity contact data.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Interest-based Epidemic Routing in Opportunistic Mobile Networks
Message delivery in opportunistic mobile networks is a challenging task since the network topology constantly changes and end-to-end paths can hardly be sustained. Epidemic routing forwards a copy message to each contacted node to achieve a high network delivery performance; this however easily burdens the network nodes with high traffic load, quickly depleting the node’s resources, e.g. power and storage, and finally degrading the network delivery performance. This paper proposes an interest-based Epidemic that improves Epidemic to be a content-aware forwarding by taking message content, node interest, and node community into consideration. Using simulation, driven by real human contact datasets, we investigate the performance of the proposed algorithm compared with Epidemic (content-oblivious) and Direct Transmission (content-aware), in terms of total delivered messages, average convergence time, and total relayed messages. Simulation results show that Epidemic-Interest outperforms Direct Transmission in terms of total delivered message and average convergence time. Moreover, compared with Epidemic, it can reduces the transmission cost while keeping the total delivered messages as high as Epidemic’s; however, it increases the convergence time beyond that of Epidemic.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Interest-based Epidemic Routing in Opportunistic Mobile Networks
Message delivery in opportunistic mobile networks is a challenging task since the network topology constantly changes and end-to-end paths can hardly be sustained. Epidemic routing forwards a copy message to each contacted node to achieve a high network delivery performance; this however easily burdens the network nodes with high traffic load, quickly depleting the node’s resources, e.g. power and storage, and finally degrading the network delivery performance. This paper proposes an interest-based Epidemic that improves Epidemic to be a content-aware forwarding by taking message content, node interest, and node community into consideration. Using simulation, driven by real human contact datasets, we investigate the performance of the proposed algorithm compared with Epidemic (content-oblivious) and Direct Transmission (content-aware), in terms of total delivered messages, average convergence time, and total relayed messages. Simulation results show that Epidemic-Interest outperforms Direct Transmission in terms of total delivered message and average convergence time. Moreover, compared with Epidemic, it can reduces the transmission cost while keeping the total delivered messages as high as Epidemic’s; however, it increases the convergence time beyond that of Epidemic.
- Open Access
- 1 March 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1196 (1) , 012046
Performance Comparison of Deterministic and Stochastic Utility Ascent Routing Algorithms in Opportunistic Mobile Networks
Opportunistic mobile networks (OMNs) are a class of MANETs where complete endto-end paths rarely exist between sources and destinations; consequently, the end-to-end delays in these networks are much greater than typical MANETs. In this harsh environment networking algorithm actions and decisions are inherently local; the algorithms are mostly greedy, choosing the best solution among the locally ones. In this paper, we study the delivery performance of two classes of gradient utility ascent routing algorithms, deterministic (greedy) and stochastic utility ascent ones, in OMNs. We furthermore discuss the impact of these algorithms on traffic load distribution fairness among the network nodes, since this issue is critical in mobile networking whose nodes typically possess limited resources, e.g. power and storage capacity. Using simulation, driven by real human mobility traces, we investigate the performance of greedy ascent algorithms, Hill Climbing (HC) and Delegation Forwarding (DF), compared with that of stochastic ascent algorithms, Simulated Annealing (SA). The results under the scenario show an advantage of SA over HC and DF in terms of total delivered messages, average delivery delay, and traffic distribution fairness; however, SA negatively impacts the delivery cost performance, i.e. increasing the total message copies beyond those of HC and DF.
- 1 March 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1196 (1) , 012046
Open AccessPerformance Comparison of Deterministic and Stochastic Utility Ascent Routing Algorithms in Opportunistic Mobile Networks
Opportunistic mobile networks (OMNs) are a class of MANETs where complete endto-end paths rarely exist between sources and destinations; consequently, the end-to-end delays in these networks are much greater than typical MANETs. In this harsh environment networking algorithm actions and decisions are inherently local; the algorithms are mostly greedy, choosing the best solution among the locally ones. In this paper, we study the delivery performance of two classes of gradient utility ascent routing algorithms, deterministic (greedy) and stochastic utility ascent ones, in OMNs. We furthermore discuss the impact of these algorithms on traffic load distribution fairness among the network nodes, since this issue is critical in mobile networking whose nodes typically possess limited resources, e.g. power and storage capacity. Using simulation, driven by real human mobility traces, we investigate the performance of greedy ascent algorithms, Hill Climbing (HC) and Delegation Forwarding (DF), compared with that of stochastic ascent algorithms, Simulated Annealing (SA). The results under the scenario show an advantage of SA over HC and DF in terms of total delivered messages, average delivery delay, and traffic distribution fairness; however, SA negatively impacts the delivery cost performance, i.e. increasing the total message copies beyond those of HC and DF.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
Improving Node Popularity Calculation Using Kalman Filter in Opportunistic Mobile Social Networks
Opportunistic mobile social networks (OMSNs) exploit human mobility to physically carry messages to the destinations. Routing algorithms in these networks typically favour the most popular individuals (nodes) as optimal carriers for message transfers to achieve high delivery performance. The state-of-the-art routing protocol BubbleRap uses a cumulative moving average technique (called C-Window) to identify a node's popularity level, measured in node degree, in a time window. However, our study found that node degree in real-life OMSNs varies quickly and significantly in time, and C-Window moreover slowly adapts to this node degree changes. To tackle this problem, we propose a new method of node degree computation based on the Kalman-filter theory. Using simulation, driven by real human contact traces, we showed that our approach can increase BubbleRap's performance, in terms of delivery ratio and traffic (load) distribution fairness.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
Improving Node Popularity Calculation Using Kalman Filter in Opportunistic Mobile Social Networks
Opportunistic mobile social networks (OMSNs) exploit human mobility to physically carry messages to the destinations. Routing algorithms in these networks typically favour the most popular individuals (nodes) as optimal carriers for message transfers to achieve high delivery performance. The state-of-the-art routing protocol BubbleRap uses a cumulative moving average technique (called C-Window) to identify a node's popularity level, measured in node degree, in a time window. However, our study found that node degree in real-life OMSNs varies quickly and significantly in time, and C-Window moreover slowly adapts to this node degree changes. To tackle this problem, we propose a new method of node degree computation based on the Kalman-filter theory. Using simulation, driven by real human contact traces, we showed that our approach can increase BubbleRap's performance, in terms of delivery ratio and traffic (load) distribution fairness.