Pub Date : 2000-12-17DOI: 10.1109/ICPWC.2000.905845
S. Sengodan, D. Smith, M. Abou-Rizk
With the convergence of the Internet protocol (IP) and wireless technologies such as Bluetooth and the wireless application protocol (WAP), a study on end-to-end security issues has become important. Differences in security algorithms and protocols between these technologies needs to be clearly understood in order to understand the impact on end-to-end security. This paper describes some of these aspects in the context of Bluetooth and WAP interfacing with IP networks. Various security services - key generation, authentication and confidentiality - are considered and compared.
{"title":"On end-to-end security for Bluetooth/WAP and TCP/IP networks","authors":"S. Sengodan, D. Smith, M. Abou-Rizk","doi":"10.1109/ICPWC.2000.905845","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905845","url":null,"abstract":"With the convergence of the Internet protocol (IP) and wireless technologies such as Bluetooth and the wireless application protocol (WAP), a study on end-to-end security issues has become important. Differences in security algorithms and protocols between these technologies needs to be clearly understood in order to understand the impact on end-to-end security. This paper describes some of these aspects in the context of Bluetooth and WAP interfacing with IP networks. Various security services - key generation, authentication and confidentiality - are considered and compared.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130394622","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-12-17DOI: 10.1109/ICPWC.2000.905833
Apurv Gupta, D. Sanghi
We present a framework for providing guaranteed quality of service in ad-hoc networks given reasonable limits on rate of change of topology. This is achieved at the expense of higher network resources than required by the flow specification itself. We quantify these extra resources and suggest changes that need to be incorporated in the buffer requirements and the play out times. Central to providing QoS guarantees is the concept of local route repair and buffer flush. The onus for restoring a failed in-use path is on the upstream node of the failed link. The route restoration time after a failure has important consequences on the performance of the proposed scheme and so we propose to add this functionality to the QoS module in general. We also suggest a protocol to reduce this latency under the assumption of slow rate of change of topology. The analysis can be extended to slightly relaxed assumptions on rate of change of topology. But when the topology changes too fast, it shall not be possible for any protocol with reasonable overhead to provide QoS guarantees.
{"title":"QoS support in mobile ad-hoc networks","authors":"Apurv Gupta, D. Sanghi","doi":"10.1109/ICPWC.2000.905833","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905833","url":null,"abstract":"We present a framework for providing guaranteed quality of service in ad-hoc networks given reasonable limits on rate of change of topology. This is achieved at the expense of higher network resources than required by the flow specification itself. We quantify these extra resources and suggest changes that need to be incorporated in the buffer requirements and the play out times. Central to providing QoS guarantees is the concept of local route repair and buffer flush. The onus for restoring a failed in-use path is on the upstream node of the failed link. The route restoration time after a failure has important consequences on the performance of the proposed scheme and so we propose to add this functionality to the QoS module in general. We also suggest a protocol to reduce this latency under the assumption of slow rate of change of topology. The analysis can be extended to slightly relaxed assumptions on rate of change of topology. But when the topology changes too fast, it shall not be possible for any protocol with reasonable overhead to provide QoS guarantees.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134256587","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-12-17DOI: 10.1109/ICPWC.2000.905912
J. Khan
This paper addresses the development of an adaptive packet based reservation multiple access protocol to transmit multimedia traffic over a wireless network. The proposed multiple access protocol is an adaptive version of the BRTDMA (block reservation time division multiple access) protocol where resources are allocated based on traffic type in a network. Resources are allocated in such a way that the quality of service parameters of different class of traffic can be maintained. The resource allocation algorithm allocates resources based on QoS requirements of different types of traffic. Simulation results are presented to show the effectiveness of adaptive resource allocation techniques.
{"title":"An adaptive reservation packet switched multiple access protocol for a wireless network","authors":"J. Khan","doi":"10.1109/ICPWC.2000.905912","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905912","url":null,"abstract":"This paper addresses the development of an adaptive packet based reservation multiple access protocol to transmit multimedia traffic over a wireless network. The proposed multiple access protocol is an adaptive version of the BRTDMA (block reservation time division multiple access) protocol where resources are allocated based on traffic type in a network. Resources are allocated in such a way that the quality of service parameters of different class of traffic can be maintained. The resource allocation algorithm allocates resources based on QoS requirements of different types of traffic. Simulation results are presented to show the effectiveness of adaptive resource allocation techniques.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306173","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-12-17DOI: 10.1109/ICPWC.2000.905853
D. Anvekar, M. Kapoor
In this paper, we present a scheme for combating the problem of interference in frequency hopping indoor wireless communication systems such as Bluetooth. Other methods in reported literature involve adapting the hopping sequence to avoid bad frequencies but they are unsuitable for Bluetooth which has a fixed hopping sequence for a picocell. The proposed scheme is based on the concept of frequency look-ahead and maintaining link state history (LSH) as a table. Look-ahead is employed to know a priori the frequencies that might be used for transmission in the near future. LSH is used to predict the probability of future interference. The paper gives two methods of recording LSH, the first based on the receipt of ACKs and NAKs from the slave and the second based on slave side monitoring of the channel. Before transmitting, the master checks the LSH table to select the slave and the packet size to transmit, such that both the transmissions to and from that slave have a low probability of error. By choosing the right packet size, the master is able to mask bad frequencies and does not need to change the hopping sequence in any way.
{"title":"Frequency look-ahead and link state history based interference avoidance in wireless picocellular networks","authors":"D. Anvekar, M. Kapoor","doi":"10.1109/ICPWC.2000.905853","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905853","url":null,"abstract":"In this paper, we present a scheme for combating the problem of interference in frequency hopping indoor wireless communication systems such as Bluetooth. Other methods in reported literature involve adapting the hopping sequence to avoid bad frequencies but they are unsuitable for Bluetooth which has a fixed hopping sequence for a picocell. The proposed scheme is based on the concept of frequency look-ahead and maintaining link state history (LSH) as a table. Look-ahead is employed to know a priori the frequencies that might be used for transmission in the near future. LSH is used to predict the probability of future interference. The paper gives two methods of recording LSH, the first based on the receipt of ACKs and NAKs from the slave and the second based on slave side monitoring of the channel. Before transmitting, the master checks the LSH table to select the slave and the packet size to transmit, such that both the transmissions to and from that slave have a low probability of error. By choosing the right packet size, the master is able to mask bad frequencies and does not need to change the hopping sequence in any way.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114972457","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-12-17DOI: 10.1109/ICPWC.2000.905839
A. Kumar
The 7 kHz audio bandwidth is increasingly being considered for natural quality communications, especially for binaural, hands-free listening situations such as in teleconferencing and digital AM broadcasting. Based on detailed performance comparisons of several alternative designs, we shortlisted an ACELP-based 7 kHz coder design for performance optimization. This paper presents several low-complexity design strategies which significantly reduce the computational complexity of the encoder and decoder while not compromising on the reconstructed signal quality. These include: (a) open-loop pitch estimation and reduced search adaptive codebook; (b) open-loop pitch estimation based on pre-search in downsampled signal domain; (c) LSF quantization using a combination of scalar and vector quantization; (d) a novel reduced complexity search of algebraic codebook; and (e) efficient postfiltering in the decoder. The computational complexity of the encoder and decoder modules of three ACELP coders with different bit allocations are compared.
{"title":"Low complexity ACELP coding of 7 kHz speech and audio at 16 kbps","authors":"A. Kumar","doi":"10.1109/ICPWC.2000.905839","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905839","url":null,"abstract":"The 7 kHz audio bandwidth is increasingly being considered for natural quality communications, especially for binaural, hands-free listening situations such as in teleconferencing and digital AM broadcasting. Based on detailed performance comparisons of several alternative designs, we shortlisted an ACELP-based 7 kHz coder design for performance optimization. This paper presents several low-complexity design strategies which significantly reduce the computational complexity of the encoder and decoder while not compromising on the reconstructed signal quality. These include: (a) open-loop pitch estimation and reduced search adaptive codebook; (b) open-loop pitch estimation based on pre-search in downsampled signal domain; (c) LSF quantization using a combination of scalar and vector quantization; (d) a novel reduced complexity search of algebraic codebook; and (e) efficient postfiltering in the decoder. The computational complexity of the encoder and decoder modules of three ACELP coders with different bit allocations are compared.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116060503","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-12-17DOI: 10.1109/ICPWC.2000.905813
S. Kundu, S. Chakrabarti
Probability of outage is an important parameter for capacity evaluation of a cellular CDMA system. A mathematical formulation with closed form expression for outage probability for integrated voice and data services has been proposed. The correlation between signal and interference is also considered in evaluating the outage. It is observed that considering the correlation a significant reduction in outage probability is obtained compared to the model of Ayyagari et al., 1999.
{"title":"Outage analysis of cellular CDMA for integrated voice and data services with correlated signal and interference","authors":"S. Kundu, S. Chakrabarti","doi":"10.1109/ICPWC.2000.905813","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905813","url":null,"abstract":"Probability of outage is an important parameter for capacity evaluation of a cellular CDMA system. A mathematical formulation with closed form expression for outage probability for integrated voice and data services has been proposed. The correlation between signal and interference is also considered in evaluating the outage. It is observed that considering the correlation a significant reduction in outage probability is obtained compared to the model of Ayyagari et al., 1999.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124823309","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-12-17DOI: 10.1109/ICPWC.2000.905774
P. Venkataram, S. Laxman, R. Rajavelsamy
In this paper, a new data transfer control scheme is proposed to provide a high degree of data transfer during handoffs for multimedia traffic carried in microcellular, picocellular, and high speed wireless networks. The method performs efficient buffering of the data at the base station using toggled buffers. The method has been tested on in-house wired/wireless networks. The results have shown enormous improvement in the continuity of data transfer during multiple handoffs while running multimedia applications such as video-on-demand (VoD) and audio-on-demand (AoD).
{"title":"A method of data transfer control during handoffs in mobile multimedia networks","authors":"P. Venkataram, S. Laxman, R. Rajavelsamy","doi":"10.1109/ICPWC.2000.905774","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905774","url":null,"abstract":"In this paper, a new data transfer control scheme is proposed to provide a high degree of data transfer during handoffs for multimedia traffic carried in microcellular, picocellular, and high speed wireless networks. The method performs efficient buffering of the data at the base station using toggled buffers. The method has been tested on in-house wired/wireless networks. The results have shown enormous improvement in the continuity of data transfer during multiple handoffs while running multimedia applications such as video-on-demand (VoD) and audio-on-demand (AoD).","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"3 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851488","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-12-17DOI: 10.1109/ICPWC.2000.905794
Xue Yisheng, Zhuang Xuelong
Soft-decision adaptive decoding of space-time trellis code (STTC) used in TDMA communication links is considered. To fully utilize preambles of successive downlink slots, bi-directional processing (BD-P) is proposed, which performs forward and backward adaptive decoding with two-step LMS (TSLMS) based channel tracking. Computer simulation shows that the proposed decoder can improve system performance distinctly on slowly or moderately fast time-varying channels. Besides, the computational complexity of the proposed BD-TSLMS decoder is modest.
{"title":"A new soft-decision adaptive decoder for space-time trellis code","authors":"Xue Yisheng, Zhuang Xuelong","doi":"10.1109/ICPWC.2000.905794","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905794","url":null,"abstract":"Soft-decision adaptive decoding of space-time trellis code (STTC) used in TDMA communication links is considered. To fully utilize preambles of successive downlink slots, bi-directional processing (BD-P) is proposed, which performs forward and backward adaptive decoding with two-step LMS (TSLMS) based channel tracking. Computer simulation shows that the proposed decoder can improve system performance distinctly on slowly or moderately fast time-varying channels. Besides, the computational complexity of the proposed BD-TSLMS decoder is modest.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138464","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-12-17DOI: 10.1109/ICPWC.2000.905834
P. Panchapakesan, D. Manjunath
Routing information updates, exchange of congestion control information, and synchronisation in distributed computation environments may require that some information from all the nodes be broadcast to all the nodes in the network. We consider such all-to-all broadcast, or gossiping as it is known in the literature, in multihop packet radio networks in an ad hoc network setup. Scheduling of transmissions in a packet radio network can be done either deterministically or randomly. The use of deterministic scheduling algorithms for ad hoc (multihop radio) networks whose topologies are dynamic may not be practical and transmission scheduling with randomised transmissions may be better suited in these networks. We study the performance of deterministic and randomised algorithms for scheduling for a class of communication requirements, called gossiping, in multihop radio networks.
{"title":"Transmission scheduling for gossiping in multihop packet radio networks","authors":"P. Panchapakesan, D. Manjunath","doi":"10.1109/ICPWC.2000.905834","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905834","url":null,"abstract":"Routing information updates, exchange of congestion control information, and synchronisation in distributed computation environments may require that some information from all the nodes be broadcast to all the nodes in the network. We consider such all-to-all broadcast, or gossiping as it is known in the literature, in multihop packet radio networks in an ad hoc network setup. Scheduling of transmissions in a packet radio network can be done either deterministically or randomly. The use of deterministic scheduling algorithms for ad hoc (multihop radio) networks whose topologies are dynamic may not be practical and transmission scheduling with randomised transmissions may be better suited in these networks. We study the performance of deterministic and randomised algorithms for scheduling for a class of communication requirements, called gossiping, in multihop radio networks.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128400124","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-12-17DOI: 10.1109/ICPWC.2000.905764
S. Nagaraj, Yih-Fang Huang
A recently introduced method for closed-loop transmit diversity (see Nagaraj, S. and Huang, Y.F., Asilomar Conference on Signals, Systems and Computers, 2000) is further analyzed in this paper. Specifically, the amount of power saving possible due to the inherent feature of selective feedback is quantified via a capacity analysis. An optimal adaptive algorithm for channel estimation, in the sense of maximum likelihood, is derived to provide robustness against feedback errors, which arise due to incorrect detection at the mobile.
本文进一步分析了最近引入的闭环传输分集方法(见Nagaraj, S.和Huang, Y.F, Asilomar Conference on Signals, Systems and Computers, 2000)。具体地说，由于选择性反馈的固有特性，可能节省的电量是通过容量分析量化的。在最大似然的意义上，导出了信道估计的最优自适应算法，以提供对反馈误差的鲁棒性，这些误差是由于移动设备的不正确检测引起的。
{"title":"Downlink transmit diversity: feedback efficiency and robustness","authors":"S. Nagaraj, Yih-Fang Huang","doi":"10.1109/ICPWC.2000.905764","DOIUrl":"https://doi.org/10.1109/ICPWC.2000.905764","url":null,"abstract":"A recently introduced method for closed-loop transmit diversity (see Nagaraj, S. and Huang, Y.F., Asilomar Conference on Signals, Systems and Computers, 2000) is further analyzed in this paper. Specifically, the amount of power saving possible due to the inherent feature of selective feedback is quantified via a capacity analysis. An optimal adaptive algorithm for channel estimation, in the sense of maximum likelihood, is derived to provide robustness against feedback errors, which arise due to incorrect detection at the mobile.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130588419","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
扫码关注我们
求助内容：
应助结果提醒方式：