Chieh-Hao Chang, Jung-Chun Kao, Fu-Wen Chen, S. Cheng
{"title":"Many-to-all priority-based network-coding broadcast in wireless multihop networks","authors":"Chieh-Hao Chang, Jung-Chun Kao, Fu-Wen Chen, S. Cheng","doi":"10.1109/WTS.2014.6835020","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835020","url":null,"abstract":"This paper addresses the minimum transmission broadcast (MTB) problem for the many-to-all scenario in wireless multihop networks and presents a network-coding broadcast protocol with priority-based deadlock prevention. Our main contributions are as follows: First, we relate the many-to-all-with-network-coding MTB problem to a maximum out-degree problem. The solution of the latter can serve as a lower bound for the number of transmissions. Second, we propose a distributed network-coding broadcast protocol, which constructs efficient broadcast trees and dictates nodes to transmit packets in a network coding manner. Besides, we present the priority-based deadlock prevention mechanism to avoid deadlocks. Simulation results confirm that compared with existing protocols in the literature and the performance bound we present, our proposed network-coding broadcast protocol performs very well in terms of the number of transmissions.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680675","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":"Bounds on capacity in multi-channel grid networks","authors":"Amalya Mihnea, M. Cardei","doi":"10.1109/WTS.2014.6835032","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835032","url":null,"abstract":"We give lower and upper bounds for capacity in grid networks when using one channel and one radio per node. We also analyze the capacity for multiple channels and make connections to channel assignment algorithms that we introduced previously, which are robust to the presence of primary users. These algorithms could be used in wireless networks or networks with limited resources.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121161126","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":"Mitigating black hole attacks in wireless sensor networks using node-resident expert systems","authors":"Vincent F. Taylor, Daniel T. Fokum","doi":"10.1109/WTS.2014.6835013","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835013","url":null,"abstract":"Wireless sensor networks consist of autonomous, self-organizing, low-power nodes which collaboratively measure data in an environment and cooperate to route this data to its intended destination. Black hole attacks are potentially devastating attacks on wireless sensor networks in which a malicious node uses spurious route updates to attract network traffic that it then drops. We propose a robust and flexible attack detection scheme that uses a watchdog mechanism and lightweight expert system on each node to detect anomalies in the behaviour of neighbouring nodes. Using this scheme, even if malicious nodes are inserted into the network, good nodes will be able to identify them based on their behaviour as inferred from their network traffic. We examine the resource-preserving mechanisms of our system using simulations and demonstrate that we can allow groups of nodes to collectively evaluate network traffic and identify attacks while respecting the limited hardware resources (processing, memory and storage) that are typically available on wireless sensor network nodes.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"325 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116598090","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.11ac: A performance evaluation with lattice-based MMSE and zero forcing MIMO OFDM receivers","authors":"R. Hoefel","doi":"10.1109/WTS.2014.6835024","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835024","url":null,"abstract":"The IEEE 802.11ac amendment approved by the end of 2013 allows physical (PHY) layer data rates up to 7 Gbps in the 5 GHz industrial, scientific and medical (ISM) band, while the IEEE 801.11n amendment specifies a maximum PHY layer data rate of 540 Mbps in 2.4 and 5 GHz ISM bands. In this paper, simulation results of the IEEE 802.11ac PHY layer show that the implementation of linear lattice reduction minimum mean squared error (LR-MMSE) multiple-input multiple-output (MIMO) detector presents a highly superior performance in relation to linear plain MMSE MIMO detector. Effects of bandwidth, channel models, modulation cardinality and number of antennas on the 802.11ac system performance are taken into account in the comparative performance evaluation between LR-MMSE and plain MMSE MIMO detectors. IEEE 802.11ac simulation results also show that, even with the application of LR techniques to obtain a subspace channel bases with lower cross-correlation among the independent linear vectors, LR-MMSE MIMO detectors have a superior performance in relation to LR zero-forcing (LR-ZF) MIMO detectors.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123437533","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":"Non-coherent detection of GFSK using Extended Kalman Filtering for Non-Gaussian noise","authors":"A. Nsour, Alhaj-Saleh Abdallah, M. Zohdy","doi":"10.1109/WTS.2014.6835000","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835000","url":null,"abstract":"Gaussian Frequency Shift Keying (GFSK), a special case of Continuous Phase Modulation (CPM) schemes, is the modulation scheme chosen for achieving basic data rate of 1 Mbps with Bluetooth receivers. In this article, we present a new non-coherent demodulation technique based on the Extended Kalman Filter (EKF) that does not require the knowledge of the modulation index to detect the GFSK modulated signal in Bluetooth receivers. The paper examines the performance of our proposed receiver in the presence of Non-Gaussian impulsive noise since this type of noise is considered to be a severe noise for wireless technologies including Bluetooth. Bit Error Rate (BER) was used as the measurement metric for the performance for our proposed receiver at the physical level while Packet Error Rate (PER) and Residual Bit Error Rate (RBER) were used as the measurement metrics at the system level. Experimental results obtained for the Extended Kalman Filter detector for Non-Gaussian noise are provided.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121768744","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":"Minimizing energy consumption for cooperative network and diversity coded sensor networks","authors":"G. Arrobo, R. Gitlin","doi":"10.1109/WTS.2014.6834989","DOIUrl":"https://doi.org/10.1109/WTS.2014.6834989","url":null,"abstract":"In this paper, we present an approach to minimize the energy consumption of multihop wireless packet networks, while achieving the required level of reliability. We consider networks that use Cooperative Network Coding (CNC), which is a synergistic combination of Cooperative Communications and Network Coding. Our approach is to optimize and balance the use of forward error control, error detection, and retransmissions at the packet level for these networks. Additionally, we introduce Cooperative Diversity Coding (CDC), which is a novel means to code the information packets, with the aim of minimizing the energy consumed for coding operations. The performance of CDC is similar to CNC in terms of the probability of successful reception at the destination and expected number of correctly received information packets at the destination. However, CDC requires less energy at the source node because of its implementation simplicity. Achieving minimal energy consumption, with the required level of reliability is critical for the optimum functioning of many wireless sensor and body area networks. For representative applications, the optimized CDC or CNC network achieves ≥ 25% energy savings compared to the baseline CNC scheme.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487302","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":"Spectral re-harvesting for 4G networks: Through low-complexity VAMOS receiver design","authors":"Muyeen Nawaz, A. Chakrapani","doi":"10.1109/WTS.2014.6835014","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835014","url":null,"abstract":"With an insatiable demand for high speed data services over 4G, any technology that re-harvests legacy spectrum is extremely useful. Voice services over Adaptive Multi-user channels on One Slot (VAMOS) is a feature introduced by 3GPP to efficiently utilize the available spectrum by multiplexing two voice users in the same radio resource. In VAMOS, the multiplexed users are assigned different transmit powers and allocated on either of the quadrature sub-channels. Neither the information about the sub-channel power imbalance ratio nor the sub-channel allocated is explicitly transmitted, making the design of a low-complexity single antenna VAMOS receiver to be a significant challenge. In this paper, we propose a low-complexity multi-user detection based VAMOS receiver for power constrained single antenna handsets which meets all the test requirements for both VAMOS levels I and II specified by 3GPP. We compare our algorithm with a Mono Interference Cancellation based VAMOS receiver and show that the performance of the proposed algorithm is up to >4dB higher at 3GPP specified Carrier-to-interference ratios. The work in this paper is of importance in the design of a low-complexity VAMOS receiver which is suitable for both VAMOS I and II.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"267 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114000722","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":"UE power saving with RRC semi-connected state in LTE","authors":"Jianke Fan, Seppo Alanärä","doi":"10.1109/WTS.2014.6834990","DOIUrl":"https://doi.org/10.1109/WTS.2014.6834990","url":null,"abstract":"This paper provides an approach where the MTC device may change to a power saving state for longer periods while the device and the network keep all related user plane security contexts and bearers. The device can return to a communication state without necessarily requiring RRC connection setup procedures. It is expected that with such an approach the sporadic higher level control plane signaling could be avoided when there are large amount of MTC devices which initiate packet transmissions periodically. Further it is expected that UE power consumption would be reduced. Simulation was done in a 3GPP Case 1 scenario. A simple intermittent traffic, 6 UEs per cell and a fixed long DRX parameter were in use in the evaluation. Different RRC release timer values were assumed to simulate different RRC connection states. The results show that with this approach both signaling load and energy consumption can be improved as it can avoid frequent transition in RRC-CONNECTED and RRC-IDLE states in device. For example, at a RRC release timer of 5 seconds, geometrically distribution of mean inter-burst arrival time of 30 seconds, the relative signaling load is 5.6 times less and the energy consumption in UE is about 3 times better with than without a RRC-SEMICONNECTED state.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114070182","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 the performance of Massive MIMO cellular systems with power amplifiers","authors":"Rana A. Abdelaal, A. S. Behbahani, A. Eltawil","doi":"10.1109/WTS.2014.6835004","DOIUrl":"https://doi.org/10.1109/WTS.2014.6835004","url":null,"abstract":"Orthogonal Frequency-Division Multiple Access (OFDMA) is the modulation of choice due to its robustness to time-dispersive radio channels, low-complexity receivers, and simple combining of signals from multiple transmitters in broadcast networks. However, the transmitter design for OFDMA is more costly, as the Peak-to-Average Power Ratio (PAPR) of an OFDMA signal is relatively high, resulting in the need for highly linear RF power amplifiers (PA). This problem becomes more compounded when a large number of PAs is required, as in Massive MIMO. In this paper, we discuss the impact of PAs on cellular systems. We show the constraints that PAs introduce, and we take these constraints into consideration while searching for the optimum set of transmitter and receiver filters. Moreover, we highlight how Massive multiple-input and multiple-output (MIMO) cellular networks can relax PAs constraints resulting in low cost PAs, while maintaining high performance. The performance is evaluated by showing the probability of error curves and signal-to-noise-ratio curves for different transmit powers and different number of transmit antennas.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122737878","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":"Solving binary and continuous knapsack problems for radio resource allocation over High Altitude Platforms","authors":"Ahmed Ibrahim, A. Alfa","doi":"10.1109/WTS.2014.6834994","DOIUrl":"https://doi.org/10.1109/WTS.2014.6834994","url":null,"abstract":"In this paper, radio resource allocation for multicasting in OFDMA based High Altitude Platforms is considered. An optimization problem for the model described in the paper is formulated which turns out to be a Mixed Integer Non-Linear Program. Due to its high complexity, we use Lagrangian relaxation to dualize some constraint sets. The Lagrangian relaxed problem is then decomposed into two Lagrangian subproblems, one is a binary knapsack Lagrangian subproblem (BKLSP) and the other is continuous knapsack Lagrangian subproblem (CKLSP). The BKLSP is responsible for the assignment of the OFDMA subchannels and time slots to multicast sessions as well as user assignment to the multicast groups in a particular frame. The CKLSP is responsible for HAP power allocation to multicast sessions in the HAP service area. The two subproblems can be solved iteratively in search for a better solution, if there is any, for the Lagrangian problem. For the BKLSP we use two different solution algorithms, one based on dynamic programming and the other is a greedy algorithm. A greedy algorithm is also used for the CKLSP. The entire approach can be used to obtain bounds in a branch and bound algorithm for each of its nodes.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128473974","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}