Alper Akyurek | University of California, San Diego (original) (raw)

Papers by Alper Akyurek

2015 Sixth International Green and Sustainable Computing Conference (IGSC), 2015

2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2015

2008 IEEE 16th Signal Processing, Communication and Applications Conference, 2008

Oz. Kablosuz aglarda verimli çogagönderiminönemli bir problem haline gelmesi, amaöte yandan kablo... more Oz. Kablosuz aglarda verimli çogagönderiminönemli bir problem haline gelmesi, amaöte yandan kablosuz ag için optimal çogagönderim agacı probleminin NP-complete olması, hesaplanabilir iyi höristikleri gerekli kılmıştır. Bu makalede, kablosuz aglarda verimli gönderim için yüksek başarımlı yeni bir dagıtık algoritma sunulmaktadır.En fazla O(N 3 ) hesaplama karmaşıklıgındaki bu algoritmanın kurdugu çogagönderim agacının uzunlugunun (daha dogrusu, yapraklara ulaşmak için yapılması gereken iletim sayısının), nod sayısı (N ) ve çogagönderim grubu büyüklügü (M ) ile artış hızının bilinen bir optimal altsınıra çok yakın oldugu benzetimler ile gözlenmiştir. Ayrıca, agacın kurulumu için nodlar arası iletilecek mesaj miktarının da küçük oldugu gözlenmiştir. Topoloji degişikliklerine adaptasyon için de bir bakım ve tamir algoritmasıönerilmiştir.

2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE, 2010

This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIre... more This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a side product it creates a multicast mesh structure by maintaining alternative branches at every tree node, thus providing robustness to link failures. This makes it suitable for both ad-hoc networks and access networks with multiple gateways. It is proved that SWIM is fully distributed, with a worst case complexity (for multicast) upper-bounded by O(N 3 ), and average complexity of only O(N 2 ). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). In terms of minimizing the number of forwarding nodes (NFN), SWIM is optimal for unicast. Its average NFN in the broadcast and multicast cases is compared with practical algorithms targeting low NFN reported in the literature. In both multicast and unicast, SWIM performs competitively in terms of NFN with the previous solutions, while having smaller maximum depth, and consequently low delay.

Proceedings of the 1st ACM Conference on Embedded Systems for Energy-Efficient Buildings - BuildSys '14, 2014

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2014

2013 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2013

ABSTRACT The need for a smarter grid is emerging with the increase of peak demand and the integra... more ABSTRACT The need for a smarter grid is emerging with the increase of peak demand and the integration of renewable resources. A great solution for peak shifting and renewable energy smoothing is through the usage of energy storage devices. This paper focuses on the energy storage power control problem in small to medium sized power distribution systems with loads, energy storage devices and renewable resources connected to the grid. To the best of our knowledge, solutions in this area either focus on the optimization problem with a convex optimization solver, that have high worst-case complexities or on sub-optimal heuristics. This paper provides a low-complexity solution, ECO-DAC, which is optimal in terms of minimizing a multi-tier cost function. We show on multiple case studies that it is possible to save up to 21% in costs for electricity drawn from the grid, compared to the no-battery case.

The Computer Journal, 2011

This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIre... more This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N 3 ), and an empirically found, average complexity of only O(N 2 ). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product it creates a multicast mesh structure by maintaining alternative branches at every tree node, thus providing robustness to link failures. This makes it suitable for both ad-hoc networks and access networks with multiple gateways. In terms of minimizing the number of forwarding nodes (NFN), SWIM is optimal for unicast and competitive with the state of the art for multicast, outperforming the best known distributed approaches from the literature except for the M-AODV algorithm. However, simulations of the M-AODV algorithm alongside SWIM on a large set of network instances shows that the depth minimality of SWIM leads to lower average delay per multicast destination. It is also shown that the delay performance of SWIM is virtually unaffected by the presence of low mobility in the network.

2015 Sixth International Green and Sustainable Computing Conference (IGSC), 2015

2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2015

2008 IEEE 16th Signal Processing, Communication and Applications Conference, 2008

2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE, 2010

Proceedings of the 1st ACM Conference on Embedded Systems for Energy-Efficient Buildings - BuildSys '14, 2014

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2014

2013 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2013

The Computer Journal, 2011

This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIre... more This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N 3 ), and an empirically found, average complexity of only O(N 2 ). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product it creates a multicast mesh structure by maintaining alternative branches at every tree node, thus providing robustness to link failures. This makes it suitable for both ad-hoc networks and access networks with multiple gateways. In terms of minimizing the number of forwarding nodes (NFN), SWIM is optimal for unicast and competitive with the state of the art for multicast, outperforming the best known distributed approaches from the literature except for the M-AODV algorithm. However, simulations of the M-AODV algorithm alongside SWIM on a large set of network instances shows that the depth minimality of SWIM leads to lower average delay per multicast destination. It is also shown that the delay performance of SWIM is virtually unaffected by the presence of low mobility in the network.