In the anti-spam field, raw reputation is the current mailing behavior of one email server. Meanwhile, it is the foundation of the distributed spam processing technology based on reputation mechanism. In this paper, the advantages and disadvantages of the existing several raw reputation generating approaches are analyzed, and a new method: MSGuard is proposed. MSGuard is a weighted raw reputation generating approach based on similarity. Simulation results demonstrate that: in the scenario which the malicious nodes provide inauthentic evaluations, the average differences between the expectations and the raw reputations calculated by TrustGuard and MSRep are 0.4 and 0.5 respectively. And the difference of either EigenTrust or MSGuard is only approximate 0.05. In the scenario which the collusive and disguised malicious nodes exist, the difference between the expectation and the raw reputation calculated by EigenTrust is 0.25, and it is less than 0.1 by MSGuard. MSGuard can reflect nodes’ actual mailing situations more accurately.
{"title":"A Weighted Raw Reputation Generating Approach Based on Similarity","authors":"Jianzhong Zhang, Xiaoming Zhang, Jianbin Zhu, Jingdong Xu","doi":"10.1109/ICCSN.2010.25","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.25","url":null,"abstract":"In the anti-spam field, raw reputation is the current mailing behavior of one email server. Meanwhile, it is the foundation of the distributed spam processing technology based on reputation mechanism. In this paper, the advantages and disadvantages of the existing several raw reputation generating approaches are analyzed, and a new method: MSGuard is proposed. MSGuard is a weighted raw reputation generating approach based on similarity. Simulation results demonstrate that: in the scenario which the malicious nodes provide inauthentic evaluations, the average differences between the expectations and the raw reputations calculated by TrustGuard and MSRep are 0.4 and 0.5 respectively. And the difference of either EigenTrust or MSGuard is only approximate 0.05. In the scenario which the collusive and disguised malicious nodes exist, the difference between the expectation and the raw reputation calculated by EigenTrust is 0.25, and it is less than 0.1 by MSGuard. MSGuard can reflect nodes’ actual mailing situations more accurately.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127869905","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}
Scalability of ad hoc network has been one of the important areas of research in the field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for a network size of 50 to 100 nodes. Because of multi-hop nature of ad hoc network, scalability is directly related to routing protocols. In this paper, we have conducted simulations to investigate scalability of DSR, AODV, and LAR routing protocols using prediction based link availability model. This also proves that whether link prediction model also adds up to the scalability of routing protocol. From simulation results, it is clear that performance of routing is improved due to link prediction model and the protocols are scalable with the model. We have tested them for 100 to 1000 nodes.
{"title":"Scalability of Routing in MANET","authors":"Prashant Singh, D. K. Lobiyal","doi":"10.1109/ICCSN.2010.54","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.54","url":null,"abstract":"Scalability of ad hoc network has been one of the important areas of research in the field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for a network size of 50 to 100 nodes. Because of multi-hop nature of ad hoc network, scalability is directly related to routing protocols. In this paper, we have conducted simulations to investigate scalability of DSR, AODV, and LAR routing protocols using prediction based link availability model. This also proves that whether link prediction model also adds up to the scalability of routing protocol. From simulation results, it is clear that performance of routing is improved due to link prediction model and the protocols are scalable with the model. We have tested them for 100 to 1000 nodes.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052294","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}
This paper introduces a novel segmentation scheme based on the template-matching method is used for identifying cancerous part in the mammogram image. These templates are defined according to the shape, and brightness of the masses or micro calcifications. Earlier to template matching, median filtering enhances the mammogram images, Edge detection operators such as Sobel, Prewitts, Laplacian and Laplacian of Guassian masks are enhances and detect the edges and then edge detection is used to detect the shape of the cancerous part. In the template matching, the threshold is set for the calculated values of the crosscorrelation. Then the percentile method is used to set an overall threshold for each mammogram image. The segmentation accuracy is increased as the proposed scheme is more robust to noise and hence, it prevents over segmentation in final segmented images. It is exposed that, this method of template matching for identifying early stage cancerous parts gives considerably better detection results
{"title":"Identifying Masses in Mammograms Using Template Matching","authors":"K. P. Lochanambal, M. Karnan, R. Sivakumar","doi":"10.1109/ICCSN.2010.95","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.95","url":null,"abstract":"This paper introduces a novel segmentation scheme based on the template-matching method is used for identifying cancerous part in the mammogram image. These templates are defined according to the shape, and brightness of the masses or micro calcifications. Earlier to template matching, median filtering enhances the mammogram images, Edge detection operators such as Sobel, Prewitts, Laplacian and Laplacian of Guassian masks are enhances and detect the edges and then edge detection is used to detect the shape of the cancerous part. In the template matching, the threshold is set for the calculated values of the crosscorrelation. Then the percentile method is used to set an overall threshold for each mammogram image. The segmentation accuracy is increased as the proposed scheme is more robust to noise and hence, it prevents over segmentation in final segmented images. It is exposed that, this method of template matching for identifying early stage cancerous parts gives considerably better detection results","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133060681","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}
Recent advances in wireless communications and electronics have promoted the development of wireless sensor networks (WSN) for a wide variety of applications. The size and power constraints of sensor nodes are the main concerns in the design of robust and efficient routing protocols. Consequently, various approaches, such as data-centric approach, hierarchical approach and location-based approach, are available. Each may be designed for a particular application with specific requirements. In this paper, we design and implement a data-centric routing protocol for WSNs, namely Centralized Sensor Protocol for Information via Negotiation (CSPIN), which combines the advertise-request-transfer process and a routing distribution mechanism. Implementation of the protocol was completed with the Crossbow MicaZ hardware using nesC/TinyOS.
无线通信和电子学的最新进展促进了无线传感器网络(WSN)的发展，用于各种应用。传感器节点的大小和功率限制是设计鲁棒和高效路由协议的主要问题。因此，可以使用各种方法，例如以数据为中心的方法、分层方法和基于位置的方法。每个都可以设计为具有特定要求的特定应用。本文设计并实现了一种以数据为中心的wsn路由协议，即CSPIN (Centralized Sensor protocol for Information via Negotiation)，该协议结合了发布-请求-传输过程和路由分配机制。该协议的实现是在nesC/TinyOS的Crossbow MicaZ硬件上完成的。
{"title":"Design and Implementation of a Centralized Sensor Protocol for Information via Negotiation","authors":"T. Pham, Xue Jun Li, P. Chong, Y. Leong","doi":"10.1109/ICCSN.2010.90","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.90","url":null,"abstract":"Recent advances in wireless communications and electronics have promoted the development of wireless sensor networks (WSN) for a wide variety of applications. The size and power constraints of sensor nodes are the main concerns in the design of robust and efficient routing protocols. Consequently, various approaches, such as data-centric approach, hierarchical approach and location-based approach, are available. Each may be designed for a particular application with specific requirements. In this paper, we design and implement a data-centric routing protocol for WSNs, namely Centralized Sensor Protocol for Information via Negotiation (CSPIN), which combines the advertise-request-transfer process and a routing distribution mechanism. Implementation of the protocol was completed with the Crossbow MicaZ hardware using nesC/TinyOS.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132071990","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}
When doing test activities using TTCN-3, achieving Codec needs testers to write a lot of codes. In order to reduce testing cost, this paper proposes a method to automatically generate Codec. The method firstly defines an abstract model for TTCN-3 test suites, TTCN-3 type tree, and then, we issue the method contains three algorithms, including the algorithm of establishing TTCN-3 type tree according to the TTCN-3 Test Suites, the algorithm of encoding each node according to the preorder traversal sequence, the algorithm of decoding each node according to the postorder traversal sequence. The method is applicable to all TTCN-3 test suites and greatly improves test efficiency. At last, an example, an information manage system developed by .net, demonstrates that the method is usable and high efficient.
{"title":"A Method to Automatically Generate Codec Based TTCN-3 to Software Testing","authors":"Meng Sun, Fengyi Zou, Jun Ma, Huiling Shi","doi":"10.1109/ICCSN.2010.22","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.22","url":null,"abstract":"When doing test activities using TTCN-3, achieving Codec needs testers to write a lot of codes. In order to reduce testing cost, this paper proposes a method to automatically generate Codec. The method firstly defines an abstract model for TTCN-3 test suites, TTCN-3 type tree, and then, we issue the method contains three algorithms, including the algorithm of establishing TTCN-3 type tree according to the TTCN-3 Test Suites, the algorithm of encoding each node according to the preorder traversal sequence, the algorithm of decoding each node according to the postorder traversal sequence. The method is applicable to all TTCN-3 test suites and greatly improves test efficiency. At last, an example, an information manage system developed by .net, demonstrates that the method is usable and high efficient.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913841","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}
Current technologies are helpful in many areas of human live. Focus of this article is on combination of technology and statistics with the aim of building mobile emergency system. Such system is based on evaluation of input signals to the mobile phone from its sensors, like VGA camera or microphone, and further processing with help of advanced statistical methods both in mobile phone and in the central processing machine. The purpose of this idea is to enable the mobile phone automatically alarm correct emergency process and help the person in emergency situation. The results can help thousands of people every day, when they are in crisis situation and unable to call for help.
{"title":"On New Opportunities of Saving Human Lives Using Mobile Phones","authors":"Ondrej Matustik, Pavel Pesout","doi":"10.1109/ICCSN.2010.71","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.71","url":null,"abstract":"Current technologies are helpful in many areas of human live. Focus of this article is on combination of technology and statistics with the aim of building mobile emergency system. Such system is based on evaluation of input signals to the mobile phone from its sensors, like VGA camera or microphone, and further processing with help of advanced statistical methods both in mobile phone and in the central processing machine. The purpose of this idea is to enable the mobile phone automatically alarm correct emergency process and help the person in emergency situation. The results can help thousands of people every day, when they are in crisis situation and unable to call for help.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875102","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}
Parallel Downloading, which divides a file into many pieces and assigns each piece to one of the servers which store the file, has been proposed and reported to achieve high speed file retrieval from many servers in parallel. The conventional method which adopts TCP as a transport protocol has a problem that its performance deteriorates in the network where packet losses frequently occur at the data-link layer. To address this issue, we have researched a parallel downloading method which uses SCTP instead of TCP as a transport protocol and focuses on its multistream feature. It is believed that the multistream function is a promising technique to alleviate the effect of packet loss problems in ubiquitous networks including wireless networks. We discuss how to realize the effective parallel downloading method using SCTP multistream and evaluate it. Here, we use only one server to simplify the problem. In this paper, on the network with various condition described by delay and loss rate, we conducted simulation experiments using various combination of parameters such as the number of concurrent requests, that of streams, and the division number. As a result, characteristics on parallel downloads using SCTP multistream have been clarified.
{"title":"Effect of SCTP Multistream Function Applied to Parallel Downloading","authors":"J. Funasaka, Toshio Niyagawa, K. Ishida","doi":"10.1109/ICCSN.2010.86","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.86","url":null,"abstract":"Parallel Downloading, which divides a file into many pieces and assigns each piece to one of the servers which store the file, has been proposed and reported to achieve high speed file retrieval from many servers in parallel. The conventional method which adopts TCP as a transport protocol has a problem that its performance deteriorates in the network where packet losses frequently occur at the data-link layer. To address this issue, we have researched a parallel downloading method which uses SCTP instead of TCP as a transport protocol and focuses on its multistream feature. It is believed that the multistream function is a promising technique to alleviate the effect of packet loss problems in ubiquitous networks including wireless networks. We discuss how to realize the effective parallel downloading method using SCTP multistream and evaluate it. Here, we use only one server to simplify the problem. In this paper, on the network with various condition described by delay and loss rate, we conducted simulation experiments using various combination of parameters such as the number of concurrent requests, that of streams, and the division number. As a result, characteristics on parallel downloads using SCTP multistream have been clarified.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121266391","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}
Due to the growing number of mobile users, global connectivity, and the small size of cells, one of the most critical issues regarding these networks is location management. The challenging task in a cellular system is to track the location of the mobile users effectively so that the connection establishment cost and delay is low. In recent years, several strategies have been proposed to improve the performance of the location management procedure in cellular networks. In this paper, we propose intelligent approach by taking the User Profile History (UPH); to reduce the location update cost. The synergistic integration of different soft computing tools is best demonstrated in this paper for location and mobility management in cellular networks. The results obtained confirm the efficiency of UPH in significantly reducing the costs of both location updates and call delivery procedures when compared to the various other strategies well-known in the literature.
{"title":"Intelligent Location Management Using Soft Computing Technique","authors":"J. Singh, M. Karnan","doi":"10.1109/ICCSN.2010.60","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.60","url":null,"abstract":"Due to the growing number of mobile users, global connectivity, and the small size of cells, one of the most critical issues regarding these networks is location management. The challenging task in a cellular system is to track the location of the mobile users effectively so that the connection establishment cost and delay is low. In recent years, several strategies have been proposed to improve the performance of the location management procedure in cellular networks. In this paper, we propose intelligent approach by taking the User Profile History (UPH); to reduce the location update cost. The synergistic integration of different soft computing tools is best demonstrated in this paper for location and mobility management in cellular networks. The results obtained confirm the efficiency of UPH in significantly reducing the costs of both location updates and call delivery procedures when compared to the various other strategies well-known in the literature.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116842681","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}
Rootkits refer to software that is used to hide the presence of malware from system/network administrators and permit an attacker to take control of a computer. In our previous work, we designed a system that would categorize rootkits based on the hooks that had been created. Focusing on rootkits that use inline function hooking techniques, we showed that our system could successfully categorize a sample of rootkits using unsupervised EM clustering. In this paper, we extend our previous work by outlining a new procedure to help system/network administrators identify the rootkits that have infected their machines. Using a logistic regression model for profiling families of rootkits, we were able to identify at least one of the rootkits that had infected each of the systems that we tested.
{"title":"A New Procedure to Help System/Network Administrators Identify Multiple Rootkit Infections","authors":"Desmond Lobo, P. Watters, Xin-Wen Wu","doi":"10.1109/ICCSN.2010.14","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.14","url":null,"abstract":"Rootkits refer to software that is used to hide the presence of malware from system/network administrators and permit an attacker to take control of a computer. In our previous work, we designed a system that would categorize rootkits based on the hooks that had been created. Focusing on rootkits that use inline function hooking techniques, we showed that our system could successfully categorize a sample of rootkits using unsupervised EM clustering. In this paper, we extend our previous work by outlining a new procedure to help system/network administrators identify the rootkits that have infected their machines. Using a logistic regression model for profiling families of rootkits, we were able to identify at least one of the rootkits that had infected each of the systems that we tested.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116785668","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}
The encrypting time of traditional AES algorithm is too long to meet the need of fast encryption. For this point, the high-performance computing capability of Graphic Processing Unit has become the hot issue of research. This paper proposes that AES algorithm is improved by use of GPU’s high performance computing capability and compared with that using CPU. And AES encryption algorithm base on high performance computing of GPU is also completed. The experiment shows that the computing speed of AES encryption algorithm based on GPU is obviously higher than AES encryption algorithm based on CPU, thus the encryption efficiency is increased.
{"title":"AES Encryption Algorithm Based on the High Performance Computing of GPU","authors":"Fei Shao, ZiNan Chang, Yi Zhang","doi":"10.1109/ICCSN.2010.124","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.124","url":null,"abstract":"The encrypting time of traditional AES algorithm is too long to meet the need of fast encryption. For this point, the high-performance computing capability of Graphic Processing Unit has become the hot issue of research. This paper proposes that AES algorithm is improved by use of GPU’s high performance computing capability and compared with that using CPU. And AES encryption algorithm base on high performance computing of GPU is also completed. The experiment shows that the computing speed of AES encryption algorithm based on GPU is obviously higher than AES encryption algorithm based on CPU, thus the encryption efficiency is increased.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925291","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
扫码关注我们
求助内容：
应助结果提醒方式：