Department of Information Systems and Technologies

Permanent URI for this communityhttps://hdl.handle.net/11693/115471

Browse

Browsing Department of Information Systems and Technologies by Subject "Algorithms"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Computer aided frequency planning for the radio and TV broadcasts
    (Institute of Electrical and Electronics Engineers, 1996-06) Altıntaş, Ayhan; Ocalı, O.; Topçu, Satılmış; Tanyer, S. G.; Köymen, Hayrettin
    The frequency planning of the VHF and UHF broadcasts in Turkey is described. This planning is done with the aid of computer databases and digital terrain map. The frequency offset is applied whenever applicable to increase the channel capacity. The offset assignment is done through simulated annealing algorithm. The international rules and regulations concerning Turkey are also considered.
  • Thumbnail Image
    ItemOpen Access
    Energy load balancing for fixed clustering in wireless sensor networks
    (IEEE, 2012) Ali, Syed Amjad; Sevgi, C.
    Clustering can be used as an effective technique to achieve both energy load balancing and an extended lifetime for a wireless sensor network (WSN). This paper presents a novel approach that first creates energy balanced fixed/static clusters, and then, to attain energy load balancing within each fixed cluster, rotates the role of cluster head through uniformly quantized energy levels based approach to prolong the overall network lifetime. The method provided herein, not only provides near-dynamic clustering performance but also reduces the complexity due to the fact that cluster formation phase is implemented once. The presented simulation results clearly show the efficacy of this proposed algorithm and thus, it can be used as a practical approach to obtain maximized network lifetime for energy balanced clusters in fixed clustering environments. © 2012 IEEE.
  • Thumbnail Image
    ItemOpen Access
    On Lempel-Ziv complexity of sequences
    (Springer, Berlin, Heidelberg, 2006) Doǧanaksoy, A.; Göloǧlu, Faruk
    We derive recurrences for counting the number a(n, r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute these recurrences. We employed these algorithms to compute a(n, r) and expected value. EPn, of number of patterns of a sequence of length n, for relatively large n. We offer a randomness test based on the algorithms to be used for testing randomness of binary sequences. We give outputs of the algorithms for some n. We also provide results of the proposed test applied to the outputs of contestant stream ciphers of ECRYPT's eSTREAM. © Springer-Verlag Berlin Heidelberg 2006.