Pub Date : 2017-03-01DOI: 10.1109/C-CODE.2017.7918921
Muhammad Noman Hayat, Haroon Khan, Z. Iqbal, Zia Ur Rahman, M. Tahir
With the emergence of low-cost hardware is enabling the development of wireless multimedia sensor network. Challenges in WMSN are resource constraint, Application specific QoS requirements and High bandwidth demand. In this paper we have explored the multichannel communication architectures of WMSN to achieve high data rate requirements, to cater interferences, jamming and congestion avoidance for reliable communication, we have listed challenging issues pertaining to multichannel communication. Picture of these MCC protocols is also presented in this paper. Classification of multichannel assignment protocols has been proposed, Identified different channel selection policies, types of channel assignment and methods of channel assignment. We conclude by a table presenting many examples of existing multichannel protocols designed for WMSNs and highlighted promising research directions.
{"title":"Multimedia sensor networks: Recent trends, research challenges and future directions","authors":"Muhammad Noman Hayat, Haroon Khan, Z. Iqbal, Zia Ur Rahman, M. Tahir","doi":"10.1109/C-CODE.2017.7918921","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918921","url":null,"abstract":"With the emergence of low-cost hardware is enabling the development of wireless multimedia sensor network. Challenges in WMSN are resource constraint, Application specific QoS requirements and High bandwidth demand. In this paper we have explored the multichannel communication architectures of WMSN to achieve high data rate requirements, to cater interferences, jamming and congestion avoidance for reliable communication, we have listed challenging issues pertaining to multichannel communication. Picture of these MCC protocols is also presented in this paper. Classification of multichannel assignment protocols has been proposed, Identified different channel selection policies, types of channel assignment and methods of channel assignment. We conclude by a table presenting many examples of existing multichannel protocols designed for WMSNs and highlighted promising research directions.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127807707","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}
It is an established fact that the data transmission between two devices or processes is achieved via packets, according to the rules and regulations of TCP/IP protocol suite. The said transmission involves all the layers of TCP/IP protocol suite. The different processes involved in the transmission follow the same rule of the TCP / IP suite either on the same device or on different devices. In this paper, we proposed an algorithm with the help of which the data is being transmitted from one process to another process using the same file if both processes are on the same device. Our proposed algorithm uses only the two top layers, i.e., Application and Transport, of a TCP/IP protocol suite while, the rest of the layers, i.e., Network, Data Link and Physical, are not used. The data is transferred directly from the transport layer of one process to the transport layer of the other process. Our proposed algorithm saves a significant amount of computational power and other system resources that are consumed by the lower layers, i.e., Network, Data Link and Physical.
{"title":"Communication between multiple processes on same device using TCP/IP suite","authors":"Faizan Badshah, Syed Tauhid Ullah Shah, Syed Roohullah Jan, Izaz ur Rahman","doi":"10.1109/C-CODE.2017.7918919","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918919","url":null,"abstract":"It is an established fact that the data transmission between two devices or processes is achieved via packets, according to the rules and regulations of TCP/IP protocol suite. The said transmission involves all the layers of TCP/IP protocol suite. The different processes involved in the transmission follow the same rule of the TCP / IP suite either on the same device or on different devices. In this paper, we proposed an algorithm with the help of which the data is being transmitted from one process to another process using the same file if both processes are on the same device. Our proposed algorithm uses only the two top layers, i.e., Application and Transport, of a TCP/IP protocol suite while, the rest of the layers, i.e., Network, Data Link and Physical, are not used. The data is transferred directly from the transport layer of one process to the transport layer of the other process. Our proposed algorithm saves a significant amount of computational power and other system resources that are consumed by the lower layers, i.e., Network, Data Link and Physical.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131414633","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918901
Tanveer Ahmed, Adeel Ahmed, Mubashir Ali, M. Kamran
Assorted communication on social networks attracted researcher's attention in recent time. Massive sharing of opinions, ideas, experiences and expertise highlight communication through social networks. Social networks have becoming a flourishing network for sharing such values. Identifying and analyzing these communication trends have gained importance for detecting patterns among peoples in social networks using community detection. Different methods have been proposed for detecting communities in social networks. Co-authorship network is also becoming central point of attention to many researchers. Domain specific co-authorship community detection is evolving area that is emerging beside other community detection identification patterns. In this paper, we performed analysis on coauthorship network in the field of computer networks using common centrality measures. Finding reveals that this study finds domain specific co-authors that are best in their knowledge sharing and collaboration in the field of computer networks.
{"title":"Analysis of co-authorship in computer networks using centrality measures","authors":"Tanveer Ahmed, Adeel Ahmed, Mubashir Ali, M. Kamran","doi":"10.1109/C-CODE.2017.7918901","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918901","url":null,"abstract":"Assorted communication on social networks attracted researcher's attention in recent time. Massive sharing of opinions, ideas, experiences and expertise highlight communication through social networks. Social networks have becoming a flourishing network for sharing such values. Identifying and analyzing these communication trends have gained importance for detecting patterns among peoples in social networks using community detection. Different methods have been proposed for detecting communities in social networks. Co-authorship network is also becoming central point of attention to many researchers. Domain specific co-authorship community detection is evolving area that is emerging beside other community detection identification patterns. In this paper, we performed analysis on coauthorship network in the field of computer networks using common centrality measures. Finding reveals that this study finds domain specific co-authors that are best in their knowledge sharing and collaboration in the field of computer networks.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132163586","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918939
Faima Abbasi, Ayesha Waseem, Erum Ashraf
Augmented reality is a useful technique and has been of interest to researchers recently. Many real-life applications ranging from games to learning have been developed using augmented reality. The aim of this work is to improve student's understanding of realistic phenomenon of nature and enhance their capabilities towards learning. Augmented reality technique has proved itself in education as it replaces memory based learning to fun driven and conceptual schooling. In this paper, we have proposed an algorithm to support marker based augmented reality teaching methodology. A controlled experimental lecture in classroom was conducted with the usage of augmented reality technique. The delivered lecture was then compared with the traditional method of teaching. Post and pre-test were conducted to record the student's understanding which depicted that the proposed augmented reality teaching method is more proficient than the traditional one and plays significant role in improving student's grades.
{"title":"Augmented reality based teaching in classrooms","authors":"Faima Abbasi, Ayesha Waseem, Erum Ashraf","doi":"10.1109/C-CODE.2017.7918939","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918939","url":null,"abstract":"Augmented reality is a useful technique and has been of interest to researchers recently. Many real-life applications ranging from games to learning have been developed using augmented reality. The aim of this work is to improve student's understanding of realistic phenomenon of nature and enhance their capabilities towards learning. Augmented reality technique has proved itself in education as it replaces memory based learning to fun driven and conceptual schooling. In this paper, we have proposed an algorithm to support marker based augmented reality teaching methodology. A controlled experimental lecture in classroom was conducted with the usage of augmented reality technique. The delivered lecture was then compared with the traditional method of teaching. Post and pre-test were conducted to record the student's understanding which depicted that the proposed augmented reality teaching method is more proficient than the traditional one and plays significant role in improving student's grades.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128842667","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}
Domain of image processing is progressing a lot and has achieved tremendous milestones. Image processing is helping in many ways for the researchers to achieve their goals especially in security and medical fields. Detection of blood group in disaster or remote areas where expert is unavailable is challenge. In this paper we have proposed a system which will detect blood group using image processing techniques. Steps to detect the type of blood group using image processing techniques are discussed. Successful results have been obtained and accuracy of the proposed system is optimal
{"title":"Image processing based detection & classification of blood group using color images","authors":"Abubakar Yamin, Faisal Imran, Usman Akbar, Syed Hassan Tanvir","doi":"10.1109/C-CODE.2017.7918945","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918945","url":null,"abstract":"Domain of image processing is progressing a lot and has achieved tremendous milestones. Image processing is helping in many ways for the researchers to achieve their goals especially in security and medical fields. Detection of blood group in disaster or remote areas where expert is unavailable is challenge. In this paper we have proposed a system which will detect blood group using image processing techniques. Steps to detect the type of blood group using image processing techniques are discussed. Successful results have been obtained and accuracy of the proposed system is optimal","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779348","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918959
Tassadaq Hussain, Saqib Amin, U. Zabit
Displacement, speed, etc. measurements by using the Self-Mixing interferometric is an active area of research. Phase retrieval by using the phase unwrapping method is a standard practice in the laser sensing. The Phase Unwrapping Method mixes the knowledge carried in both the phase acquired and the principal value of the phase into an adaptive differential integration system. The method demands automated and intelligent high performance hardware architecture, due to the compact, self-aligned and cost effective nature of laser sensors. In this work, we have implemented an Improved Phase Unwrapping Method on the Multi-core system and measures the performance and power efficiency for different target technologies. The results on the multi-core system show that the Improved Phase Unwrapping Method gets 4.09 times performance improvement and consumes 2.04 times less energy than the uni-core system.
{"title":"Implementation of high precision laser interferometry algorithm for real-time displacement sensing using multi-core architecture","authors":"Tassadaq Hussain, Saqib Amin, U. Zabit","doi":"10.1109/C-CODE.2017.7918959","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918959","url":null,"abstract":"Displacement, speed, etc. measurements by using the Self-Mixing interferometric is an active area of research. Phase retrieval by using the phase unwrapping method is a standard practice in the laser sensing. The Phase Unwrapping Method mixes the knowledge carried in both the phase acquired and the principal value of the phase into an adaptive differential integration system. The method demands automated and intelligent high performance hardware architecture, due to the compact, self-aligned and cost effective nature of laser sensors. In this work, we have implemented an Improved Phase Unwrapping Method on the Multi-core system and measures the performance and power efficiency for different target technologies. The results on the multi-core system show that the Improved Phase Unwrapping Method gets 4.09 times performance improvement and consumes 2.04 times less energy than the uni-core system.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125231339","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918962
Mahwish Pervaiz, Alyia Amir
the presented paper is concerned with emotion recognition from speech based on micro and macro level features. Prosodic and temporal features are explored to identify their significance and contribution in emotion recognition system. Emotions are extracted at segment (micro) level and macro (utterance) level. The method has been verified using two emotional speech database with support vector machine classifier. Results at both levels are compared and better recognition rate are achieved at micro level than global statistics.
{"title":"Comparative study of features extraction for speech's emotion at micro and macro level","authors":"Mahwish Pervaiz, Alyia Amir","doi":"10.1109/C-CODE.2017.7918962","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918962","url":null,"abstract":"the presented paper is concerned with emotion recognition from speech based on micro and macro level features. Prosodic and temporal features are explored to identify their significance and contribution in emotion recognition system. Emotions are extracted at segment (micro) level and macro (utterance) level. The method has been verified using two emotional speech database with support vector machine classifier. Results at both levels are compared and better recognition rate are achieved at micro level than global statistics.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131625610","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918892
N. Saeed, Muhammad Haris, Mian Imtiaz Ul Haq
In this paper a local geometry alignment algorithm is presented for locating the primary users (PUs) and Secondary users (SUs) in cognitive radio network. Based on the estimated distance between PUs and SUs for the neighbors within certain communication range, the relative configuration of all the users in the network is obtained initially and is refined finally to get the global position of every user in the network. The localization performance of the proposed approach is compared to multidimensional scaling and principal component analysis. Furthermore the lower bound on error i.e., the Cramer Rao lower bound (CRLB) is also derived to check the performance of the proposed algorithm.
{"title":"Jointly locating the primary and secondary users in cognitive radio networks","authors":"N. Saeed, Muhammad Haris, Mian Imtiaz Ul Haq","doi":"10.1109/C-CODE.2017.7918892","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918892","url":null,"abstract":"In this paper a local geometry alignment algorithm is presented for locating the primary users (PUs) and Secondary users (SUs) in cognitive radio network. Based on the estimated distance between PUs and SUs for the neighbors within certain communication range, the relative configuration of all the users in the network is obtained initially and is refined finally to get the global position of every user in the network. The localization performance of the proposed approach is compared to multidimensional scaling and principal component analysis. Furthermore the lower bound on error i.e., the Cramer Rao lower bound (CRLB) is also derived to check the performance of the proposed algorithm.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124861232","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918891
Muhammad Sajjad Khan, Insoo Koo
Spectrum sensing is one of the key functionalities in cognitive radio (CR) which enables opportunistic spectrum access. How to promptly sense the presence of the primary user (PU) is a key issue to CR network. The quick detection of the PU is critical such that violation of the detection on time will cause an interference to the PU. Particularly the spectrum sensing can be evaluated by how quickly it detect the changes. This involves detecting reliably and quickly possibly weak primary user signal. In this work, we propose a cluster based quickest change detection algorithm for the spectrum sensing. The Proposed scheme utilizes one-sided CUSUM (cumulative sum) algorithm at the user level, and proposed an algorithm at the cluster level which maintain 1-slot history of the user at the cluster head (CH), which also helps in detecting the change at the cluster level. CH only collect data from the users which observe change in their slot. By exploiting the advantage of one-sided CUSUM algorithm with cluster-based approach, the proposed scheme achieve the minimum detection delay subject to false alarm constraint. With simulation results, we demonstrate that the proposed scheme has faster detection as compare to conventional detection scheme.
{"title":"Primary user detection in cognitive radio networks through quickest detection","authors":"Muhammad Sajjad Khan, Insoo Koo","doi":"10.1109/C-CODE.2017.7918891","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918891","url":null,"abstract":"Spectrum sensing is one of the key functionalities in cognitive radio (CR) which enables opportunistic spectrum access. How to promptly sense the presence of the primary user (PU) is a key issue to CR network. The quick detection of the PU is critical such that violation of the detection on time will cause an interference to the PU. Particularly the spectrum sensing can be evaluated by how quickly it detect the changes. This involves detecting reliably and quickly possibly weak primary user signal. In this work, we propose a cluster based quickest change detection algorithm for the spectrum sensing. The Proposed scheme utilizes one-sided CUSUM (cumulative sum) algorithm at the user level, and proposed an algorithm at the cluster level which maintain 1-slot history of the user at the cluster head (CH), which also helps in detecting the change at the cluster level. CH only collect data from the users which observe change in their slot. By exploiting the advantage of one-sided CUSUM algorithm with cluster-based approach, the proposed scheme achieve the minimum detection delay subject to false alarm constraint. With simulation results, we demonstrate that the proposed scheme has faster detection as compare to conventional detection scheme.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130761878","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 : 2017-03-01DOI: 10.1109/C-CODE.2017.7918951
Abrar Hashmi, M. Hanif, A. I. Bhatti
Sliding mode control is one of the most robust nonlinear control schemes among many nonlinear controllers due to its robustness property and ability to decouple systems in lower dimensions. In order to overcome the known or bounded uncertainties many nonlinear controllers can work well, however, some of them fails to capture the unbounded uncertainties. The modeling of a real time system plays a vital role in mechanical system engineering. The exact modeling of a system is essential in order to analyze the behavior of the system. This article analyze the sliding mode control (SMC) behavior for nonlinear models and nonlinear uncertainties.
{"title":"Simulation and analysis of duffing oscillator using sliding mode control","authors":"Abrar Hashmi, M. Hanif, A. I. Bhatti","doi":"10.1109/C-CODE.2017.7918951","DOIUrl":"https://doi.org/10.1109/C-CODE.2017.7918951","url":null,"abstract":"Sliding mode control is one of the most robust nonlinear control schemes among many nonlinear controllers due to its robustness property and ability to decouple systems in lower dimensions. In order to overcome the known or bounded uncertainties many nonlinear controllers can work well, however, some of them fails to capture the unbounded uncertainties. The modeling of a real time system plays a vital role in mechanical system engineering. The exact modeling of a system is essential in order to analyze the behavior of the system. This article analyze the sliding mode control (SMC) behavior for nonlinear models and nonlinear uncertainties.","PeriodicalId":344222,"journal":{"name":"2017 International Conference on Communication, Computing and Digital Systems (C-CODE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129481228","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
扫码关注我们
求助内容：
应助结果提醒方式：