Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677262
Xinyu Gu, Wenyu Li, Lin Zhang
With Cell Range Extension in a heterogeneous network, the users in the range extension area usually suffer from high interference from macro cell. This may degrade the cell-edge user downlink performance if the resource provided in the Low Power Node can not compensate for the loss from the increased interference. This paper proposes an adaptive algorithm to dynamically adjust the coverage area of the Low Power Node. By using this algorithm, the coverage area of the Low Power Node is extended dynamically according to the varying traffic situation in the network so as to avoid any unnecessarily increased interference from range extension. Simulation results indicate that the proposed algorithm can ensure a nearly optimal cell-edge user performance in all tested traffic load situation.
{"title":"Adaptive cell range control in heterogeneous network","authors":"Xinyu Gu, Wenyu Li, Lin Zhang","doi":"10.1109/WCSP.2013.6677262","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677262","url":null,"abstract":"With Cell Range Extension in a heterogeneous network, the users in the range extension area usually suffer from high interference from macro cell. This may degrade the cell-edge user downlink performance if the resource provided in the Low Power Node can not compensate for the loss from the increased interference. This paper proposes an adaptive algorithm to dynamically adjust the coverage area of the Low Power Node. By using this algorithm, the coverage area of the Low Power Node is extended dynamically according to the varying traffic situation in the network so as to avoid any unnecessarily increased interference from range extension. Simulation results indicate that the proposed algorithm can ensure a nearly optimal cell-edge user performance in all tested traffic load situation.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132552027","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677052
Peng Chen, Lenan Wu
This paper presents an optimum weighted cumulation target detection (OWCTD) algorithm and prewhitening processing matrix for resonance region multi-carrier radar, and points out that the target detection performance of the wideband multi-carrier pulse radar using OWCTD algorithm is better than the traditional match filter algorithm. In addition, this paper deduces that the target velocity has little effect on the detection performance of the OWCTD algorithm. Finally, the asymptotic target detection probability as SNR tends to infinity is given, and the OWCTD algorithm performs better than the traditional match filter target detection algorithm at all target velocity.
{"title":"Optimum weighted cumulation target detection for resonance region multi-carrier radar","authors":"Peng Chen, Lenan Wu","doi":"10.1109/WCSP.2013.6677052","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677052","url":null,"abstract":"This paper presents an optimum weighted cumulation target detection (OWCTD) algorithm and prewhitening processing matrix for resonance region multi-carrier radar, and points out that the target detection performance of the wideband multi-carrier pulse radar using OWCTD algorithm is better than the traditional match filter algorithm. In addition, this paper deduces that the target velocity has little effect on the detection performance of the OWCTD algorithm. Finally, the asymptotic target detection probability as SNR tends to infinity is given, and the OWCTD algorithm performs better than the traditional match filter target detection algorithm at all target velocity.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511178","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677152
Jun Zhou, Yijun Mo, Bang Wang
Mobility Load Balancing (MLB) and Mobility Robustness Optimization (MRO) are two important functions in Long Term Evolved (LTE) cellular mobile networks. They are closely related because they both adjust handover parameters to achieve their respective objective. But some conflicts may occur if both of the two functions work inconsistently and adjust the same parameter in opposite directions. This will result in huge resource waste, and both of them will not work efficiently. In this paper, we present a scheme embedded in MLB based on the cell load to solve the conflict problem. Analysis and simulation results show that the proposed scheme works efficiently and improves the performance of the network.
{"title":"Joint optimization between MLB and MRO based on cell load balance for LTE networks","authors":"Jun Zhou, Yijun Mo, Bang Wang","doi":"10.1109/WCSP.2013.6677152","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677152","url":null,"abstract":"Mobility Load Balancing (MLB) and Mobility Robustness Optimization (MRO) are two important functions in Long Term Evolved (LTE) cellular mobile networks. They are closely related because they both adjust handover parameters to achieve their respective objective. But some conflicts may occur if both of the two functions work inconsistently and adjust the same parameter in opposite directions. This will result in huge resource waste, and both of them will not work efficiently. In this paper, we present a scheme embedded in MLB based on the cell load to solve the conflict problem. Analysis and simulation results show that the proposed scheme works efficiently and improves the performance of the network.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130346607","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677184
Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun
Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.
{"title":"Improved multi-hop time synchronization for Underwater Acoustic Networks","authors":"Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun","doi":"10.1109/WCSP.2013.6677184","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677184","url":null,"abstract":"Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114484730","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677041
A. Awang, Shobhit Agarwal
In Wireless Sensor Networks (WSNs), sensor nodes are often deployed in large quantity and high density. Due to dense deployment, the sensed data are often redundant and highly correlated. Transmitting redundant data is not practical in the resource-constrained WSNs particularly from the viewpoint of energy conservation. Data aggregation offers a key solution to curtail the network loads and hence reduces the transmission energy consumption. In this work, we propose two data aggregation mechanisms (class-based and alpha-based) that aggregate and route data packet based on Received Signal Strength Indicator (RSSI). Each node maintains an RSSI value with respect to a sink node. When a data packet is generated, an aggregation identification (Agg ID) is associated with that packet. Using the RSSI and Agg ID in RSSI-Based Forwarding (RBF), we favor nodes closer to sink when aggregating and relaying a data packet. We show via simulation the performance of the proposed mechanisms in terms of normalized number of transmissions, energy consumed per data packet, network lifetime and packet loss probability.
{"title":"Data aggregation using RSSI for multihop Wireless Sensor Networks","authors":"A. Awang, Shobhit Agarwal","doi":"10.1109/WCSP.2013.6677041","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677041","url":null,"abstract":"In Wireless Sensor Networks (WSNs), sensor nodes are often deployed in large quantity and high density. Due to dense deployment, the sensed data are often redundant and highly correlated. Transmitting redundant data is not practical in the resource-constrained WSNs particularly from the viewpoint of energy conservation. Data aggregation offers a key solution to curtail the network loads and hence reduces the transmission energy consumption. In this work, we propose two data aggregation mechanisms (class-based and alpha-based) that aggregate and route data packet based on Received Signal Strength Indicator (RSSI). Each node maintains an RSSI value with respect to a sink node. When a data packet is generated, an aggregation identification (Agg ID) is associated with that packet. Using the RSSI and Agg ID in RSSI-Based Forwarding (RBF), we favor nodes closer to sink when aggregating and relaying a data packet. We show via simulation the performance of the proposed mechanisms in terms of normalized number of transmissions, energy consumed per data packet, network lifetime and packet loss probability.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127762313","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677206
Mi Hu, J. Ge, Xiaoye Shi
In this paper, we study the optimal power allocation (OPA) for the two-way relay channel employing the analogue network coding (ANC) protocol in cognitive radio (CR) network. The OPA scheme is proposed by minimizing the weaker link's individual outage probability under the sum-power constraint and interference power threshold (IPT) constraints to the primary user (PU) in a Rayleigh fading channel environment. Particularly, for the purpose of accomplishing the power allocation more realistically, the interference to each other between PU and secondary user (SU) and relay is taken into consideration. And the closed-form solution for the optimum power allocation scheme of each case is derived. Numerical Results confirm that the system with the proposed scheme for the two-way relaying with ANC has a gain of 3dB over the equal power allocation (EPA) scheme no matter with or without IPT. When introduced IPT constraints into the optimization scheme, the outage probability of SU communication cannot be reduced after a certain level of total power, even though the total power is sufficient. Meanwhile, the best location for the relay is near by the middle point of the two end nodes regardless of the power allocation scheme.
{"title":"Optimal power allocation scheme for the two-way relay channel using ANC in cognitive radio","authors":"Mi Hu, J. Ge, Xiaoye Shi","doi":"10.1109/WCSP.2013.6677206","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677206","url":null,"abstract":"In this paper, we study the optimal power allocation (OPA) for the two-way relay channel employing the analogue network coding (ANC) protocol in cognitive radio (CR) network. The OPA scheme is proposed by minimizing the weaker link's individual outage probability under the sum-power constraint and interference power threshold (IPT) constraints to the primary user (PU) in a Rayleigh fading channel environment. Particularly, for the purpose of accomplishing the power allocation more realistically, the interference to each other between PU and secondary user (SU) and relay is taken into consideration. And the closed-form solution for the optimum power allocation scheme of each case is derived. Numerical Results confirm that the system with the proposed scheme for the two-way relaying with ANC has a gain of 3dB over the equal power allocation (EPA) scheme no matter with or without IPT. When introduced IPT constraints into the optimization scheme, the outage probability of SU communication cannot be reduced after a certain level of total power, even though the total power is sufficient. Meanwhile, the best location for the relay is near by the middle point of the two end nodes regardless of the power allocation scheme.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124603033","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677110
Chao Gao, Zhiyong Liu, Bin Cao, Liwei Mu
In recent research of wireless communication, the concept of cooperative diversity has been put forward and used widely. A number of transmission schemes designed for radio communications could not be directly applied to underwater network, where channel characteristics are more complicated. In this paper, we consider a situation comparatively closer to the realistic underwater acoustic communication and investigate the relay selection problem. Considering the long propagation delay caused by low speed of sound, we design a cooperative transmission scheme. In this scheme, the network chooses the optimal relay or the suitable number of nodes adapting to the changes of underwater circumstances. Then the signal-to-noise ratio (SNR) is added to the criterion of relay selection to realize a more effective algorithm.
{"title":"Relay selection scheme based on propagation delay for cooperative underwater acoustic network","authors":"Chao Gao, Zhiyong Liu, Bin Cao, Liwei Mu","doi":"10.1109/WCSP.2013.6677110","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677110","url":null,"abstract":"In recent research of wireless communication, the concept of cooperative diversity has been put forward and used widely. A number of transmission schemes designed for radio communications could not be directly applied to underwater network, where channel characteristics are more complicated. In this paper, we consider a situation comparatively closer to the realistic underwater acoustic communication and investigate the relay selection problem. Considering the long propagation delay caused by low speed of sound, we design a cooperative transmission scheme. In this scheme, the network chooses the optimal relay or the suitable number of nodes adapting to the changes of underwater circumstances. Then the signal-to-noise ratio (SNR) is added to the criterion of relay selection to realize a more effective algorithm.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132584676","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677115
Lijuan Cao, Wenjun Xu, Xuehong Lin, Jiaru Lin
The MAC protocol can minimize simultaneous channel access attempts in an effort to decrease the interference and thereby increases reliability, which is vitally important for VANETs (vehicle ad hoc networks). In this paper, an adaptive hybrid MAC (Medium Access Control) scheme is proposed for VANETs, in which the transmission frame is split dynamically into two parts according to the traffic load. In the first part, CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance) is adopted as the access technology, and in the second one, STDMA (Self-organizing Time Division Multiple Access) is exploited. We implement simulations with various traffic loads in the MATLAB platform, and the simulation results show that the proposed scheme is reliable and can achieve better performance in channel access delay and packet drop probability than both pure CSMA/CA and STDMA schemes.
MAC协议可以最大限度地减少同时通道访问尝试,以减少干扰,从而提高可靠性,这对vanet(车辆自组织网络)至关重要。本文提出了一种针对vanet的自适应混合介质访问控制(MAC)方案,该方案将传输帧根据业务负载动态拆分为两部分。第一部分采用CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance)作为接入技术,第二部分采用自组织时分多址(STDMA)技术。仿真结果表明,该方案可靠,在信道接入时延和丢包概率方面均优于纯CSMA/CA和STDMA方案。
{"title":"A CSMA/TDMA dynamic splitting scheme for MAC protocol in VANETs","authors":"Lijuan Cao, Wenjun Xu, Xuehong Lin, Jiaru Lin","doi":"10.1109/WCSP.2013.6677115","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677115","url":null,"abstract":"The MAC protocol can minimize simultaneous channel access attempts in an effort to decrease the interference and thereby increases reliability, which is vitally important for VANETs (vehicle ad hoc networks). In this paper, an adaptive hybrid MAC (Medium Access Control) scheme is proposed for VANETs, in which the transmission frame is split dynamically into two parts according to the traffic load. In the first part, CSMA/CA (Carrier Sense Multiple Access method with Collision Avoidance) is adopted as the access technology, and in the second one, STDMA (Self-organizing Time Division Multiple Access) is exploited. We implement simulations with various traffic loads in the MATLAB platform, and the simulation results show that the proposed scheme is reliable and can achieve better performance in channel access delay and packet drop probability than both pure CSMA/CA and STDMA schemes.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121479508","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677284
Chunxu Jiao, Zhaoyang Zhang, Jun Yu Li
In this paper, a differential space-time modulation (DSTM) scheme is put forward for high speed train(HST) transmission system. In particular, the HST is equipped with multiple antennas. By exploiting the delay correlation inherited from the linear mobility of HST, this scheme performs extremely robustly and efficiently even without knowing CSI at the transmitter or receiver. The performance of an optimal unitary code in a specific 2 × 2 case is studied and the accurate analytical expression for its pairwise error probability(PEP) is obtained. Furthermore, a rather tight upper bound for the symbol error rate(SER) based on PEP is derived. Simulation results verify the good performance of the proposed scheme.
{"title":"Delay correlation based differential space-time modulation for high speed train transmission","authors":"Chunxu Jiao, Zhaoyang Zhang, Jun Yu Li","doi":"10.1109/WCSP.2013.6677284","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677284","url":null,"abstract":"In this paper, a differential space-time modulation (DSTM) scheme is put forward for high speed train(HST) transmission system. In particular, the HST is equipped with multiple antennas. By exploiting the delay correlation inherited from the linear mobility of HST, this scheme performs extremely robustly and efficiently even without knowing CSI at the transmitter or receiver. The performance of an optimal unitary code in a specific 2 × 2 case is studied and the accurate analytical expression for its pairwise error probability(PEP) is obtained. Furthermore, a rather tight upper bound for the symbol error rate(SER) based on PEP is derived. Simulation results verify the good performance of the proposed scheme.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125328","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 : 2013-12-02DOI: 10.1109/WCSP.2013.6677246
Wei Zhou, C. Ren, Chuan Ma, Hui Yu, Han-wen Luo, Xiaoying Gan, Wang Xi
In recent years, there is a significant trend for VANET to provide not only traditional services like warning information exchanging for road safety and car collision avoidance but also various multimedia applications such as mobile TV which may require broadband access to core network or Internet. On the other hand, service provision technologies with point-to-multipoint transmission mode which could better utilize the limited wireless resource have been well discussed and standardized, such as MBMS in 3GPP and BCMCS in 3GPP2. In this paper, we propose an effective solution aimed to enable multicast/broadcast service provision in integrated VANET-cellular heterogeneous wireless networks based on a two-phase cooperative transmission strategy. Through analysis and simulation, our proposal combines advantages of these two heterogeneous networks and the nature of multicast/broadcast technology.
{"title":"Multicast/broadcast service in integrated VANET-cellular heterogeneous wireless networks","authors":"Wei Zhou, C. Ren, Chuan Ma, Hui Yu, Han-wen Luo, Xiaoying Gan, Wang Xi","doi":"10.1109/WCSP.2013.6677246","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677246","url":null,"abstract":"In recent years, there is a significant trend for VANET to provide not only traditional services like warning information exchanging for road safety and car collision avoidance but also various multimedia applications such as mobile TV which may require broadband access to core network or Internet. On the other hand, service provision technologies with point-to-multipoint transmission mode which could better utilize the limited wireless resource have been well discussed and standardized, such as MBMS in 3GPP and BCMCS in 3GPP2. In this paper, we propose an effective solution aimed to enable multicast/broadcast service provision in integrated VANET-cellular heterogeneous wireless networks based on a two-phase cooperative transmission strategy. Through analysis and simulation, our proposal combines advantages of these two heterogeneous networks and the nature of multicast/broadcast technology.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494353","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}