2015 International Conference on Computing, Networking and Communications (ICNC)最新文献

{"title":"Green design for smart antenna system using iterative beamforming algorithms","authors":"R. Mehrotra, R. Bose","doi":"10.1109/ICCNC.2015.7069399","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069399","url":null,"abstract":"In wireless sensor networks operating over short inter-node distances, both computation power and radio power influence the battery life. In such a scenario, to evaluate the utility of Smart Antennas (SA) from a power perspective, one has to consider the power consumed in the beamforming (BF) unit (computation power) and the power consumed in the radio unit (radio power). Both computation power and radio power in turn depend on the number of iterations of the BF algorithms. In this paper, two iterative adaptive BF algorithms, Least Mean Square (LMS) algorithm and Recursive Least Square (RLS) algorithm are considered. Computation power measurements have been carried out for a StrongARM SA-1100 processor platform. A closed form expression for optimal number of iterations has been derived for a given bit error rate (BER) that minimizes the total power consumption. It is found that optimal number of iterations increases linearly with path loss exponent and decreases logarithmic with BER. We have analyzed the effect of different BERs and path loss exponents on the optimal number of iterations. Simulation results suggest that RLS algorithm becomes more effective compared to the LMS algorithm in terms of number of iterations at higher path loss exponents. This study yields a new, power optimal stopping criterion, thereby providing a green design for SA systems.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121149474","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":"Optimizing the location deployment of dynamic mobile base stations","authors":"Sulabh Bhattarai, Sixiao Wei, S. Rook, Wei Yu, D. Griffith, N. Golmie","doi":"10.1109/ICCNC.2015.7069409","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069409","url":null,"abstract":"In this paper, we address the issue of optimizing the location deployment of dynamic mobile base stations. Particularly, we propose a low-cost, dynamic deployment protocol to locate mobile base stations, which is capable of meeting the Quality of Service (QoS) requirements necessary for applications. Unlike other deployment techniques, our proposed protocol can find an optimal schedule to relocate mobile base stations based on fluctuating population and traffic densities in an incident area. Through simulations, we demonstrate that our proposed technique can increase network throughput and reduce end-to-end delay, jitter, and packet loss rate.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121344707","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":"Spectrum occupancy analysis of cooperative relaying technique for cognitive radio networks","authors":"Mohamed Abdelraheem, Mustafa ElNainay, S. Midkiff","doi":"10.1109/ICCNC.2015.7069347","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069347","url":null,"abstract":"Dynamic Spectrum Access (DSA) is a successful solution for the spectrum scarcity problem. In DSA, unlicensed users can gain access to licensed spectrum in a way that does not harm the licensed transmission. Many technical solutions are proposed to efficiently facilitate DSA. This paper analyzes the benefits of using cooperative relaying technique on the spectrum occupancy for the unlicensed transmissions. A slotted access with interweave spectrum sharing is modeled using stationary discrete time Markov chains for both non-cooperative and cooperative unlicensed transmissions. Furthermore, the effect of the cooperation level among the unlicensed users on the achieved throughput is investigated. The results show that the mechanism of cooperative relaying is more efficient in utilizing the unused spectrum especially in crowded spectrum. Moreover, the relative average throughput increases as the cooperation increases due to efficient utilization of the spectrum holes.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126075704","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":"The affect-aware city","authors":"B. Guthier, R. Abaalkhail, Rajwa Alharthi, Abdulmotaleb El Saddik","doi":"10.1109/ICCNC.2015.7069418","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069418","url":null,"abstract":"The goal of smart cities can be summarized as optimizing the city's services (transportation, utilities, safety and many others) in order to improve the quality of life of its residents. A means to this goal is the heavy use of information and communications technology to give the city awareness of the real world and enable intelligent decision making. At the same time, the field of Affective Computing aims to give machines the ability to interpret and utilize human emotions. It is argued that emotions are an inseparable aspect of human intelligence. We thus propose our vision of the affect-aware city. By being capable of understanding the affective states of its citizens, the city's decision making processes can be brought in line with what truly matters to the people. We give an overview of the relevant affective states. We show how they can be detected individually and then aggregated into a global model of affect. The paper concludes with some inspiring applications that are possible in an affective city.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123601082","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":"Towards optimal power control for delay-constrained cognitive radio networks","authors":"Iman Abdalla, T. Elbatt, M. Nafie, F. Digham","doi":"10.1109/ICCNC.2015.7069389","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069389","url":null,"abstract":"In this paper we study the problem of optimal power control for a Z-interference channel abstracting an underlay cognitive radio network where the secondary user has delay constraints. More specifically, we minimize the packet drop probability at the secondary user (equivalent to delay bound violation probability) subject to quality of service (QoS) constraints at the primary and secondary users, among other constraints. Towards, this objective, we develop a mathematical framework using Markov chains and formulate a constrained optimization problem. First, we assess the complexity of the problem which is found to be non-convex. Motivated by the sheer complexity of characterizing the global optimum for the problem at hand, we resort to known non-linear problem solvers which guarantee only local optimality. Nevertheless, our proposed solution approach outperforms [1] for plausible scenarios of the point-to-point fading link studied therein. Our numerical results reveal interesting insights about the power control policy that minimizes the delay for a cognitive network in a Rayleigh fading channel. Furthermore, it demonstrates the effect of tuning both the delay constraint and the cross channel mean on the resulting power control policies.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391297","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":"IEEE 802.11 Wi-Fi access point density estimation with capture-recapture models","authors":"Andreas Achtzehn, L. Simić, M. Petrova, P. Mähönen","doi":"10.1109/ICCNC.2015.7069333","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069333","url":null,"abstract":"The estimation of IEEE 802.11 Wi-Fi access point (AP) densities is an important cornerstone in deriving accurate models for the deployment structure of opportunistic wireless networks. Such densities are usually derived through large-scale wardriving-like measurement campaigns with COTS devices. Due to shielding, limited receiver sensitivity, and sampling density constraints, in general only a subset of Wi-Fi APs can be observed. Furthermore, repeated measurement campaigns show that even if an AP has been observed in one visit to a study area, it may not be observed in subsequent visits, due to small-scale deviations in the measurement locations and unavoidable changes in the radio environment such as moving vehicles and pedestrians. This motivates our study of the application of capture-recapture models to establish more accurate estimates of the actual number of APs in a study area. We approach this problem by first developing a general system model and mathematical framework for AP observability. As we assume temporally constant population sizes but potential inhomogeneities in observation probabilities, we then assess the performance of two applicable population density estimators, namely the Lincoln-Petersen and jackknife estimators, through a simulation study. We demonstrate the practical significance of the proposed capture-recapture methodology by applying it to a data set from an extensive urban Wi-Fi measurement campaign that we have carried out in Cologne, Germany, quantifying the achievable gains and the estimators' sensitivity to the measurement campaign design. We show that applying the capture-recapture techniques provides the practical advantage of yielding a similar accuracy in the estimation of Wi-Fi density even with significantly fewer measurement locations than surveyed in the full campaign. However, our results indicate that a high receiver sensitivity remains essential for such wardriving-like measurements, i.e. less sophisticated measurement setups such as smartphones will introduce high errors in the AP density estimation.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114168212","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":"Real-time CPU based H.265/HEVC encoding solution with x86 platform technology","authors":"Yang Lu, Qi Zhang, Bin Wei","doi":"10.1109/ICCNC.2015.7069380","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069380","url":null,"abstract":"The new video coding standard: High Efficiency Video Coding (HEVC)/H265 developed by ISO-IEC/MPEG and ITU-T/VCEG, has a goal to improve compression performance over the current H264/MPEG-4 standard, in the range of 50% bit-rate reduction for equal perceptual video quality. However the complexity of the algorithm and data structure of H265 is much higher than H264, that means H265 based codec will require more computing resource/power than its predecessor. In this paper we investigate the HEVC codec characters, focus on CPU based software video trans-coding technologies that provides the best video quality and most flexible programming model, maximize x86 platform capabilities at one HEVC codec, to achieve real-time performance for HEVC encoding codec on x86 platform.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129602151","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":"Queueing theory as a modeling tool for bacterial interaction: Implications for microbial fuel cells","authors":"U. Mitra, Nicolò Michelusi, Sahand Pirbadian, H. Koorehdavoudi, M. El‐Naggar, P. Bogdan","doi":"10.1109/ICCNC.2015.7069423","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069423","url":null,"abstract":"Microbial communities play a significant role in bioremediation, plant growth promotion, human and animal digestion, drive elemental cycles, the carbon-cycle and cleaning water. They are also posed to be the engines of renewable energy via microbial fuel cells which can reverse the process of electrosynthesis. While the diffusion of chemical signals in the surrounding medium of biological systems has been heavily studied, the electron transfer mechanism occurring in living cells and its role in cell-cell interaction is less understood. Recent experimental observations open up new frontiers in the design of electron-based communication and energy networks in microbial communities, which may coexist with the more well-known interaction strategies based on molecular diffusion. In this position paper, a series of modeling strategies is proposed, informed by experiment, to describe the large-scale interaction of bacterial communities. A new queueing theoretic model for the internal workings of a bacterium is described as well as methods based on statistical physics to scale up the queuing models. The goal is to couple modeling with experiment to optimize the design of microbial fuel cells.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130570354","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":"Vertical beamforming for three-dimensional user placement","authors":"S. Akoum, J. Acharya","doi":"10.1109/ICCNC.2015.7069365","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069365","url":null,"abstract":"Full-dimensional multiple input multiple output (FD-MIMO) is a practical implementation of massive MIMO in cellular communication systems. FD-MIMO relies on a planar array of active antenna systems (AAS) at the base stations to harvest the benefits of both azimuth and vertical beamforming. In this paper, we analyze the network performance of per-user vertical beamforming with a special focus on the three-dimensional placement of the base stations and the users. We use tools from stochastic geometry to analyze the coverage performance of cellular networks with a three-dimensional radiation pattern at the base stations, using AAS. We show that the directionality achieved via dynamic antenna tilting provides multi-fold improvement in network performance as compared to omni-directional digital beamforming. We draw insights on the performance of the network as a function of the height difference between the base stations and the users, the number of antennas at the base station, and the various characteristics of the radiation pattern.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123371010","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":"Slow start algorithm for mobile broadband networks including delay unrelated to network congestion","authors":"T. Koyama, K. Aoki","doi":"10.1109/ICCNC.2015.7069332","DOIUrl":"https://doi.org/10.1109/ICCNC.2015.7069332","url":null,"abstract":"The conventional slow start algorithm doubles the congestion window size per RTT until it detects a packet loss in order to estimate the available bandwidth quickly. But it causes a large number of packet losses. Hybrid Slow Start is proposed to reduce these packet losses. It finds a good point where TCP can exit the slow start phase before packet losses occur. However, the algorithm for finding the exit point does not work well on mobile broadband networks since the delay in these networks fluctuates regardless of whether congestion exists or not. Jitter causes false-positive detections of network congestion and causes Hybrid Slow Start to exit before the congestion window increases enough to utilize the available bandwidth. In this paper, we propose a new slow start algorithm suited to mobile broadband networks including delays unrelated to network congestion. It estimates the delay and includes it in the threshold of congestion detection to prevent undershoots of the congestion window. It also estimates the available bandwidth to prevent overshoots causing a large number of packet losses. We evaluated the algorithm in a simulated network and a real mobile broadband network. The results show that it finds the exit point properly and improves the TCP performance in such networks.","PeriodicalId":219966,"journal":{"name":"2015 International Conference on Computing, Networking and Communications (ICNC)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336864","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}