{"title":"Performance analysis of a tunable cost function based WLAN energy efficient packet transmission technique","authors":"W. Muhamad, J. Khan, Jason Brown","doi":"10.1109/APWIMOB.2014.6920296","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920296","url":null,"abstract":"This paper propose a new algorithm to adapt the transmission parameters of the IEEE 802.11 network devices to optimize the energy consumption of a WLAN transmitter under different Quality of Service (QoS) constraints. The novelty of the proposed algorithm is that the transmission data rate is mapped based on the proposed tunable cost function to optimize the energy requirements of a transmitter. The algorithm is adaptive in nature where parameters of the cost function can be adapted to match the transmission data rate based on network load conditions. In addition to that, to achieve the energy efficiency objective, different threshold criteria are proposed for the adaptive data rate mapping. Performance analysis is carried out to study the effects of tunable parameters of the cost function to enhance energy efficiency and QoS. By using an OPNET based simulation model, we evaluate the performance improvement that can be achieved when the proposed mechanism is implemented in a WLAN. Performance of the proposed algorithm is also compared with two well established algorithms such as the First Rate CDRPA and the Miser. The results show that the proposed algorithm achieve transmission energy saving as large as 58% and 20% compared to the Rate First CDRPA and Miser respectively, while maintaining required performance in terms of packet delay and packet loss.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117125747","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}
P. Sahoo, Cheng-Cheng Chien, Ming-Jer Chiang, Shih-Lin Wu
{"title":"A novel event transmission protocol for vehicular ad hoc networks","authors":"P. Sahoo, Cheng-Cheng Chien, Ming-Jer Chiang, Shih-Lin Wu","doi":"10.1109/APWIMOB.2014.6920312","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920312","url":null,"abstract":"In vehicular ad hoc networks (VANET), accidents or traffic congestion occurs due to driver behavior and change of lanes. Besides, people in the car may like to share some data such as games, music, and other information when they drive through the highways. Network services and road safety for the vehicles can be provided by the VANET. In IEEE 1609.4 standard, the channel application is divided into control and service channels, which is static. Due to static nature of the channel interval, transmission of safety and non-safety data cannot be handled efficiently. Though road accidents are normal, it may not occur more frequently and therefore the control channel used for broadcasting the safety message cannot be use efficiently. It will cause the wastage of channel due to fixed control channel and services channel intervals. In this paper, our goal is to increase the driving safety, prevention of accidents and efficient utilization of channels by adjusting the control and service channel intervals dynamically. Hence, we propose here a dynamic channel adjustment protocol based on IEEE 1609.4 standard that can adjust the control and service channel to transmit the message efficiently. Simulation results of our protocol shows that it can outperform the standard in terms of number of dropped packets and idle time for different number of nodes within the communication range.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126100131","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":"Effects of size mismatch in dual-function near-field antennas","authors":"A. Eteng, S. Rahim, C. Leow","doi":"10.1109/APWIMOB.2014.6920309","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920309","url":null,"abstract":"Effective deployment of near-field wireless power transfer mechanisms requires the concurrent transfer of status and control data between the coupled terminals. The implementation of simultaneous data and power transfer requires an understanding of the interplay between the transfer efficiency and bandwidth. This paper examines the transfer efficiency and bandwidth of links with independently matched circular loop antennas. Three scenarios are investigated. In the first, both paired antennas have the same size. The second and third scenarios deal with bigger and smaller transmit antennas relative to the receive antenna. The results suggest that equal-sized antennas provide a higher level of efficiency than with size mismatched antennas. Further, a marginal increase in link bandwidth is observed for the case of a larger transmit antenna relative to the receive antenna.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122515389","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":"Novel visual sensor deployment algorithm in PTZ wireless visual sensor networks","authors":"Hong-Hsu Yen","doi":"10.1109/APWIMOB.2014.6920291","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920291","url":null,"abstract":"In this paper, we consider the visual sensor deployment algorithm in Pan-Tilt-Zoom (PTZ) Wireless Visual Sensor Networks (WVSN). With the capability of panning, tilting and zooming, the sensor visual coverage can be enlarged and fewer visual sensors are needed as compared to the traditional WVSN. We divide the Field of View (FoV) of the PTZ sensor into two regions, Direct Coverage Region (DCR) and PTZ Coverage Region (PTZCR). In the PTZCR, the visual sensor need to pan-tilt-zoom the camera angle to cover the object. Because pan-tilt-zoom is a slow mechanic operation, visual sensor might not be able to adjust the angle in time to capture the visual data. One possible way to alleviate this problem is to make sure the PTZCR are covered by M sensors. With large M, there is a high probability of adjusting the camera in time to capture the visual data at the PTZCR by at least one camera. We tackle this visual sensor deployment problem in PTZ WVSN to make sure that each area is either covered in the DCR of a single visual sensor or in the PTZCR of M sensors. Then novel heuristic, PTZA algorithm, is proposed to solve the problem. In the computational experiments, we find out that PTZ capable camera sensor could significantly reduce the number of deployed sensors especially in smaller sensing range and smaller camera span angle.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591631","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":"Ns-3 based WiMAX emulation system","authors":"M. Tariq, R. Beuran, Y. Shinoda","doi":"10.1109/APWIMOB.2014.6920304","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920304","url":null,"abstract":"Evaluating a system in real-time to test its performance has always been a challenging task. Although real-world wireless testbeds offer great value, on the other hand they are expensive in terms of hardware cost and very hard to maintain. Network simulations are synthetic environments for running representations of mathematical models. However, network emulation studies are preferred for system modeling and its evaluation in a real-time environment. In this paper, we present the design and implementation of a WiMAX emulation system. By making use of the open-source ns- 3 simulation framework, we developed an emulation system of WiMAX entities, protocols and procedures. Our approach provides the means of transferring real application data on real network between ns-3 simulation entities, and allows physical hosts to connect with the simulated WiMAX network. Thus, the proposed system offers realism and accuracy similar to that of hardware with the cost, configurability and scalability of simulation. To show the feasibility of our design, we include several validation experiments, including using real application data in the emulated environment. Through this system we ease the prototyping of technology that will bring us closer to the realization of the present and future mobile Internet.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340363","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}
Sunghwan Cho, Yeongyoon Choi, Wontaek Lim, Yongchul Kim
{"title":"Cooperative Analog and Digital (CANDI) Time Synchronization for large two-dimension multihop networks","authors":"Sunghwan Cho, Yeongyoon Choi, Wontaek Lim, Yongchul Kim","doi":"10.1109/APWIMOB.2014.6920269","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920269","url":null,"abstract":"For large multihop networks, the time synchronization (TS) error accumulates as the hop number increases using conventional methods, such as Timing-sync Protocol for Sensor Networks (TPSN), Reference Broadcast Synchronization (RBS), and Flooding Time Synchronization Protocol (FTSP). In this paper, to reduce the number of hops to cover the large network and exploit the spatial averaging of TS error between clusters, a novel method is proposed combining Concurrent Cooperative Transmission (CCT) and Semi-Cooperative Spectrum Fusion (SCSF). This method, named Cooperative Analog and Digital (CANDI) Time Synchronization protocol, consists of two phases: The digital stage and the analog stage. The digital stage uses CCT to broadcast a TS packet containing time information. Cooperating nodes transmit the digitally encoded message simultaneously in orthogonal channels, so that the receiver combines the multiple packet to achieve significant SNR advantage. In the analog stage, the cooperating nodes simultaneously transmit their slightly different individual estimates of the propagation time by using frequency shift modulation. Nodes receiving this signal prevent fading and reduce estimation error in one step through the averaging inherent in diversity combining. Simulation results for two-dimension (2-D) networks are given in order to evaluate the performance of CANDI, and CANDI is compared with TPSN.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121411484","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":"Interference alignment with efficient dynamic information selection for LTE-A uplink coordinated multipoint systems","authors":"Sheng-Yang Huang, Kuang-Min Lin, Juinn-Horng Deng","doi":"10.1109/APWIMOB.2014.6920280","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920280","url":null,"abstract":"The demand for high data rate and reliable quality of service has increased in nowadays. Multi-user will induce other cells interference which severely degrades the system performance. In this paper, the interference alignment (IA) techniques in uplink (UL) coordinated multipoint (CoMP) system with three different dynamic information selection (DIS) schemes are proposed to enhance the performance of boundary communications. The first scheme is to maximize the sum-rate by selecting optimal information from other base station in a brute force way. The second way is to minimize the number of outage of the communicated link in the MIMO interference channel. The third scheme which maximizes the minimum signal to interference-plus-noise ratio (Max-Min SINR) is proposed take both sum-rate and outage probability into consideration. Simulation results show that the proposed algorithms can increase the sum-rate and reduce the outage probability compared to the conventional UL CoMP system.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121666707","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":"Chaotic Interleaving scheme for PAPR reduction in Cognitive Radio Systems","authors":"A. Eltholth, Ibrahim Atef","doi":"10.1109/APWIMOB.2014.6920306","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920306","url":null,"abstract":"This paper investigates the use of Baker Map based Chaotic Interleaving as a preprocessing Peak to Average Power Ratio (PAPR) reduction technique in OFDM based Cognitive Radio Systems (CRS). Simulation results illustrate noticeable reduction in PAPR when using Chaotic Interleaving (CI), it is shown that CI outperforms Block Interleaving (BI) scheme, also, it is depicted that the use of CI greatly reduces the Adjacent Channel Leakage Ratio (ACLR), which reduces the need for filtered OFDM to meet the CRS spectrum mask requirements.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"55 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123123560","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":"Further results on the asymptotic analysis of digital communications in generalized fading channels","authors":"E. Adebola, A. Annamalai","doi":"10.1109/APWIMOB.2014.6920268","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920268","url":null,"abstract":"This articles presents several new and simple closed-form asymptotic approximations for the average symbol error rate (ASER) performance measure of digital communication systems (with/without diversity transceivers) impaired by additive white Gaussian noise (AWGN) and multipath fading. In particular, a new class of asymptotic approximations for the ASER is derived by utilizing a normalized asymptotic probability density function (PDF) of signal-to-noise ratio (SNR). The resulting expressions are considerably better/tighter over a wider range of mean SNRs when compared to the existing high-SNR approximations although both techniques need only the first non-zero term of the Maclaurin (if exists) or the Poincare series expansion of the receiver output SNR. We also investigate the utility/efficacy of the Welch-Satterthwaite and Moschopoulos approximations (based on either a moments matching technique or using our proposed normalized asymptotic PDF of SNR that resembles a Gamma PDF) for yielding accurate predictions of the ASER in the low-SNR regime in a myriad of fading environments. Simple closed-form approximations for the ergodic channel capacities of different types of fading channels with/without diversity reception are also derived.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121135626","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":"Study of relay position in two-path successive relaying with interference cancellation","authors":"Qian Yu Liau, C. Leow","doi":"10.1109/APWIMOB.2014.6920308","DOIUrl":"https://doi.org/10.1109/APWIMOB.2014.6920308","url":null,"abstract":"Two-path successive relaying scheme is designed to recover the loss of spectral efficiency due to half-duplex constraint When not operating in orthogonal channels, the relay pair used in the successive relaying scheme interferes each other. This inter-relay interference degrades the capacity performance of the successive relaying scheme significantly. Successive interference cancellation has been proposed to tackle the inter-relay interference in two-path successive relaying. The effectiveness of such interference cancellation technique relies heavily on the instantaneous channel conditions, which is not only depending on the small scale fading but also the large scale path loss. However, in the existing literature of two-path successive relaying, the effect of path loss and the position of relays have not been considered. Therefore, in this paper, we study the effect of path loss and relay position to the ergodic capacity of the two-path successive relaying with and without interference cancellation. We also compare the performance of successive relaying with the conventional half-duplex relaying. Simulation results show that the ergodic capacity of the two-path successive relaying not only depends on the relative position of the relays from source and destination nodes, but it is also affected by the inter-relay distance. When the relays are relatively closer to the destination and the inter-relay distance is short, the ergodic capacity of the two-path successive relaying with interference cancellation outperforms the conventional half-duplex relaying.","PeriodicalId":177383,"journal":{"name":"2014 IEEE Asia Pacific Conference on Wireless and Mobile","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134235576","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}