cover
Contact Name
Tole Sutikno
Contact Email
ijece@iaesjournal.com
Phone
-
Journal Mail Official
ijece@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Electrical and Computer Engineering
ISSN : 20888708     EISSN : 27222578     DOI : -
International Journal of Electrical and Computer Engineering (IJECE, ISSN: 2088-8708, a SCOPUS indexed Journal, SNIP: 1.001; SJR: 0.296; CiteScore: 0.99; SJR & CiteScore Q2 on both of the Electrical & Electronics Engineering, and Computer Science) is the official publication of the Institute of Advanced Engineering and Science (IAES). The journal is open to submission from scholars and experts in the wide areas of electrical, electronics, instrumentation, control, telecommunication and computer engineering from the global world.
Articles 6,301 Documents
Reliability Constrained Unit Commitment Considering the Effect of DG and DR Program Masoud Aliakbari; Pouria Maghouli; Habib Allah Aalami
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 4: August 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (683.325 KB) | DOI: 10.11591/ijece.v8i4.pp1985-1996

Abstract

Due to increase in energy prices at peak periods and increase in fuel cost, involving Distributed Generation (DG) and consumption management by Demand Response (DR) will be unavoidable options for optimal system operations. Also, with high penetration of DGs and DR programs into power system operation, the reliability criterion is taken into account as one of the most important concerns of system operators in management of power system. In this paper, a Reliability Constrained Unit Commitment (RCUC) at presence of time-based DR program and DGs integrated with conventional units is proposed and executed to reach a reliable and economic operation. Designated cost function has been minimized considering reliability constraint in prevailing UC formulation. The UC scheduling is accomplished in short-term so that the reliability is maintained in acceptable level. Because of complex nature of RCUC problem and full AC load flow constraints, the hybrid algorithm included Simulated Annealing (SA) and Binary Particle Swarm Optimization (BPSO) has been proposed to optimize the problem. Numerical results demonstrate the effectiveness of the proposed method and considerable efficacy of the time-based DR program in reducing operational costs by implementing it on IEEE-RTS79.
Performance Comparison of Routing Protocols in Bipartite Wireless Sensor Network Devashish Gosain; Itu Snigdh
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 6: December 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (298.202 KB) | DOI: 10.11591/ijece.v5i6.pp1417-1423

Abstract

This paper evaluates and ranks the suitability of routing algorithms for bipartite wireless sensor network topology. The network considered in this paper, consists of an irregular combination of fixed and mobile nodes, which leads to construction of a bipartite graph among them. A wireless sensor network is usually constrained by the energy limitations and processing capabilities. We therefore, consider the important metrics for analysis namely, carried load, energy consumption and the average delay incurred. We present the possibilities of employing the routing algorithms subject to the quality of service required by the wireless sensor networks applications
Emergent situations for smart cities: A survey Ahmad Mohamad Al-Smadi; Mutasem K. Alsmadi; Abdel Karim Baareh; Ibrahim Almarashdeh; Hayam Abouelmagd; Osman Saad Shidwan Ahmed
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 6: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (14.644 KB) | DOI: 10.11591/ijece.v9i6.pp4777-4787

Abstract

A smart city is a community that uses communication and information technology to improve sustainability, livability, and feasibility. As any community, there are always unexpected emergencies, which must be treated to preserve the regular order. However, a smart system is needed to be able to respond effectively to these emergent situations. The contribution made in this survey is twofold. Firstly, it provides a comprehensive exhaustive and categorized overview of the existing surveys for smart cities.  The categorization is based on several criteria such as structures, benefits, advantages, applications, challenges, issues, and future directions. Secondly, it aims to analyze several studies with respect to emergent situations and management to smart cities. The analysis is based on several factors such as the challenges and issues discussed, the solutions proposed, and opportunities for future research. The challenges include security, privacy, reliability, performance, scalability, heterogeneity, scheduling, resource management, and latency. Few studies have investigated the emergent situations of smart cities and despite the importance of latency factor for smart city applications, it is rarely discussed.
Source based Security Issues in WDM Systems A. Antwiwaa; A. Kumar; A. K Jaiswal
International Journal of Electrical and Computer Engineering (IJECE) Vol 7, No 4: August 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (386.194 KB) | DOI: 10.11591/ijece.v7i4.pp2101-2108

Abstract

The issue of security has become a bigger heddle for all telecommunication companies to climb in this era where information hungry customers are increasing daily. Unauthorized users are finding novel ways of accessing information of others and thereby attacking the requisite legitimate users’ information accounting to security threats. In this work, two forms of WDM system attacks will be considered. These attacks include a clone source based attack where the adversary tries to replicate the transmitted signal of the legitimate user by transmitting at the same wavelength and power and the different wavelength source based attack where the adversary transmit at a wavelength different from that of the legitimate user thereby creating interaction effects igniting security issues. Finally, a simulation of the outcome will be considered and the resulting output will be analyzed
Voltage sensitivity analysis to determine the optimal integration of distributed generation in distribution systems Katherine Cabana; John Candelo; Rafael Castillo; Emiro De la Hoz Franco
International Journal of Electrical and Computer Engineering (IJECE) Vol 9, No 1: February 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1485.946 KB) | DOI: 10.11591/ijece.v9i1.pp55-65

