T. A. Sohan, Hasib Hamidul Haque, Asif Hasan, Jahidul Islam, A. A. Islam
{"title":"A graph coloring based dynamic channel assignment algorithm for cognitive radio vehicular Ad Hoc networks","authors":"T. A. Sohan, Hasib Hamidul Haque, Asif Hasan, Jahidul Islam, A. A. Islam","doi":"10.1109/NSysS.2016.7400692","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400692","url":null,"abstract":"In this paper, we propose an intuitive graph coloring-based algorithm for Dynamic Spectrum Access (DSA) in Cognitive Radio-enabled Vehicular Ad Hoc Networks (CRVANETs). Besides, we thoroughly investigate the performance of our algorithm through numerical and discrete event simulation. For performance evaluation, we design and simulate singleradio multi-channel CR-VANETs to investigate the operational challenges and performance of our proposed algorithm. In addition, we elaborately discuss the procedure of simulating CRVANETs using a widely used discrete event simulator called ns-2, which is quite challenging and not properly documented in the literature.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132338801","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 genetic algorithm for virtual machine migration in heterogeneous mobile cloud computing","authors":"Mofijul Islam, M. Razzaque, Jahidul Islam","doi":"10.1109/NSysS.2016.7400696","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400696","url":null,"abstract":"Mobile Cloud Computing (MCC) improves the performance of a mobile application by executing it at a resourceful cloud server that can minimize execution time compared to a resource-constrained mobile device. Virtual Machine (VM) migration in MCC brings cloud resources closer to a user so as to further minimize the response time of an offloaded application. Such resource migration is very effective for interactive and real-time applications. However, the key challenge is to find an optimal cloud server for migration that offers the maximum reduction in computation time. In this paper, we propose a Genetic Algorithm (GA) based VM migration model, namely GAVMM, for heterogeneous MCC system. In GAVMM, we take user mobility and load of the cloud servers into consideration to optimize the effectiveness of VM migration. The goal of GAVMM is to select the optimal cloud server for a mobile VM and to minimize the total number of VM migrations, resulting in a reduced task execution time. Additionally, we present a thorough numerical evaluation to investigate the effectiveness of our proposed model compared to the state-of-the-art VM migration policies.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136019","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":"Securing app distribution process of iOS exploiting the notion of authentic update","authors":"Sajeda Akter, F. Rahman, A. Islam","doi":"10.1109/NSysS.2016.7400689","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400689","url":null,"abstract":"iOS is, perhaps, considered as one of the most secured and reliable operating systems available now-a-days. However, its loopholes are coming into light in recent times causing a few security breaches such as the Masque attack. Even though prompt and pragmatic fixes for such breaches are of utmost significance, a fix for the Masque attack is yet to be proposed. To address this issue, in this paper, we propose a novel mechanism for guarding against the Masque attack. In our proposed mechanism, we exploit a synergy between authentication and non-repudiation to guard against different forms of Masque attack. Our exploitation leads towards a simple mechanism for preventing Replay attacks and for rejecting unauthenticated update, both of which generally paves the way of performing Masque attack. Consequently, the mechanism offers a pragmatic and easy-to-implement solution for the Masque attack.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129979892","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":"Conflicting goal constrained architecture of a heterogeneous mobile sensor network","authors":"A. Sultana, Mahmuda Naznin, Rifat Shahriyar","doi":"10.1109/NSysS.2016.7400701","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400701","url":null,"abstract":"Maintaining coverage and connectivity is a conventional research problem in a sensor network. However, it is still a challenging research field due to the power constraint and connection vulnerability of the battery powered sensing devices. However now a days a network comprises of different mobile devices of different ranges. Still now, there is no comprehensive optimal solution for providing coverage with desired connectivity in a mobile wireless sensor network. In our paper, we present an efficient coverage model for heterogeneous mobile sensing devices maintaining the required connectivity. We compute the optimal positioning of the mobile devices based on Linear Programming, maintaining the required connectivity. We validate our claim by experimental results.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132365205","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 between sensing quality and energy efficiency for context monitoring applications","authors":"Sujan Sarker, Amit Kumar Nath, M. Razzaque","doi":"10.1109/NSysS.2016.7400699","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400699","url":null,"abstract":"Mobile devices have gone far beyond their basic usage like calling, texting, etc. New generation mobile devices like smartphones contain a rich set of embedded sensors which enable them to perform sensing operations in different domains. To get user contextual information, both human centric & participatory sensing can be helpful. In order to accurately capture, recognize and classify various user states, sensors need to operate more in active mode. However, continuous sensing results in huge energy consumption, decreasing the battery lifetime. Hence, a tradeoff in between the sensing accuracy and energyefficiency is required. In this paper, we have developed novel strategies to make this tradeoff. User contexts are monitored and multiplicative increase and multiplicative decrease (MIMD) approach is exploited to dynamically adjust the sensing frequency following the sensing quality requirements of the applications. We have developed a real-time android application to evaluate the effectiveness of the proposed method in terms of sensing accuracy and energy-efficiency. The results show a good level of improvement compared to a state-of-the-art work.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125165019","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 between RSA and ElGamal based untraceable blind signature schemes","authors":"Khairul Alam, K. R. Alam, O. Faruq, Y. Morimoto","doi":"10.1109/NSysS.2016.7400705","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400705","url":null,"abstract":"This paper presents a comparison between RSA and ElGamal based untraceable blind signature (BS) schemes through simulation. The objective is to provide a guideline while selecting either of them to develop an application. A BS scheme is a cryptographic protocol that can be used in cryptographic applications like electronic voting systems, electronic payment systems etc to conduct their privacy-related transactions anonymously but securely. While a user operates her electronic transactions employing a BS scheme over the internet, the BS scheme ensures the confidentiality of the secret message of the user. Besides, untraceability is a crucial criterion for any BS scheme because thereby the signer of this scheme is unable to link the message-signature pair after the BS has been revealed to the public. Two untraceable BS schemes: one is proposed by Hwang et al. and is based on RSA cryptosystem whereas the other is proposed by Lee et al. and is based on ElGamal cryptosystem have been chosen here for simulation. The outcome of the simulation model is the comparison of computation time requirement of blinding, singing, unblinding and verification phases of the chosen BS schemes.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921909","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":"Comparative study of different methods of social network analysis and visualization","authors":"Marufur Rahman, Rezaul Karim","doi":"10.1109/NSysS.2016.7400702","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400702","url":null,"abstract":"A Social Network is a social structure made of individuals or organizations that are linked by one or more specific types of interdependency, such as friends, kinship, terrorist relation, conflict, financial exchange, disease transmission (epidemiology), airline routes etc. Social Network Analysis is an approach to the study of human or organization social interactions. It can be used to investigate kinship patterns, community structure or the organization of other formal and informal social networks. Recently, email networks have been popular source of data for both analysis and visualization of social network of a person or organization. In this paper, three types of visualization technique to analyze social networks have been considered - Force directed layout, Spherical layout and Clustered layout. Each method was evaluated with various data sets from an organization. Force directed layout is used to view the total network structure (Overview). Spherical layout is a 3D method to reveal communication patterns and relationships between different groups. Clustered graph layout visualizes a large amount of data in an efficient and compact form. It gives a hierarchical view of the network. Among the three methods, Clustered layout is the best to handle large network and group relationship. Finally, the comparative study of these three methods has been given.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133496123","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":"Game theoretic downlink resource scheduling for self-coexisting cognitive radio networks","authors":"Sayef Azad Sakin, M. Razzaque","doi":"10.1109/NSysS.2016.7400697","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400697","url":null,"abstract":"Cognitive Radio Networks (CRNs) provide a convenient way to access under-utilized TV bands for wireless radio users. Different co-located networks must have to coexist by accessing different parts of the incumbent free available spectrum in an opportunistic manner. In this paper, we propose a fully distributed non-cooperative game theoretic scheme for resource scheduling in self-coexisting cognitive radio networks. We formulate the downlink resource scheduling problem in self-coexistent CRNs as a non-linear convex optimization problem, which is NP-hard in real world network scenario. An alternate greedy algorithm is developed that produces sub-optimal solution to the resource scheduling problem by dividing it into downlink channel allocation and power assignment sub-problems. We propose a novel utility function for the game to achieve high throughput and an algorithm to guide through the Nash Equilibrium state. Theoretical proof for the Nash Equilibrium has been presented and performance improvements compared to the state-of-the-art works have been depicted through simulation studies.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115745894","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 new cost-effective approach for battlefield surveillance in wireless sensor networks","authors":"Fariha Tasmin Jaigirdar, Mohammad Mahfuzul Islam","doi":"10.1109/NSysS.2016.7400694","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400694","url":null,"abstract":"Assuring security (in the form of attacking mode as well as in safeguard mode) and at the same time keeping strong eye on the opposition's status (position, quantity, availability) is the key responsibility of a commander in the battlefield. Battlefield surveillance is one of the strong applications of Wireless Sensor Networks (WSNs). A commander is not only liable to his above responsibilities, but also to manage his duties in an efficient way. For this reason, ensuring maximum destruction with minimum resources is a major concern of a commander in the battlefield. This paper focuses on the maximum destruction problem in military affairs. In the work of Jaigirdar and Islam (2012), the authors proposed two novel algorithms (Maximum degree analysis and Maximum clique analysis) that ensure the efficiency and cost-effectiveness of the above problem. A comparative study explaining the number of resources required for commencing required level of destruction made to the opponents has been provided in the paper. In this paper the authors have come forward with another algorithm for the same problem. With the simulation studies and comparative analysis of the same example set the authors in this paper demonstrate the effectiveness (in both the quality and quantity) of the new method to be best among the three.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827011","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}
Nova Ahmed, M. Azad, M. Khan, A. Habib, Shuvashis Ghosh, Sabiha Shahid
{"title":"ShonaBondhu: a cloud based system to handle flash flood","authors":"Nova Ahmed, M. Azad, M. Khan, A. Habib, Shuvashis Ghosh, Sabiha Shahid","doi":"10.1109/NSysS.2016.7400688","DOIUrl":"https://doi.org/10.1109/NSysS.2016.7400688","url":null,"abstract":"Flash Flood is a natural disaster that floods away large area where there are dense presence of rivers. Bangladesh is one such country where people face this sudden flood problem and loses valuable assets using manual water level monitoring. The challenge lies in the sudden increase of water level once the flood water is in. We are proposing a distributed system using water level monitoring sensors named Shonabondhu. The sensing nodes are distributed all across the country and the servers that collect data from sensors are spread around various regions. The servers use a function of rainfall and current water level that indicate a particular gradient to that sensor. The gradient information among sensors are related using the water level and rainfall data over four years (2008 to 2011). This gradient information is updated and propagated when any kind of change is present near the source of the river. A communication abstraction is created to propagate sensitive information and periodic updates of current status. We have used actual sensors to monitor the water level in the river and have used emulated sensors to mimic the behavior in large distributed system. Our current system works as a proof of a concept system before the actual deployment of this system in collaboration of Water Development Board of Bangladesh.","PeriodicalId":295833,"journal":{"name":"2016 International Conference on Networking Systems and Security (NSysS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122807930","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}