cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
,
INDONESIA
Indonesian Journal of Electrical Engineering and Informatics (IJEEI)
Published by IAES Indonesia Section and Partners
ISSN : 20893272     EISSN : -     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) is a peer reviewed International Journal in English published four issues per year (March, June, September and December). The aim of Indonesian Journal of Electrical Engineering and Informatics (IJEEI) is to publish high-quality articles dedicated to all aspects of the latest outstanding developments in the field of electrical engineering. Its scope encompasses the engineering of Telecommunication and Information Technology, Applied Computing & Computer, Instrumentation & Control, Electrical (Power), Electronics, and Informatics.
Arjuna Subject : -
Articles 12 Documents
 1   2 
Search results for , issue "Vol 6, No 2: June 2018" : 12 Documents clear
A Packet Scheduling Scheme for Improving Real-time Applications Performance in Downlink LTE–advanced Elsheikh Mohamed Ahmed Elsheikh; Mohamed Hadi Habaebi; Huda Adibah Mohd Ramli; Mohammed H. A. Arafa; Kazi Istiaque Ahmed
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 6, No 2: June 2018
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v6i2.451

Abstract

Quality of Service based packet scheduling is a key-feature of LTE-A mandating selection and transmission of individual user packets based on their priority. HARQ Aware Scheduling, Retransmission Aware Proportional Fair, Chase Combining Based Max C/I Scheduling and Maximum- Largest Weighted First (M-LWDF) are popular Packet Scheduling Algorithms (PSAs) developed to meet QoS requirements. In highly erroneous LTE-A cannel, M-LWDF is considered to be one of best PSA. To validate the performance of M-LWDF for the LTE-A channel, Mean User Throughout, and Fairness performance measures were evaluated for 3 different PSAs designed based on M-LWDF algorithm in this paper. A C++ based simulation results indicate the superiority of the PSA3 algorithm within the threshold of the performance measures against benchmarks. It has shown more efficiency and the performance of RTA traffic was enhanced. Results show that PSA3 is superior to its benchmark PSA2 by 12% in Mean User Throughput and 11% in Fairness. PSA2 performed the worst because it prioritizes new users and it allocated all available RBs to the scheduled user leaving the rest to wait in the buffer. PSA3 maintians good Mean User Throughput and fairnessdue to scheduling each user on its RB which leads to multi-user diversity.
Using a Modified Shuffled Frog Leaping Algorithm (MSFLA) in Locating and Determining the Optimal Capacity of Distributed Generation Units Hosseini, Sayed-Jamal-al-Din; Zamanifar, Mehran
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 6, No 2: June 2018
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v6i2.408

Abstract

Restructuring the power systems and the simultaneous trend to renewable resources has increased the importance of appropriate planning of distribution companies to maximize the potential of distributed resources. Therefore, due to the growing trend of using distributed generations, it is necessary to determine the location and optimal capacity and examine the effects of these units on the power system, especially in the distribution network. Distributed generation sources can be a source of positive impacts, such as improving the technical parameters of the network, including losses, voltage profiles, reliability, and congestion reduction in the power systems, according to the specifications, operating conditions and installation location. In this paper, improvement of the profile and reduction of the losses is used as an object and through appropriate weight coefficients in an object function for the purpose of placement and determining the optimal capacity of the distributed generation sources. In the proposed method the Modified Shuffled Frog Leaping Algorithm (MSFLA) is implemented on an IEEE 33-bus standard network. Also, simulation results are compared with GA and PSO algorithms on the network, which clearly shows the efficiency of the proposed method in the placement and determining the optimal capacity of the distributed generation sources.

Page 2 of 2 | Total Record : 12

 1   2 

Filter by Year

2018 2018


Reset
Filter By Issues
All Issue Vol 13, No 4: December 2025 Vol 13, No 3: September 2025 Vol 13, No 2: June 2025 Vol 13, No 1: March 2025 Vol 12, No 4: December 2024 Vol 12, No 3: September 2024 Vol 12, No 2: June 2024 Vol 12, No 1: March 2024 Vol 11, No 4: December 2023 Vol 11, No 3: September 2023 Vol 11, No 2: June 2023 Vol 11, No 1: March 2023 Vol 10, No 4: December 2022 Vol 10, No 3: September 2022 Vol 10, No 2: June 2022 Vol 10, No 1: March 2022 Vol 9, No 4: December 2021 Vol 9, No 3: September 2021 Vol 9, No 2: June 2021 Vol 9, No 1: March 2021 Vol 8, No 4: December 2020 Vol 8, No 3: September 2020 Vol 8, No 2: June 2020 Vol 8, No 1: March 2020 Vol 7, No 4: December 2019 Vol 7, No 3: September 2019 Vol 7, No 2: June 2019 Vol 7, No 1: March 2019 Vol 6, No 4: December 2018 Vol 6, No 3: September 2018 Vol 6, No 3: September 2018 Vol 6, No 2: June 2018 Vol 6, No 1: March 2018 Vol 5, No 4: December 2017 Vol 5, No 3: September 2017 Vol 5, No 2: June 2017 Vol 5, No 1: March 2017 Vol 4, No 4: December 2016 Vol 4, No 3: September 2016 Vol 4, No 2: June 2016 Vol 4, No 1: March 2016 Vol 3, No 4: December 2015 Vol 3, No 3: September 2015 Vol 3, No 2: June 2015 Vol 3, No 1: March 2015 Vol 2, No 4: December 2014 Vol 2, No 3: September 2014 Vol 2, No 3: September 2014 Vol 2, No 2: June 2014 Vol 2, No 1: March 2014 Vol 1, No 4: December 2013 Vol 1, No 3: September 2013 Vol 1, No 2: June 2013 Vol 1, No 1: March 2013 More Issue