{"title":"A new band selection approach based on information theory and support vector machine for hyperspectral images reduction and classification","authors":"Asma Elmaizi, E. Sarhrouni, A. Hammouch, C. Nacir","doi":"10.1109/ISNCC.2017.8072002","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072002","url":null,"abstract":"The high dimensionality of hyperspectral images consisting of several bands often imposes a big computational challenge for image processing. Therefore, spectral band selection is an essential step for removing the irrelevant, noisy and redundant bands. Consequently increasing the classification accuracy. However, identification of useful bands from hundreds or even thousands of related bands is a nontrivial task. This paper aims at identifying a small set of highly discriminative bands, for improving computational speed and prediction accuracy. Hence, we proposed a new strategy based on joint mutual information to measure the statistical dependence and correlation between the selected bands and evaluate the relative utility of each one to classification. The proposed filter approach is compared to an effective reproduced filters based on mutual information. Simulations results on the hyperpectral image HSI AVIRIS 92AV3C using the SVM classifier have shown that the effective proposed algorithm outperforms the reproduced filters strategy performance.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124585126","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 predicting the residence time of mobile users at relevant places","authors":"Abdessamed Sassi, Salah Eddine Henouda, A. Bachir","doi":"10.1109/ISNCC.2017.8072019","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072019","url":null,"abstract":"Predicting future spatial and temporal behavior of mobile users is essential for the development of a wealth of new applications and services. In this paper, we focus on predicting the residence time of a user at their relevant locations. We explore the joint use of location history, arrival time, and the previous residence time to accurately predict the residence time at the current location. We developed a model that integrates all these parameters and uses our modified k-moving-average and k-CDF time-aided algorithms that include the arrival time in the model. We run performance evaluation experiments on a large real mobility trace collected by Dartmouth College and made publicly available through the CRAWDAD project. The dataset we worked on included 545 access points and 6.181 users. Our results show that adding high-granularity temporal information to the mobility model allows to significantly improve the residence time prediction compared to state-of-the-art methods. The prediction accuracy improvement for the dataset we work on has been consistent and of about 20% on the average.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121640248","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. Broumi, M. Talea, A. Bakali, F. Smarandache, P. K. K. Kumar
{"title":"Shortest path problem on single valued neutrosophic graphs","authors":"S. Broumi, M. Talea, A. Bakali, F. Smarandache, P. K. K. Kumar","doi":"10.1109/ISNCC.2017.8071993","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8071993","url":null,"abstract":"A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs. This paper addresses for the first time, the shortest path in an acyclic neutrosophic directed graph using ranking function. Here each edge length is assigned to single valued neutrosophic numbers instead of a real number. The neutrosophic number is able to represent the indeterminacy in the edge (arc) costs of neutrosophic graph. A proposed algorithm gives the shortest path and shortest path length from source node to destination node. Finally an illustrative example also included to demonstrate the proposed method in solving path problems with single valued neutrosophic arcs.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563339","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":"A comparison of migration and multihoming support in IPv6 and XIA","authors":"Nandi Zhang, M. Sirbu, J. Peha","doi":"10.1109/ISNCC.2017.8071980","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8071980","url":null,"abstract":"Mobility and multihoming have become the norm in Internet access, e.g. smartphones with Wi-Fi and LTE, and connected vehicles with LTE and DSRC links that change rapidly. Mobility creates challenges for active session continuity when provider-aggregatable locators are used, while multihoming brings opportunities for improving resiliency and allocative efficiency. This paper proposes a novel migration protocol, in the context of the eXpressive Internet Architecture (XIA), the XIA Migration Protocol. We compare it with Mobile IPv6, with respect to handoff latency and overhead, flow migration support, and defense against spoofing and replay of protocol messages. Handoff latencies of the XIA Migration Protocol and Mobile IPv6 Enhanced Route Optimization are comparable and neither protocol opens up avenues for spoofing or replay attacks. However, XIA requires no mobility anchor point to support client mobility while Mobile IPv6 always depends on a home agent. We show that XIA has significant advantage over IPv6 for multihomed hosts and networks in terms of resiliency, scalability, load balancing and allocative efficiency. IPv6 multihoming solutions either forgo scalability (BGP-based) or sacrifice resiliency (NAT-based), while XIA's fallback-based multihoming provides fault tolerance without a heavy-weight protocol. XIA also allows fine-grained incoming load-balancing and QoS-matching by supporting flow migration. Flow migration is not possible using Mobile IPv6 when a single IPv6 address is associated with multiple flows. From a protocol design and architectural perspective, the key enablers of these benefits are flow-level migration, XIA's DAG-based locators and self-certifying identifiers.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130748914","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":"Fuzzy logic based traffic surveillance system using cooperative V2X protocols with low penetration rate","authors":"Muntaser A. Salman, S. Özdemir, F. Çelebi","doi":"10.1109/ISNCC.2017.8071997","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8071997","url":null,"abstract":"In this paper, we studied the relationship between Vehicle Total Time (VTT) and the traffic conditions for signalized intersection. VTT is the duration that a vehicle remains associated with road side unit RSU through group leader. As the vehicle travels along an intersection and encounters different degrees of delay (i.e. different traffic conditions), the value of VTT varies accordingly. Intuitively, the higher value of VTT indicates the worse degree of traffic condition. This study, investigates the ways to estimate the traffic condition of an intersection based on the measurements of VTT taken from Vehicle to Everything V2X protocol of the COLOMBO project. Specifically, we estimate the traffic conditions of an intersection based on average speed and its derivative (acceleration) using fuzzy logic. The proposed method is evaluated using a well known network simulator benchmark (ns3). The simulation results reveal that VTT can be used with data fusion techniques to estimate the traffic conditions of an intersection with good accuracy even under low penetration rates (PR). This is comparable to a similar technique used in COLOMBO to abstract the traffic conditions of an intersection based on average speed. As a result, this study suggests a potential use of VTT as traffic indicator for signal control design in the future work.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133305868","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 extended IMS framework with a high-performance and scalable distributed storage and computing system","authors":"Youssef Seraoui, B. Raouyane, M. Bellafkih","doi":"10.1109/ISNCC.2017.8072003","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072003","url":null,"abstract":"The mobile network operators (MNOs) that are deploying the IP Multimedia Subsystem (IMS) experience rapid growth of mobile contents and mobile subscribers' requests. Consequently, system performance could be affected and the management of different types of content resources gets expensive and gradually harder. In fact, with the emergence of the big data technology, MNOs must think of making the most of it to introduce new big data based value-added services and ameliorate the IMS system performance and management. In this paper, we propose an extended architectural framework of the 4G LTE system by merging the IMS platform and Hadoop modules for the purposes of both the distributed storage of IMS service resources and the computing service that is suggested in this study for meeting future mobile consumers' needs in mobile computing terms. During experiments, we evaluate the quality of both the system and service. As a result, the propounded architectural framework improves server utilization and quality of service slightly varies.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132156329","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":"Optimal vertical handover based on TOPSIS algorithm and utility function in heterogeneous wireless networks","authors":"M. Lahby, A. Sekkaki","doi":"10.1109/ISNCC.2017.8072023","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072023","url":null,"abstract":"Currently, the deployment of 4G wireless networks such as Long Term Evolution (LTE) or LTE-Advanced became a reality for different telecommunication operator's. This emergence allows the user to roam seamlessly from existing technologies such 3G or WiFi to 4G network, at anytime and anywhere. The main challenge lies in this heterogeneous networks is to determine the best access network for the end user in terms of quality of service (QoS) when the vertical handover process is needed. In this paper, we propose an optimal vertical handover approach based on multiple attributes decision making (MADM) algorithms and the utility function. The MADM algorithms are used to calculate the performance for each network according to each traffic class. Then we apply the utility function to represent the user's preferences on traffic classes to select the best access network. The simulation results demonstrate that our proposed approach can achieve a significant improvement concerning three parameters: the reversal phenomenon, the ping-pong effect and the number of handoffs failures.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129305857","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":"Impact of equalization on hybrid communication system for smart grid","authors":"Amani Aloui, Ons Ben Rhouma, C. Rebai","doi":"10.1109/ISNCC.2017.8072017","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072017","url":null,"abstract":"This paper investigates the impact of advanced signal processing techniques on a communication through Advanced Metering Infrastructure (AMI) in smart grid. While the Narrowband Powerline channel (NB-PLC) is very harsh, we propose to use two h e t e r o g e n e o u s environments: wireless (RF) and wired (NB-PLC) channels. Authors present channel estimation techniques based on Least Squares (LS) and Minimum Mean Square Error (MMSE) algorithms and channel equalization based on Zero Forcing (Z F) and Minimum Mean Square Error (M M SE) methods. Performances analysis show that the MMSE channel estimator is better than the LS estimator in terms of mean square error for the two environments and the MMSE equalizer used for NB-PLC channel do not have good performances. Therefore, environment diversity can be exploited to enhance our system reliability.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122116619","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}
Ivana Kovacevic, A. Erdeljan, S. Vukmirović, Nikola Dalčeković, Jelena Stankovski
{"title":"Combining real-time processing streams to enable demand response in smart grids","authors":"Ivana Kovacevic, A. Erdeljan, S. Vukmirović, Nikola Dalčeković, Jelena Stankovski","doi":"10.1109/ISNCC.2017.8072020","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072020","url":null,"abstract":"Modern smart grids are trending towards direct involvement of end customers in reaching the optimum in balancing energy consumption and generation. In the traditional model, supply follows demand while the modern grids are shifting to the opposite where the load follows supply. Since smart grid systems process a lot of data in real-time, we have researched how we could use the data in order to save energy and reduce peaks. Reducing peaks in energy consumption can save investments on utility side by supplying the same number of customers with less power generation units. The paper presents a possible solution that gives insight into the amount of energy that could potentially be saved at any time by turning off particular devices in the Demand Response (DR) program. Moreover, the proposed solution allows utility to easily and effectively manage network. The solution relies on real-time big data processing and is implemented as Apache Storm topology. Storm processes the gathered data in two data streams - location of customers and devices measurements. By combining two data streams, we check whether a household is empty and how much energy could be saved in every moment. We measured throughput for three distinct loads which were used to simulate three different city sizes. By increasing parallelism and the number of nodes we have noticed that those two factors have a significant influence on the obtained results. What is more, these results provide us with a valuable insight into the overall and complete state of the network in real time.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124630513","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":"Secure genomic data evaluation in cloud environments","authors":"Adil Bouti, J. Keller","doi":"10.1109/ISNCC.2017.8072027","DOIUrl":"https://doi.org/10.1109/ISNCC.2017.8072027","url":null,"abstract":"Security in clouds often focuses on preventing unauthorized access to confidential information. However, cloud providers might also be a source for loss of confidentiality and are generally considered in risk models as honest but curious (HBC). The wide availability and high volume of genomic data improves advances in biomedical research, but outsourcing genomic data processing to cloud providers presents new challenges and risks due to the confidentiality of such data and the critical consequences of a possible loss. We present techniques to securely delegate Genome-Wide Association Study (GWAS) data into clouds using encrypted data. The protocol is based on homomorphic properties of well known encryption algorithms. The protocol can also be used to amend existing applications by software patches of binaries. In the present paper we introduce some practical extensions to our algorithm to improve its efficiency. Additionally we extend the algorithm to support novel optimizations, including Single Operation Multiple Data (SIMD) while preserving its homomorphic properties. We evaluate the protocol by a proof-of-concept implementation of minor allele frequency and chi-squared statistics computations on real-life genomic data to investigate practicability, and discuss variants and extensions to increase the prototype's efficiency.","PeriodicalId":176998,"journal":{"name":"2017 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132897240","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}