Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208000
Ekkehard Lang, S. Redana, Bernhard Raaf Nokia
Relays are expected to be a cost efficient way to fulfill requirements on high data rate coverage in next generation cellular networks, like LTE-Advanced. This paper presents a cost model and the respective analysis used for investigating the impact of relaying on cost savings for operators. The approach consists of defining the service level that next generation cellular networks should provide and deriving deployments of eNBs and RNs (or equivalently iso- performance scenarios) that fulfill these requirements. Iso- performance scenarios are therefore obtained by means of simulations and compared in the cost model.
{"title":"Business Impact of Relay Deployment for Coverage Extension in 3GPP LTE-Advanced","authors":"Ekkehard Lang, S. Redana, Bernhard Raaf Nokia","doi":"10.1109/ICCW.2009.5208000","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208000","url":null,"abstract":"Relays are expected to be a cost efficient way to fulfill requirements on high data rate coverage in next generation cellular networks, like LTE-Advanced. This paper presents a cost model and the respective analysis used for investigating the impact of relaying on cost savings for operators. The approach consists of defining the service level that next generation cellular networks should provide and deriving deployments of eNBs and RNs (or equivalently iso- performance scenarios) that fulfill these requirements. Iso- performance scenarios are therefore obtained by means of simulations and compared in the cost model.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122993986","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208023
Wei Miao, Xiao-Diao Chen, Yunzhou Li, Shuyun Zhou, Jun Wang
In this paper we study a MIMO fading broadcast channel where each receiver has perfect channel state information (CSI) while the transmitter only acquires quantized CSI by finite rate feedback. We analyze the zero-forcing dirty-paper coding (ZF-DPC) scheme, which is a nonlinear precoding scheme inherently superior to linear ZF beamforming. Lower bound in closed-form expression and upper bound on the achievable ergodic rate of ZF-DPC with Gaussian inputs and uniform power allocation are derived. Based on the closed-form lower bound, sufficient conditions on the feedback channels to ensure non-zero and full downlink multiplexing gain are obtained. Specifically, in order to achieve the downlink multiplexing gain of αM (0 <α ≤ 1), it is sufficient to scale the number of feedback bits B per user as B = α(M −1)log2 P N0 where M is the number of transmit antennas and P N0 is the average downlink SNR. the results there show that the system becomes interference- limited with fixed amount of feedback while the number of feedback bits per user must increase linearly with the logarithm of the downlink SNR to maintain the full downlink multiplexing gain. In this paper, we study the achievable rate of zero-forcing dirty-paper coding (ZF-DPC) (1), a nonlinear precoding scheme inherently superior to ZF-BF due to its interference precancelation characteristic, for a MIMO broadcast channel with finite rate feedback. We adopt the vector quantization distortion measure of the angle between the codevector and the downlink channel vector, and perform random vector quantization (RVQ) (3)-(5) for analytical convenience. Our main contributions and key findings are as follows:
{"title":"On the Achievable Rate of ZF-DPC for MIMO Broadcast Channels with Finite Rate Feedback","authors":"Wei Miao, Xiao-Diao Chen, Yunzhou Li, Shuyun Zhou, Jun Wang","doi":"10.1109/ICCW.2009.5208023","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208023","url":null,"abstract":"In this paper we study a MIMO fading broadcast channel where each receiver has perfect channel state information (CSI) while the transmitter only acquires quantized CSI by finite rate feedback. We analyze the zero-forcing dirty-paper coding (ZF-DPC) scheme, which is a nonlinear precoding scheme inherently superior to linear ZF beamforming. Lower bound in closed-form expression and upper bound on the achievable ergodic rate of ZF-DPC with Gaussian inputs and uniform power allocation are derived. Based on the closed-form lower bound, sufficient conditions on the feedback channels to ensure non-zero and full downlink multiplexing gain are obtained. Specifically, in order to achieve the downlink multiplexing gain of αM (0 <α ≤ 1), it is sufficient to scale the number of feedback bits B per user as B = α(M −1)log2 P N0 where M is the number of transmit antennas and P N0 is the average downlink SNR. the results there show that the system becomes interference- limited with fixed amount of feedback while the number of feedback bits per user must increase linearly with the logarithm of the downlink SNR to maintain the full downlink multiplexing gain. In this paper, we study the achievable rate of zero-forcing dirty-paper coding (ZF-DPC) (1), a nonlinear precoding scheme inherently superior to ZF-BF due to its interference precancelation characteristic, for a MIMO broadcast channel with finite rate feedback. We adopt the vector quantization distortion measure of the angle between the codevector and the downlink channel vector, and perform random vector quantization (RVQ) (3)-(5) for analytical convenience. Our main contributions and key findings are as follows:","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023735","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208041
J. Restrepo, C. Gruber, C. Mas Machuca
Energy efficient communication devices are essential to minimize the operational cost of future networks and to reduce the negative effects of global warming. In this paper we propose a novel energy reduction approach on network level that takes load-dependent energy consumption information of communication equipment into account. Case study calculation results show that energy savings of more than 35% and with it operational cost can be saved by applying energy profile aware routing.
{"title":"Energy Profile Aware Routing","authors":"J. Restrepo, C. Gruber, C. Mas Machuca","doi":"10.1109/ICCW.2009.5208041","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208041","url":null,"abstract":"Energy efficient communication devices are essential to minimize the operational cost of future networks and to reduce the negative effects of global warming. In this paper we propose a novel energy reduction approach on network level that takes load-dependent energy consumption information of communication equipment into account. Case study calculation results show that energy savings of more than 35% and with it operational cost can be saved by applying energy profile aware routing.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866711","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208042
J. Wigard, T. Kolding, Lars Dalsgaard, Claudio Coletti
The UTRAN long-term evolution (LTE) specifications provide flexible means to achieve micro-sleep operation for user equipment (UE) even though it is in active mode and running a service. By means of a discontinuous reception (DRX) framework, pauses in the transmission due to natural traffic characteristics or network prioritization can be utilized. The specifications give a number of options to optimize the performance. In this paper two of those possibilities are compared. Long DRX with the use of an inactivity timer is compared to the usage of short DRX on top of long DRX. The performance is evaluated in terms of user throughput, power consumption, and network performance, while using a realistic RF modem power consumption model for the UE. For bursty traffic, short DRX shows a gain of up to 100% over DRX with just an inactivity timer, when measuring throughput per power unit consumed in case of one or multiple users being present in the cell.
{"title":"On the User Performance of LTE UE Power Savings Schemes with Discontinuous Reception in LTE","authors":"J. Wigard, T. Kolding, Lars Dalsgaard, Claudio Coletti","doi":"10.1109/ICCW.2009.5208042","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208042","url":null,"abstract":"The UTRAN long-term evolution (LTE) specifications provide flexible means to achieve micro-sleep operation for user equipment (UE) even though it is in active mode and running a service. By means of a discontinuous reception (DRX) framework, pauses in the transmission due to natural traffic characteristics or network prioritization can be utilized. The specifications give a number of options to optimize the performance. In this paper two of those possibilities are compared. Long DRX with the use of an inactivity timer is compared to the usage of short DRX on top of long DRX. The performance is evaluated in terms of user throughput, power consumption, and network performance, while using a realistic RF modem power consumption model for the UE. For bursty traffic, short DRX shows a gain of up to 100% over DRX with just an inactivity timer, when measuring throughput per power unit consumed in case of one or multiple users being present in the cell.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398762","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208103
L. D'Orazio, M. Panizza, C. Sacchi
in this work, we shall propose an OFDMA system based on the allocation of orthogonal subcarrier groups to multi- rate user classes. This system can be regarded as an evolution of GO-OFDMA used for single-rate data transmission. A user data stream is split into a multiple substreams, whose number depends on the user data rate. Then, each substream is spread by a distinct spreading code and, finally, transmitted in OFDM modality over the selected subcarrier set. The main advantage obtained with respect to classical OFDMA lies in the possibility of exploiting diversity in code domain and frequency domain (like it happens in MC-CDMA). Experimental results in terms of BER evidenced an interesting trend of the proposed GO-OFDMA system towards a noticeable BER improvement achieved for highest-data rate users with respect to VSL MC-CDMA. Therefore, the proposed GO-OFDMA system seems to provide a less conservative management of radio resources that is more in favor to "broadband" users, while penalizing "narrowband" users, whose BER is slightly degraded with respect to that one achieved by VSL MC-CDMA.
{"title":"A Multi-User Multi-Rate OFDMA Transmission System Based on Orthogonal Subcarrier Grouping","authors":"L. D'Orazio, M. Panizza, C. Sacchi","doi":"10.1109/ICCW.2009.5208103","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208103","url":null,"abstract":"in this work, we shall propose an OFDMA system based on the allocation of orthogonal subcarrier groups to multi- rate user classes. This system can be regarded as an evolution of GO-OFDMA used for single-rate data transmission. A user data stream is split into a multiple substreams, whose number depends on the user data rate. Then, each substream is spread by a distinct spreading code and, finally, transmitted in OFDM modality over the selected subcarrier set. The main advantage obtained with respect to classical OFDMA lies in the possibility of exploiting diversity in code domain and frequency domain (like it happens in MC-CDMA). Experimental results in terms of BER evidenced an interesting trend of the proposed GO-OFDMA system towards a noticeable BER improvement achieved for highest-data rate users with respect to VSL MC-CDMA. Therefore, the proposed GO-OFDMA system seems to provide a less conservative management of radio resources that is more in favor to \"broadband\" users, while penalizing \"narrowband\" users, whose BER is slightly degraded with respect to that one achieved by VSL MC-CDMA.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122432214","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208008
S. Ashtarifar, A. Matrawy
Determining a host's location on the Internet is an important issue in many applications such as the ability for handling emergency services. In this paper we discuss techniques in this area in the context of locating callers to Internet Telephony systems. We mainly discuss two broad groups of these techniques that might fit into VoIP solutions, namely database techniques and measurement based techniques. We also discuss how IPv6 addresses location information. The paper concludes with a discussion on major issues in this important area.
{"title":"Determining Host Location on the Internet: The Case of VoIP Emergency Calls","authors":"S. Ashtarifar, A. Matrawy","doi":"10.1109/ICCW.2009.5208008","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208008","url":null,"abstract":"Determining a host's location on the Internet is an important issue in many applications such as the ability for handling emergency services. In this paper we discuss techniques in this area in the context of locating callers to Internet Telephony systems. We mainly discuss two broad groups of these techniques that might fit into VoIP solutions, namely database techniques and measurement based techniques. We also discuss how IPv6 addresses location information. The paper concludes with a discussion on major issues in this important area.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134226135","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208066
A. Vinel, D. Staehle, A. Turlikov
IEEE 802.11p is currently being developed international standard, which specifies physical (PHY) and medium access control (MAC) protocols for car-to-car and car-to-infrastructure communication and should become a basis for safety-related and infotainment applications in future vehicular ad-hoc networks (VANETs). In VANETs beaconing is one of the most important communication modes, which is used to advertise the presence of a car to its neighbor cars. For different applications timely and successful delivery of beacons containing speed, direction and position of a car is extremely important. In this paper, we present analytical methods for car-to-car communication analysis and investigate the influence of beacon generation rate on the mean beacon transmission delay and probability of a successful beacon reception in the IEEE 802.11p-based network in both saturated and unsaturated cases.
{"title":"Study of Beaconing for Car-to-Car Communication in Vehicular Ad-Hoc Networks","authors":"A. Vinel, D. Staehle, A. Turlikov","doi":"10.1109/ICCW.2009.5208066","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208066","url":null,"abstract":"IEEE 802.11p is currently being developed international standard, which specifies physical (PHY) and medium access control (MAC) protocols for car-to-car and car-to-infrastructure communication and should become a basis for safety-related and infotainment applications in future vehicular ad-hoc networks (VANETs). In VANETs beaconing is one of the most important communication modes, which is used to advertise the presence of a car to its neighbor cars. For different applications timely and successful delivery of beacons containing speed, direction and position of a car is extremely important. In this paper, we present analytical methods for car-to-car communication analysis and investigate the influence of beacon generation rate on the mean beacon transmission delay and probability of a successful beacon reception in the IEEE 802.11p-based network in both saturated and unsaturated cases.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134192603","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208076
J. Heide, M. Pedersen, F. Fitzek, T. Larsen
In this work we consider the implementation of Random Linear Network Coding (RLNC) on battery constrained mobile devices with low computational capabilities such as; sensors, mobile phones and Personal Digital Assistants (PDAs). It is non-trivial to create an efficient implementation of RLNC which is needed to ensure high throughput, low computational requirements and energy consumption. As a consequence there does not, to the best of our knowledge, exist any such implemen- tation for mobile device that allow for throughput close to what can be achieved in e.g. Wireless Local Area Network (WLAN). In this paper we propose to base RLNC on the binary Galois field and to use a systematic code. We have implemented this approach in C++ and Symbian C++ and achieve synthetic encoding/decoding throughput of up to 40/30 MB/s on a Nokia N95-8GB mobile phone and 1.5/1.0 GB/s on a high end laptop. Index Terms—Mobile devices, Network coding, Reliable Mul- ticast. I. INTRODUCTION A large body of existing literature (1) treats the theoretical benefits of Network Coding (NC). However, the costs of implementing NC in terms computational overhead, memory consumption or network usage is often not considered. In this work we consider the implementation of RLNC on mobile bat- tery constrained devices with low computational capabilities, such as sensors, mobile phones or PDAs. The computations performed using RLNC is based on finite fields arithmetic also known as Galois fields. From a coding perspective the field size, q, used should be large to ensure that coded packets are linearly independent, additionally increasing the size of the field elements is advantageous as this reduces the number of
{"title":"Network Coding for Mobile Devices - Systematic Binary Random Rateless Codes","authors":"J. Heide, M. Pedersen, F. Fitzek, T. Larsen","doi":"10.1109/ICCW.2009.5208076","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208076","url":null,"abstract":"In this work we consider the implementation of Random Linear Network Coding (RLNC) on battery constrained mobile devices with low computational capabilities such as; sensors, mobile phones and Personal Digital Assistants (PDAs). It is non-trivial to create an efficient implementation of RLNC which is needed to ensure high throughput, low computational requirements and energy consumption. As a consequence there does not, to the best of our knowledge, exist any such implemen- tation for mobile device that allow for throughput close to what can be achieved in e.g. Wireless Local Area Network (WLAN). In this paper we propose to base RLNC on the binary Galois field and to use a systematic code. We have implemented this approach in C++ and Symbian C++ and achieve synthetic encoding/decoding throughput of up to 40/30 MB/s on a Nokia N95-8GB mobile phone and 1.5/1.0 GB/s on a high end laptop. Index Terms—Mobile devices, Network coding, Reliable Mul- ticast. I. INTRODUCTION A large body of existing literature (1) treats the theoretical benefits of Network Coding (NC). However, the costs of implementing NC in terms computational overhead, memory consumption or network usage is often not considered. In this work we consider the implementation of RLNC on mobile bat- tery constrained devices with low computational capabilities, such as sensors, mobile phones or PDAs. The computations performed using RLNC is based on finite fields arithmetic also known as Galois fields. From a coding perspective the field size, q, used should be large to ensure that coded packets are linearly independent, additionally increasing the size of the field elements is advantageous as this reduces the number of","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115393823","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208044
T. Takiguchi, S. Saruwatari, T. Morito, S. Ishida, M. Minami, H. Morikawa
Excessive power consumption is a major problem in wireless communication. This is particularly true in ubiquitous computing environments, since wireless devices consume a considerable amount of energy in idle listening. Wake-up wireless communication technology is a promising candidate for reducing power consumption during idle listening. To realize wake-up wireless communication, this paper proposes a novel ID matching mechanism that uses a Bloom filter. This paper describes the design and implementation of a wireless wake-up module that uses this ID matching mechanism. Simulation results reveal that the wake-up module consumes only 12.4 muW while idle listening, and that employing this Bloom-filter-based approach eliminates 99.95 % of power consumption in our application scenarios.
{"title":"A Novel Wireless Wake-Up Mechanism for Energy-Efficient Ubiquitous Networks","authors":"T. Takiguchi, S. Saruwatari, T. Morito, S. Ishida, M. Minami, H. Morikawa","doi":"10.1109/ICCW.2009.5208044","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208044","url":null,"abstract":"Excessive power consumption is a major problem in wireless communication. This is particularly true in ubiquitous computing environments, since wireless devices consume a considerable amount of energy in idle listening. Wake-up wireless communication technology is a promising candidate for reducing power consumption during idle listening. To realize wake-up wireless communication, this paper proposes a novel ID matching mechanism that uses a Bloom filter. This paper describes the design and implementation of a wireless wake-up module that uses this ID matching mechanism. Simulation results reveal that the wake-up module consumes only 12.4 muW while idle listening, and that employing this Bloom-filter-based approach eliminates 99.95 % of power consumption in our application scenarios.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116792230","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208065
Annette Böhm, M. Jonsson
Future active-safety applications in vehicular networks rely heavily on the support for real-time inter-vehicle communication. The Medium Access Control (MAC) mechanism proposed for the upcoming IE ...
{"title":"Position-Based Data Traffic Prioritization in Safety-Critical, Real-Time Vehicle-to-Infrastructure Communication","authors":"Annette Böhm, M. Jonsson","doi":"10.1109/ICCW.2009.5208065","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208065","url":null,"abstract":"Future active-safety applications in vehicular networks rely heavily on the support for real-time inter-vehicle communication. The Medium Access Control (MAC) mechanism proposed for the upcoming IE ...","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522817","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
扫码关注我们
求助内容：
应助结果提醒方式：