{"title":"Conceptual architecture for self-discovering in fragmented service systems","authors":"Michael Strasser, S. Albayrak","doi":"10.1109/NTMS.2015.7266479","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266479","url":null,"abstract":"Currently, platforms for service provisioning in the mobility domain are designed as closed, proprietary and domain specialized systems. Their isolation prevents themselves from exchanging data with sympathizing service platforms. Current research focuses on mobility services and how they support the way of future mobility. However, data exchange between these platforms receives little research attention so far. The missing interconnectivity limits the progress towards an ecosystem of service provisioning systems which can exchange data on demand. For the data exchange, platforms need to implement interfaces which comply to a common protocol. Furthermore, service platforms need to be able to discover themselves ad hoc. The work introduces available self-discovery and data exchange methods which are considered to have sufficient capabilities to enable cross communication within a dynamic environment of fragmented service provisioning platforms. The paper presents a conceptually elaborated architecture based on a central management unit.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"795 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994343","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":"UV glass sensor","authors":"S. Yuvaraja, A. S. Vithya","doi":"10.1109/NTMS.2015.7266531","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266531","url":null,"abstract":"This is a conceptual paper aimed at harnessing the electromagnetic properties of glass as a good source of power. The magnetic field produced by the atoms in the glass is analyzed using optical rectification. The focus point is found by dividing the glass material into a number of matrix segments. The focus point refers to the point on the glass which has the maximum solar light incident on it. The solar light is made to [3] fall on a device called pyranometer that is used to analyze the solar irradiance for a period of time before allowing it to fall on the material. The above process takes place when the maximum power point tracking algorithm based instrument is [4] attached to the glass. The intensity and distance relationship is calculated using inverse square law concept. The major challenge is that the solar light must be focused on the glass 2 with an intensity of 1 MWatt/m. The focusing object must be 500mm away from the glass. Sun is the source of light and is located at a distance of 149,600,000km. The intensity it 2 provides is 2.585438 micro watt/m which is very low compared to the intensity required, hence UV light is focused on the glass [7].","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117300506","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":"Trust-based storage in a Kademlia network infected by Sybils","authors":"R. Pecori","doi":"10.1109/NTMS.2015.7266529","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266529","url":null,"abstract":"Coping with multiple false identities, also known as a Sybil attack, is one of the main challenges in securing structured peer-to-peer networks. Poisoning routing tables through these identities may make the process for storing and retrieving resources within a DHT (Distributed Hash Table) extremely difficult and time consuming. We investigate current possible countermeasures and propose a novel adaptive method for making the storage and retrieval process, in a Kademlia-based network, more secure. This is done through the use of a trust-based storage algorithm, exploiting reputation techniques. Our solution shows promising results in thwarting a Sybil attack in a Kademlia network, also in comparison with similar methods.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115311328","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":"An hybrid platform for remote health monitoring: From concept to deployment","authors":"K. Heurtefeux, Nasreen Mohsin, H. Menouar","doi":"10.1109/NTMS.2015.7266472","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266472","url":null,"abstract":"This paper presents experimental results from a platform consisting of multiple wearable body area networks (BAN) connected to a wireless mesh network. The proposed platform collects, processes and wirelessly transmits medical data from multiple wearable BAN to a medical control center (MCC) through a solar-powered and multi-hop mesh network. This proof-of-concept platform encompasses several innovations. In the BAN, a dynamic TDMA MAC layer has been implemented over a 802.15.4 physical layer as well as 2 lightweight protocols. To reduce the number of packet sent by sensors and the size of packet sent by the gateway, a similarity-based filter and a polynomial interpolation technique respectively are used. In the solar-powered mesh network, a machine learning algorithm has been implemented to predict battery depletion and ensure continuity of service.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575199","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":"Proposal of multi-value cell structure for high-density two-dimensional codes and evaluation of readability using smartphones","authors":"N. Teraura, K. Sakurai","doi":"10.1109/NTMS.2015.7266514","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266514","url":null,"abstract":"In the now-popular two-dimensional code, bits are expressed using white and two black colors in the cell, which forms the element. However, such codes do not have confidentiality. Since confidentiality may be needed according to the use, a large-capacity and high-density two-dimensional code with compatibility and confidentiality can be realized by adding a secrecy part in addition to the existing part. To enlarge capacity, it is necessary to form a cell using many bits, which requires a multicolor method. The read verification of the compatible area and the additional area was carried out using a smartphone, and the code was verified to confirm its practicality.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123926557","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":"Distortion analysis of underwater acoustic sensor networks","authors":"A. Stefanov","doi":"10.1109/NTMS.2015.7266487","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266487","url":null,"abstract":"The paper studies the distortion performance of multihop underwater acoustic sensor networks. The network is composed of bottom mounted sensors and the sensor to sensor links experience Ricean fading. The distortion is evaluated for the case when there is interference from other sensors in the network. The focus is on the sustainable number of hops in the network for a maximum allowed (target) route distortion requirement. Numerical examples are provided that illustrate the results of the analysis and the regions where the network operation is limited, namely, the coverage-limited region and the interference-limited region.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121404604","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}
S. Farhat, A. Samhat, S. Lahoud, Bernard A. Cousin
{"title":"Pricing strategies in multi-operator heterogeneous wireless networks","authors":"S. Farhat, A. Samhat, S. Lahoud, Bernard A. Cousin","doi":"10.1109/NTMS.2015.7266513","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266513","url":null,"abstract":"In this paper, three pricing scenarios are proposed to set the transaction cost of the inter-operators agreement in a multi-operator cooperative environment. An analysis, of the operators' profits, is performed for these cooperation scenarios and different price sharing models are investigated for comparison. First, we describe the proposed pricing scenarios, the motivation behind and the points of evaluation for each scenario. Then, we present the hybrid decision algorithm for the selection of the access in a multioperator wireless networks environment. Next, we present two business models made for the simulation, in order to highlight how network conditions and operator's strategy for service price may affect the profitability of the cooperation. Simulation results show that proposed pricing models guarantee profit gain for the cooperating operators, and are suitable in a multi-operator sharing environment. A best pricing scenario can be decided depending on the deployed capacity for sharing and the user's service price settings.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349334","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":"Distributed interference management using Q-Learning in cognitive femtocell networks: New USRP-based implementation","authors":"Medhat H. M. Elsayed, Amr M. Mohamed","doi":"10.1109/NTMS.2015.7266488","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266488","url":null,"abstract":"Femtocell networks have become a promising solution in supporting high data rates for 5G systems, where cell densification is performed using the small femtocells. However, femtocell networks have many challenges. One of the major challenges of femtocell networks is the interference management problem, where deployment of femtocells in the range of macro-cells may degrade the performance of the macrocell. In this paper, we develop a new platform for studying interference management in distributed femtocell networks using reinforcement learning approach. We design a complete MAC protocol to perform distributed power allocation using Q-Learning algorithm, where both independent and cooperative learning approaches are applied across network nodes. The objective of the Q-Learning algorithms is to maximize aggregate femtocells capacity, while maintaining the QoS for the Macrocell users. Furthermore, we present the realization of the algorithms using GNURadio and USRP platforms. Performance evaluation are conducted in terms of macrocell capacity convergence to a target capacity and improvement of aggregate femtocells capacity.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126745964","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}
Luan Cardoso dos Santos, Guilherme Rodrigues Bilar, F. D. Pereira
{"title":"Implementation of the fully homomorphic encryption scheme over integers with shorter keys","authors":"Luan Cardoso dos Santos, Guilherme Rodrigues Bilar, F. D. Pereira","doi":"10.1109/NTMS.2015.7266495","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266495","url":null,"abstract":"New researches in the field of homomorphic encryption schemes have made it possible to implement a variety of schemes using different techniques and programming languages. In this paper we describe the implementation of a DGHV scheme variant using Python and the GMPY2 library. This scheme was first proposed in 2010, by van Dijk et al, and later modified into two variants by Coron in 2011 and 2012, which reduced the prohibitive size of the public keys, at the cost of computational power. Besides that, this paper also presents a comparison of these implementations with the previous implementation of Coron's first variant.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116118417","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":"Detecting critical protected links to keep connectivity to servers against link failures","authors":"Daishi Irie, S. Kurimoto, H. Miwa","doi":"10.1109/NTMS.2015.7266485","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266485","url":null,"abstract":"It is important for service providers to design and operate reliable network which is robust against network failures. Especially, a network must be sufficiently connected, even if link failures occur. It is desirable to protect all links so that the failure probability of a link is sufficiently small by sufficient backup resource and rapid recovery system. However, link protection needs much cost; therefore, it is important to find the smallest number of links to be protected so that a network resulting from failures of any non-protected links provides users connectivity. In this paper, we focus on the criteria that all connected components include specified servers in a resulting network after links fail. Our purpose is to find the links to be protected such that, even if any non-protected links fail, all connected components in the resulting network include the servers. First, we formulate this link protection problem and prove that this problem is NP-hard. Next, we present a polynomial-time algorithm to solve the problem that the number of the simultaneous link failures is restricted to one. Furthermore, we present a polynomial-time approximation algorithm with the approximation ratio of a constant, the number of the simultaneous link failures. In addition, we apply the approximation algorithms to the topology of actual networks and evaluate the approximation ratio. The results indicate that the approximation ratio in the actual networks is much smaller than the theoretical upper bound. It follows that our algorithms are efficient when we determine protected links in an actual network.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128228180","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}