Pub Date : 2016-10-01DOI: 10.1109/ISPACS.2016.7824700
Munish Kumar, V. Nath
In this paper, a microstrip line-fed antenna with a Spidron fractal shape in the ground plane is presented. The proposed antenna is able to work in two frequency bands i.e. from 6.27–6.97 GHz and 15.73–19.38 GHz with corresponding resonant frequencies of 6.57 and 17.61 GHz. The impedance bandwidth obtained for both operating bands is 0.703 GHz and 3.64 GHz respectively. High gain of 9.04 dB and 7.82 dB for both bands is obtained. Due to the Spidron defected ground structure, the decrease in the resonant frequency can be seen. The volumetric dimensions of the proposed antenna are highly compact (36 mm×36 mm×0.762 mm) and hence, can be easily integrated with other microwave circuits. The proposed structure covers super-extended C-band, partial K-band and Ku-band, hence suitable for several satellite transmission applications. The proposed antenna designs have been simulated using ANSYS HFSS. The design concepts, rules and procedure for the proposed antenna are also discussed in detail.
{"title":"Dual-band microstrip line-fed antenna with fractal Spidron defected ground structure","authors":"Munish Kumar, V. Nath","doi":"10.1109/ISPACS.2016.7824700","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824700","url":null,"abstract":"In this paper, a microstrip line-fed antenna with a Spidron fractal shape in the ground plane is presented. The proposed antenna is able to work in two frequency bands i.e. from 6.27–6.97 GHz and 15.73–19.38 GHz with corresponding resonant frequencies of 6.57 and 17.61 GHz. The impedance bandwidth obtained for both operating bands is 0.703 GHz and 3.64 GHz respectively. High gain of 9.04 dB and 7.82 dB for both bands is obtained. Due to the Spidron defected ground structure, the decrease in the resonant frequency can be seen. The volumetric dimensions of the proposed antenna are highly compact (36 mm×36 mm×0.762 mm) and hence, can be easily integrated with other microwave circuits. The proposed structure covers super-extended C-band, partial K-band and Ku-band, hence suitable for several satellite transmission applications. The proposed antenna designs have been simulated using ANSYS HFSS. The design concepts, rules and procedure for the proposed antenna are also discussed in detail.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121465071","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824694
Xianshu Jin, Hwiyun Ju, Sungchol Cho, B. Mun, Cheongbin Kim, Sunyoung Han
Adaptive streaming over HTTP(DASH) is a popular method to deliver best possible quality media using available network resources. In this paper we propose QoS routing algorithm design for providing high quality and continuous stream of media streaming in SDN(Software Defined Network). To provide seamless DASH service over SDN is a challenge because traditional DASH service manner mismatches with SDN per-flow centralized management architecture. Therefore, it is necessary to have some interactions between communication layers for making routing decision. Firstly, we propose server driven bit rate estimation approach to computes video bit rate and inform the application QoS requirement to the control layer. The media server estimates the resources available and dynamically adapts the video bit rate in order to reduce additional software stacks on end-user devices. We also present a Kalman Filter based rate adaptation mechanism that predicts the next bit rate of the media in a seamless manner. Secondary, we propose a QoS routing design for adaptive stream, it allows SDN controller evaluates all passable paths based on whole network topology by taking the bit rate of the segments in to account. We perform an experiment and presented the server driven bandwidth estimation mechanism to compute the appropriate bit rate and rate switching in smooth manner. We also construct a SDN testbed for QoS routing algorithm for adaptive streaming, it shows additional reroute step to find path that satisfy the bitrate before downgrade the video quality.
{"title":"QoS routing design for adaptive streaming in Software Defined Network","authors":"Xianshu Jin, Hwiyun Ju, Sungchol Cho, B. Mun, Cheongbin Kim, Sunyoung Han","doi":"10.1109/ISPACS.2016.7824694","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824694","url":null,"abstract":"Adaptive streaming over HTTP(DASH) is a popular method to deliver best possible quality media using available network resources. In this paper we propose QoS routing algorithm design for providing high quality and continuous stream of media streaming in SDN(Software Defined Network). To provide seamless DASH service over SDN is a challenge because traditional DASH service manner mismatches with SDN per-flow centralized management architecture. Therefore, it is necessary to have some interactions between communication layers for making routing decision. Firstly, we propose server driven bit rate estimation approach to computes video bit rate and inform the application QoS requirement to the control layer. The media server estimates the resources available and dynamically adapts the video bit rate in order to reduce additional software stacks on end-user devices. We also present a Kalman Filter based rate adaptation mechanism that predicts the next bit rate of the media in a seamless manner. Secondary, we propose a QoS routing design for adaptive stream, it allows SDN controller evaluates all passable paths based on whole network topology by taking the bit rate of the segments in to account. We perform an experiment and presented the server driven bandwidth estimation mechanism to compute the appropriate bit rate and rate switching in smooth manner. We also construct a SDN testbed for QoS routing algorithm for adaptive streaming, it shows additional reroute step to find path that satisfy the bitrate before downgrade the video quality.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129711796","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824761
Chi-Chia Sun, Heng-Chi Lai, M. Sheu, Yi Huang
Recently, how to make surveillance cameras running in all weather conditions become a very important research topic. Because surveillance images are often influenced by the weather conditions in a real world. In this paper, a fast single image fog removal algorithm based on an improved dark channel prior method is proposed. Compared to the latest works, the proposed algorithm can increase 28.5% computing speed and 41.8% image contrast ratio. Meanwhile, it can remove fog efficiently without the influence in the night too.
{"title":"Single image fog removal algorithm based on an improved dark channel prior method","authors":"Chi-Chia Sun, Heng-Chi Lai, M. Sheu, Yi Huang","doi":"10.1109/ISPACS.2016.7824761","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824761","url":null,"abstract":"Recently, how to make surveillance cameras running in all weather conditions become a very important research topic. Because surveillance images are often influenced by the weather conditions in a real world. In this paper, a fast single image fog removal algorithm based on an improved dark channel prior method is proposed. Compared to the latest works, the proposed algorithm can increase 28.5% computing speed and 41.8% image contrast ratio. Meanwhile, it can remove fog efficiently without the influence in the night too.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130885991","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824736
K. Kanjanasit, Changhai Wang
This paper presents the design and fabrication of a high-performance patch antenna for operation over the X-band (8 – 12 GHz) frequency region. A wide impedance bandwidth is obtained using a double-tuned impedance matching technique. The wideband antenna consists of a short-end CPW and the coupling aperture on an FR4 substrate, and a suspended patch. The triple resonance effect associated with the characteristics of the double-tuned aperture and the patch is used to achieve wideband performance. The effects of the design parameters of the CPW line, the aperture, air gap and the patch are studied. The patch was fabricated on a thin film LCP substrate. A laser micromachined polymer rim was used to create an air gap between the LCP substrate and the FR4 substrate. The measured results show a good agreement with that of the simulation work. The impedance bandwidth of the antenna is as large as 41% covering the X-band. The 3-dB gain bandwidth is 43% and the maximum gain is 8.5 dBi.
{"title":"A high performance micromachined CPW fed aperture coupled compact patch antenna using a double-tuned impedance matching method","authors":"K. Kanjanasit, Changhai Wang","doi":"10.1109/ISPACS.2016.7824736","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824736","url":null,"abstract":"This paper presents the design and fabrication of a high-performance patch antenna for operation over the X-band (8 – 12 GHz) frequency region. A wide impedance bandwidth is obtained using a double-tuned impedance matching technique. The wideband antenna consists of a short-end CPW and the coupling aperture on an FR4 substrate, and a suspended patch. The triple resonance effect associated with the characteristics of the double-tuned aperture and the patch is used to achieve wideband performance. The effects of the design parameters of the CPW line, the aperture, air gap and the patch are studied. The patch was fabricated on a thin film LCP substrate. A laser micromachined polymer rim was used to create an air gap between the LCP substrate and the FR4 substrate. The measured results show a good agreement with that of the simulation work. The impedance bandwidth of the antenna is as large as 41% covering the X-band. The 3-dB gain bandwidth is 43% and the maximum gain is 8.5 dBi.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977309","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824690
Yuuya Moritani, Atsushi Yoshihara, Nayuta Jinda, M. Muneyasu
In this paper, we propose a method of embedding and detecting data in printed images with several resolutions using the camera of a tablet device. The proposed method is based on a method that uses block division and code diffusion. To specify the resolution of an image and the number of blocks, invisible markers that are embedded in the amplitude domain of the discrete Fourier transform of the target image are used. The angles between the markers and the x-axis are used to specify the resolution and the number of blocks. The proposed method can increase the variety of images suitable for data embedding. From experimental results obtained using a tablet device, it is shown that the proposed method is effective for specifying the resolution and the number of blocks in a captured image.
{"title":"Data detection method from printed images with different resolutions using tablet device","authors":"Yuuya Moritani, Atsushi Yoshihara, Nayuta Jinda, M. Muneyasu","doi":"10.1109/ISPACS.2016.7824690","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824690","url":null,"abstract":"In this paper, we propose a method of embedding and detecting data in printed images with several resolutions using the camera of a tablet device. The proposed method is based on a method that uses block division and code diffusion. To specify the resolution of an image and the number of blocks, invisible markers that are embedded in the amplitude domain of the discrete Fourier transform of the target image are used. The angles between the markers and the x-axis are used to specify the resolution and the number of blocks. The proposed method can increase the variety of images suitable for data embedding. From experimental results obtained using a tablet device, it is shown that the proposed method is effective for specifying the resolution and the number of blocks in a captured image.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370209","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824712
Yuma Kinoshita, Sayaka Shiota, H. Kiya
A number of inverse tone mapping operators (TMOs) for dynamic range expansion have been proposed due to the need to visualize low dynamic range (LDR) images on high dynamic range (HDR) devices. This paper proposes a novel inverse TMO, which enables to generate HDR images from LDR ones, not only without using any specific parameters but also at low computing costs. Furthermore, the inverse TMO has a new characteristic when an LDR image is mapped from an HDR one by Reinhard's global operator. In the case, the HDR image reconstructed by the proposed method without parameters can be remapped into the same image as that remapped from an HDR one reconstructed with parameters. Experimental results show that the proposed inverse tone mapping (TM) operation can be carried out, while keeping better structural similarity and lower computing cost than conventional methods.
{"title":"An inverse tone mapping operator based on Reinhard's global operator","authors":"Yuma Kinoshita, Sayaka Shiota, H. Kiya","doi":"10.1109/ISPACS.2016.7824712","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824712","url":null,"abstract":"A number of inverse tone mapping operators (TMOs) for dynamic range expansion have been proposed due to the need to visualize low dynamic range (LDR) images on high dynamic range (HDR) devices. This paper proposes a novel inverse TMO, which enables to generate HDR images from LDR ones, not only without using any specific parameters but also at low computing costs. Furthermore, the inverse TMO has a new characteristic when an LDR image is mapped from an HDR one by Reinhard's global operator. In the case, the HDR image reconstructed by the proposed method without parameters can be remapped into the same image as that remapped from an HDR one reconstructed with parameters. Experimental results show that the proposed inverse tone mapping (TM) operation can be carried out, while keeping better structural similarity and lower computing cost than conventional methods.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114553318","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824691
N. Wongwaen, C. Sinthanayothin
This paper proposes an automatic background subtraction algorithm for 3D object. The objective is to apply the algorithm to quickly pick out the 3D object from background when the position is roughly fixed. The method consists of 3 main steps as follows. First step creates a box for hold all 3D data. Second step projects the whole 3D points on a horizontal plane which is align on the middle of the box, then converts the 3D projected points into 2D black and white image. Final step applies connected component labeling algorithm for classifying black pixels, in order to find the group which satisfies the object constraints and to render associated 3D points. The experimental results shown that the whole process takes 1.6 sec on average, with 90 % accuracy.
{"title":"Automatic background subtraction algorithm for 3D object by using connected-component labeling algorithm","authors":"N. Wongwaen, C. Sinthanayothin","doi":"10.1109/ISPACS.2016.7824691","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824691","url":null,"abstract":"This paper proposes an automatic background subtraction algorithm for 3D object. The objective is to apply the algorithm to quickly pick out the 3D object from background when the position is roughly fixed. The method consists of 3 main steps as follows. First step creates a box for hold all 3D data. Second step projects the whole 3D points on a horizontal plane which is align on the middle of the box, then converts the 3D projected points into 2D black and white image. Final step applies connected component labeling algorithm for classifying black pixels, in order to find the group which satisfies the object constraints and to render associated 3D points. The experimental results shown that the whole process takes 1.6 sec on average, with 90 % accuracy.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132738690","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824676
Sasa Maric, S. Reisenfeld, L. Goratti
This paper presents a method to alleviate the effects of primary user emulation attacks in cognitive radio (CR) networks. The proposed method uses a simplified belief propagation (BP) algorithm that is able to identify whether a transmitter is a legitimate primary user or an attacker. In a primary user emulation attack (PUEA) a transmitter impersonates a primary user (PU) in order to deceive secondary users (SU) into believing that a channel is occupied. As a result, secondary users must vacate the channel immediately. This paper presents a simplified belief propagation method as a defence strategy against primary user emulation attacks. In our method each secondary user examines an incoming signal from a transmitter and determines with a certain probability whether the transmitter is a legitimate user or not. This probability is known as the belief. The beliefs at each secondary user are reconciled and a final belief is compared to a predefined threshold. If the final belief is below the threshold, the user is identified as an attacker. If it is above the threshold, the user is deemed a primary user. This result is then propagated throughout the network so that all users on the network are aware of the attacker. In this paper, we present a method based on the belief propagation framework. The proposed method converges in a single iteration; this is the result of a redefined messaging protocol and a simplified belief equation. As a result, the computational complexity of the method is reduced significantly, while still maintaining a high level of accuracy.
{"title":"A single iteration belief propagation algorithm to minimize the effects of primary user emulation attacks","authors":"Sasa Maric, S. Reisenfeld, L. Goratti","doi":"10.1109/ISPACS.2016.7824676","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824676","url":null,"abstract":"This paper presents a method to alleviate the effects of primary user emulation attacks in cognitive radio (CR) networks. The proposed method uses a simplified belief propagation (BP) algorithm that is able to identify whether a transmitter is a legitimate primary user or an attacker. In a primary user emulation attack (PUEA) a transmitter impersonates a primary user (PU) in order to deceive secondary users (SU) into believing that a channel is occupied. As a result, secondary users must vacate the channel immediately. This paper presents a simplified belief propagation method as a defence strategy against primary user emulation attacks. In our method each secondary user examines an incoming signal from a transmitter and determines with a certain probability whether the transmitter is a legitimate user or not. This probability is known as the belief. The beliefs at each secondary user are reconciled and a final belief is compared to a predefined threshold. If the final belief is below the threshold, the user is identified as an attacker. If it is above the threshold, the user is deemed a primary user. This result is then propagated throughout the network so that all users on the network are aware of the attacker. In this paper, we present a method based on the belief propagation framework. The proposed method converges in a single iteration; this is the result of a redefined messaging protocol and a simplified belief equation. As a result, the computational complexity of the method is reduced significantly, while still maintaining a high level of accuracy.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235383","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824697
P. Pal, A. Dasgupta, J. Akhil, R. Kar, D. Mandal, S. P. Ghosal
This paper delivers an efficient and accurate approach for identification of a Box-Jenkins (BJ) structure based Wiener model with Simplex Particle Swarm Optimization (SPSO) algorithm. The accuracy and the precision of the identification scheme have been justified with the reported bias and variance information, respectively, of the estimated parameters. The output mean square error (MSE) has been considered as the fitness function to be optimized for the SPSO algorithm. The accuracy and the consistency of the identification of the Hammerstein system have been justified with the corresponding statistical information of the MSE. Accurate identification of the parameters associated with the linear dynamic sub-system ensures the stability of the overall closed loop system.
{"title":"Identification of a Box-Jenkins structured two stage cascaded model using Simplex Particle Swarm Optimization algorithm","authors":"P. Pal, A. Dasgupta, J. Akhil, R. Kar, D. Mandal, S. P. Ghosal","doi":"10.1109/ISPACS.2016.7824697","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824697","url":null,"abstract":"This paper delivers an efficient and accurate approach for identification of a Box-Jenkins (BJ) structure based Wiener model with Simplex Particle Swarm Optimization (SPSO) algorithm. The accuracy and the precision of the identification scheme have been justified with the reported bias and variance information, respectively, of the estimated parameters. The output mean square error (MSE) has been considered as the fitness function to be optimized for the SPSO algorithm. The accuracy and the consistency of the identification of the Hammerstein system have been justified with the corresponding statistical information of the MSE. Accurate identification of the parameters associated with the linear dynamic sub-system ensures the stability of the overall closed loop system.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115991999","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 : 2016-10-01DOI: 10.1109/ISPACS.2016.7824706
Sanchai Jaktheerangkoon, K. N. Nakorn, K. Rojviboonchai
In present, IEEE 802.11p is a standard for vehicle communication which can enhance quality of road transportation. The communication in non-line-of-sight is an important scenario that has to be inspected deeply. Because in non-line-of-sight or blind corner scenario, the signals may be obstructed. This reason would lead to communication loss, and be a big challenge for building safety applications. In this paper, we conduct real experiments at different types of blind corners and propose success rate of transmitted packets and RSSI of the received packets. Moreover, we suggest number of packets that have to be sent to ensure that at least one packet is delivered successfully. Our results show that the communication range in blind corner is less than 60 m from the corner, and for the worst case, the communication range is only 20 m from the corner. Our research is useful in daily life and can be contributed to safety applications and protocols implementation, roads and buildings construction, and network simulations.
{"title":"Performance study of IEEE 802.11p in blind corner scenario","authors":"Sanchai Jaktheerangkoon, K. N. Nakorn, K. Rojviboonchai","doi":"10.1109/ISPACS.2016.7824706","DOIUrl":"https://doi.org/10.1109/ISPACS.2016.7824706","url":null,"abstract":"In present, IEEE 802.11p is a standard for vehicle communication which can enhance quality of road transportation. The communication in non-line-of-sight is an important scenario that has to be inspected deeply. Because in non-line-of-sight or blind corner scenario, the signals may be obstructed. This reason would lead to communication loss, and be a big challenge for building safety applications. In this paper, we conduct real experiments at different types of blind corners and propose success rate of transmitted packets and RSSI of the received packets. Moreover, we suggest number of packets that have to be sent to ensure that at least one packet is delivered successfully. Our results show that the communication range in blind corner is less than 60 m from the corner, and for the worst case, the communication range is only 20 m from the corner. Our research is useful in daily life and can be contributed to safety applications and protocols implementation, roads and buildings construction, and network simulations.","PeriodicalId":131543,"journal":{"name":"2016 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126828593","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
扫码关注我们
求助内容：
应助结果提醒方式：