Yun Tian, Wenbo Xu, Cong Zhang, Yue Wang, Hongwen Yang
{"title":"Joint reconstruction algorithms for one-bit distributed compressed sensing","authors":"Yun Tian, Wenbo Xu, Cong Zhang, Yue Wang, Hongwen Yang","doi":"10.1109/ICT.2015.7124707","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124707","url":null,"abstract":"Distributed compressed sensing (DCS), exploiting the correlation among multiple signals, enjoys the advantage of reduced number of measurements. This paper considers a type of joint sparsity model in DCS, where each signal contains a common component and an innovation component. In order to reduce the transmission cost, the measurements are derived as the sign information of the compressed samples by using one-bit quantization. We study such CS operation, and propose two joint reconstruction algorithms by iteratively deriving the sign information of each component. Simulation results show that the proposed algorithms can recover the signals efficiently.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466428","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}
Y. Sekercioglu, J. Violi, L. Priestnall, J. Armstrong
{"title":"Accurate node localization with directional pulsed infrared light for indoor ad hoc network applications","authors":"Y. Sekercioglu, J. Violi, L. Priestnall, J. Armstrong","doi":"10.1109/ICT.2015.7124716","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124716","url":null,"abstract":"We present a localization scheme for indoor ad hoc networks which use pulsed infrared light as the communication medium. Ad hoc networks are formed when devices with wireless communications capabilities spontaneously connect and exchange information packets. Typically, in wireless ad hoc networks, nodes estimate their position relative to their neighbors by processing the location information in conjunction with the certain physical properties of the signals they receive, such as signal strength, bit error rate, or time difference of arrival. Unfortunately, widely used low-cost infrared transmitters and receivers for indoor applications do not allow measurement of these properties easily. To overcome this, we have developed a system which relies only on the reception of a data frame and is capable of estimating the angular direction of the infrared signal source within an error margin of +/- 5 degrees. Then, through the application of triangulation, a node estimates its relative position with respect to its neighbors. One effective method of translating a relative position to an absolute one is to use anchor nodes. These nodes broadcast their exact location. Each receiving node then progressively fixes its position and broadcasts the position updates, leading to the entire network localizing itself. A major drawback of this approach arises in large networks, where the average hop distance between an anchor and ordinary nodes is large, and position estimation errors inevitably start to accumulate. In order to alleviate this problem, we have developed the Anchor Hop Distance Weighted Localization (AHDWL) algorithm to selectively weigh position estimates at each hop. We found that the AHDWL algorithm is very effective in reducing propagation of positioning errors.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122515948","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":"DC programming for power minimization in a multicell network with RF-powered relays","authors":"A. Nasir, D. T. Ngo, S. Durrani","doi":"10.1109/ICT.2015.7124678","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124678","url":null,"abstract":"We consider a multicell network where an amplify-and-forward relay is deployed in each cell to help the base station (BS) serve its cell-edge user. We assume that each relay scavenges energy from all received radio signals to process and forward the information data from the BS to the corresponding user. For this, a power splitter and a wireless energy harvester are implemented in the relay. Our aim is to minimize the total power consumption in the network while guaranteeing minimum data throughput for each user. To this end, we develop a resource management scheme that jointly optimizes three parameters, namely, BS transmit powers, power splitting factors for energy harvesting and information processing at the relays, and relay transmit powers. As the formulated problem is highly nonconvex, we devise a successive convex approximation algorithm based on difference-of-convex-functions (DC) programming. The proposed iterative algorithm transforms the nonconvex problem into a sequence of convex problems, each of which is solved efficiently in each iteration. We prove that this path-following algorithm converges to an optimal solution that satisfies the Karush-Kuhn-Tucker (KKT) conditions of the original nonconvex problem. Simulation results demonstrate that the proposed joint optimization solution substantially improves the network performance.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130141920","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 contention window tuning for IEEE 802.11","authors":"Xin Zhou, C. Zheng, Xiao-Xin He","doi":"10.1109/ICT.2015.7124660","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124660","url":null,"abstract":"The performance of MAC layer protocol in wireless network is the main factor that determines the efficiency in sharing and utilizing the limited bandwidth resources. In this paper, a practicable distributed backoff algorithm, which is named Adaptive Contention Window Backoff (ACWB) for IEEE 802.11 wireless LAN is presented. ACWB algorithm tunes the Contention Window size in a distributed manner at run-time in order to maximize the throughput and fairness according to the idle backoff interval statistics. Simulation results indicate that the proposed scheme provides a remarkable improvement in terms of the network throughput while maintaining good fairness.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122490440","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}
D. Perdana, Muhammad Nanda, Revient Ode, R. F. Sari
{"title":"Performance evaluation of PUMA routing protocol for Manhattan mobility model on vehicular ad-hoc network","authors":"D. Perdana, Muhammad Nanda, Revient Ode, R. F. Sari","doi":"10.1109/ICT.2015.7124661","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124661","url":null,"abstract":"The Quality of Service (QoS) on the traffic environment with high mobility, dynamic topology, and change trajectory is one of the challenges in the use of Vehicular Ad-Hoc Networks (VANET) Routing Protocols. PUMA routing protocol presents multicast work mechanism based on shared mesh topology. It always dynamically adapt to VANET traffic conditions. In this paper, we evaluated the PUMA routing protocol performance using the Manhattan Mobility Model with the effect of the Nakagami fading distribution in VANET. We also analyse the average node distribution in the tagged vehicle communication range using Poisson distribution. We use the NS 2.34 and VanetMobiSim for the simulation and evaluation of the performance. The performance results will be analyzed by varying the traffic parameters in the Manhattan mobility model from low to high traffic condition. The simulation result shows that the communication range under the Nakagami fading distribution affected the Quality of Service (QoS) in VANET. We found that the delay is higher compared with those in the condition without Nakagami fading. The throughput is also lower compared with those in the condition without Nakagami fading.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130010904","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":"Energy-optimal resource scheduling and computation offloading in small cell networks","authors":"Wael Labidi, M. Sarkiss, M. Kamoun","doi":"10.1109/ICT.2015.7124703","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124703","url":null,"abstract":"This paper provides a joint optimization framework of radio resource scheduling and computation offloading in small cell LTE based networks. We consider that mobile users are served by nearby small cell base stations which can be endowed with some computational capabilities. The objective is to minimize the average energy consumption at the user terminal to run its mobile applications, either locally or remotely, while satisfying average delay constraints tolerated by these applications. For this problem, we investigate offline dynamic programming approaches and we devise two solutions: deterministic and randomized, to find the optimal radio scheduling-offloading policy. We show that the dynamic offline strategies are able of achieving optimal energy efficiency at the mobile terminals. Indeed, they can adapt the processing decisions between: local processing, offloading, and staying idle, by exploiting their knowledge on the channel conditions and the application properties.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569247","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":"Evolutionary radio resource management in distributed femtocell networks","authors":"Shangjing Lin, Wei Ni, Hui Tian, R. Liu","doi":"10.1109/ICT.2015.7124677","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124677","url":null,"abstract":"Femtocells are an integrating part of future cellular systems, where radio resource management is a challenge due to unbalanced backhaul delays and the hotspot nature of femtocells. We propose a new game theoretic framework, where the channel allocation and transmit powers evolve in a distributed manner, adapting to femtocells' topology and traffic demands. The key idea is to cast femtocells' clustering as an evolutionary game, where the femtocells independently switch to less interfered clusters. Within each cluster, we design a non-cooperative game to implement power control in the absence of centralized coordination. Simulations show that our approach is effective for timely interference mitigation and reliable topology management. The stability and scalability of our approach are also demonstrated.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128932965","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}
Pengbiao Wang, Junfeng Wang, Cheng-lin Zhao, Xiaokai Liu
{"title":"A wavelet compression based channel feedback protocol for spatially correlated massive MIMO systems","authors":"Pengbiao Wang, Junfeng Wang, Cheng-lin Zhao, Xiaokai Liu","doi":"10.1109/ICT.2015.7124701","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124701","url":null,"abstract":"Equipped with large scale antenna arrays, massive multiple input multiple output systems are qualified with several benefits including enhanced throughput, power efficiency, and anti-interference ability, etc. The acquisition of such advantages requires adequate channel state information at transmitter. In frequency division duplex multiple input multiple output systems, channel state information is extracted through channel feedback mechanism which is not easy to implement due to the fact that the feedback overhead is critical with so many antennas. However, large scale antenna arrays may introduce correlation elements into channel state information due to the limit of the base station size. Therefore, we propose a wavelet compression based channel feedback protocol aiming to reduce the feedback load by exploiting the correlation features among large scale antenna arrays. We take a point-to-point massive multiple input multiple output system into consideration, and both Jakes correlation model and exponential correlation model are applied to make the numerical simulations and verify the performance of the proposed wavelet compression based feedback scheme.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126864512","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":"Diversity of low-density lattices","authors":"Mayur Punekar, J. Boutros","doi":"10.1109/ICT.2015.7124696","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124696","url":null,"abstract":"We describe full-diversity constructions of real lattices defined by their integer-check matrix, i.e. the inverse of their generator matrix. In the first construction suited to maximum-likelihood decoding, these lattices are defined by sparse (low-density) or non-sparse integer-check matrices. Based on a special structure of the lattice binary image, a second full-diversity lattice construction is described for sparse integer-check matrices in the context of iterative probabilistic decoding. Full diversity is theoretically proved in both cases. Computer simulation results also confirm that the proposed low-density lattices attain the maximal diversity order.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348452","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":"On complete targets coverage and connectivity in energy harvesting wireless sensor networks","authors":"Changlin Yang, Kwan-Wu Chin","doi":"10.1109/ICT.2015.7124717","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124717","url":null,"abstract":"In energy harvesting wireless sensor networks, ensuring complete targets coverage is a fundamental problem. In particular, targets are required to be monitored by at least one sensor node at all times. To date, past works have proposed to schedule sensor nodes alternately in the active/sleep state to maximize network lifetime whilst maintaining complete targets coverage, and affording sensor nodes recharging opportunities. However, they do not consider connectivity to the sink. We first propose a Linear Programming (LP) based solution to determine the activation time of sensor nodes. The design constraints include complete targets coverage, energy, and flow conservation to ensure data from sensor nodes monitoring targets are able to forward their data to the sink. We also propose an efficient heuristic algorithm as the LP solution requires an exhaustive collection of set covers. The heuristic iteratively selects sensor nodes to monitor targets and forward sensed data according to their residual energy. The simulation results show that the heuristic algorithm achieves 80% of the network lifetime computed by the LP solution at a fraction of the computation time.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514971","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}