Abstract

This paper presents a voltage sensitivity analysis with respect to the real power injected with renewable energies to determine the optimal integration of distributed generation (DG) in distribution systems (DS). The best nodes where the power injections improve voltages magnitudes complying with the constraints are determined. As it is a combinatorial problem, particle swarm optimization (PSO) and simulated annealing (SA) were used to change injections from 10% to 60% of the total power load using solar and wind generators and find the candidate nodes for installing power sources. The method was tested using the 33-node, 69-node and 118-node radial distribution networks. The results showed that the best nodes for injecting real power with renewable energies were selected for the distribution network by using the voltage sensitivity analysis. Algorithms found the best nodes for the three radial distribution networks with similar values in the maximum injection of real power, suggesting that this value maintains for all the power system cases. The injections applied to the different nodes showed that voltage magnitudes increase significantly, especially when exceeding the maximum penetration of DG. The test showed that some nodes support injections up to the limits, but the voltages increase considerably on all nodes.
A cognitive robot equipped with autonomous tool innovation expertise Handy Wicaksono; Claude Sammut
International Journal of Electrical and Computer Engineering (IJECE) Vol 10, No 2: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (658.154 KB) | DOI: 10.11591/ijece.v10i2.pp2200-2207

Abstract

Like a human, a robot may benefit from being able to use a tool to solve a complex task. When an appropriate tool is not available, a very useful ability for a robot is to create a novel one based on its experience. With the advent of inexpensive 3D printing, it is now possible to give robots such an ability, at least to create simple tools. We proposed a method for learning how to use an object as a tool and, if needed, to design and construct a new tool. The robot began by learning an action model of tool use for a PDDL planner by observing a trainer. It then refined the model by learning by trial and error. Tool creation consisted of generalising an existing tool model and generating a novel tool by instantiating the general model. Further learning by experimentation was performed. Reducing the search space of potentially useful tools could be achieved by providing a tool ontology. We then used a constraint solver to obtain numerical parameters from abstract descriptions and use them for a ready-to-print design. We evaluated our system using a simulated and a real Baxter robot in two cases: hook and wedge. We found that our system performs tool creation successfully.
Delay Comparison for 16x16 Vedic Multiplier Using RCA and CLA M. Bhavani; M. Siva Kumar; K. Srinivas Rao
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 3: June 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (175.496 KB) | DOI: 10.11591/ijece.v6i3.pp1205-1212

Abstract

In any integrated chip compulsory adders are required because first they are fast and second are the less power consumption and delay. And at the same time multiplication process is also used in various applications. So as the speed of multiplier increases then the speed of processor also increases. And hence we are proposing the Vedic multiplier using these adders. Vedic multiplier is an ancient mathematics which uses mainly 16 sutras for its operation. In this project we are using “urdhva triyagbhyam” sutra to do our process. This paper proposes the Vedic multiplier using the adders ripple carry adder(RCA) and carry look ahead adder(CLA) and puts forward that CLA is better than RCA.The major parameters we are simulating here are number of slices and delay. The code is written by using Verilog and is implemented using Xilinx ISE Design Suite.
Design Of Intelligent Stick Based On Microcontroller With GPS Using Speech IC Naseer Muhammad; Qazi Waqar Ali
International Journal of Electrical and Computer Engineering (IJECE) Vol 2, No 6: December 2012
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (94.838 KB)

Abstract

For visually impaired persons the endeavors and researchers have spent the decades to develop an intelligent and smart stick to protect and alert them from obstacles. This paper proposes a new thought developing an intelligent stick equipped with GPS navigation system, which detect the obstacles in path and gives information about their location using GPS coordinates. The combination of ultrasonic sensors and GPS will detect the obstacles and determine the position and will gives information about location through Bluetooth.DOI:http://dx.doi.org/10.11591/ijece.v2i6.1622
Probabilistic Road-Aware Geocast In VANETs Zubair Amjad; Wang-Cheol Song
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 3: June 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (791.342 KB) | DOI: 10.11591/ijece.v5i3.pp599-610

Abstract

Geocast is a communication technique to disseminate information in specific geographic regions instead of node addresses. Traffic congestion, accidents, local hazards and digital content sharing are potential use cases of information sharing in VANETs. Recently, several approaches for geocast routing have been proposed to achieve high delivery ratios. These approaches consider a center point and radius to define the destination region also called geocast region. They focus only on routing scheme to enhance the delivery ratio and delays. However, these approaches do not consider the target region selection problem in the geocast routing. In this paper, we propose a novel application-level mechanism for sharing road conditions, such as accidents, detours and congestion in VANETs through probabilistic road-aware geocast routing. We assign probabilities to the roads around each intersection in the neighborhood road network of the source vehicle. We then build a spanning tree of roads (from graph representation of the road network) with information source as the root node. Nodes below the root represent junctions and edges represent inter-connecting road segments. Messages propagate along the branches of the spanning tree. The spanning tree represents the geocast region. As the information propagates down the branches, probability of road as geocast region decreases. Information is propagated until a threshold probability is reached. Our method also ensures that messages are not delivered to irrelevant vehicles irrespective of their proximity to the source. We evaluate our application through extensive and realistic simulations in ns-3 simulator using IDM car following and MOBIL lane change models for realistic modeling of vehicle mobility.
A Novel Approach for Clustering Big Data based on MapReduce Gourav Bathla; Himanshu Aggarwal; Rinkle Rani
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 3: June 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (488.659 KB) | DOI: 10.11591/ijece.v8i3.pp1711-1719

