Pub Date : 2000-05-15DOI: 10.1109/VETECS.2000.851462
T. Samata, O. Yamagishi, E. Fujisawa, A. Irube, A. Asano, T. Obara, T. Nishikawa, M. Takahashi, S. Minami
This paper proposes an approach to change an ordinary IMT-2000 mobile phone to a videophone with less effort by using a newly developed chip/IP (intellectual property) core set. The chip/IP core set is composed of a speech codec DSP, a video codec LSI and multiplexing/demultiplexing IP. Furthermore, an integrated next generation LSI for videophone is also introduced. The developed chip/IP core set is designed to realize the upcoming new 3GPP standard, based on the popular ITU-T standard H.324 but some modifications are included for efficient implementation in the IMT-2000 wireless network.
{"title":"A new chip/IP core set for 3G-324M video telephony","authors":"T. Samata, O. Yamagishi, E. Fujisawa, A. Irube, A. Asano, T. Obara, T. Nishikawa, M. Takahashi, S. Minami","doi":"10.1109/VETECS.2000.851462","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851462","url":null,"abstract":"This paper proposes an approach to change an ordinary IMT-2000 mobile phone to a videophone with less effort by using a newly developed chip/IP (intellectual property) core set. The chip/IP core set is composed of a speech codec DSP, a video codec LSI and multiplexing/demultiplexing IP. Furthermore, an integrated next generation LSI for videophone is also introduced. The developed chip/IP core set is designed to realize the upcoming new 3GPP standard, based on the popular ITU-T standard H.324 but some modifications are included for efficient implementation in the IMT-2000 wireless network.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116713670","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851302
G. Jeong
A parallel frequency and pseudo-noise (PN) code searcher for direct-spread (DS)-CDMA is proposed and its performance in multipath Rayleigh fading channels is analyzed. The proposed method uses a two-step acquisition procedure: in the first PN search step, energies in multiple frequency hypotheses are tested in parallel against a threshold. When one or more frequency hypotheses pass the test, the searcher accepts the PN hypothesis and enters the next frequency search step where the searcher looks for the strongest frequency hypothesis. The proposed method uses a pre-calculated correlation matrix to extract frequency information from the Walsh-Hadamard transform of a received signal. One advantage of this method is that it utilizes the fast WHT that is already used in many DS-CDMA receivers for decoding orthogonal channels.
{"title":"Parallel frequency and code acquisition based on Walsh-Hadamard transform in DS-CDMA","authors":"G. Jeong","doi":"10.1109/VETECS.2000.851302","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851302","url":null,"abstract":"A parallel frequency and pseudo-noise (PN) code searcher for direct-spread (DS)-CDMA is proposed and its performance in multipath Rayleigh fading channels is analyzed. The proposed method uses a two-step acquisition procedure: in the first PN search step, energies in multiple frequency hypotheses are tested in parallel against a threshold. When one or more frequency hypotheses pass the test, the searcher accepts the PN hypothesis and enters the next frequency search step where the searcher looks for the strongest frequency hypothesis. The proposed method uses a pre-calculated correlation matrix to extract frequency information from the Walsh-Hadamard transform of a received signal. One advantage of this method is that it utilizes the fast WHT that is already used in many DS-CDMA receivers for decoding orthogonal channels.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127374025","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851424
D. Borah, P. Rapajic
Adaptive optimal CDMA multiuser detection can be performed by using a bank of MMSE filters followed by a Viterbi detector. Several characteristics of this receiver structure are investigated. It is shown that this receiver can successfully suppress narrow band interference (NBI). The effect of the MMSE filter length on MSE is investigated and it is shown that the MMSE filter length needs to be only a few symbols long. The complexity/performance tradeoff capability of the receiver is studied. It is observed that this receiver, at one end, becomes the linear MMSE receiver with lowest complexity and, at the other end, it becomes the maximum likelihood (ML) receiver with highest complexity.
{"title":"Adaptive weighted least squares CDMA multiuser detection","authors":"D. Borah, P. Rapajic","doi":"10.1109/VETECS.2000.851424","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851424","url":null,"abstract":"Adaptive optimal CDMA multiuser detection can be performed by using a bank of MMSE filters followed by a Viterbi detector. Several characteristics of this receiver structure are investigated. It is shown that this receiver can successfully suppress narrow band interference (NBI). The effect of the MMSE filter length on MSE is investigated and it is shown that the MMSE filter length needs to be only a few symbols long. The complexity/performance tradeoff capability of the receiver is studied. It is observed that this receiver, at one end, becomes the linear MMSE receiver with lowest complexity and, at the other end, it becomes the maximum likelihood (ML) receiver with highest complexity.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125005288","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851570
A. Fapojuwo, E. Nikiforov
We propose a handover mechanism suitable for loss-sensitive and delay-sensitive traffic in ATM-based wireless networks. The handover mechanism is based on buffering of cells at the base station destination buffer and assignment of entry and exit priority to loss-sensitive and delay-sensitive traffic types respectively. The performance of the proposed handover scheme is analyzed using the theory of Markov chains, and the main analytic results are expressions for cell loss probability and base station overload probability. The results are useful for determining the buffer space required to achieve a desired cell loss probability and also for setting the buffer threshold for overload detection at a base station.
{"title":"Base station buffer requirements for handover traffic processing in ATM-based wireless networks","authors":"A. Fapojuwo, E. Nikiforov","doi":"10.1109/VETECS.2000.851570","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851570","url":null,"abstract":"We propose a handover mechanism suitable for loss-sensitive and delay-sensitive traffic in ATM-based wireless networks. The handover mechanism is based on buffering of cells at the base station destination buffer and assignment of entry and exit priority to loss-sensitive and delay-sensitive traffic types respectively. The performance of the proposed handover scheme is analyzed using the theory of Markov chains, and the main analytic results are expressions for cell loss probability and base station overload probability. The results are useful for determining the buffer space required to achieve a desired cell loss probability and also for setting the buffer threshold for overload detection at a base station.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125058128","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851393
C. Schifers, G. Hans
The communication system within a train is a central issue for train system integration. Historically, there have been numerous, proprietary and non-interoperable solutions. IEC 61375 and UIC 556 have now been issued as a set of international standards to overcome this situation: IEC 61375, the Train Communication Network (TCN), defines a communication architecture and the necessary protocols for non-vital communication on train and on vehicle level. It consists of a two-layered, hierarchical architecture to suit the needs of inter- and intra-vehicle communication. UIC 556 and the accompanying UIC codes define the operator's view on the train, the framework for the coordination of the different applications and the operational handling to ensure interoperability between vehicles from different manufacturers. This protocol suite has been successfully explored in operational test trains as well as in large number of actual running projects for DMUs, EMUs, high-speed trains, locomotives, passenger trains, suburban trains, as well as trams. It is used for new vehicles and for vehicle refurbishment. The article focuses on the TCN and UIC standards, their development and application in actual projects.
{"title":"IEC 61375-1 and UIC 556-international standards for train communication","authors":"C. Schifers, G. Hans","doi":"10.1109/VETECS.2000.851393","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851393","url":null,"abstract":"The communication system within a train is a central issue for train system integration. Historically, there have been numerous, proprietary and non-interoperable solutions. IEC 61375 and UIC 556 have now been issued as a set of international standards to overcome this situation: IEC 61375, the Train Communication Network (TCN), defines a communication architecture and the necessary protocols for non-vital communication on train and on vehicle level. It consists of a two-layered, hierarchical architecture to suit the needs of inter- and intra-vehicle communication. UIC 556 and the accompanying UIC codes define the operator's view on the train, the framework for the coordination of the different applications and the operational handling to ensure interoperability between vehicles from different manufacturers. This protocol suite has been successfully explored in operational test trains as well as in large number of actual running projects for DMUs, EMUs, high-speed trains, locomotives, passenger trains, suburban trains, as well as trams. It is used for new vehicles and for vehicle refurbishment. The article focuses on the TCN and UIC standards, their development and application in actual projects.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126096127","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851338
Yubin Chen, Jiandong Li, Kai Liu
Adaptive antenna technology is now regarded as one of the hot-point research areas in mobile communications. However, its applications in mobile stations receive little attention. This paper considers the performance of a multi-hop packet radio network employing adaptive antennas at the mobile stations. A simple adaptive beamforming policy is presented. Analysis and simulation indicates that mobile stations in packet radio networks employing mobile adaptive antennas can offer a significant performance enhancement when compared with their omnidirectional counterparts. In addition, an AD-ALOHA protocol for the MAC layer and the adaptive protocol architecture with adaptive antenna technology was proposed.
{"title":"Performance of multi-hop packet radio networks with mobile adaptive antennas","authors":"Yubin Chen, Jiandong Li, Kai Liu","doi":"10.1109/VETECS.2000.851338","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851338","url":null,"abstract":"Adaptive antenna technology is now regarded as one of the hot-point research areas in mobile communications. However, its applications in mobile stations receive little attention. This paper considers the performance of a multi-hop packet radio network employing adaptive antennas at the mobile stations. A simple adaptive beamforming policy is presented. Analysis and simulation indicates that mobile stations in packet radio networks employing mobile adaptive antennas can offer a significant performance enhancement when compared with their omnidirectional counterparts. In addition, an AD-ALOHA protocol for the MAC layer and the adaptive protocol architecture with adaptive antenna technology was proposed.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283147","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851341
K. Oosaki, Y. Akaiwa
We propose a dynamic assignment method of radio channels using their qualities and data packet sizes. In this method, a high quality channel is assigned for long packets and a low quality channel is assigned for short packets. Assuming a packet transfer method based on PHS (Personal Handy System) procedure, the transfer speed and delay characteristics are investigated by computer simulation and compared with conventional method (i.e. random assignment). Both the transfer speed characteristics and delay performance are improved under light traffic load.
{"title":"A dynamic radio channel assignment considering data packet length and channel quality","authors":"K. Oosaki, Y. Akaiwa","doi":"10.1109/VETECS.2000.851341","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851341","url":null,"abstract":"We propose a dynamic assignment method of radio channels using their qualities and data packet sizes. In this method, a high quality channel is assigned for long packets and a low quality channel is assigned for short packets. Assuming a packet transfer method based on PHS (Personal Handy System) procedure, the transfer speed and delay characteristics are investigated by computer simulation and compared with conventional method (i.e. random assignment). Both the transfer speed characteristics and delay performance are improved under light traffic load.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125356996","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851685
Hao Guan, Zhiying. Du, Cheng Li
In the third generation of mobile communication system, the home location register (HLR) bottleneck problem will be more serious due to the many emerging new services. We propose the "terminal aided k-location tracking with distributed HLR database" method for mobility management. The TA k-LT can reduce HLR registration load greatly with the help of the terminal and the vehicle location register (VLR), and the distributed HLR database can decrease the HLR call delivery load dramatically. Besides, the TA k-LT can overcome the multiple HLR registration update problem of the distributed HLR database. As compared with the traditional distributed method, analysis shows this combination method can reduce both system mobility management cost and the number of replicated databases, hence save the system device cost.
{"title":"Terminal aided k-location tracking with distributed HLR database for mobility management","authors":"Hao Guan, Zhiying. Du, Cheng Li","doi":"10.1109/VETECS.2000.851685","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851685","url":null,"abstract":"In the third generation of mobile communication system, the home location register (HLR) bottleneck problem will be more serious due to the many emerging new services. We propose the \"terminal aided k-location tracking with distributed HLR database\" method for mobility management. The TA k-LT can reduce HLR registration load greatly with the help of the terminal and the vehicle location register (VLR), and the distributed HLR database can decrease the HLR call delivery load dramatically. Besides, the TA k-LT can overcome the multiple HLR registration update problem of the distributed HLR database. As compared with the traditional distributed method, analysis shows this combination method can reduce both system mobility management cost and the number of replicated databases, hence save the system device cost.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125570887","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851403
T. Fujiwara, Y. Shimazaki, H. Toyoshima, S. Ito, M. Sugiura, M. Atsumi, T. Watanabe, S. Mizushina
An application of CDMA technique to a dedicated data collection system for monitoring and control of city lifelines is considered. This paper describes the system configuration of a 2.4 GHz experimental system in which CDMA is combined with polling technique to access 256 household terminals. Results of preliminary experiments are also presented.
{"title":"A TD-CDMA data collection system for city lifeline monitoring","authors":"T. Fujiwara, Y. Shimazaki, H. Toyoshima, S. Ito, M. Sugiura, M. Atsumi, T. Watanabe, S. Mizushina","doi":"10.1109/VETECS.2000.851403","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851403","url":null,"abstract":"An application of CDMA technique to a dedicated data collection system for monitoring and control of city lifelines is considered. This paper describes the system configuration of a 2.4 GHz experimental system in which CDMA is combined with polling technique to access 256 household terminals. Results of preliminary experiments are also presented.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626374","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 : 2000-05-15DOI: 10.1109/VETECS.2000.851218
M. Kalia, Deepak Bansal, R. Shorey
Motivated by the emerging standards for indoor pico-cellular wireless systems, such as the Bluetooth, we propose and study the scheduling policies for master driven time division duplex (TDD) wireless networks. In these networks, the frequency band is divided into time slots, and each end (i.e., master or slave) takes turns in using the time slots. In Bluetooth, a slave transmits packets in the reverse slot only after the master polls the slave in a forward slot (by sending data to it). The conventional scheduling policies such as round robin do not perform well in these systems as they are not suited to the tight coupling of the uplink-downlink. We propose new scheduling policies, (i) the priority scheme, and, (ii) the K-fairness scheme that utilize the state at the master and slaves to schedule the TDD slots effectively. Active slaves are differentiated based upon the binary information (i.e., the presence or absence of packets in a slave queue) about the master-slave queue pairs. The priority scheme achieves high throughput as compared to the packet-by-packet generalized processor sharing (PGPS) based policies while guaranteeing a minimal service to each active slave while the K-fairness policy is characterized by a tight fairness bound as well as high system throughput. We then extend these policies for scheduling variable size data in the presence of voice. Further, since Bluetooth supports variable size data packets (1, 3 or 5 slots) on the same connections, the segmentation and reassembly (SAR) can significantly impact scheduling of data packets by varying packet size distribution. We propose an intelligent SAR policy (ISAR) and compare it with the naive random-SAR in which the data packet sizes (i.e., 1, 3 or 5) are assigned probabilistically. ISAR adapts MAC packet size at the master and slave queues depending on the data arrival rates at both the queues.
在蓝牙等室内微蜂窝无线系统新标准的推动下，提出并研究了主驱动时分双工(TDD)无线网络的调度策略。在这些网络中，频带被划分为时隙，每端(即主端或从端)轮流使用时隙。在蓝牙中，只有当主站轮询主站时(通过向其发送数据)，从站才能在反向槽中传输数据包。传统的调度策略，如轮循，在这些系统中表现不佳，因为它们不适合上行链路和下行链路的紧密耦合。我们提出了新的调度策略，(i)优先级方案，(ii) k -公平性方案，利用主从状态有效地调度TDD插槽。根据关于主从队列对的二进制信息(即，从队列中是否存在数据包)来区分活动从队列。与基于逐包广义处理器共享(PGPS)的策略相比，优先级方案在保证对每个活动从机提供最小服务的同时实现了高吞吐量，而k -公平性策略具有严格的公平性绑定和高系统吞吐量的特点。然后，我们扩展这些策略，以便在语音存在的情况下调度可变大小的数据。此外，由于蓝牙在同一连接上支持可变大小的数据包(1、3或5个插槽)，因此分段和重组(SAR)可以通过改变数据包大小分布来显著影响数据包的调度。我们提出了一种智能SAR策略(ISAR)，并将其与朴素随机SAR进行比较，其中数据包大小(即1,3或5)是概率分配的。ISAR根据数据到达两个队列的速率来调整主队列和从队列上的MAC数据包大小。
{"title":"Data scheduling and SAR for Bluetooth MAC","authors":"M. Kalia, Deepak Bansal, R. Shorey","doi":"10.1109/VETECS.2000.851218","DOIUrl":"https://doi.org/10.1109/VETECS.2000.851218","url":null,"abstract":"Motivated by the emerging standards for indoor pico-cellular wireless systems, such as the Bluetooth, we propose and study the scheduling policies for master driven time division duplex (TDD) wireless networks. In these networks, the frequency band is divided into time slots, and each end (i.e., master or slave) takes turns in using the time slots. In Bluetooth, a slave transmits packets in the reverse slot only after the master polls the slave in a forward slot (by sending data to it). The conventional scheduling policies such as round robin do not perform well in these systems as they are not suited to the tight coupling of the uplink-downlink. We propose new scheduling policies, (i) the priority scheme, and, (ii) the K-fairness scheme that utilize the state at the master and slaves to schedule the TDD slots effectively. Active slaves are differentiated based upon the binary information (i.e., the presence or absence of packets in a slave queue) about the master-slave queue pairs. The priority scheme achieves high throughput as compared to the packet-by-packet generalized processor sharing (PGPS) based policies while guaranteeing a minimal service to each active slave while the K-fairness policy is characterized by a tight fairness bound as well as high system throughput. We then extend these policies for scheduling variable size data in the presence of voice. Further, since Bluetooth supports variable size data packets (1, 3 or 5 slots) on the same connections, the segmentation and reassembly (SAR) can significantly impact scheduling of data packets by varying packet size distribution. We propose an intelligent SAR policy (ISAR) and compare it with the naive random-SAR in which the data packet sizes (i.e., 1, 3 or 5) are assigned probabilistically. ISAR adapts MAC packet size at the master and slave queues depending on the data arrival rates at both the queues.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115514185","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
扫码关注我们
求助内容：
应助结果提醒方式：