Pub Date : 2011-12-01DOI: 10.1109/ISCIT.2011.6089712
Ying Tang, Yue Ruan
Ultra-wideband (UWB) is a modern radio technology that works at extremely low energy levels. It is popularly used in short-range, low power and low cost communications such as RFIDs. This paper presents a UWB receiver using energy detection scheme with on-off keying (OOK) modulation. A novel synchronization and detection algorithm called energy offset based scheme is investigated and used in the receiver. This scheme aims at reducing power consumption and simplifying hardware complexity of the receiver. The prototype of the receiver's baseband is implemented on FPGA, with the design of FSMs in the controller. Simulation results are given, which reveal that the proposed UWB receiver has simple and power saving synchronization blocks, smaller preamble code length in synchronization, whereas maintaining performance in the target level.
{"title":"Research on a novel synchronization and detection scheme used in energy detection UWB receiver","authors":"Ying Tang, Yue Ruan","doi":"10.1109/ISCIT.2011.6089712","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089712","url":null,"abstract":"Ultra-wideband (UWB) is a modern radio technology that works at extremely low energy levels. It is popularly used in short-range, low power and low cost communications such as RFIDs. This paper presents a UWB receiver using energy detection scheme with on-off keying (OOK) modulation. A novel synchronization and detection algorithm called energy offset based scheme is investigated and used in the receiver. This scheme aims at reducing power consumption and simplifying hardware complexity of the receiver. The prototype of the receiver's baseband is implemented on FPGA, with the design of FSMs in the controller. Simulation results are given, which reveal that the proposed UWB receiver has simple and power saving synchronization blocks, smaller preamble code length in synchronization, whereas maintaining performance in the target level.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497825","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089962
Yongnu Jin, K. Kwak
In the present literature, the delay line (DL) in transmitted-reference (TR) system is supposed to be ideal. However, it is in fact impossible to design a DL with perfect phase-frequency characteristic. In this paper, based on the statistical model of group delay ripple (GDR) of the non-ideal DL, we investigate the degradation of average bit error rate (BER) for TR UWB communication system. Through Monte Carlo simulations, the impact of GDR amplitude on the degradation of BER performance under different TR UWB channel environments and different SNR conditions is verified.
{"title":"The impact of group delay ripple for TR UWB communication system","authors":"Yongnu Jin, K. Kwak","doi":"10.1109/ISCIT.2011.6089962","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089962","url":null,"abstract":"In the present literature, the delay line (DL) in transmitted-reference (TR) system is supposed to be ideal. However, it is in fact impossible to design a DL with perfect phase-frequency characteristic. In this paper, based on the statistical model of group delay ripple (GDR) of the non-ideal DL, we investigate the degradation of average bit error rate (BER) for TR UWB communication system. Through Monte Carlo simulations, the impact of GDR amplitude on the degradation of BER performance under different TR UWB channel environments and different SNR conditions is verified.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130321551","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089963
Xiaorong Xu, Aiping Huang, J. Bao
This paper investigates energy consumption problem in cooperative spectrum sensing and sharing in energy-constrained Cognitive Radio Networks (CRN). With the aim of the realization of green energy-saving cognitive communications, we mainly analyze energy efficiency in the process of cooperative sensing and transmission. Robust cooperative sensing technique is presented with the consideration of sensing channel SNR and reporting channel SNR. In addition, the error rates of transmission between cooperative secondary users (SUs) are also taken into account, which are more practical than traditional cooperative sensing analysis. In spectrum sharing process, an analytical expression of transmission energy consumption and an exact closed-form expression of average BER with BPSK and MQAM modulation are derived. Based on the minimization of energy consumption, optimization algorithm is presented in order to obtain the whole average BER performance with the minimum energy consumption. Optimal cooperative SU number sets are also presented under certain transmission distance constraint. Simulation results confirm our derivation. It is indicated that the analysis of cooperative sensing and sharing provides a significant way for energy saving in CRN.
{"title":"Energy efficiency analysis of cooperative sensing and sharing in cognitive radio networks","authors":"Xiaorong Xu, Aiping Huang, J. Bao","doi":"10.1109/ISCIT.2011.6089963","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089963","url":null,"abstract":"This paper investigates energy consumption problem in cooperative spectrum sensing and sharing in energy-constrained Cognitive Radio Networks (CRN). With the aim of the realization of green energy-saving cognitive communications, we mainly analyze energy efficiency in the process of cooperative sensing and transmission. Robust cooperative sensing technique is presented with the consideration of sensing channel SNR and reporting channel SNR. In addition, the error rates of transmission between cooperative secondary users (SUs) are also taken into account, which are more practical than traditional cooperative sensing analysis. In spectrum sharing process, an analytical expression of transmission energy consumption and an exact closed-form expression of average BER with BPSK and MQAM modulation are derived. Based on the minimization of energy consumption, optimization algorithm is presented in order to obtain the whole average BER performance with the minimum energy consumption. Optimal cooperative SU number sets are also presented under certain transmission distance constraint. Simulation results confirm our derivation. It is indicated that the analysis of cooperative sensing and sharing provides a significant way for energy saving in CRN.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132085019","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}
When customers who carry their “Hospitality” cards (UHF passive RFID tags) enter the shopping malls, the RFID reader can identify the tags and get the customers' personal information. The position of the customer can also be obtained using the reflected RSSI value returned to the RFID reader from the RFID tag. These information can help sales assistants to provide proper service to customers. In this paper, we propose an enhancement scheme for customer service using fuzzy logic system (FLS) using RFID. Three antecedents are used: the distance of a customer to the corresponding area's salesman, the walking speed of the customer and the possibility that the customer accepts recommendation. 27 FLS rules are set up based on these three antecedents. The output of the FLS provides the service possibility that the sales assistant at the corresponding area will provide proper service to the customer. If a customer is near to the salesman, the walking speed is slow and the possibility of acceptance of recommendation is high, then the possibility that the salesman provides service is strong.
{"title":"Passive RFID customer service enhancement using fuzzy logic","authors":"Junjie Chen, Jinghan Liang, Q. Liang, Wei Wang, Baoju Zhang","doi":"10.1109/ISCIT.2011.6089729","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089729","url":null,"abstract":"When customers who carry their “Hospitality” cards (UHF passive RFID tags) enter the shopping malls, the RFID reader can identify the tags and get the customers' personal information. The position of the customer can also be obtained using the reflected RSSI value returned to the RFID reader from the RFID tag. These information can help sales assistants to provide proper service to customers. In this paper, we propose an enhancement scheme for customer service using fuzzy logic system (FLS) using RFID. Three antecedents are used: the distance of a customer to the corresponding area's salesman, the walking speed of the customer and the possibility that the customer accepts recommendation. 27 FLS rules are set up based on these three antecedents. The output of the FLS provides the service possibility that the sales assistant at the corresponding area will provide proper service to the customer. If a customer is near to the salesman, the walking speed is slow and the possibility of acceptance of recommendation is high, then the possibility that the salesman provides service is strong.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132967819","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6090034
L. Nie, Juan Wang, Hui Wang, Xiaohui Lin
QoS routing protocol has become a hot research spot. However, it is difficult to offer guaranteed QoS, such as bandwidth, delay and delay jitter. To solve this problem, we proposed a Delay-Minimized Routing protocol based on Bandwidth Estimation (DMR-BE) that incorporates an admission control scheme and a route decision scheme to meet the QoS requirement of bandwidth and real-time applications. Bandwidth is used as constrains in the route discovery process to find paths that meet the bandwidth requirements. When making route decision, delay is taken into consideration so that the path with the minimum end to end delay can be selected. DMR-BE presented a new method of estimating the bandwidth consumption of data flows and has taken waiting time into consideration when accessing channels. Simulation results show that it has good performances in the end to end delay and throughput, which provides guaranteed QoS on bandwidth and delay.
{"title":"Delay-minimized routing based on bandwidth estimation for Ad Hoc networks","authors":"L. Nie, Juan Wang, Hui Wang, Xiaohui Lin","doi":"10.1109/ISCIT.2011.6090034","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6090034","url":null,"abstract":"QoS routing protocol has become a hot research spot. However, it is difficult to offer guaranteed QoS, such as bandwidth, delay and delay jitter. To solve this problem, we proposed a Delay-Minimized Routing protocol based on Bandwidth Estimation (DMR-BE) that incorporates an admission control scheme and a route decision scheme to meet the QoS requirement of bandwidth and real-time applications. Bandwidth is used as constrains in the route discovery process to find paths that meet the bandwidth requirements. When making route decision, delay is taken into consideration so that the path with the minimum end to end delay can be selected. DMR-BE presented a new method of estimating the bandwidth consumption of data flows and has taken waiting time into consideration when accessing channels. Simulation results show that it has good performances in the end to end delay and throughput, which provides guaranteed QoS on bandwidth and delay.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122728646","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092182
S. Timakul, S. Choomchuay
This paper presents a simple method in designing a parity matrix of low density parity check codes. According to its use the use of arithmetic sequence is ideal for high rate code with no existing of cycle 4. The design is applicable to array code, modified array code, and quasi cyclic code. Upon the investigation, the designed code has delivered a similar BER-SNR performance when compared with that of more complicate designed matrices.
{"title":"A simple algorithm for a high code rate LDPC parity matrix design","authors":"S. Timakul, S. Choomchuay","doi":"10.1109/ISCIT.2011.6092182","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092182","url":null,"abstract":"This paper presents a simple method in designing a parity matrix of low density parity check codes. According to its use the use of arithmetic sequence is ideal for high rate code with no existing of cycle 4. The design is applicable to array code, modified array code, and quasi cyclic code. Upon the investigation, the designed code has delivered a similar BER-SNR performance when compared with that of more complicate designed matrices.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999667","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6090035
Jamshaid Sarwar Malik, J. Malik, A. Hemani, N. Gohar
Box Muller (BM) algorithm is extensively used for generation of high quality Gaussian Random Numbers (GRNs) in hardware. Most efficient published implementation of BM method utilizes transformation of 32-bit data path to 16 bits and use of first degree piece-wise polynomial approximation to compute logarithmic and square root functions. In this work, we have performed extensive error analysis to show that coefficient memory for polynomial approximation can be reduced by more than 35 percent without compromising on quality of generated Gaussian samples. This also reduces complexity of corresponding address generator, which requires most hardware resources. We have also used more efficient and statistically accurate skip-ahead Linear Feedback Shift Registers to generate uniformly distributed numbers for the BM algorithm. Complete hardware implementation utilizes only 407 slices, 03 DSP blocks and 1.5 memory blocks on Xilinx Virtex-4 XC4VLX15 operating at 230 MHz while providing a tail accuracy of 6.6σ. This is better in terms of accuracy and hardware utilization than any of the previously reported architecture.
{"title":"An efficient hardware implementation of high quality AWGN generator using Box-Muller method","authors":"Jamshaid Sarwar Malik, J. Malik, A. Hemani, N. Gohar","doi":"10.1109/ISCIT.2011.6090035","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6090035","url":null,"abstract":"Box Muller (BM) algorithm is extensively used for generation of high quality Gaussian Random Numbers (GRNs) in hardware. Most efficient published implementation of BM method utilizes transformation of 32-bit data path to 16 bits and use of first degree piece-wise polynomial approximation to compute logarithmic and square root functions. In this work, we have performed extensive error analysis to show that coefficient memory for polynomial approximation can be reduced by more than 35 percent without compromising on quality of generated Gaussian samples. This also reduces complexity of corresponding address generator, which requires most hardware resources. We have also used more efficient and statistically accurate skip-ahead Linear Feedback Shift Registers to generate uniformly distributed numbers for the BM algorithm. Complete hardware implementation utilizes only 407 slices, 03 DSP blocks and 1.5 memory blocks on Xilinx Virtex-4 XC4VLX15 operating at 230 MHz while providing a tail accuracy of 6.6σ. This is better in terms of accuracy and hardware utilization than any of the previously reported architecture.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133386267","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6089748
Liqi Wei, Xiaoqiang Xiao, Yingwen Chen, Ming Xu, Haikuan Fan
In Vehicle Ad hoc Networks (VANETs), multi-hop broadcast is a key technique to disseminate emergency information such as Event-driven safety messages to warn drivers in case of dangerous events. When multiple vehicles receive an emergency message, packet collisions may occur if they rebroadcast the message simultaneously. In this paper we propose a power-control broadcast scheme based on studying the IEEE 802.11p and IEEE 1609 WAVE standards for vehicular communications. Transmission strategy is adjusted based on vehicles' situation and the receive power of recently broadcast packet from a sender node, and re-dissemination power in short-range for reliable broadcast is adapted based on the observed channel status. We evaluated the performance of the proposed scheme by simulation with NS-2. The results demonstrate high delivery ratio and fast emergency messages dissemination while avoiding congestion simultaneously.
{"title":"Power-control-based broadcast scheme for emergency messages in VANETs","authors":"Liqi Wei, Xiaoqiang Xiao, Yingwen Chen, Ming Xu, Haikuan Fan","doi":"10.1109/ISCIT.2011.6089748","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089748","url":null,"abstract":"In Vehicle Ad hoc Networks (VANETs), multi-hop broadcast is a key technique to disseminate emergency information such as Event-driven safety messages to warn drivers in case of dangerous events. When multiple vehicles receive an emergency message, packet collisions may occur if they rebroadcast the message simultaneously. In this paper we propose a power-control broadcast scheme based on studying the IEEE 802.11p and IEEE 1609 WAVE standards for vehicular communications. Transmission strategy is adjusted based on vehicles' situation and the receive power of recently broadcast packet from a sender node, and re-dissemination power in short-range for reliable broadcast is adapted based on the observed channel status. We evaluated the performance of the proposed scheme by simulation with NS-2. The results demonstrate high delivery ratio and fast emergency messages dissemination while avoiding congestion simultaneously.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133869456","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092156
X. Shi, C. Siriteanu, S. Yoshizawa, Y. Miyanaga
In recent years, there have been significant breakthroughs in wireless communication systems design based on the multiple-input multiple-output (MIMO) concept. Exploiting the channel state information at the transmitter (CSIT) can improve the link performance. Thus, MIMO precoding has been an active research area for wireless communications. By specifying a precoding matrix with full CSIT, one can activate the strongest channel modes. In practice, important issues include how to obtain an accurate estimated CSI and use it. In this paper, we exploit estimated CSI for a correlated realistic Rician fading channel with estimated statistics. Then, a new precoder by providing the statistical mean of the channel matrix is presented. Numerical results show the performance degradation exists between the typical channel assumption, i.e., Rayleigh fading, and the realistic channel, i.e., correlated Rician fading. The new CSIT by sufficiently considering the channel statistics can reduce the error rate. The rank of the Rician fading channel matrix renders performance sensitive for the precoding performance.
{"title":"MIMO precoding performance for correlated and estimated Rician fading","authors":"X. Shi, C. Siriteanu, S. Yoshizawa, Y. Miyanaga","doi":"10.1109/ISCIT.2011.6092156","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092156","url":null,"abstract":"In recent years, there have been significant breakthroughs in wireless communication systems design based on the multiple-input multiple-output (MIMO) concept. Exploiting the channel state information at the transmitter (CSIT) can improve the link performance. Thus, MIMO precoding has been an active research area for wireless communications. By specifying a precoding matrix with full CSIT, one can activate the strongest channel modes. In practice, important issues include how to obtain an accurate estimated CSI and use it. In this paper, we exploit estimated CSI for a correlated realistic Rician fading channel with estimated statistics. Then, a new precoder by providing the statistical mean of the channel matrix is presented. Numerical results show the performance degradation exists between the typical channel assumption, i.e., Rayleigh fading, and the realistic channel, i.e., correlated Rician fading. The new CSIT by sufficiently considering the channel statistics can reduce the error rate. The rank of the Rician fading channel matrix renders performance sensitive for the precoding performance.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"78 3-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131607420","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 : 2011-12-01DOI: 10.1109/ISCIT.2011.6092168
Huili Cheng, Qinghai Yang, Fenglin Fu, K. Kwak
In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.
{"title":"Spectrum sharing with smooth supermodular game in cognitive radio networks","authors":"Huili Cheng, Qinghai Yang, Fenglin Fu, K. Kwak","doi":"10.1109/ISCIT.2011.6092168","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092168","url":null,"abstract":"In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865325","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
扫码关注我们
求助内容：
应助结果提醒方式：