Pub Date : 2016-09-01DOI: 10.1109/IKT.2016.7777768
M. Najimi, A. Ebrahimzadeh, S. M. Hosseini Andargoli
In this paper, we propose a sensing nodes selection scheme to achieve energy efficiency in cooperative spectrum sensing for cognitive sensor networks. In cooperative spectrum sensing, nodes send their results to a fusion center (FC) to make the final decision using a fusion rule. While minimize the energy consumption, we also consider improving the detection performance in our approach by maximizing the global probability of detection and minimizing the global probability of false alarm. Moreover, we simplify the resulted NP-complete problem by mapping the assignment indices from integer to the real domain. A closed-form equation is obtained to determine the priority of nodes for sensing and a solution is provided based on convex optimization techniques. The proposed algorithm is independent of the distribution of the global probability of detection and the type of selecting fusion rule. Simulation results is investigated for AND and OR fusion rules and show that our algorithm is very effective in saving energy in different scenarios.
{"title":"Energy-efficient cooperative spectrum sensing using two hard decision rules","authors":"M. Najimi, A. Ebrahimzadeh, S. M. Hosseini Andargoli","doi":"10.1109/IKT.2016.7777768","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777768","url":null,"abstract":"In this paper, we propose a sensing nodes selection scheme to achieve energy efficiency in cooperative spectrum sensing for cognitive sensor networks. In cooperative spectrum sensing, nodes send their results to a fusion center (FC) to make the final decision using a fusion rule. While minimize the energy consumption, we also consider improving the detection performance in our approach by maximizing the global probability of detection and minimizing the global probability of false alarm. Moreover, we simplify the resulted NP-complete problem by mapping the assignment indices from integer to the real domain. A closed-form equation is obtained to determine the priority of nodes for sensing and a solution is provided based on convex optimization techniques. The proposed algorithm is independent of the distribution of the global probability of detection and the type of selecting fusion rule. Simulation results is investigated for AND and OR fusion rules and show that our algorithm is very effective in saving energy in different scenarios.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128268159","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777757
Rasoul Seidipiri, A. Patooghy, Sima Afsharpour, M. Fazeli
This paper proposes and evaluates a performance efficient application mapping algorithm for mesh-based NoCs. The proposed algorithm first prioritizes tasks of the given application graph based on their total in/out communication traffic. Then a task with the most communication traffic is selected and mapped onto the center part of the mesh topology i.e., a core with the most available communication channels. After that, repeatedly, the next task is selected in a way that has the most communications with the already mapped tasks. Such a task is mapped onto the core which its degree is proportional to the tasks link degree. The proposed method is evaluated by Noxim which is a cycle-accurate NoC simulator in terms of communication cost i.e., to total number of packets traversed through the network to complete the application graph. The proposed method is compared with several previously proposed mapping algorithms including NMAP, CMAP, LMAP, PSMAP, and CASTNET. Comparisons show that the proposed method offers better performance and consumes lower energy in the network.
{"title":"RASMAP: An efficient heuristic application mapping algorithm for network-on-chips","authors":"Rasoul Seidipiri, A. Patooghy, Sima Afsharpour, M. Fazeli","doi":"10.1109/IKT.2016.7777757","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777757","url":null,"abstract":"This paper proposes and evaluates a performance efficient application mapping algorithm for mesh-based NoCs. The proposed algorithm first prioritizes tasks of the given application graph based on their total in/out communication traffic. Then a task with the most communication traffic is selected and mapped onto the center part of the mesh topology i.e., a core with the most available communication channels. After that, repeatedly, the next task is selected in a way that has the most communications with the already mapped tasks. Such a task is mapped onto the core which its degree is proportional to the tasks link degree. The proposed method is evaluated by Noxim which is a cycle-accurate NoC simulator in terms of communication cost i.e., to total number of packets traversed through the network to complete the application graph. The proposed method is compared with several previously proposed mapping algorithms including NMAP, CMAP, LMAP, PSMAP, and CASTNET. Comparisons show that the proposed method offers better performance and consumes lower energy in the network.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365325","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777776
Maziyar Grami, Reza Gheibi, F. Rahimi
Today, development of internet causes a fast growth of internet shops and retailers and makes them as a main marketing channel. This kind of marketing generates a numerous transaction and data which are potentially valuable. Using data mining is an alternative to discover frequent patterns and association rules from datasets. In this paper, we use data mining techniques for discovering frequent customers' buying patterns from a Customer Relationship Management database. There are lots of algorithms for this purpose, such as Apriori and FP-Growth. However, they may not have efficient performance when the data is big, therefore various meta-heuristic methods can be an alternative. In this paper we first excerpt loyal customers by using RFM criterion to face more reliable answers and create relevant dataset. Then association rules are discovered using proposed genetic algorithm. The results showed that our proposed approach is more efficient and have some distinction in compare with other methods mentioned in this research.
{"title":"A novel association rule mining using genetic algorithm","authors":"Maziyar Grami, Reza Gheibi, F. Rahimi","doi":"10.1109/IKT.2016.7777776","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777776","url":null,"abstract":"Today, development of internet causes a fast growth of internet shops and retailers and makes them as a main marketing channel. This kind of marketing generates a numerous transaction and data which are potentially valuable. Using data mining is an alternative to discover frequent patterns and association rules from datasets. In this paper, we use data mining techniques for discovering frequent customers' buying patterns from a Customer Relationship Management database. There are lots of algorithms for this purpose, such as Apriori and FP-Growth. However, they may not have efficient performance when the data is big, therefore various meta-heuristic methods can be an alternative. In this paper we first excerpt loyal customers by using RFM criterion to face more reliable answers and create relevant dataset. Then association rules are discovered using proposed genetic algorithm. The results showed that our proposed approach is more efficient and have some distinction in compare with other methods mentioned in this research.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128169583","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777775
N. Hemmati, O. Tabibzadeh, Muharram Mansoorizadeh
Universal Dependencies is the latest standard annotation scheme available, aiming at cross-linguistically consistent treebank annotation. It has already been adapted to a large number of languages including Persian. The trend, however, has been to take into account the original principles of dependency grammar rather than a description of the specific language in dependency terms. This paper reports an attempt to adapt Universal Dependencies to form a scheme for annotation of Persian dependency structure based on a comprehensive description of Persian syntax according to a theory introduced as the Autonomous Phrases Theory. The main idea there is that the significance of phrases should be appreciated in dependency analyses due to their cognitive reality, and the notion of valency is also extended beyond verbs. On that basis, every dependent of whatever head type is classified as either a complement or an adjunct depending on whether or not it plays a role in the valency structure of the head. A tagset was proposed consisting of fifty-three dependency relations, including fifteen original labels and the rest borrowed from the universal dependencies.
{"title":"Adaptation of universal dependencies to specific grammars: The case of Persian dependency grammar","authors":"N. Hemmati, O. Tabibzadeh, Muharram Mansoorizadeh","doi":"10.1109/IKT.2016.7777775","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777775","url":null,"abstract":"Universal Dependencies is the latest standard annotation scheme available, aiming at cross-linguistically consistent treebank annotation. It has already been adapted to a large number of languages including Persian. The trend, however, has been to take into account the original principles of dependency grammar rather than a description of the specific language in dependency terms. This paper reports an attempt to adapt Universal Dependencies to form a scheme for annotation of Persian dependency structure based on a comprehensive description of Persian syntax according to a theory introduced as the Autonomous Phrases Theory. The main idea there is that the significance of phrases should be appreciated in dependency analyses due to their cognitive reality, and the notion of valency is also extended beyond verbs. On that basis, every dependent of whatever head type is classified as either a complement or an adjunct depending on whether or not it plays a role in the valency structure of the head. A tagset was proposed consisting of fifty-three dependency relations, including fifteen original labels and the rest borrowed from the universal dependencies.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130098338","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777787
Samad Najjar-Ghabel, Shamim Yousefi, M. Z. Lighvan
Nowadays, cryptography is one of the common security mechanisms. Cryptography algorithms are used to make secure data transmission over unsecured networks. Vital applications are required to techniques that encrypt/decrypt big data at the appropriate time, because the data should be encrypted/decrypted are variable size and usually the size of them is large. In this paper, for the mentioned requirements, the counter mode cryptography (CTR) algorithm with Data Encryption Standard (DES) core is paralleled by using Graphics Processing Unit (GPU). A secondary part of our work, this parallel CTR algorithm is applied on special network on chip (NoC) architecture that designed by Heracles toolkit. The results of numerical comparison show that GPU-based implementation can be achieved better runtime in comparison to the CPU-based one. Furthermore, our final implementations show that parallel CTR mode cryptography is achieved better runtime by using special NoC that applied on FPGA board in comparison to GPU-based and CPU ones.
{"title":"A high speed implementation counter mode cryptography using hardware parallelism","authors":"Samad Najjar-Ghabel, Shamim Yousefi, M. Z. Lighvan","doi":"10.1109/IKT.2016.7777787","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777787","url":null,"abstract":"Nowadays, cryptography is one of the common security mechanisms. Cryptography algorithms are used to make secure data transmission over unsecured networks. Vital applications are required to techniques that encrypt/decrypt big data at the appropriate time, because the data should be encrypted/decrypted are variable size and usually the size of them is large. In this paper, for the mentioned requirements, the counter mode cryptography (CTR) algorithm with Data Encryption Standard (DES) core is paralleled by using Graphics Processing Unit (GPU). A secondary part of our work, this parallel CTR algorithm is applied on special network on chip (NoC) architecture that designed by Heracles toolkit. The results of numerical comparison show that GPU-based implementation can be achieved better runtime in comparison to the CPU-based one. Furthermore, our final implementations show that parallel CTR mode cryptography is achieved better runtime by using special NoC that applied on FPGA board in comparison to GPU-based and CPU ones.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117330360","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777790
Rouhollah Nabati, Ali Ghaffari Nejad, Ali Yousefi
One of the most important challenges in social network models is dissimilarity of proposed models with real networks. In this article we proposed a new small world model generator based on binary trees that simulate family and human ties. In reality family such as father, children, and grandchildren makes a path between grandfather and grandchildren. We used this property to adopt effective parameters of proposed model with real networks. Proposed model implemented in Gephi analysis and visualization software and as the result the generated graph is compared with some of the recent models.
{"title":"EDSS: An extended deterministic scale-free small world network","authors":"Rouhollah Nabati, Ali Ghaffari Nejad, Ali Yousefi","doi":"10.1109/IKT.2016.7777790","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777790","url":null,"abstract":"One of the most important challenges in social network models is dissimilarity of proposed models with real networks. In this article we proposed a new small world model generator based on binary trees that simulate family and human ties. In reality family such as father, children, and grandchildren makes a path between grandfather and grandchildren. We used this property to adopt effective parameters of proposed model with real networks. Proposed model implemented in Gephi analysis and visualization software and as the result the generated graph is compared with some of the recent models.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114549694","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777762
H. Kardanmoghaddam
Typing CAPTCHA is usually troublesome and is unpleasant for the users. But the security of some of the websites depends on it and causes that human being is distinguished from robots facing with different websites. Filling CAPTCHA by humans can be used effectively like electronization of books and different texts. In this article it has been attempted to examine using image processing for converting published and written texts to applied CAPTCHA in different websites by proposing a novel pattern.
{"title":"Proposing an algorithm for converting published and handwritten texts to CAPTCHA by using image processing","authors":"H. Kardanmoghaddam","doi":"10.1109/IKT.2016.7777762","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777762","url":null,"abstract":"Typing CAPTCHA is usually troublesome and is unpleasant for the users. But the security of some of the websites depends on it and causes that human being is distinguished from robots facing with different websites. Filling CAPTCHA by humans can be used effectively like electronization of books and different texts. In this article it has been attempted to examine using image processing for converting published and written texts to applied CAPTCHA in different websites by proposing a novel pattern.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124371536","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777778
Yousef Mostafaei, S. Pashazadeh
Ad-hoc networks consist of collections of wireless mobile nodes. Due to mobility, there exists frequent link breakage, packet loss, and need for route discovery. OLSR is proactive routing protocol that is developed for mobile ad-hoc networks. OLSR reduces the network traffic by flooding control packets efficiently and reducing unnecessary and redundant control packets. OLSR reduces the overhead of control packets using a subset of one-hop neighbors called multipoint relays for flooding control packets. Although OLSR is dedicated for mobile ad-hoc networks, but mobility of nodes does not considered in MPR selection procedure. In this paper is assumed that some nodes are stationary and packet delivery rate of the OLSR routing protocol is improved by preventing mobile nodes from being selected as multipoint relay as much as is possible. Simulation results which are implemented on Visualsense simulator, demonstrate that our proposed method reduces the packet loss ratio and number of control packets and consequently increases lifetime of networks.
{"title":"An improved OLSR routing protocol for reducing packet loss ratio in ad-hoc networks","authors":"Yousef Mostafaei, S. Pashazadeh","doi":"10.1109/IKT.2016.7777778","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777778","url":null,"abstract":"Ad-hoc networks consist of collections of wireless mobile nodes. Due to mobility, there exists frequent link breakage, packet loss, and need for route discovery. OLSR is proactive routing protocol that is developed for mobile ad-hoc networks. OLSR reduces the network traffic by flooding control packets efficiently and reducing unnecessary and redundant control packets. OLSR reduces the overhead of control packets using a subset of one-hop neighbors called multipoint relays for flooding control packets. Although OLSR is dedicated for mobile ad-hoc networks, but mobility of nodes does not considered in MPR selection procedure. In this paper is assumed that some nodes are stationary and packet delivery rate of the OLSR routing protocol is improved by preventing mobile nodes from being selected as multipoint relay as much as is possible. Simulation results which are implemented on Visualsense simulator, demonstrate that our proposed method reduces the packet loss ratio and number of control packets and consequently increases lifetime of networks.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363620","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777759
Somayeh Heibati, N. Movahedinia
Routing is considered as one of the most important processes in computer networks especially ad hoc networks. Vehicular ad hoc networks require to use efficient protocols for routing in order to exchange data between network nodes for various reasons including lack of infrastructure in some circumstances, high mobility of nodes, network dynamics and lack of trusted nodes. Because of the need for security and high reliability in vehicular ad hoc networks, one of the criteria considered in routing in these networks is inter-vehicular trust for data transmissions. In this paper, a trust-based routing protocol is proposed which takes reduced routing delay into account using fuzzy logic and improves routing. The simulation results show the effectiveness of the proposed method in terms of end-to-end latency, network efficiency, correct reception rate and incoming packets error rate compared to one of the earlier methods presented in this respect.
{"title":"Decreasing of trust-based routing delay in vehicular ad hoc networks","authors":"Somayeh Heibati, N. Movahedinia","doi":"10.1109/IKT.2016.7777759","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777759","url":null,"abstract":"Routing is considered as one of the most important processes in computer networks especially ad hoc networks. Vehicular ad hoc networks require to use efficient protocols for routing in order to exchange data between network nodes for various reasons including lack of infrastructure in some circumstances, high mobility of nodes, network dynamics and lack of trusted nodes. Because of the need for security and high reliability in vehicular ad hoc networks, one of the criteria considered in routing in these networks is inter-vehicular trust for data transmissions. In this paper, a trust-based routing protocol is proposed which takes reduced routing delay into account using fuzzy logic and improves routing. The simulation results show the effectiveness of the proposed method in terms of end-to-end latency, network efficiency, correct reception rate and incoming packets error rate compared to one of the earlier methods presented in this respect.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125398645","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 : 2016-09-01DOI: 10.1109/IKT.2016.7777774
Neda Borzouie, Negar Borzouie
The quality of service in Wireless Multimedia Sensor Networks (WMSN) is related to packet loss rate. Recently different studies have been done on developing efficient protocols in the transport layer for controlling packet loss in WMSN. However, all of these protocols are independent of the characteristics of multimedia content. Transport layer for wireless sensor networks have many challenges. One of these challenges is the congestion. It leads to undesirable effects such as increased the packet delay, energy consumption and decrease quality of video. Considering these effects provide appropriate congestion control mechanisms can lead to improve the quality of service (QoS) requirements. This paper introduces a new congestion control method for transmitting the video stream. This method gives the faster congestion detection and congestion control based on the property of video information. The experimental results shows that our method provide performance improvement in terms of high video quality, packet loss, energy conservation and delay compared to other protocols.
{"title":"Improve the quality of services to help congestion control flows to send a video in wireless multimedia sensor networks","authors":"Neda Borzouie, Negar Borzouie","doi":"10.1109/IKT.2016.7777774","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777774","url":null,"abstract":"The quality of service in Wireless Multimedia Sensor Networks (WMSN) is related to packet loss rate. Recently different studies have been done on developing efficient protocols in the transport layer for controlling packet loss in WMSN. However, all of these protocols are independent of the characteristics of multimedia content. Transport layer for wireless sensor networks have many challenges. One of these challenges is the congestion. It leads to undesirable effects such as increased the packet delay, energy consumption and decrease quality of video. Considering these effects provide appropriate congestion control mechanisms can lead to improve the quality of service (QoS) requirements. This paper introduces a new congestion control method for transmitting the video stream. This method gives the faster congestion detection and congestion control based on the property of video information. The experimental results shows that our method provide performance improvement in terms of high video quality, packet loss, energy conservation and delay compared to other protocols.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117320936","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
扫码关注我们
求助内容：
应助结果提醒方式：