Lu Chen, K. Sandrasegaran, R. Basukala, F. M. Madani, Cheng-Chung Lin
{"title":"Impact of soft handover and pilot pollution on video telephony in a commercial network","authors":"Lu Chen, K. Sandrasegaran, R. Basukala, F. M. Madani, Cheng-Chung Lin","doi":"10.1109/APCC.2010.5679998","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679998","url":null,"abstract":"Soft handover (SHO) provides better support for user mobility. The quality of service (QoS) to the mobile wireless subscribers can also grant benefits from SHO. To analyze the impact of SHO on the circuit switched (CS) video telephony (VT); real-time measurements have been conducted on a commercial WCDMA mobile network in the CBD of Sydney, Australia. Live measurement provides a practical approach to evaluate performance of commercial network. The obtained SHO gain implies that better QoS can be achieved. Furthermore, the negative impact of pilot pollution on radio link quality has been demonstrated in this paper.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"6 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":"130251448","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}
Hyungjong Kim, Hano Wang, Jemin Lee, Sungsoo Park, D. Hong
{"title":"Outage probability of cognitive amplify-and-forward relay networks under interference constraints","authors":"Hyungjong Kim, Hano Wang, Jemin Lee, Sungsoo Park, D. Hong","doi":"10.1109/APCC.2010.5679701","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679701","url":null,"abstract":"This paper presents the outage performance in cognitive relay networks. The closed-form expression for the outage probability is derived in cognitive amplify-and-forward (AF) relay networks under the interference constraint. Through the Monte Carlo simulation, it is shown that our analytic result is a tight bound especially at high average signal to noise ratio (SNR). Additionally, the numerical result shows the feasible region of AF relay in cognitive relay networks. This result also shows that the relaying transmission in the cognitive networks is inferior to the direct transmission in aspect of the outage performance, if the location of relay is too close to the primary receiver.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"305 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":"131027976","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}
K. Ahmed, Sreedevi Kothuri, M. Patwary, Mohamed Abdel-Maguid
{"title":"Subspace compressive GLRT detector for airborne MIMO Radar","authors":"K. Ahmed, Sreedevi Kothuri, M. Patwary, Mohamed Abdel-Maguid","doi":"10.1109/APCC.2010.5679718","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679718","url":null,"abstract":"In this paper, the design of a subspace compressive GLRT (SSC-GLRT) detector has been pursued for MIMO airborne radar system when the secondary sets of data are available in addition to the primary one. It is observed that with very reduced amount of measurement data at sub-Nyquist rate that is equal to the number of virtual bi-static radar in the presence of a single target, SSC-GLRT provides the same performance as the conventional GLRT with much larger length of the data, i.e., an order of magnitude higher given by the product of the number of elements in the received antenna array and coherent pulse interval (CPI). Therefore, SSC-GLRT is much energy efficient and useful in the scenario where the computational complexity becomes a burden. Also, this paper illustrates an elegant way of mapping the angular and Doppler domain to an one dimensional discrete vector for the formulation of compressive sampling (CS) based ℓ1 reconstruction of the signal subspace when it is unknown so that it can successively be used in SSC-GLRT. The simulation example further corroborates the effectiveness of the proposed SSC-GLRT detector.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"24 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":"130742578","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":"A contender-aware backoff algorithm for CSMA based MAC protocol for Wireless Sensor Network","authors":"M. Al-Mamun, G. Karmakar, J. Kamruzzaman","doi":"10.1109/APCC.2010.5679777","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679777","url":null,"abstract":"Existing contention based nonpersistent medium access control protocols in Wireless Sensor Network (WSN) do not perform well in high contention. Their performances are affected by occurrence of collision due to uniform probability distribution in choosing Time Slot (TS) during backoff period. To address this issue nonuniform probability distribution was proposed. However success rate still drops for higher number of contenders. In this paper we propose CSMA/s (Collision Sense Multiple Access /per Slot based), a new approach in nonuniform contender-aware probability distribution for choosing TS in the backoff period. Rather than taking a premeditated fixed value for contender population size, our proposed scheme embeds neighborhood population size into its bedrock to automatically converge to the actual number of contenders which enables the contender to adaptively choose TS in the backoff period for reducing collision. This method produces better success rate and lower latency for even very high number of contenders.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"17 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":"133130135","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":"Pragmatic trellis coded modulation for adaptive multi-objective genetic algorithm-based cognitive radio systems","authors":"Ayman A. El-Saleh, M. Ismail, M. Ali","doi":"10.1109/APCC.2010.5679986","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679986","url":null,"abstract":"The cognitive radio (CR) has recently been proposed as one of the main opportunistic spectrum access solutions for dynamic spectrum allocation. In the CR context, an adaptive wireless node changes its transmission parameters to communicate efficiently and avoid interference with licensed users. In this paper, an adaptive pragmatic trellis coded modulation (TCM) scheme is proposed for CR systems. The proposed scheme employs the family of pragmatic TCM to combine different coded modulation modes to serve the CR node adaption while reducing the hardware complexity. The tradeoff of the error-throughput-power consumption performance is first analyzed using the so-called Pareto front concept. Then, the pragmatic TCM modes are implemented into a multi-objective genetic algorithm (MOGA) based CR decision engine. It is demonstrated that the proposed system is able to evolve to an appropriate transmission mode based on the wireless environmental conditions.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"340 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":"115887149","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":"New high-definition videoconference system for remote lectures connecting 18 National Universities in Japan","authors":"Takeshi Sakurada, Yoichi Hagiwara","doi":"10.1109/APCC.2010.5679702","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679702","url":null,"abstract":"This paper describes construction of a high-definition videoconference system which is connected 18 National Universities. This system is supported two screens with high-definition, to provide videos and sounds in high quality. We can operate a videoconference device, high definition camera, audio and video equipment (an audio amplifier and data projectors, etc.) from a wireless touch panel. A wireless touch panel is connected to an administration system of reservation through a network. This system can reduce a burden of a user, because the user can use it with simple operation for reservation from Web, and a system starts automatically in reservation time and sets it. This system is a beginning in Japan, as for the remote lecture using a high-definition picture connected Japanese universities from the north to the south.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"25 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":"126519357","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":"Optimal threshold for throughput and optimal threshold for capacity in one-bit feedback scheduler","authors":"F. Ishizaki, Kaoru Momiyama","doi":"10.1109/APCC.2010.5679707","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679707","url":null,"abstract":"In this paper, we consider a wireless network consisting of a BS (Base Station) and MSs (Mobile Stations) where the BS employs the one-bit feedback quantized proportional fair scheduler for downlink transmission. We then examine the effect of the threshold value in the scheduler on the throughput and that on the information theoretic capacity. Numerical results exhibit that the characteristics of the throughput with the change of the threshold value are greatly different from the characteristics of the information theoretic capacity with the change of the threshold value. Numerical results also show that if we use the optimal threshold for capacity as a substitute of the optimal threshold for throughput, the throughput performance can be considerably degraded.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"83 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":"122302352","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":"Downlink resource management for OFDMA femtocells using stochastic subchannel allocation","authors":"Hyunduk Jung, Jaiyong Lee","doi":"10.1109/APCC.2010.5679775","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679775","url":null,"abstract":"The Femtocell becomes an effective solution to support indoor high data rate services. The macrocell systems require expensive costs to improve the performance of indoor users. Although the advantage of the femtocells, the co-channel interference between the femtocells and the macrocells is the most significant problem to deploy femtocells. In this paper, a novel downlink resource management algorithm for OFDMA femtocells using the stochastic subchannel allocation is proposed. The stochastic subchannel allocation selects available subchannels used by the femtocells to reduce the interference. Monte-Carlo simulation results show the performance of the proposed algorithm in terms of the average user throughput.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"47 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":"132616403","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":"Application of Kolmogorov complexity in anomaly detection","authors":"A. Ukil","doi":"10.1109/APCC.2010.5679753","DOIUrl":"https://doi.org/10.1109/APCC.2010.5679753","url":null,"abstract":"Kolmogorov complexity is the basis of algorithmic randomness theory. It quantifies the amount of information of individual object, which is measured by the size of its smallest algorithmic description. The concept of Kolmogorov complexity is used in many applications like spam filtering, data compression, information assurance etc. In this paper, we present the application of Kolmogorov complexity in network security field, particularly for anomaly detection. In order to accomplish that, it is assumed that most of the network attacks change the structure of the traffic. This enforces anomaly and hence subsequent intrusion can be detected if the structure or signature of the traffic flow is investigated. From this notion, we propose a signature based anomaly detection scheme. We show through simulation results that with the help of Kolmogorov complexity, we can detect traffic pattern abnormality in a simplistic way. This detection and quantification of traffic pattern eventually lead to anomaly detection.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"40 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":"132668313","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":"Adaptive intentional connection rerouting for traffic grooming in WDM mesh networks with biological attractor selection","authors":"Yan Li, Jianping Wang, Yun Xu","doi":"10.1109/APCC.2010.5680019","DOIUrl":"https://doi.org/10.1109/APCC.2010.5680019","url":null,"abstract":"In wavelength division multiplexing (WDM) mesh networks, wavelength utilization is limited by the mismatch between the high bandwidth that one wavelength can provide and the relatively low bandwidth request of a single connection. Traffic grooming which grooms multiple connections onto one wavelength is a desirable technique to improve resource utilization. However, with unpredictable traffic demand, the newly arrived request may not be accommodated using remaining resources. Rerouting which reroutes existing connections such that the newly arrived request can be accommodated is an effective approach to further improve network throughput. In this paper, we study adaptive intentional connection rerouting which intentionally triggers rerouting algorithm according to network status, with the aim to reserve maximum resources for future connections. There are two important issues in intentional rerouting scheme: when to trigger rerouting algorithm and the rule to reroute the accommodated connections. The answers to the questions can reduce network blocking probability within an appropriate number of rerouting. In this paper, we propose to use biological attractor selection approach to address the above issues so that rerouting can be performed at the right time to accommodate unpredictable traffic demand. The proposed rerouting scheme can also improve system robustness given its adaptability. The simulations demonstrate the effectiveness of our proposed adaptive rerouting approach.","PeriodicalId":402292,"journal":{"name":"2010 16th Asia-Pacific Conference on Communications (APCC)","volume":"53 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":"132233646","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}