Aybars Ural

Aybars Ural

Auto-generated profile, based on publicly available information

Aybars Ural

International Computer Institute, Ege University,IzmirTurkey

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2019
Verified
Conference Paper
Closed access
NKNoushin Karimpour
Noushin Karimpour
BKBurak Karaduman
Burak Karaduman
AUAybars Ural
Aybars Ural
Moharram ChallengerMoharram Challenger
Moharram Challenger
ODOrhan Dagdeviren
Orhan Dagdeviren
Compliance monitoring and surveillance is an important task in hospitals and health centers as the health-care associated infections can have serious consequences such as increasing mortality and accelerating morbidity. Monitoring and surveillance by human observers have its own difficulties such as loss of observer concentration, human error build-up, and professional deformation. In this work, we have implemented and compared the performance of two Internet of Things based approaches for monitoring the hand hygiene of medical staff during patient visiting. We used ESP modules as base stations and smart-phones as mobile nodes and estimated the distances using Bluetooth RSSI values to locate the medical staff in a patient's room. In the proximity-based solution, we compared the RSSI from a mobile node measured on different ESP nodes/modules and utilized the assumption stating that the mobile node is closest to an ESP node which yields the highest RSSI value. In the trilateration based approach, we used the RSSI values to estimate the distance of mobile nodes to each ESP node and we used a trilateration algorithm to locate the mobile node in the room. Our experiments showed that the proximity-based solution recorded 20% incorrect location visiting while the percentage for the trilateration based solution was 8%. This indicates that the trilateration based approach is more reliable than the proximity-based solution in this application domain.

31 January 2014 in International journal of Computer Networks & Communications
Verified
Journal Article
Open access
VKVedat Kavalci
Vedat Kavalci
AUAybars Ural
Aybars Ural
ODOrhan Dagdeviren
Orhan Dagdeviren

1 January 2016
Verified
Book Chapter
Closed access
CICan Umut Ileri
Can Umut Ileri
CUCemil Aybars Ural
Cemil Aybars Ural
ODOrhan Dagdeviren
Orhan Dagdeviren
VKVedat Kavalci
Vedat Kavalci
An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.