Claim Missing Document
Check
Articles

Found 3 Documents
Search

Performance Analysis of Scheduling Schemes for Femto to Macro Interference Coordination in LTE-Femtocell Deployment Scenario Rafina Destiarti Ainul; Haniah Mahmudah; Ari Wijayanti
EMITTER International Journal of Engineering Technology Vol 4 No 1 (2016)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (563.184 KB) | DOI: 10.24003/emitter.v4i1.114

Abstract

Deploying femtocells that have low power level in LTE with small coverage area is an alternative solution for mobile operators to improve indoors network coverage area as well as system capacity. However deploying femtocells (HeNB) that were used co-channel frequency, can be brought about interference problem to the Macro BTS (eNB). Close Subscriber Group (CSG) of HeNB allows only User equipment (UE) to access HeNB. HeNB is the source of interference for UE who cannot access it. Therefore it is necessary for interference coordination methods among the HeNB and eNB. The methods are ICIC (Intercell Interference Coordination) and eICIC (enhanced Intercell Interference Coordination).  This paper proposed performance analysis of scheduling schemes for Femto to macro interference coordination that allocated resource in the frequency and time domain using LTE-Femtocell suburban and urban deployment scenario. Simulation result using ICIC methods can improve SINR performance 15.77 % in urban and 28.66 % in suburban, throughput performance 10.11 % in urban and 21.05 % in suburban. eICIC methods can improve SINR performance 17.44 % in urban and 31.14 % in suburban, throughput performance 19.83% in urban and 44.39 % in suburban.The result prove using eICIC method in time domain resource have better performance than using ICIC method in frequency resource. However using eICIC method in suburban deployment scenariocan increase the performance of SINR and throughput more effective than using eICIC method in urban deployment scenario.
Performance Analysis of Cell Zooming Based Centralized Algorithm for Energy Efficient in Surabaya Haniah Mahmudah; Okkie Puspitorini; Ari Wijayanti; Nur Adi Siswandari; Rosabella Ika Yuanita
EMITTER International Journal of Engineering Technology Vol 4 No 2 (2016)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (361.589 KB) | DOI: 10.24003/emitter.v4i2.155

Abstract

The cellular subscribers’s growth over the years increases the traffic volume at Base Stations (BSs) significantly. Typically, in central business district (CBD) area, the traffic load in cellular network in the daytime is relatively heavy, and light in the daynight. But, Base Station still consumes energy normally. It can cause the energy consumption is wasted. On the other hand, energy consumption being an important issue in the world. Because, higher energy consumption contributes on increasing of emission. Thus, it requires for efficiency energy methods by switching BS dynamically. The methods are Lower-to-Higher (LH) and Higher-to-Lower (HL) scheme on centralized algorithm. In this paper propose cell zooming technique  which can adjusts the cell size dynamic based on traffic condition. The simulation result by using Lower-to-Higher (LH) scheme can save the network energy consumption up to 70.7917% when the number of mobile user is 37 users and 0% when the number of mobile user is more than or equal to 291 users. While, Higher-to-Lower (HL) scheme can save the network energy consumption up to 32.3303% when the number of mobile user is 37 users and 0% when the number of mobile user is more than or equal to 292 users. From both of these schemes, we can analyze that by using Lower-to-Higher (LH) scheme reduces energy consumption greater than using Higher-to-Lower (HL) scheme. Nevertheless, both of them can be implemented for energy-efficient method in CBD area. Eventually, the cell zooming technique by using two schemes on centralized algorithm which leads to green cellular network in Surabaya is investigated.
Penerapan Floyd-Warshall untuk Pencarian Rute Terpendek pada Aplikasi Notifikasi Kecelakaan Lalu Lintas Haniah Mahmudah; M. Fajar Ibrahim; Okkie Puspitorini; Ari Wijayanti; Nur Adi Siswandari
Jurnal Nasional Teknik Elektro dan Teknologi Informasi Vol 11 No 4: November 2022
Publisher : Departemen Teknik Elektro dan Teknologi Informasi, Fakultas Teknik, Universitas Gadjah Mada

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/jnteti.v11i4.2201

Abstract

In the case of an accident, a prompt response is needed to prevent accidents or provide assistance to traffic accident victims. Several ways can be carried out to address this problem. One of them is by developing several smartphone applications for accident detection and accident notification that provide aid in traffic accidents. The existing application to assist the victims merely presents the shortest route from the respondent to the victim’s location without any features that help the respondent find a route to the nearest hospital and police station. Therefore, this study develops a smartphone application for accident alerts for victims’ relatives and respondents, which assists in locating the victim’s position and the closest hospitals and police stations. This accident notification app for smartphones utilizes open-source software and is very scalable. The outcome of this study is an Android application capable of sending accident notification broadcasts, allowing the victim’s relatives and respondents to get accident notifications and drive to the accident place using the route given by the application. In addition, the developed app also provides information about the location of the nearest hospital and police station, allowing respondents nearby the location to help the victim promptly. The results of testing the application using the black box method on the Android platform indicated that 100% of the features of this application were running well. The shortest route with the Floyd-Warshall algorithm was 4.199 km, with no route deviations from the distance testing scenario. The average speed of notification delivery response from victims to respondents was 27.86 ms.