Abstract

Clustering is one of the most important applications of data mining. It has attracted attention of researchers in statistics and machine learning. It is used in many applications like information retrieval, image processing and social network analytics etc. It helps the user to understand the similarity and dissimilarity between objects. Cluster analysis makes the users understand complex and large data sets more clearly. There are different types of clustering algorithms analyzed by various researchers. Kmeans is the most popular partitioning based algorithm as it provides good results because of accurate calculation on numerical data. But Kmeans give good results for numerical data only. Big data is combination of numerical and categorical data. Kprototype algorithm is used to deal with numerical as well as categorical data. Kprototype combines the distance calculated from numeric and categorical data. With the growth of data due to social networking websites, business transactions, scientific calculation etc., there is vast collection of structured, semi-structured and unstructured data. So, there is need of optimization of Kprototype so that these varieties of data can be analyzed efficiently.In this work, Kprototype algorithm is implemented on MapReduce in this paper. Experiments have proved that Kprototype implemented on Mapreduce gives better performance gain on multiple nodes as compared to single node. CPU execution time and speedup are used as evaluation metrics for comparison.Intellegent splitter is proposed in this paper which splits mixed big data into numerical and categorical data. Comparison with traditional algorithms proves that proposed algorithm works better for large scale of data.

Filter by Year

2011 2026


Filter By Issues
All Issue Vol 16, No 1: February 2026 Vol 15, No 6: December 2025 Vol 15, No 5: October 2025 Vol 15, No 4: August 2025 Vol 15, No 3: June 2025 Vol 15, No 2: April 2025 Vol 15, No 1: February 2025 Vol 14, No 6: December 2024 Vol 14, No 5: October 2024 Vol 14, No 4: August 2024 Vol 14, No 3: June 2024 Vol 14, No 2: April 2024 Vol 14, No 1: February 2024 Vol 13, No 6: December 2023 Vol 13, No 5: October 2023 Vol 13, No 4: August 2023 Vol 13, No 3: June 2023 Vol 13, No 2: April 2023 Vol 13, No 1: February 2023 Vol 12, No 6: December 2022 Vol 12, No 5: October 2022 Vol 12, No 4: August 2022 Vol 12, No 3: June 2022 Vol 12, No 2: April 2022 Vol 12, No 1: February 2022 Vol 11, No 6: December 2021 Vol 11, No 5: October 2021 Vol 11, No 4: August 2021 Vol 11, No 3: June 2021 Vol 11, No 2: April 2021 Vol 11, No 1: February 2021 Vol 10, No 6: December 2020 Vol 10, No 5: October 2020 Vol 10, No 4: August 2020 Vol 10, No 3: June 2020 Vol 10, No 2: April 2020 Vol 10, No 1: February 2020 Vol 9, No 6: December 2019 Vol 9, No 5: October 2019 Vol 9, No 4: August 2019 Vol 9, No 3: June 2019 Vol 9, No 2: April 2019 Vol 9, No 1: February 2019 Vol 8, No 6: December 2018 Vol 8, No 5: October 2018 Vol 8, No 4: August 2018 Vol 8, No 3: June 2018 Vol 8, No 2: April 2018 Vol 8, No 1: February 2018 Vol 7, No 6: December 2017 Vol 7, No 5: October 2017 Vol 7, No 4: August 2017 Vol 7, No 3: June 2017 Vol 7, No 2: April 2017 Vol 7, No 1: February 2017 Vol 6, No 6: December 2016 Vol 6, No 5: October 2016 Vol 6, No 4: August 2016 Vol 6, No 3: June 2016 Vol 6, No 2: April 2016 Vol 6, No 1: February 2016 Vol 5, No 6: December 2015 Vol 5, No 5: October 2015 Vol 5, No 4: August 2015 Vol 5, No 3: June 2015 Vol 5, No 2: April 2015 Vol 5, No 1: February 2015 Vol 4, No 6: December 2014 Vol 4, No 5: October 2014 Vol 4, No 4: August 2014 Vol 4, No 3: June 2014 Vol 4, No 2: April 2014 Vol 4, No 1: February 2014 Vol 3, No 6: December 2013 Vol 3, No 5: October 2013 Vol 3, No 4: August 2013 Vol 3, No 3: June 2013 Vol 3, No 2: April 2013 Vol 3, No 1: February 2013 Vol 2, No 6: December 2012 Vol 2, No 5: October 2012 Vol 2, No 4: August 2012 Vol 2, No 3: June 2012 Vol 2, No 2: April 2012 Vol 2, No 1: February 2012 Vol 1, No 2: December 2011 Vol 1, No 1: September 2011 More Issue