Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6848994
H. Şenol, E. Panayirci, M. Uysal
This paper is concerned with a challenging problem of channel estimation for amplify-and-forward cooperative relay based orthogonal frequency division multiplexing (OFDM) systems in the presence of sparse underwater acoustic channels and of the correlative non-Gaussian noise. We exploit the sparse structure of the channel impulse response to improve the performance of the channel estimation algorithm, due to the reduced number of taps to be estimated. The resulting novel algorithm initially estimates the overall sparse channel taps from the source to the destination as well as their locations using the matching pursuit (MP) approach. The correlated non-Gaussian effective noise is modeled as a Gaussian mixture. Based on the Gaussian mixture model, an efficient and low complexity algorithm is developed based on the combinations of the MP and the space-alternating generalized expectation-maximization (SAGE) technique, to improve the estimates of the channel taps and their location as well as the noise distribution parameters in an iterative way. The proposed SAGE algorithm is designed in such a way that, by choosing the admissible hidden data properly on which the SAGE algorithm relies, a subset of parameters is updated for analytical tractability and the remaining parameters for faster convergence Computer simulations show that underwater acoustic (UWA) channel is estimated very effectively and the proposed algorithm has excellent symbol error rate and channel estimation performance.
{"title":"Sparse channel estimation for OFDM-based underwater cooperative systems with amplify-and-forward relaying","authors":"H. Şenol, E. Panayirci, M. Uysal","doi":"10.1109/BlackSeaCom.2014.6848994","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6848994","url":null,"abstract":"This paper is concerned with a challenging problem of channel estimation for amplify-and-forward cooperative relay based orthogonal frequency division multiplexing (OFDM) systems in the presence of sparse underwater acoustic channels and of the correlative non-Gaussian noise. We exploit the sparse structure of the channel impulse response to improve the performance of the channel estimation algorithm, due to the reduced number of taps to be estimated. The resulting novel algorithm initially estimates the overall sparse channel taps from the source to the destination as well as their locations using the matching pursuit (MP) approach. The correlated non-Gaussian effective noise is modeled as a Gaussian mixture. Based on the Gaussian mixture model, an efficient and low complexity algorithm is developed based on the combinations of the MP and the space-alternating generalized expectation-maximization (SAGE) technique, to improve the estimates of the channel taps and their location as well as the noise distribution parameters in an iterative way. The proposed SAGE algorithm is designed in such a way that, by choosing the admissible hidden data properly on which the SAGE algorithm relies, a subset of parameters is updated for analytical tractability and the remaining parameters for faster convergence Computer simulations show that underwater acoustic (UWA) channel is estimated very effectively and the proposed algorithm has excellent symbol error rate and channel estimation performance.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121714627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849016
Zhanji Wu, Yongtao Shi, Xiang Chen, Yongxu Zhu
An efficient component-interleaved nonbinary Low Density Parity Check Code (LDPC) scheme is proposed, which can significantly outperform the binary LDPC codes scheme without a component interleaver on fading channels. In this paper, the bit-error-rate (BER) performances of nonbinary LDPC codes are compared with the binary LDPC codes on the independent Rayleigh fading channel. And then we use a fast decoding algorithm to reduce the complexity of nonbinary LDPC decoding, so that the nonbinary LDPC codes scheme becomes more practical. Besides, the influence of a component interleaver on the performance of nonbinary LDPC codes is also analyzed. Simulation results prove that nonbinary LDPC codes significantly outperform the binary LDPC codes, especially for low code rate and high order Galois field, which is up to 1.5dB. The component interleaver also can obviously improve the performance of nonbinary LDPC codes on fading channels, which is up to 0.3 dB.
{"title":"An efficient component-interleaved nonbinary Low Density Parity Check Code scheme on Rayleigh fading channels","authors":"Zhanji Wu, Yongtao Shi, Xiang Chen, Yongxu Zhu","doi":"10.1109/BlackSeaCom.2014.6849016","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849016","url":null,"abstract":"An efficient component-interleaved nonbinary Low Density Parity Check Code (LDPC) scheme is proposed, which can significantly outperform the binary LDPC codes scheme without a component interleaver on fading channels. In this paper, the bit-error-rate (BER) performances of nonbinary LDPC codes are compared with the binary LDPC codes on the independent Rayleigh fading channel. And then we use a fast decoding algorithm to reduce the complexity of nonbinary LDPC decoding, so that the nonbinary LDPC codes scheme becomes more practical. Besides, the influence of a component interleaver on the performance of nonbinary LDPC codes is also analyzed. Simulation results prove that nonbinary LDPC codes significantly outperform the binary LDPC codes, especially for low code rate and high order Galois field, which is up to 1.5dB. The component interleaver also can obviously improve the performance of nonbinary LDPC codes on fading channels, which is up to 0.3 dB.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132031730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849026
J. Saldaña, G. Marfia, M. Roccetti
This paper studies the feasibility of playing a First Person Shooter interactive online game while traveling as a passenger on a car in an urban scenario where wireless connectivity is available through WiFi Access Points (APs). Knowing in advance the positions of APs, we propose a mechanism that is capable of predicting future connectivity times while moving, so that a player may choose (or not) to begin a game round. With such estimation of connectivity time, a player can obtain a feeling regarding which parts of a game s/he could (not) accomplish and hence be put in the position of deciding for the best. We validated our approach through simulations utilizing a large set of real vehicular movement traces collected in Pisa, Italy.
{"title":"Everything you always wanted to know about playing a FPS game on a car","authors":"J. Saldaña, G. Marfia, M. Roccetti","doi":"10.1109/BlackSeaCom.2014.6849026","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849026","url":null,"abstract":"This paper studies the feasibility of playing a First Person Shooter interactive online game while traveling as a passenger on a car in an urban scenario where wireless connectivity is available through WiFi Access Points (APs). Knowing in advance the positions of APs, we propose a mechanism that is capable of predicting future connectivity times while moving, so that a player may choose (or not) to begin a game round. With such estimation of connectivity time, a player can obtain a feeling regarding which parts of a game s/he could (not) accomplish and hence be put in the position of deciding for the best. We validated our approach through simulations utilizing a large set of real vehicular movement traces collected in Pisa, Italy.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132201634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849012
Zhiqiang Liu, Jingfei Jiang, Y. Dou, Rongchun Li, Song Guo
The multiple-input-multiple-output (MIMO) technique is widely used in modern wireless communication systems because it greatly increases system capacity and improves communication reliability. However, MIMO detection is a challenging task. Sphere detection algorithms are preferred in practice as these can achieve bit error rate performances close to that of the maximum likelihood algorithm. Sphere detection algorithms also offer affordable computational complexity. In this paper, we propose a layer-wise detector framework on the basis of the K-best detection algorithm for 4×4, 16-QAM MIMO systems. The kernel module of the framework is based on the layer-processing module. In this case, we fully pipelined the module with a parallel sorting unit. By using the layer-processing module, we can assemble different detectors with different performances and cost trade-offs. We deployed four detectors with different amounts of layer processing modules. All detectors receive a throughput of over 300 Mbps. The detector with eight layer modules was fully pipelined. This detector generates one result per clock cycle and obtains a throughput of up to 2.68 Gbps at 168 MHz.
{"title":"A high throughput K-best detector on FPGA","authors":"Zhiqiang Liu, Jingfei Jiang, Y. Dou, Rongchun Li, Song Guo","doi":"10.1109/BlackSeaCom.2014.6849012","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849012","url":null,"abstract":"The multiple-input-multiple-output (MIMO) technique is widely used in modern wireless communication systems because it greatly increases system capacity and improves communication reliability. However, MIMO detection is a challenging task. Sphere detection algorithms are preferred in practice as these can achieve bit error rate performances close to that of the maximum likelihood algorithm. Sphere detection algorithms also offer affordable computational complexity. In this paper, we propose a layer-wise detector framework on the basis of the K-best detection algorithm for 4×4, 16-QAM MIMO systems. The kernel module of the framework is based on the layer-processing module. In this case, we fully pipelined the module with a parallel sorting unit. By using the layer-processing module, we can assemble different detectors with different performances and cost trade-offs. We deployed four detectors with different amounts of layer processing modules. All detectors receive a throughput of over 300 Mbps. The detector with eight layer modules was fully pipelined. This detector generates one result per clock cycle and obtains a throughput of up to 2.68 Gbps at 168 MHz.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"53 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120905917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849033
M. Kolomytsev, A. Lipatov, Yurii Syniepolskiy
This article is devoted to the threshold values assessment, adjusted by ITU, which determine the necessity of satellite networks coordination in the Ku band. Determined maximum capacity of geostationary orbit for different satellite separation and power limitations operating in standard DVB-S2.
{"title":"Impact of ITU threshold values on geostationary orbit efficiency in the Ku band","authors":"M. Kolomytsev, A. Lipatov, Yurii Syniepolskiy","doi":"10.1109/BlackSeaCom.2014.6849033","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849033","url":null,"abstract":"This article is devoted to the threshold values assessment, adjusted by ITU, which determine the necessity of satellite networks coordination in the Ku band. Determined maximum capacity of geostationary orbit for different satellite separation and power limitations operating in standard DVB-S2.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114035945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849022
M. Kolomytsev, K. Shalbanov
Newton's method is the slowest and Golden section method is the fastest one.For each value of end-to-end communication rate, minimal energy consumption could be achieved with optimal parameters. In case of increasing the total distance, energy consumption would grow. For equal number of receiving and transmitting antennas on each hop, increasing the number of antennas results in increasing end-to-end rate with a fixed energy consumption. With a fixed effective rate, increasing the number of antennas leads to increasing energy consumption in the low effective rate region and decreasing energy consumption in the high effective rate region. If end-to-end distance would stay the same but distances between hops would differ, changes in energy consumption could be minor or quit significant. Total energy consumption in case of equally-spaced hops is lower than for non-equally spaced hops in low effective rate region and higher in high effective rate region.
{"title":"Efficiency estimation of using MIMO technology in multi-hop networks","authors":"M. Kolomytsev, K. Shalbanov","doi":"10.1109/BlackSeaCom.2014.6849022","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849022","url":null,"abstract":"Newton's method is the slowest and Golden section method is the fastest one.For each value of end-to-end communication rate, minimal energy consumption could be achieved with optimal parameters. In case of increasing the total distance, energy consumption would grow. For equal number of receiving and transmitting antennas on each hop, increasing the number of antennas results in increasing end-to-end rate with a fixed energy consumption. With a fixed effective rate, increasing the number of antennas leads to increasing energy consumption in the low effective rate region and decreasing energy consumption in the high effective rate region. If end-to-end distance would stay the same but distances between hops would differ, changes in energy consumption could be minor or quit significant. Total energy consumption in case of equally-spaced hops is lower than for non-equally spaced hops in low effective rate region and higher in high effective rate region.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115177841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6848997
Shih-Chun Lin, I. Akyildiz, Pu Wang, Zhi Sun
To provide constant channel conditions for a great deal of distributed wireless sensors, magneto-inductive (MI) propagation technique suggests an attractive facilitation of underground sensor networks (USNs) for MI-USNs. However, to put this MI method into practice, a reliable and efficient data transportation is a must to fulfill a pre-defined level of quality of service (QoS). In this paper, a complete study is first given for the different communication functionalities from physical to network layers as well as the QoS requirements of applications. Rather than adopting the currently layered approach, a two-phase cross-layer protocol, called Xlayer, is then proposed to deliver statistical QoS guarantees and obtain both optimal energy savings and throughput gain concurrently. Simulation results conform that Xlayer achieves significant energy savings, high throughput efficiency, and dependable MI communication, thus facilitating a new design paradigm for MI-USNs.
{"title":"Optimal energy-throughput efficiency for magneto-inductive underground sensor networks","authors":"Shih-Chun Lin, I. Akyildiz, Pu Wang, Zhi Sun","doi":"10.1109/BlackSeaCom.2014.6848997","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6848997","url":null,"abstract":"To provide constant channel conditions for a great deal of distributed wireless sensors, magneto-inductive (MI) propagation technique suggests an attractive facilitation of underground sensor networks (USNs) for MI-USNs. However, to put this MI method into practice, a reliable and efficient data transportation is a must to fulfill a pre-defined level of quality of service (QoS). In this paper, a complete study is first given for the different communication functionalities from physical to network layers as well as the QoS requirements of applications. Rather than adopting the currently layered approach, a two-phase cross-layer protocol, called Xlayer, is then proposed to deliver statistical QoS guarantees and obtain both optimal energy savings and throughput gain concurrently. Simulation results conform that Xlayer achieves significant energy savings, high throughput efficiency, and dependable MI communication, thus facilitating a new design paradigm for MI-USNs.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849017
Reza A. Ashrafi, Abdullah Sariduman, A. E. Pusane
The newest family of low-density parity-check (LDPC) codes, spatially-coupled (SC) codes, is shown to have several desirable characteristics including low implementation complexity and close-to-optimal performance over a range of channels. Furthermore, because of their ribbon-shaped parity-check matrices, window decoding can be used to decode these codes, which leads to low-delay implementations. Researchers have focused on asymptotically regular SC code ensembles and have examined several aspects of the code construction processes. In this paper, we concentrate on irregular SC code ensembles. We evaluate their decoding thresholds over the binary erasure channel and show that their performance is better than their regular SC counterparts. It is also shown that the gap between asymptotic coding thresholds of irregular SC ensembles and the fundamental Shannon limit gets negligibly small. For the sake of a better comparison, we have also evaluated the finite-length error performance of selected regular and irregular SC codes over the additive white Gaussian channel and it is also observed that finite-length error performance of these irregular SC codes outperforms regular SC codes. To further improve the error performance of these codes and to lower the possible error floors, progressive edge growth algorithm has also been considered in the finite-length performance analysis.
{"title":"Asymptotic and finite-length performance of irregular spatially-coupled codes","authors":"Reza A. Ashrafi, Abdullah Sariduman, A. E. Pusane","doi":"10.1109/BlackSeaCom.2014.6849017","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849017","url":null,"abstract":"The newest family of low-density parity-check (LDPC) codes, spatially-coupled (SC) codes, is shown to have several desirable characteristics including low implementation complexity and close-to-optimal performance over a range of channels. Furthermore, because of their ribbon-shaped parity-check matrices, window decoding can be used to decode these codes, which leads to low-delay implementations. Researchers have focused on asymptotically regular SC code ensembles and have examined several aspects of the code construction processes. In this paper, we concentrate on irregular SC code ensembles. We evaluate their decoding thresholds over the binary erasure channel and show that their performance is better than their regular SC counterparts. It is also shown that the gap between asymptotic coding thresholds of irregular SC ensembles and the fundamental Shannon limit gets negligibly small. For the sake of a better comparison, we have also evaluated the finite-length error performance of selected regular and irregular SC codes over the additive white Gaussian channel and it is also observed that finite-length error performance of these irregular SC codes outperforms regular SC codes. To further improve the error performance of these codes and to lower the possible error floors, progressive edge growth algorithm has also been considered in the finite-length performance analysis.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114349678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6849024
Kübra Ayvaz, Ercan Kurtarangil, B. Canberk
The tradeoff between the connectivity and the coverage area has been a crucial challenge to investigate, in order to design effective vehicular network deployments in urban areas. Generally, in order to increase and scale the connectivity among vehicles, the radio transmission range needs to be extended. In both Vehicle-to-Vehicle (V2V) and Vehicle-to-Road Side Units (V2R) deployments, the increase in the number of Road Side Unit (RSU) and/or On Board Units (OBU) can also extend the network coverage area. However, these solutions can be possible with extra deployment costs. Beside that, due to the generic high mobility characteristics of vehicles, they cannot maintain a robust connection for a long time even though there are enough nodes to relay the transmission, leading a decrease in the network connectivity. To solve this challenge between the coverage area and the connectivity, in this paper, we propose a relay based coverage area model that uses already connected vehicles as a relay between disconnected vehicles and RSUs. Disconnected vehicles run the proposed neighbor discovery algorithm to setup a connection with already connected vehicles around their radio transmission range. Our algorithm builds dynamic neighbor maps and provides an optimal relay node to the disconnected vehicles. Therefore, the connectivity is increased neither changing the transmission range nor increasing the number of RSUs. Moreover, the proposed neighbor maps provide accurate location information, thus V2V and V2R connections can be built and sustained without the need of Global Positioning system (GPS) information, which can be misleading for many urban area scenarios due to the topological disorders. The through evaluations of the proposed algorithm show that our mechanism provides similar extension effect with enhancing of RSU transmission range two times.
{"title":"A relay-based coverage area model for optimal connectivity in vehicular networks","authors":"Kübra Ayvaz, Ercan Kurtarangil, B. Canberk","doi":"10.1109/BlackSeaCom.2014.6849024","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6849024","url":null,"abstract":"The tradeoff between the connectivity and the coverage area has been a crucial challenge to investigate, in order to design effective vehicular network deployments in urban areas. Generally, in order to increase and scale the connectivity among vehicles, the radio transmission range needs to be extended. In both Vehicle-to-Vehicle (V2V) and Vehicle-to-Road Side Units (V2R) deployments, the increase in the number of Road Side Unit (RSU) and/or On Board Units (OBU) can also extend the network coverage area. However, these solutions can be possible with extra deployment costs. Beside that, due to the generic high mobility characteristics of vehicles, they cannot maintain a robust connection for a long time even though there are enough nodes to relay the transmission, leading a decrease in the network connectivity. To solve this challenge between the coverage area and the connectivity, in this paper, we propose a relay based coverage area model that uses already connected vehicles as a relay between disconnected vehicles and RSUs. Disconnected vehicles run the proposed neighbor discovery algorithm to setup a connection with already connected vehicles around their radio transmission range. Our algorithm builds dynamic neighbor maps and provides an optimal relay node to the disconnected vehicles. Therefore, the connectivity is increased neither changing the transmission range nor increasing the number of RSUs. Moreover, the proposed neighbor maps provide accurate location information, thus V2V and V2R connections can be built and sustained without the need of Global Positioning system (GPS) information, which can be misleading for many urban area scenarios due to the topological disorders. The through evaluations of the proposed algorithm show that our mechanism provides similar extension effect with enhancing of RSU transmission range two times.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-05-27DOI: 10.1109/BlackSeaCom.2014.6848998
I. Bekmezci, M. Ermis, Sezgin Kaplan
Flying Ad Hoc Networks (FANETs) is one of the most effective multi communication architectures through its capability of transferring data simultaneously without any infrastructure. The FANET task allocation problem is one-to-one assignment of agents to tasks so that the overall benefit of all the agents is maximized by taking delays and costs into account, given a set of agents and a set of tasks. A coordination based task allocation system ensuring spatial and temporal coordination between UAVs is essential for FANETs. In this paper, a new multi UAV task planning heuristic is proposed for FANETs to visit all target points in a minimum time, while preserving all time network connectivity. Effectiveness in the mission execution and cost efficiency in the task allocation have been presented by conducting a bunch of experiments performed on 2D terrains. Performance results validated the usage of our algorithms for the connected multi UAV task planning problem for FANET.
{"title":"Connected multi UAV task planning for Flying Ad Hoc Networks","authors":"I. Bekmezci, M. Ermis, Sezgin Kaplan","doi":"10.1109/BlackSeaCom.2014.6848998","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2014.6848998","url":null,"abstract":"Flying Ad Hoc Networks (FANETs) is one of the most effective multi communication architectures through its capability of transferring data simultaneously without any infrastructure. The FANET task allocation problem is one-to-one assignment of agents to tasks so that the overall benefit of all the agents is maximized by taking delays and costs into account, given a set of agents and a set of tasks. A coordination based task allocation system ensuring spatial and temporal coordination between UAVs is essential for FANETs. In this paper, a new multi UAV task planning heuristic is proposed for FANETs to visit all target points in a minimum time, while preserving all time network connectivity. Effectiveness in the mission execution and cost efficiency in the task allocation have been presented by conducting a bunch of experiments performed on 2D terrains. Performance results validated the usage of our algorithms for the connected multi UAV task planning problem for FANET.","PeriodicalId":427901,"journal":{"name":"2014 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122985964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：