Monthly Archives: June 2014

Video İşleme Algoritmalarının OpenCL Kullanarak GPU ve FPGA Üzerinde Veri-Paralel Gerçeklenmesi

Video İşleme Algoritmalarının OpenCL Kullanarak GPU ve FPGA Üzerinde Veri-Paralel Gerçeklenmesi

  • Duygu Büyükaydin, Toygar Akgün, Metin Aktas, and Cengiz Erbas. Video Isleme Algoritmalarinin OpenCL Kullanarak GPU ve FPGA Üzerinde Veri-Paralel Gerçeklenmesi. In Savunma teknolojileri kongresi (SAVTEK 2014), Ankara, Turkey, 2014.
    [BibTeX]
    @InProceedings{2014-06-BUYUKAYADIN,
    author = {Duygu B{\"u}y{\"u}kaydin and Toygar Akg{\"u}n and Metin Aktas and Cengiz Erbas},
    title = {{Video Isleme Algoritmalarinin OpenCL Kullanarak GPU ve FPGA {\"U}zerinde Veri-Paralel Ger{\c c}eklenmesi}},
    booktitle = {Savunma Teknolojileri Kongresi ({SAVTEK 2014})},
    address = {Ankara, Turkey},
    date = {2014-06-25/2014-06-27},
    year = {2014}
    }

Posted in Dissemination | Leave a comment
Game Theoretic D2D Content Dissemination in 4G Cellular Networks

Game Theoretic D2D Content Dissemination in 4G Cellular Networks

  • Angelos Antonopoulos and Christos Verikoukis. Multi-Player Game Theoretic MAC Strategies for Energy Efficient Data Dissemination. IEEE Transactions on Wireless Communications, 13(2):592-603, 2014. doi:10.1109/TWC.2013.120713.120790
    [BibTeX] [Abstract]

    The existence of multiple active sources in wireless data dissemination scenarios raises considerable channel access issues. Although the overall goal in the network is the successful accomplishment of the dissemination, the individual wireless nodes aim at maximizing their battery lifetime by minimizing their particular energy consumption. Considering thus the self-centered behavior of the nodes, we anticipate to design Medium Access Control (MAC) policies in order to provide the terminals with energy efficient solutions without compromising the dissemination completion time. In this paper, we propose non-cooperative game theoretic channel access strategies by estimating equilibrium points that achieve balance between conserving energy and completing the data dissemination. In particular, we present two different MAC strategies: i) a distributed approach for ad-hoc networks, and ii) a coordinated approach for infrastructure networks, where a central controller is sporadically used to accelerate the data dissemination. In addition, network-coded transmissions are considered to eliminate the need of control packets exchange. Both analytical and simulation results are provided to evaluate our proposed schemes, demonstrating the significant gains that game theoretic techniques can bring to the network performance compared to standardized solutions.

    @Article{2014-02-ANTONOPOULOS,
    author = {Angelos Antonopoulos and Christos Verikoukis},
    journal = {{IEEE Transactions on Wireless Communications}},
    title = {{Multi-Player Game Theoretic MAC Strategies for Energy Efficient Data Dissemination}},
    date = {2014-02-11},
    volume = {13},
    number = {2},
    pages = {592-603},
    doi = {10.1109/TWC.2013.120713.120790},
    abstract = {The existence of multiple active sources in wireless data dissemination scenarios raises considerable channel access issues. Although the overall goal in the network is the successful accomplishment of the dissemination, the individual wireless nodes aim at maximizing their battery lifetime by minimizing their particular energy consumption. Considering thus the self-centered behavior of the nodes, we anticipate to design Medium Access Control (MAC) policies in order to provide the terminals with energy efficient solutions without compromising the dissemination completion time. In this paper, we propose non-cooperative game theoretic channel access strategies by estimating equilibrium points that achieve balance between conserving energy and completing the data dissemination. In particular, we present two different MAC strategies: i) a distributed approach for ad-hoc networks, and ii) a coordinated approach for infrastructure networks, where a central controller is sporadically used to accelerate the data dissemination. In addition, network-coded transmissions are considered to eliminate the need of control packets exchange. Both analytical and simulation results are provided to evaluate our proposed schemes, demonstrating the significant gains that game theoretic techniques can bring to the network performance compared to standardized solutions.},
    year = {2014}
    }

Posted in Dissemination | Leave a comment
Wireless Energy Harvesting in Two-Way Network Coded Cooperative Communications: A Stochastic Approach for Large Scale Networks

Wireless Energy Harvesting in Two-Way Network Coded Cooperative Communications: A Stochastic Approach for Large Scale Networks

  • Prodromos-Vassilios Mekikis, Angelos Antonopoulos, and Christos Verikoukis. Wireless Energy Harvesting in Two-Way Network Coded Cooperative Communications: A Stochastic Approach for Large Scale Networks. IEEE Communication Letters, 18(6):1011-1014, 2014. doi:10.1109/LCOMM.2014.2320926
    [BibTeX] [Abstract]

    In this letter, we study the performance of network coding (NC)-aided cooperative communications in large scale networks, where the relays are able to harvest energy emitted by wireless transmissions. In particular, we derive theoretical expressions for key network performance metrics, i.e., the probability of successful data exchange and the network lifetime gain. The proposed analytical expressions are verified via extensive Monte Carlo simulations, demonstrating the potential benefits of the energy harvested by the wireless transmissions.

    @Article{2014-06-MEKIKIS-1,
    author = {Prodromos-Vassilios Mekikis and Angelos Antonopoulos and Christos Verikoukis},
    title = {{Wireless Energy Harvesting in Two-Way Network Coded Cooperative Communications: A Stochastic Approach for Large Scale Networks}},
    journal = {{IEEE Communication Letters}},
    date = {2014-06-06},
    volume = {18},
    number = {6},
    pages = {1011-1014},
    doi = {10.1109/LCOMM.2014.2320926},
    abstract = {In this letter, we study the performance of network coding (NC)-aided cooperative communications in large scale networks, where the relays are able to harvest energy emitted by wireless transmissions. In particular, we derive theoretical expressions for key network performance metrics, i.e., the probability of successful data exchange and the network lifetime gain. The proposed analytical expressions are verified via extensive Monte Carlo simulations, demonstrating the potential benefits of the energy harvested by the wireless transmissions.},
    year = {2014},
    }

Posted in Dissemination | Leave a comment
RF Indoor Positioning System Supported by Wireless Computer Vision Sensors

RF Indoor Positioning System Supported by Wireless Computer Vision Sensors

  • Przemysaw Woznica, Michal Tarkowski, Marek Plotka, and Lukasz Kulas. RF Indoor Positioning System Supported by Wireless Computer Vision Sensors. In Proceedings of the 20th International Conference on Microwaves, Radar, and Wireless Communication (MIKON), pages 1-3, Gdansk, Poland, 2014.
    [BibTeX] [Abstract] [Download PDF]

    In this paper the possibility of increase the accuracy of RF fingerprinting indoor tracking system by the use of additional information from simple vision system is examined. As the distances in signal space differs from ones in real environment the ambiguity in decision process of fingerprinting algorithm can occur when set of closest distances between tag and map points in signal space corresponds to big distances differences in environment. The additional information from vision system is utilize to resolve which of possible locations should be chosen as correct one. In paper localization system is described and experimental results are presented as the evaluation of system performance.

    @InProceedings{2014-06-WOZNICA,
    author = {Przemysaw Woznica and Michal Tarkowski and Marek Plotka and Lukasz Kulas},
    title = {{RF Indoor Positioning System Supported by Wireless Computer Vision Sensors}},
    booktitle = {{Proceedings of the 20th International Conference on Microwaves, Radar, and Wireless Communication (MIKON)}},
    date = {2014-06-16/2014-06-18},
    pages = {1-3},
    address = {Gdansk, Poland},
    url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber = 6899996&tag = 1},
    abstract = {In this paper the possibility of increase the accuracy of RF fingerprinting indoor tracking system by the use of additional information from simple vision system is examined. As the distances in signal space differs from ones in real environment the ambiguity in decision process of fingerprinting algorithm can occur when set of closest distances between tag and map points in signal space corresponds to big distances differences in environment. The additional information from vision system is utilize to resolve which of possible locations should be chosen as correct one. In paper localization system is described and experimental results are presented as the evaluation of system performance.},
    year = {2014}
    }

