Elma Zanaj

Prof. Elma Zanaj

Polytechnic University of Tirana
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
14 September 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Elma ZanajElma Zanaj
Elma Zanaj
Ennio GambiEnnio Gambi
Ennio Gambi
BZBlerina Zanaj
Blerina Zanaj
DDDeivis Disha
Deivis Disha
NKNels Kola
Nels Kola
Underwater sensor networks (UWSN) include a large number of devices and sensors which are positioned in a specific area to carry out monitoring in cooperation with each other as well as data collection. In this paper it has been studied and simulated the performance of an extremely important parameter for communication in UWSN such as the acoustic channel capacity as function of water temperature and salinity arise. The performance’s knowledge on acoustic channel may be improved with a deep study of its dependence by season, weather conditions or environmental parameters variation. If an accurate estimation of the acoustic communication capacity utilization for a given area is required, we must consider also the bottom materials of this area. The simulation results presented in this study through an improved algorithm, will help to understand better the underwater acoustic channel performance as a function of all these factors. This is of particular importance for acoustic modems designing, in order to implement suitable functionalities able to adapt the data transmission capacity of the acoustic link to the structure of the oceanic bottom and its component material.

1 January 2007
Verified
Conference Paper
Closed access
Elma ZanajElma Zanaj
Elma Zanaj
Marco BaldiMarco Baldi
Marco Baldi
FCFranco Chiaraluce
Franco Chiaraluce
Gossip is a well-known technique for distributed computing in an arbitrarily connected network of nodes. The gossip algorithm, which is very simple to implement, takes into account strong limitations in computational, communication and energy resources that usually characterize nodes in sensor networks. In gossip, the computational burden is distributed among the nodes, and computation and communication are managed in a very quick and efficient way: in essence, each node acquires its own measure and, starting from it, exchanges information with its neighbors, according with a connection probability distribution. In this paper, we study the performance of gossip algorithms, aiming to test the agreement between analytical results on the averaging time and the actual convergence time for specific scenarios, estimated through numerical simulations. Furthermore, we apply an optimization technique, recently appeared in the literature, that theoretically allow to accelerate convergence. Numerical simulations permit to assess the effects of optimization in real cases, thus evaluating the actual improvement in performance it achieves.


1 January 2015 in International Journal of Advanced Computer Science and Applications
Verified
Journal Article
Open access
PDF file
EKEzmerina Kotobelli
Ezmerina Kotobelli
Elma ZanajElma Zanaj
Elma Zanaj
MAMirjeta Alinci
Mirjeta Alinci
EBEdra Bumçi
Edra Bumçi
MBMario Banushi
Mario Banushi
Nowadays many applications use Wireless Sensor Networks (WSN) as their fulfill the purpose of collection of data from a particular phenomenon. Their data centric behavior as well as harsh restrictions on energy makes WSN different from many other networks known. During this work the energy management problem of WSN is studied, by using our proposed modified algorithm. It is a clustering algorithm, where nodes are organized in clusters and send their data to a shift selected cluster head. It will provide improvement on energy consumption in terms of member nodes, by making cluster heads static. LEACH already has a good energy saving strategy but our modification will provide an easier approach towards efficiency.

1 June 2017
Verified
Conference Paper
Closed access
Elma ZanajElma Zanaj
Elma Zanaj
BZBlerina Zanaj
Blerina Zanaj
IEIndrit Enesi
Indrit Enesi
JLJetmir Lumi
Jetmir Lumi
Wireless Sensor Networks are used widely for remote environmental monitoring, target tracking or for recording weather conditions change applied at diverse applications. They have become integral part of our lives, by giving reliable data gathering and even that the sensor node is small, lightweight and portable. As the power for each sensor node is supplied from a battery, the lifetime and residual energy are crucial conditions of such kind of networks by no distinction of their application type. So, finding efficient distributed algorithms for approximately optimal strong routing techniques is an open issue that can be explored further. Simulations in this work are done by applying an existing routing algorithm of WSN, the algorithm helps to rise up different situations which are near to real cases. And by studying the algorithm performance it is possible to bring to it other improvements by changing accordingly the most important parameters. The main contribution of this paper consists in bringing some simulation results that help to make a better choice regarding the parameter of node degree depending from the different values of percentage for the parameter of link failure, these values are simulated by our choice.

1 July 2017
Verified
Conference Paper
Closed access
IEIndrit Enesi
Indrit Enesi
Elma ZanajElma Zanaj
Elma Zanaj
SKSaimir Kokonozi
Saimir Kokonozi
BZBlerina Zanaj
Blerina Zanaj
Internet service providers are increasingly facing the growing demand for higher bandwidth to satisfy users demand. In the condition of overloaded, the web servers show delays in offering services until reaching total unavailability. There exist several approaches to deal with this problem, the core of them use the configuration of a web server in cluster, but offering the service as a single entity. The ways to distribute the load on the web servers' cluster vary from the simplest to the most complicated ones, which analyze the state of the servers and optimize the balance. In this paper is presented a new evaluation method of the servers load. The algorithm calculates the CPU load based on the amount of traffic exchanged from each server and the number of active connections, weighting more the later factor. The servers under a specified safety level of the CPU usage, undergo a weighted evaluation process to determine the least loaded one, at which the clients 'requests will be sent. The NS2 simulation results show a significant reduction in balancer work, while increasing its performance on traffic distribution.