V. Saritha, P. V. Krishna, I. Alagiri, V. M. Viswanatham, M. Obaidat
{"title":"Efficient Multipath Routing Protocol with Quality of Service for Mobile Ad Hoc Networks","authors":"V. Saritha, P. V. Krishna, I. Alagiri, V. M. Viswanatham, M. Obaidat","doi":"10.1109/ICC.2018.8422385","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422385","url":null,"abstract":"Design of multipath routing schemeis a challenging task as its topology is very dynamic in mobile adhoc network (MANET) environments. Providing reliability is more important while designing the routing protocol. Hence, multipath routing protocol which is based on Quality of Service parameters is proposed in this paper. The QoS parameters considered are delay, bandwidth and hop count. Different types of traffic such as real- time traffic and non-real-time traffic are considered. In order to improve reliability by reducing number of retransmissions, an additional packet is generated in the case of non-real time traffic and multiple description coding is used in the case of real-time traffic. The proposed algorithm, MRQ is simulated using NS-2 and compared with the existing competing schemes - QAMR and RA-MDC. Simulation results proved that the perfomance of our scheme is better in terms of End-to-End delay, packet delivery ratio, Peak Signal Noise Ratio (PSNR) and retransmissions ratio metrics.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607047","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}
Yifan Ren, Jie Li, Yusheng Ji, Sajal K. Das, Zhetao Li
{"title":"A Novel User Revocation Scheme for Key Policy Attribute Based Encryption in Cloud Environments","authors":"Yifan Ren, Jie Li, Yusheng Ji, Sajal K. Das, Zhetao Li","doi":"10.1109/ICC.2018.8422881","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422881","url":null,"abstract":"Access control is an important mechanism in cloud computing. The Key Policy Attribute Based Encryption (KP-ABE) is an important method to implement the access control in cloud service. However, conventional user revocation scheme in KP-ABE costs huge computational overhead. In this paper, we focus on the important user revocation issue in KP-ABE. We introduce several control parameters, including version value, check value and user list. We combine KP-ABE with salt encryption for the implementation. We provide a novel user revocation scheme for KP-ABE to improve the user revocation issue, which can reduce the heavy computational overhead when user being revoked. The performance evaluation shows that the proposed user revocation scheme gives good performance with KP-ABE.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580751","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":"Collaborative Hierarchical Caching over 5G Edge Computing Mobile Wireless Networks","authors":"Xi Zhang, Qixuan Zhu","doi":"10.1109/ICC.2018.8422371","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422371","url":null,"abstract":"Edge computing techniques have been developed to support the exponentially increasing service demands in the fifth generation (5G) networks by bringing the data contents and their corresponding computations/communications to the edge of the wireless networks, which is the area near to mobile users. As one of the promising and enabling techniques in edge computing wireless networks, in- network caching stores the data contents close to mobile users to efficiently reduce the transmission delay for time-sensitive multimedia data contents. However, one of the main challenges for implementing in-network caching techniques lies in how to develop the collaborative caching mechanisms among all caches in the edge of wireless networks to upper-bound the data transmission delay while maximizing the cache hitting rate. In this paper, we propose the inter-tier and intra-tier collaborative hierarchical caching mechanisms over 5G edge computing multimedia mobile wireless networks, where the popular multimedia data contents are selectively cached at different wireless network caching tiers (e.g., at routers, cellular- base stations/WiFi-access-point, and mobile devices, respectively). The inter-tier collaborative hierarchical caching minimizes the average number of hops (including wireless hops and wireline hops) through the collaborative caching across three wireless network caching tiers, and the intra-tier collaborative hierarchical caching maximizes the overall cache hitting rate within the same wireless network caching tier. To optimize the intra-tier collaborative hierarchical caching mechanism, we derive the upper-bound and lower- bound of maximum numbers of device-to-device (D2D) pairs at the bottom tier of wireless network caching. Finally, we use numerical analyses to evaluate and validate our proposed collaborative hierarchical caching mechanisms over edge computing mobile wireless networks.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126750632","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":"Enhanced Session Table Architecture for Stateful Firewalls","authors":"Z. Trabelsi, S. Zeidan","doi":"10.1109/ICC.2018.8422079","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422079","url":null,"abstract":"Stateful firewall keeps track of the state of network connections. The performance of stateful firewall determines by both the performance of its session table and the mechanism used for packet filtering. This paper presents a stateful session table architecture then integrates it with Splay tree firewall. Splay tree firewall organizes policy rules in a designated prefix length splay tree data structure, and a collection of hash tables grouped by prefix length. Packet filtering time using Splay tree firewall is essentially reduced through multilevel filtering paths, where unwanted packets are rejected as early as possible. The proposed session table architecture reduces memory space consumption and session operations time, as it uses one hash slot per connection. Keeping all connection related information in one session entry produces additional processing time, particularly for session timeout attribute processing. Our proposed session architecture separates session state and timeout attributes information into different data structures to enhance the overall system performance.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126753305","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":"Statistical QoS-Driven Power Allocation for Cooperative Caching over 5G Big Data Mobile Wireless Networks","authors":"Jingqing Wang, Xi Zhang","doi":"10.1109/ICC.2018.8422370","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422370","url":null,"abstract":"In order to effectively guarantee the statistically delay-bounded multimedia services over time-varying wireless channels, the statistical quality-of-service (QoS) technique has been developed over 5G big data mobile wireless networks. On the other hand, as one of the 5G-promising techniques, the wireless caching enabled WiFi offloading technique is shown to be powerful in addressing the data explosion problem and alleviating the network congestion problem in macrocells. Consequently, challenges have been imposed in applying the cooperative caching schemes for maximizing the successful playback probability under statistical delay-bounded QoS constraints. To effectively overcome the above-mentioned problems, we propose the statistical QoS-driven power allocation scheme through applying the cooperative caching enabled WiFi offloading system over 5G big data mobile wireless networks. In particular, under the Nakagami- textit{m} fading model, we establish the system models for cooperative caching and wireless transmissions. Given the statistical QoS constraints, we derive and analyze the aggregate effective capacity and the successful playback probability under our developed optimal power allocation policies for the QoS-driven cooperative caching enabled WiFi offloading. Also conducted is a set of simulations which analyze and show the priority of our proposed cooperative caching enabled WiFi offloading scheme, compared with the schemes without cooperative caching in terms of effective capacity under statistical QoS constraints over 5G big data mobile wireless networks.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121344710","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}
Daniel Miller, Zhengyuan Zhou, N. Bambos, I. Ben-Gal
{"title":"Optimal Sensing for Patient Health Monitoring","authors":"Daniel Miller, Zhengyuan Zhou, N. Bambos, I. Ben-Gal","doi":"10.1109/ICC.2018.8422884","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422884","url":null,"abstract":"In this paper, we construct a framework for optimally sensing a patient's health state with a wireless body area network (WBAN). In such a resource-constrained paradigm, it is often necessary to use lower performance sensing modes, conditionally reducing system performance to increase efficiency and maximize system lifetime. The optimal control architecture trades between shallow and deep sensing modes according to the estimated patient health state, minimizing the expected costs over future states. We construct an implicit formulation for deriving the optimal sensing policy via dynamic programming, an easily implemented myopic sensing policy, and a useful performance bound for evaluating near-optimal approximate sensing policies. We further provide an Monte Carlo experimental evaluation of how such policies depend on key model parameters.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116275099","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":"Tradeoffs for Data Collection and Wireless Energy Transfer Dilemma in IoT Environments","authors":"Sara Arabi, H. Elbiaze, Essaid Sabir, M. Sadik","doi":"10.1109/ICC.2018.8422712","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422712","url":null,"abstract":"Recently, UAV has provided a significant role to support the wireless network, thanks to the several advantages that can offer in comparison with the terrestrial base station. In this paper, we aim to deal with data collection and charging depletion ground IoT devices through UAV station, which is used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module. Thus, the UAV can be used as an energy source to serve depleted IoT devices. On one hand, the UAV charges the depletion ground IoT devices starting initially with those with battery level under a certain threshold. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the RF signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its known energy constraint, we investigate in this work the trade- off between both times that the UAV reserves to devices in order to recharge them and to collect data. Numerical results evaluate different metrics of performances in which we examine the added value of UAV with energy harvesting module.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"75 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468785","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}
Yuhai Lu, Yanbing Liu, Chunyan Zhang, Jianlong Tan
{"title":"A Data-Deduplication-Based Matching Mechanism for URL Filtering","authors":"Yuhai Lu, Yanbing Liu, Chunyan Zhang, Jianlong Tan","doi":"10.1109/ICC.2018.8422284","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422284","url":null,"abstract":"URL filtering plays an important role in various network security applications. URL filtering usually requires high matching performance, but the performance of the classical multiple string matching algorithms have been difficult to be significantly improved. In this article, we found that the online URLs to be filtered contain a large number of duplicate URLs. According to this observation, we propose a novel deduplication-based matching mechanism (DBM) for URL filtering. The DBM caches information of the duplicate URLs in a hash table to avoid duplicate URLs being repeatedly scanned by URL filtering system. The DBM can be used in conjunction with any multiple string matching algorithms. Experimental results show that when a multiple string matching algorithm used in conjunction with the DBM, the matching speed of the URL filtering system can be increased by 9%-68%. So DBM can significantly accelerate the speed of URL filtering system. Besides increasing speed of URL filtering system, DBM is a mechanism independent of the specific matching algorithm and can be easily used in other field.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128082864","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":"Centralized Scheduling Strategies for Cooperative HARQ Retransmissions in Multi-Source Multi-Relay Wireless Networks","authors":"Stefan Cerovic, R. Visoz, L. Madier, A. Berthet","doi":"10.1109/ICC.2018.8422578","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422578","url":null,"abstract":"In this paper, we investigate centralized scheduling strategies for cooperative incremental redundancy retransmissions in the slow-fading half-duplex multiple access multiple relay channel. Time Division Multiple Access is assumed for the sources and the relays. Sources transmit successively in time slots for the first phase. The second phase consists of a limited number of time slots for retransmissions. In each time slot, the destination schedules a node (being a relay or a source) to retransmit, conditional on the knowledge of the correctly decoded source sets of each node (which is itself for a source). A scheduled relay retransmission uses Joint Network and Channel Coding on its correctly decoded source messages (cooperative retransmission). Several node selection strategies are proposed based on the maximization of the long-term aggregate throughput under a given constraint of fairness. Monte-Carlo simulations show that these strategies outperform the state of the art one based on the minimization of the probability of the common outage event after each time-slot. Moreover, the long-term aggregate throughput reached with these strategies is close to the upper-bound, calculated by the exhaustive search approach. The same conclusion remains valid for both symmetric and asymmetric source rate scenarios.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132039302","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":"Socially Optimal Distributed User Association for Multi-Hop Machine-to-Machine Communications","authors":"Ziqi Chen, David B. Smith","doi":"10.1109/ICC.2018.8422383","DOIUrl":"https://doi.org/10.1109/ICC.2018.8422383","url":null,"abstract":"In order to accommodate a massive number of machine-to-machine (M2M) communication devices (MTCDs) in cellular networks, we propose an efficient association and multi-hop relaying scheme, with rate control, between users and access points. Overall transmission rate is maximized and power consumption is minimized, while ensuring load balancing and proportional fairness among users. In this context a distributed algorithm is proposed that solves this joint association and relaying problem, only requiring limited control information exchange between nearby users. With formulation as a game, it is shown that the proposed algorithm converges to a social optimum, with a subgame perfect equilibrium. Numerical simulation results show significant improvements in the network data rate, by a factor of at least 6, and fairness, up to a factor of 14, among the MTCDs by the proposed association method when compared to other potential schemes.","PeriodicalId":387855,"journal":{"name":"2018 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130478712","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}