Pub Date : 2015-09-24DOI: 10.1109/NTMS.2015.7266505
A. M. Souza, R. S. Yokoyama, Guilherme Maia, A. Loureiro, L. Villas
Traffic jam in urban centers is a mobility problem responsible for significant economic losses and the degradation of the environment. However, a wide range of technologies, in particular, intelligent transportation systems, may be used to predict, identify and reduce vehicular traffic congestion. In this context, this work presents an Intelligent Traffic Information System (ITIS) which relies on inter-vehicle communication in order to avoid traffic jams in urban centers. The main goal of the proposed system is to reduce the average trip time, the fuel consumption and CO2 emissions, thus increasing vehicular traffic efficiency, reducing economic losses and making cities more environmental friendly. Simulation results for a synthetic scenario have shown that our proposed system is able to accomplish this goal. In particular, the average trip time was decreased ≈47%, the fuel consumption ≈22% and the CO2 emission ≈24%.
{"title":"Minimizing traffic jams in urban Centers using vehicular ad hoc networks","authors":"A. M. Souza, R. S. Yokoyama, Guilherme Maia, A. Loureiro, L. Villas","doi":"10.1109/NTMS.2015.7266505","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266505","url":null,"abstract":"Traffic jam in urban centers is a mobility problem responsible for significant economic losses and the degradation of the environment. However, a wide range of technologies, in particular, intelligent transportation systems, may be used to predict, identify and reduce vehicular traffic congestion. In this context, this work presents an Intelligent Traffic Information System (ITIS) which relies on inter-vehicle communication in order to avoid traffic jams in urban centers. The main goal of the proposed system is to reduce the average trip time, the fuel consumption and CO2 emissions, thus increasing vehicular traffic efficiency, reducing economic losses and making cities more environmental friendly. Simulation results for a synthetic scenario have shown that our proposed system is able to accomplish this goal. In particular, the average trip time was decreased ≈47%, the fuel consumption ≈22% and the CO2 emission ≈24%.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122279711","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266490
Yoann Foquet, D. Nace
This work discuss briefly the Elastic Flow Rerouting (EFR) - a traffic restoration strategy for protecting traffic flows in communication networks (including wireless networks). EFR aims at alleviating the trade-off between practicabilty of traffic restoration and the cost of network resources observed in existing networking solutions. We provide a discussion on the strategy and position it among the other strategies.
{"title":"Elastic flow rerouting","authors":"Yoann Foquet, D. Nace","doi":"10.1109/NTMS.2015.7266490","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266490","url":null,"abstract":"This work discuss briefly the Elastic Flow Rerouting (EFR) - a traffic restoration strategy for protecting traffic flows in communication networks (including wireless networks). EFR aims at alleviating the trade-off between practicabilty of traffic restoration and the cost of network resources observed in existing networking solutions. We provide a discussion on the strategy and position it among the other strategies.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"70 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":"121282043","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266463
R. Pecori
An important and common prerequisite of many asymmetric cryptography systems is the availability of a secure mechanism for exchanging or distributing public keys. In this paper we compare two adaptive trust-based distributed schemes to deliver public keys in a peer-to-peer network. In such a scenario, centralized solutions, for example based on a certification authority or a public key infrastructure, cannot be used. For this reason we considered a completely distributed approach creating a sort of context aware web-of-trust. This is achieved in two different trust-based manners: one considering a classic request-response scheme and another one that exploits a Distributed Hash Table (DHT). We compare performances of both solutions trying to find an optimum trade-off.
{"title":"A comparison analysis of trust-adaptive approaches to deliver signed public keys in P2P systems","authors":"R. Pecori","doi":"10.1109/NTMS.2015.7266463","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266463","url":null,"abstract":"An important and common prerequisite of many asymmetric cryptography systems is the availability of a secure mechanism for exchanging or distributing public keys. In this paper we compare two adaptive trust-based distributed schemes to deliver public keys in a peer-to-peer network. In such a scenario, centralized solutions, for example based on a certification authority or a public key infrastructure, cannot be used. For this reason we considered a completely distributed approach creating a sort of context aware web-of-trust. This is achieved in two different trust-based manners: one considering a classic request-response scheme and another one that exploits a Distributed Hash Table (DHT). We compare performances of both solutions trying to find an optimum trade-off.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"39 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":"125065599","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266518
Garvita Bajaj, Pushpendra Singh
The ubiquitous nature of mobile devices offering high computing capabilities has attracted a large number of users. The sensors available on these devices provide valuable data about user contexts, which when combined with sensor data from other mobile devices can reveal interesting environmental contexts, which can then be used for applications like real-time traffic monitoring, noise mapping, crowdmapping, etc. Developing applications for inferring environmental context requires participation from multiple users satisfying certain requirements (e.g., location of users etc.); hence, building such applications requires developers to carefully identify potential collaborators satisfying these conditions. This makes the development of such applications cumbersome and time-consuming. In this work, we present Sahyog1 - a publish-subscribe framework that allows developers to specify these requirements and identify users that can actively participate in such applications. Sahyog helps application developers request data from a large number of users without worrying about reaching out to users, communicating data requests and responses, and storing information. We discuss the design and implementation of our system with the underlying research challenges, and evaluate it using several parameters.
{"title":"Sahyog: A middleware for mobile collaborative applications","authors":"Garvita Bajaj, Pushpendra Singh","doi":"10.1109/NTMS.2015.7266518","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266518","url":null,"abstract":"The ubiquitous nature of mobile devices offering high computing capabilities has attracted a large number of users. The sensors available on these devices provide valuable data about user contexts, which when combined with sensor data from other mobile devices can reveal interesting environmental contexts, which can then be used for applications like real-time traffic monitoring, noise mapping, crowdmapping, etc. Developing applications for inferring environmental context requires participation from multiple users satisfying certain requirements (e.g., location of users etc.); hence, building such applications requires developers to carefully identify potential collaborators satisfying these conditions. This makes the development of such applications cumbersome and time-consuming. In this work, we present Sahyog1 - a publish-subscribe framework that allows developers to specify these requirements and identify users that can actively participate in such applications. Sahyog helps application developers request data from a large number of users without worrying about reaching out to users, communicating data requests and responses, and storing information. We discuss the design and implementation of our system with the underlying research challenges, and evaluate it using several parameters.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"140 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":"128472119","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266532
Budoor Bawazeer, N. Adra, G. Aldabbagh, N. Dimitriou
With the increasing number of smart devices and handheld computers, mobile users should be provided with always-on connectivity. Many research works have addressed the problem of providing mobile users with a seamless handover to avoid losing connectivity while moving to uncovered areas or gaps among WiFi access points (AP). The criteria of choosing the target network to which to perform the handover are of great importance. In this regard, the access technology that uses the TV White Space (TVWS) spectrum, which is the unused TV spectrum characterized by lower frequencies and higher bandwidths, is considered to be the perfect choice for handover from WiFi due to its wide coverage area and low cost. This work will study the handover between WiFi and WhiteFi, which is a WiFi amendment to operate on TVWS. Different handover signaling schemes are presented and the handover performance is evaluated in terms of handover scanning delay. MIH (Media Independent Handover) protocol is used to reduce the scanning delay by communicating with the WhiteFi Registered Location Secure Server (RLSS). Handover performance study was conducted to evaluate the total handover delay in terms of available bandwidth, hops count and required signaling messages size.
随着智能设备和掌上电脑数量的增加，移动用户应该提供始终在线的连接。许多研究工作已经解决了为移动用户提供无缝切换的问题，以避免在移动到未覆盖的区域或WiFi接入点(AP)之间的间隙时失去连接。选择执行切换的目标网络的标准非常重要。因此，利用电视空白频段(TV White Space, TVWS)频谱的接入技术，由于其覆盖范围广、成本低，被认为是WiFi切换的最佳选择。TV空白频段是频率较低、带宽较高的未使用电视频谱。本工作将研究WiFi与WhiteFi之间的切换，WhiteFi是在TVWS上运行的WiFi修正。提出了不同的切换信令方案，并从切换扫描时延的角度对切换性能进行了评价。MIH(媒体独立切换)协议通过与白efi注册位置安全服务器(RLSS)通信来减少扫描延迟。通过切换性能研究，从可用带宽、跳数和所需信令消息大小三个方面评估总切换延迟。
{"title":"WiFi/WhiteFi handover: Signaling and performance","authors":"Budoor Bawazeer, N. Adra, G. Aldabbagh, N. Dimitriou","doi":"10.1109/NTMS.2015.7266532","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266532","url":null,"abstract":"With the increasing number of smart devices and handheld computers, mobile users should be provided with always-on connectivity. Many research works have addressed the problem of providing mobile users with a seamless handover to avoid losing connectivity while moving to uncovered areas or gaps among WiFi access points (AP). The criteria of choosing the target network to which to perform the handover are of great importance. In this regard, the access technology that uses the TV White Space (TVWS) spectrum, which is the unused TV spectrum characterized by lower frequencies and higher bandwidths, is considered to be the perfect choice for handover from WiFi due to its wide coverage area and low cost. This work will study the handover between WiFi and WhiteFi, which is a WiFi amendment to operate on TVWS. Different handover signaling schemes are presented and the handover performance is evaluated in terms of handover scanning delay. MIH (Media Independent Handover) protocol is used to reduce the scanning delay by communicating with the WhiteFi Registered Location Secure Server (RLSS). Handover performance study was conducted to evaluate the total handover delay in terms of available bandwidth, hops count and required signaling messages size.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"1 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":"130546497","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266509
P. Langlois, R. Nheili, C. Denis
Floating-point arithmetic may introduce failures of the numerical reproducibility between a priori similar sequential and parallel executions of HPC simulation. We present how to apply some existing techniques to part of hydrodynamic finite element simulations. We analyze how easy these techniques allow us to recover its numerical reproducibility.
{"title":"Numerical reproducibility: Feasibility issues","authors":"P. Langlois, R. Nheili, C. Denis","doi":"10.1109/NTMS.2015.7266509","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266509","url":null,"abstract":"Floating-point arithmetic may introduce failures of the numerical reproducibility between a priori similar sequential and parallel executions of HPC simulation. We present how to apply some existing techniques to part of hydrodynamic finite element simulations. We analyze how easy these techniques allow us to recover its numerical reproducibility.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"363 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":"123954795","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266506
S. Trabelsi, H. Plate, Amine Abida, M. Marouane, Ben Aoun, Anis Zouaoui, C. Missaoui, Sofien Gharbi, Alaeddine Ayari
Staying informed about security vulnerabilities, work-arounds and the availability of patches regarding the components of a given system is crucial to ensure system security. Several channels can be used to the monitor the new vulnerabilities publications, but these channels are scattered. We propose in this paper a vulnerability monitoring system based on twitter analysis that aggregates and analyses different sources of data and extracts zero-day vulnerabilities.
{"title":"Mining social networks for software vulnerabilities monitoring","authors":"S. Trabelsi, H. Plate, Amine Abida, M. Marouane, Ben Aoun, Anis Zouaoui, C. Missaoui, Sofien Gharbi, Alaeddine Ayari","doi":"10.1109/NTMS.2015.7266506","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266506","url":null,"abstract":"Staying informed about security vulnerabilities, work-arounds and the availability of patches regarding the components of a given system is crucial to ensure system security. Several channels can be used to the monitor the new vulnerabilities publications, but these channels are scattered. We propose in this paper a vulnerability monitoring system based on twitter analysis that aggregates and analyses different sources of data and extracts zero-day vulnerabilities.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"6 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":"129974603","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266467
D. Sacaleanu, L. Perisoara, R. Stoian, V. Lazarescu
This paper proposes a new data processing framework for energy saving, based on a synergy between data compression and data aggregation techniques. This combination allows a more compact representation of the transmitted data in the clusters head nodes compared with the individual use of each technique. For data compression, we use the static Huffman algorithm with Extrapolation prediction that exploits Temporal correlation (ET) and static Huffman algorithm with Differential prediction that exploits Spatial correlation (DS). For data aggregation we use a Bit Aggregation Technique (BAT) to efficiently represent the data carrying bits from a byte. To validate the synergetic combination between ET, DS and BAT, we developed two platforms that allow us to simulate and practical implement the algorithms. The performances are compared with those of the classical Adaptive Huffman algorithm with Differential prediction that exploits Temporal correlation (DT). The results show an important decrease of energy consumption for the synergetic solution obtained both on software and hardware platforms.
{"title":"A new energy saving framework for long lasting wireless sensor nodes","authors":"D. Sacaleanu, L. Perisoara, R. Stoian, V. Lazarescu","doi":"10.1109/NTMS.2015.7266467","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266467","url":null,"abstract":"This paper proposes a new data processing framework for energy saving, based on a synergy between data compression and data aggregation techniques. This combination allows a more compact representation of the transmitted data in the clusters head nodes compared with the individual use of each technique. For data compression, we use the static Huffman algorithm with Extrapolation prediction that exploits Temporal correlation (ET) and static Huffman algorithm with Differential prediction that exploits Spatial correlation (DS). For data aggregation we use a Bit Aggregation Technique (BAT) to efficiently represent the data carrying bits from a byte. To validate the synergetic combination between ET, DS and BAT, we developed two platforms that allow us to simulate and practical implement the algorithms. The performances are compared with those of the classical Adaptive Huffman algorithm with Differential prediction that exploits Temporal correlation (DT). The results show an important decrease of energy consumption for the synergetic solution obtained both on software and hardware platforms.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"30 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":"132844757","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266517
T. Pfeiffenberger, J. Du, Pedro Bittencourt Arruda, A. Anzaloni
Our work evaluates the use of software-defined networking (SDN) for reliable communication. Reliable communication has become an important topic in many areas, including energy communication networks or, more generally, automation control networks. Electrical grids are developing into smart grids, which depend heavily on reliability, robustness and optimized resource usage. On the other side, the separation of communication and network control proposed by SDN opens new possibilities for reliable and flexible networks. In this work, we show how OpenFlow, the leading SDN framework, could be used to solve the problem of robust multicast better than existing technologies used by substations. Our solution uses the fast-failover groups feature of OpenFlow to provide one-link fault tolerance with little packet loss and can provide routes that use resources efficiently and are less likely to fail. Robust shortest path routing and minimum spanning tree broadcast routing come as special cases. We also show how this solution can be extended to handle more link failures (even an arbitrary number of them) or to provide more efficient routes.
{"title":"Reliable and flexible communications for power systems: Fault-tolerant multicast with SDN/OpenFlow","authors":"T. Pfeiffenberger, J. Du, Pedro Bittencourt Arruda, A. Anzaloni","doi":"10.1109/NTMS.2015.7266517","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266517","url":null,"abstract":"Our work evaluates the use of software-defined networking (SDN) for reliable communication. Reliable communication has become an important topic in many areas, including energy communication networks or, more generally, automation control networks. Electrical grids are developing into smart grids, which depend heavily on reliability, robustness and optimized resource usage. On the other side, the separation of communication and network control proposed by SDN opens new possibilities for reliable and flexible networks. In this work, we show how OpenFlow, the leading SDN framework, could be used to solve the problem of robust multicast better than existing technologies used by substations. Our solution uses the fast-failover groups feature of OpenFlow to provide one-link fault tolerance with little packet loss and can provide routes that use resources efficiently and are less likely to fail. Robust shortest path routing and minimum spanning tree broadcast routing come as special cases. We also show how this solution can be extended to handle more link failures (even an arbitrary number of them) or to provide more efficient routes.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"52 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":"131666944","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}
Pub Date : 2015-07-27DOI: 10.1109/NTMS.2015.7266503
Victor Tortorello, L. H. Nakamura, D. C. Lobato, R. Meneguette
Nowadays, wireless technologies and mobile communication networks have been widely used in many public places due to the greater flexibility, reduced wiring cost and improved efficiency when compared to wired alternatives. Particularly, the real time wireless technologies allow users to collect and transmit data in a timely manner and also draw a good attention of them. This transmission does not only involves the web data, but also control messages. Also, it has a high impact on the traditional wireless and mobile communication networks. Thus, one of the most challenge in this research area is the designing of an efficient and robust mobility management. This work aims at developing an application that will manage connections made by mobile devices, providing the user with the ability to map their connections for each application, enabling the simultaneous use of more than one network interface; therefore our solution seeks to increase the flow of data user. Our proposal uses smartphones for the creation of application development, which was developed for Android platforms, in order to contribute to the open source community.
{"title":"MASCA: MAnagement of simultaneous connectivity for applications","authors":"Victor Tortorello, L. H. Nakamura, D. C. Lobato, R. Meneguette","doi":"10.1109/NTMS.2015.7266503","DOIUrl":"https://doi.org/10.1109/NTMS.2015.7266503","url":null,"abstract":"Nowadays, wireless technologies and mobile communication networks have been widely used in many public places due to the greater flexibility, reduced wiring cost and improved efficiency when compared to wired alternatives. Particularly, the real time wireless technologies allow users to collect and transmit data in a timely manner and also draw a good attention of them. This transmission does not only involves the web data, but also control messages. Also, it has a high impact on the traditional wireless and mobile communication networks. Thus, one of the most challenge in this research area is the designing of an efficient and robust mobility management. This work aims at developing an application that will manage connections made by mobile devices, providing the user with the ability to map their connections for each application, enabling the simultaneous use of more than one network interface; therefore our solution seeks to increase the flow of data user. Our proposal uses smartphones for the creation of application development, which was developed for Android platforms, in order to contribute to the open source community.","PeriodicalId":115020,"journal":{"name":"2015 7th International Conference on New Technologies, Mobility and Security (NTMS)","volume":"14 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":"131744394","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：