Posted in Dissemination | Leave a comment
A Parallel Action Language for Embedded Applications and its Compilation Flow

A Parallel Action Language for Embedded Applications and its Compilation Flow

  • Ivan Llopard, Albert Cohen, Christian Fabre, and Nicolas Hili. A Parallel Action Language for Embedded Applications and its Compilation Flow. In Proceedings of 17th International Workshop on Software and Compilers for Embedded Systems, pages 118-127, Schloss Rheinfels, St. Goar, Germany, 2014. doi:10.1145/2609248.2609257
    [BibTeX] [Abstract]

    The complexity of Embedded System (ES) development is increasing dramatically. This has several cumulative sources: the intricate combination of data-intensive, computational and control aspects; the ubiquity of parallelism and heterogeneity of modern architectures; and the diversity of target- specific, non-deterministic programming models (e.g., C++ with explicit message passing, OpenCL, VHDL). Model-Driven Engineering (MDE) proposes to manage complexity by raising the level of abstraction for designers and developers, and refining the implementation for a particular context and platform through model transformations. In such frameworks, behavior is often specified by means of Hierarchical State Machines (HSMs) equiped with an action language. However, although such models represent some level of control parallelism through objects and HSMs, data parallelism, compound data, and the exploitation and optimization thereof remains very limited. In this paper, we propose an action language that seamlessly combines HSMs with data parallelism and operations on compound data. It preserves the expressivity of HSM and captures a layout-neutral description of data organisation. It also extends message-passing with an intuitive semantics for this additional paralellism and provides strong foundation for array-based optimisation techniques. We present this language together with a baseline code generation flow to enable the production of efficient, low-level imperative code.

    @InProceedings{2014-06-LLOPARD,
    author = {Ivan Llopard and Albert Cohen and Christian Fabre and Nicolas Hili},
    title = {{A Parallel Action Language for Embedded Applications and its Compilation Flow}},
    booktitle = {{Proceedings of 17th International Workshop on Software and Compilers for Embedded Systems}},
    date = {2014-06-10/2014-06-11},
    address = {Schloss Rheinfels, St. Goar, Germany},
    pages = {118-127},
    doi = {10.1145/2609248.2609257},
    abstract = {The complexity of Embedded System (ES) development is increasing dramatically. This has several cumulative sources: the intricate combination of data-intensive, computational and control aspects; the ubiquity of parallelism and heterogeneity of modern architectures; and the diversity of target- specific, non-deterministic programming models (e.g., C++ with explicit message passing, OpenCL, VHDL). Model-Driven Engineering (MDE) proposes to manage complexity by raising the level of abstraction for designers and developers, and refining the implementation for a particular context and platform through model transformations. In such frameworks, behavior is often specified by means of Hierarchical State Machines (HSMs) equiped with an action language. However, although such models represent some level of control parallelism through objects and HSMs, data parallelism, compound data, and the exploitation and optimization thereof remains very limited. In this paper, we propose an action language that seamlessly combines HSMs with data parallelism and operations on compound data. It preserves the expressivity of HSM and captures a layout-neutral description of data organisation. It also extends message-passing with an intuitive semantics for this additional paralellism and provides strong foundation for array-based optimisation techniques. We present this language together with a baseline code generation flow to enable the production of efficient, low-level imperative code.},
    year = {2014}
    }

