{"title":"Novel autocorrelation based spectrum sensing methods for cognitive radios","authors":"Wang Jun, Bi Guangguo","doi":"10.1109/APCC.2010.5679691","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679691","url":null,"abstract":"In cognitive radios, energy detector is often considered for spectrum sensing in the literature. However, its performance deteriorates rapidly when noise power is fluctuating. In order to solve this problem, several autocorrelation based detection methods such as statistical covariances based (CAV) detection method and eigenvalue based (MME) detection method have been proposed. However, CAV detector is derived based on the assumption the noise is real and MME detector on the other hand is a little conservative. In this paper, two novel autocorrelation based spectrum sensing methods, which are correlation coefficients (CCE) based detection method and nonparametric autocorrelation (NAC) based detection method, have been proposed. CCE detector is suitable for complex Gaussian noise and NAC detector can distinguish correlated signals from arbitrary independent noise without knowing the noise type. Both CCE detector and NAC detector are also nonparametric. Simulation experiments are provided to show the validity of the proposed CCE detector and NAC detector.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128838933","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}
{"title":"Primary system interference analysis for cognitive radio transmission power control","authors":"Meng-Jung Ho, S. Berber, K. Sowerby","doi":"10.1109/APCC.2010.5679695","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679695","url":null,"abstract":"Cognitive radio (CR) improves radio spectrum utilization and offers new opportunities for future wireless services. It is designed to operate in frequency bands that are licensed to other primary radio users while ensuring no harmful interference to the licensed users' operations. By knowing the geo-locations of the CRs and the licensed users, it is possible to allow CR to access licensed bands without causing interference. In this paper, a transmission power control scheme for CRs is proposed to minimise the interference to licensed users. The scheme utilises mainly location information to estimate primary systems service reliability as the main power control indicator to determine the transmission power. Primary system interference analysis has been conducted as a part of the scheme and a model of an exclusion zone centred on a primary transmitter (PT) has been developed. This model is also specified by the Federal Communications Commission (FCC). Interference analysis at the centre and the edge of the exclusion zone has been performed by other researchers. In this paper, an analysis of the interference power level across the entire coverage area has been conducted. The effect of shadowing has also been included in the evaluation. The interference power statistics have been analysed for the entire coverage area. Analytic studies and Monte Carlo simulations are in agreement.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133377058","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}
{"title":"Fair data flows scheduling schema for multihop wireless ad hoc networks","authors":"Hamidreza Salarian, P. Khadivi","doi":"10.1109/APCC.2010.5680004","DOIUrl":"https://doi.org/10.1109/APCC.2010.5680004","url":null,"abstract":"One of the most critical problems in multihop wireless networks is the fair allocation of bandwidth among different nodes. Although there are significant researches on the fairness issues in single-hop wireless networks, research on multihop fairness rarely found in the literature. A user in multi-hop network, besides the contention with other nodes to obtain the channel in physical layer, must find a solution for the inevitable contention between its own and the relayed traffic in the network layer. Accordingly, a suitable mechanism is needed to schedule data flows in network layer fairly. In this paper, a new algorithm is proposed which tries to allocate node's bandwidth fairly between different contention traffic flows. The main purpose of this algorithm, named HBPQ (History Based Priority Queuing) is the prevention of starvation occurrence for any active flow in the network. HBPQ uses a satisfaction function to measure the user's gratifications and tries to bring close the satisfaction of users. If HBPQ is used for flow scheduling in multihop wireless ad-hoc networks, the simulation results show that each active network's flow, receives a throughput proportional to distance between its source and destination and existing traffic load on its traversed path.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"1995 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405887","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}
{"title":"Analytical modeling of multi-service systems with multi-service sources","authors":"M. Głąbowski, M. Sobieraj, M. Stasiak","doi":"10.1109/APCC.2010.5679781","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679781","url":null,"abstract":"The paper presents a new analytical model for performance evaluation of multi-service communication systems. The paper considers for the first time multi-service systems in which each single traffic source can generate calls of different traffic classes, i.e. the multi-service systems with multi-service sources. To date only the models assuming that a single source of given class generates always only calls of this class, i.e. the multi-service systems with single-service sources, have been considered in teletraffic literature. The proposed algorithm makes it possible to determine occupancy distribution as well as blocking and loss probability for calls of particular traffic classes. In order to assure completeness of considerations the systems with both finite and infinite traffic sources are considered. The results of analytical modeling of the systems with multi-service sources are compared with simulation data. The possible application of the proposed model is presented in the context of an exemplary cellular system with WCDMA (Wideband Code Division Multiple Access) radio interface.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130816177","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}
{"title":"Multi-user and channel dependent scheduling based adaptive power saving for LTE and beyond system","authors":"Liu Liu, X. She, Lan Chen","doi":"10.1109/APCC.2010.5679748","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679748","url":null,"abstract":"In this paper, adaptive power saving methods considering multi-user diversity and channel dependent scheduling characteristics are proposed for Long-Term Evolution (LTE) and beyond system. In LTE, Discontinuous Reception (DRX) is applied in User Equipment (UE) to conserve mobile terminal's battery power. According to our observation, system load and channel variation have great impact to the power saving efficiency. We firstly investigate effects of these two factors on the effectiveness of DRX. Based on the analysis, we proposed novel and efficient adaptive DRX schemes. In these schemes, DRX parameters are adaptively changed according to number and velocity of connected UE respectively. Simulation results show that power saving efficiency can be greatly improved without much loss of system capacity.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128297976","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}
{"title":"Reliable data delivery in low energy ad hoc sensor networks","authors":"K. Daabaj, M. Dixon, Terry Koziniec, David Murray","doi":"10.1109/APCC.2010.5679762","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679762","url":null,"abstract":"Reliable delivery of data is a classical design goal for reliability-oriented collection routing protocols for ad hoc wireless sensor networks (WSNs). Guaranteed packet delivery performance can be ensured by careful selection of error free links, quick recovery from packet losses, and avoidance of overloaded relay sensor nodes. Due to limited resources of individual senor nodes, there is usually a trade-off between energy spending for packets transmissions and the appropriate level of reliability. Since link failures and packet losses are unavoidable, sensor networks may tolerate a certain level of reliability without significantly affecting packets delivery performance and data aggregation accuracy in favor of efficient energy consumption. However a certain degree of reliability is needed, especially when hop count increases between source sensor nodes and the base station as a single lost packet may result in loss of a large amount of aggregated data along longer hops. An effective solution is to jointly make a trade-off between energy, reliability, cost, and agility while improving packet delivery, maintaining low packet error ratio, minimizing unnecessary packets transmissions, and adaptively reducing control traffic in favor of high success reception ratios of representative data packets. Based on this approach, the proposed routing protocol can achieve moderate energy consumption and high packet delivery ratio even with high link failure rates. The proposed routing protocol was experimentally investigated on a testbed of Crossbow's TelosB motes and proven to be more robust and energy efficient than the current implementation of TinyOS2.x MultihopLQI.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197059","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}
S. Tsunoda, N. Kitsuwan, E. Oki, T. Miyamura, K. Shiomoto
{"title":"Protocol proxy scheme for emulating OSPF for IP+optical network management","authors":"S. Tsunoda, N. Kitsuwan, E. Oki, T. Miyamura, K. Shiomoto","doi":"10.1109/APCC.2010.5680016","DOIUrl":"https://doi.org/10.1109/APCC.2010.5680016","url":null,"abstract":"This paper proposes a protocol proxy scheme that can emulate the open shortest path first (OSPF) protocol in an effective and flexible manner. It is implemented in our developed network emulator, which is used to test network controllers for IP optical network management. In the protocol scheme, OSPF protocol emulation is achieved by combining an OSPF protocol proxy (introduced here) and an OSPF peer state manager based on existing OSPF protocol software. The protocol proxy produces OSPF packets holding link state advertisements with customized extensions including MPLS and GMPLS, while the OSPF peer state manager implements neighbor establishment via the proxy. The protocol proxy has two main functions: rewrite OSPF packets originated by the OSPF peer state manager and generate OSPF packets to inform the updated topology to the network controller. To implement the customized OSPF extensions, only the protocol proxy software need be modified; the existing OSPF software for the OPSF peer state manager is not touched. This makes the implementation of the OSPF emulation easy and flexible. Furthermore, the protocol proxy obtains the network topology information from the resource simulator, which is managed in a centralized manner. This reduces the amount of processing resources required and is scalable in terms of network size. We develop a prototype of the network emulator including OSPF protocol emulation with the protocol proxy scheme. The effectiveness of the protocol proxy scheme is confirmed by an experiment on 40 nodes.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122624737","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}
{"title":"Analytical performance evaluation of IEEE 802.15.4 with multiple transmission queues for providing QoS under non-saturated conditions","authors":"Youn-Soon Shin, Kang-Woo Lee, Jong-Suk Ahn","doi":"10.1109/APCC.2010.5679712","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679712","url":null,"abstract":"This paper investigates the effects of adopting multiple transmission queues in IEEE 802.15.4 to differentiate frame sending priorities for providing QoS (Quality of Service) services. By employing different contention window operational parameters for various traffic classes like IEEE 802.11e, the multi-queue system can send frames of higher priority class more rapidly than those of the lower ones. For the performance evaluation of multi-queue's behavior under both saturated and unsaturated traffic conditions, this paper proposes an analytical model which integrates models for conventional 802.15.4 and legacy 802.11e. To enhance the accuracy, furthermore, the model accommodates the deferment behaviors and transmission retries that have not been accounted in traditional 802.15.4 models. Our analytical model predicts that the multi-queue scheme separates the throughput of two different classes by up to 46% without wasting the bandwidth when the two classes contend over the wireless channel. Simulation results validate our model's accuracy within 7% discrepancy at maximum.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114593110","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}
{"title":"Mobility-based handover decision mechanism to relieve ping-pong effect in cellular networks","authors":"Jaheon Gu, S. Bae, M. Chung, K. Cheon, A. Park","doi":"10.1109/APCC.2010.5680000","DOIUrl":"https://doi.org/10.1109/APCC.2010.5680000","url":null,"abstract":"In order to guarantee quality of service (QoS) and seamless communications to nomadic users, it is important to prevent unnecessary handovers occurred during a short interval, so-called ping-pong effect. Considering mobility is one of the useful methods to relieve ping-pong effect in cellular networks since a mobile device can efficiently determine whether it should perform handover or not through the estimation of its moving direction or velocity. In this paper, we propose a mobility estimation method that estimates radial velocity of mobile device directed to the neighboring base stations based on the received signal strength (RSS). In addition, we propose an efficient handover decision mechanism based on the estimated mobility to relieve ping-pong effect. From performance evaluation based on simulations, we find that the proposed mobility estimation mechanism can accurately estimate mobility of moving devices and the proposed handover mechanism can effectively relieve ping-pong effect and reduce handover delay.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127725438","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}
{"title":"Performance analysis of overlap FFT filter-bank for dynamic spectrum access applications","authors":"M. Umehira, M. Tanabe","doi":"10.1109/APCC.2010.5679690","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679690","url":null,"abstract":"An OFDMA-based channel access scheme for dynamic spectrum access has drawbacks of large PAPR (Peak to Average Power Ratio) and large ACI (Adjacent Channel Interference). To solve these problems, a new flexible channel access scheme using overlap FFT filter-bank was proposed based on single carrier modulation for dynamic spectrum access. It is necessary to establish the design methodology of the overlap FFT filter-bank since ACI is critical for dynamic spectrum access. This paper analyzes the performance of the overlap FFT filter-band for dynamic spectrum access applications and confirms it by computer simulations. Furthermore, ACI performance of the overlap FFT filter-bank is evaluated.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126200059","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}