Posted in Dissemination | Leave a comment
Two-tier Cellular Random Network Planning for Minimum Deployment Cost

Two-tier Cellular Random Network Planning for Minimum Deployment Cost

  • Prodromos-Vassilios Mekikis, Elli Kartsakli, Angelos Antonopoulos, Aris S. Lalos, and Luis Alonso. Two-tier Cellular Random Network Planning for Minimum Deployment Cost. In Proceedings of the 2014 IEEE International Conference on Communications (ICC), pages 1248-1253, Sydney, Australia, 2014. doi:10.1109/ICC.2014.6883492
    [BibTeX] [Abstract]

    Random dense deployment of heterogeneous networks (HetNets), consisting of macro base stations (BS) and small cells (SC), can provide higher quality of service (QoS) while increasing the energy efficiency of the cellular network. In addition, it is possible to achieve lower deployment cost and, therefore, maximize the benefits for the network providers. In this paper, we propose a novel method to determine the minimum deployment cost of a two-tier heterogeneous cellular network using random deployment. After deriving the coverage probability of the two-tier deployment by using stochastic geometry tools, we identify the tier intensities that provide the minimum deployment cost for a given coverage probability. Extensive simulations verify the existence of a unique set of intensities for different coverage constraints.

    @InProceedings{2014-06-MEKIKIS-2,
    title = {{Two-tier Cellular Random Network Planning for Minimum Deployment Cost}},
    author = {Prodromos-Vassilios Mekikis and Elli Kartsakli and Angelos Antonopoulos and Aris S. Lalos and Luis Alonso},
    booktitle = {{Proceedings of the 2014 IEEE International Conference on Communications (ICC)}},
    date = {2014-06-10/2014-06-14},
    address = {Sydney, Australia},
    pages = {1248-1253},
    doi = {10.1109/ICC.2014.6883492},
    abstract = {Random dense deployment of heterogeneous networks (HetNets), consisting of macro base stations (BS) and small cells (SC), can provide higher quality of service (QoS) while increasing the energy efficiency of the cellular network. In addition, it is possible to achieve lower deployment cost and, therefore, maximize the benefits for the network providers. In this paper, we propose a novel method to determine the minimum deployment cost of a two-tier heterogeneous cellular network using random deployment. After deriving the coverage probability of the two-tier deployment by using stochastic geometry tools, we identify the tier intensities that provide the minimum deployment cost for a given coverage probability. Extensive simulations verify the existence of a unique set of intensities for different coverage constraints.},
    year = {2014}
    }

Posted in Dissemination | Leave a comment
A Model-based Approach for Rapid Prototyping of Parallel Applications on Many-core

A Model-based Approach for Rapid Prototyping of Parallel Applications on Many-core

  • Ayoub Nouri, Anca Molnos, Marius Bozga, Julien Mottin, Arnaud Tonda, Saddek Bensalem, and François Pacull. A Model-based Approach for Rapid Prototyping of Parallel Applications on Many-core. Poster presented at the 51st Design Automation Conference in San Francisco, USA, 2014.
    [BibTeX] [Abstract]

    Rapid prototyping of highly parallel applications on many-core platforms is extremely challenging. We present an automated analysis and code generation flow for implementing high-level KPN models on STHORM, an embedded 64-core computing fabric developed by STMicroelectronics. The flow is model-based with sound semantical basis and enables formal verification and performance analysis at different stages. The target for code generation is the MCAPI programming standard which has been ported on STHORM. Currently, the flow is fully operational. We report concrete results obtained on image-processing algorithms and illustrate the potential benefits of the flow for exploring implementation trade-offs.

    @Misc{2014-06-NOURI,
    author = {Ayoub Nouri and Anca Molnos and Marius Bozga and Julien Mottin and Arnaud Tonda and Saddek Bensalem and Fran\c{c}ois Pacull},
    title = {{A Model-based Approach for Rapid Prototyping of Parallel Applications on Many-core}},
    date = {2014-06-01/2014-06-05},
    howpublished = {Poster presented at the 51st Design Automation Conference in San Francisco, USA},
    abstract = {Rapid prototyping of highly parallel applications on many-core platforms is extremely challenging. We present an automated analysis and code generation flow for implementing high-level KPN models on STHORM, an embedded 64-core computing fabric developed by STMicroelectronics. The flow is model-based with sound semantical basis and enables formal verification and performance analysis at different stages. The target for code generation is the MCAPI programming standard which has been ported on STHORM. Currently, the flow is fully operational. We report concrete results obtained on image-processing algorithms and illustrate the potential benefits of the flow for exploring implementation trade-offs.},
    year = {2014}
    }

Posted in Dissemination | Leave a comment