In the unstructured P2P networks, the flooding resource search method may cause much communication overhead, and severely constrains the scalability of network. In order to overcome this disadvantage, a new search strategy named TTL-Search based on the local caching and the scope of searching requests is proposed in this paper. According to this strategy, the searching process is divided into two stages, and each stage adopts different forwarding strategies. Analysis and experimental results show that, TTL-Search can overcome blindness of flooding search, and also can reduce redundancy overhead caused by query to some extend. So it can improve query success rate, and can be efficiently applied in the unstructured P2P network searching.
{"title":"A New Strategy of Resource Searching in Unstructured P2P Network","authors":"Jianyong Wang, Yuling Li, Futing Gong, Wei Chen","doi":"10.1109/ICCSN.2010.120","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.120","url":null,"abstract":"In the unstructured P2P networks, the flooding resource search method may cause much communication overhead, and severely constrains the scalability of network. In order to overcome this disadvantage, a new search strategy named TTL-Search based on the local caching and the scope of searching requests is proposed in this paper. According to this strategy, the searching process is divided into two stages, and each stage adopts different forwarding strategies. Analysis and experimental results show that, TTL-Search can overcome blindness of flooding search, and also can reduce redundancy overhead caused by query to some extend. So it can improve query success rate, and can be efficiently applied in the unstructured P2P network searching.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"47 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":"134007272","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}
Xing Wang, Binxing Fang, Hong-li Zhang, Hui He, Gang Xu
Existing network damage assessment method fall short because they either lack correlation adjustment among indexes or without conclusive evidence to demonstrated the degree does represent the real situation of the network. This paper proposed a method to adjustment index correlation based on Orthogonalization. The advantages of this method for evaluation damage degree of network have been demonstrated from two simulation experiments. One is damage degree comparisons in difference basic topologies. Another is worm propagation in campus topology. The results show that network suffered by distinct damage with the same packet creation rate and traffic generate model in different basic topologies. The worm propagation experiment has demonstrated that the method can reflected the dynamic process of network availability damage accurately and integrally.
{"title":"Index Correlation Adjustment Based on Orthogonalization for Network Damage Assessment","authors":"Xing Wang, Binxing Fang, Hong-li Zhang, Hui He, Gang Xu","doi":"10.1109/ICCSN.2010.110","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.110","url":null,"abstract":"Existing network damage assessment method fall short because they either lack correlation adjustment among indexes or without conclusive evidence to demonstrated the degree does represent the real situation of the network. This paper proposed a method to adjustment index correlation based on Orthogonalization. The advantages of this method for evaluation damage degree of network have been demonstrated from two simulation experiments. One is damage degree comparisons in difference basic topologies. Another is worm propagation in campus topology. The results show that network suffered by distinct damage with the same packet creation rate and traffic generate model in different basic topologies. The worm propagation experiment has demonstrated that the method can reflected the dynamic process of network availability damage accurately and integrally.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"57 42","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134225561","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 3rd generation partnership project (3GPP) long term evolution (LTE) standard uses single carrier frequency division multiple access (SCFDMA) scheme for the uplink transmissions and orthogonal frequency division multiplexing access (OFDMA) in downlink. SCFDMA uses DFT spreading prior to OFDMA modulation to map the signal from each user to a subset of the available subcarriers i.e., single carrier modulation. The efficiency of a power amplifier is determined by the peak to average power ratio (PAPR) of the modulated signal. In this paper, we analyze the PAPR in 3GPP LTE systems using root raised cosine based filter. Simulation results show that the SCFDMA subcarrier mapping has a significantly lower PAPR compared to OFDMA. Also comparing the three forms of SCFDMA subcarrier mapping, results show that interleave FDMA (IFDMA) subcarrier mapping with proposed root raised cosine filter reduced PAPR significantly than localized FDMA (LFDMA) and distributed (DFDMA) mapping. This improves its radio frequency (RF) power amplifier efficiency and also the mean power output from a battery driven mobile terminal.
{"title":"Peak to Average Power Ratio Analysis for LTE Systems","authors":"M. Rana, M. S. Islam, A. Kouzani","doi":"10.1109/ICCSN.2010.53","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.53","url":null,"abstract":"The 3rd generation partnership project (3GPP) long term evolution (LTE) standard uses single carrier frequency division multiple access (SCFDMA) scheme for the uplink transmissions and orthogonal frequency division multiplexing access (OFDMA) in downlink. SCFDMA uses DFT spreading prior to OFDMA modulation to map the signal from each user to a subset of the available subcarriers i.e., single carrier modulation. The efficiency of a power amplifier is determined by the peak to average power ratio (PAPR) of the modulated signal. In this paper, we analyze the PAPR in 3GPP LTE systems using root raised cosine based filter. Simulation results show that the SCFDMA subcarrier mapping has a significantly lower PAPR compared to OFDMA. Also comparing the three forms of SCFDMA subcarrier mapping, results show that interleave FDMA (IFDMA) subcarrier mapping with proposed root raised cosine filter reduced PAPR significantly than localized FDMA (LFDMA) and distributed (DFDMA) mapping. This improves its radio frequency (RF) power amplifier efficiency and also the mean power output from a battery driven mobile terminal.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"84 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":"115120683","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}
Kaikuo Xu, Changjie Tang, Rong Tang, G. Ali, Jun Zhu
UCINET, Pajek, Networkx, iGraph, JUNG and statnet, are commonly used to perform analysis with complex network model. The scalability, and function coverage of these six software packages are assessed and compared. Some randomly generated datasets are used to evaluate the performance of these software packages with regard to input/output (I/O), basic graph algorithms, statistical metrics computation, graph generation, community detection, and visualization. A metric regarding both numbers of the nodes and the edges of complex networks, which is called Maximum Expected Network Processing Ability (MENPA), is proposed to measure the scalability of software packages. Empirical results show that these six software packages are complementary rather than competitive and the difference on the scalability among these six software packages may be attributed to the varieties in both of the programming languages and the network representations.
{"title":"A Comparative Study of Six Software Packages for Complex Network Research","authors":"Kaikuo Xu, Changjie Tang, Rong Tang, G. Ali, Jun Zhu","doi":"10.1109/ICCSN.2010.34","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.34","url":null,"abstract":"UCINET, Pajek, Networkx, iGraph, JUNG and statnet, are commonly used to perform analysis with complex network model. The scalability, and function coverage of these six software packages are assessed and compared. Some randomly generated datasets are used to evaluate the performance of these software packages with regard to input/output (I/O), basic graph algorithms, statistical metrics computation, graph generation, community detection, and visualization. A metric regarding both numbers of the nodes and the edges of complex networks, which is called Maximum Expected Network Processing Ability (MENPA), is proposed to measure the scalability of software packages. Empirical results show that these six software packages are complementary rather than competitive and the difference on the scalability among these six software packages may be attributed to the varieties in both of the programming languages and the network representations.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"40 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":"129809724","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}
Previous gossip-based protocols developed for sensor networks or various kinds of P2P networks assume that all processes in a system are interested in all events occurring while communicating among them. Though all query nodes in a large group are running the same application, they might join various multicast groups depending on their interests. However, despite the significant importance of message delivery order guarantees, little work on gossip-based protocols exists supporting multicast groups and satisfying these constraints in a scalable way. In this paper, we present an efficient and scalable causal order guaranteeing multicast protocol to use only local views supporting multi-groups. In the proposed protocol, multicast groups are defined by interests associated with the processes and join/leave messages are disseminated by gossip communication based on local views. So, group memberships are dynamically changing by their own members in multicast groups with high probabilistic reliability. Also, group ID order lists are delivered to possibly overlapping multicast groups to ensure causal order delivery. Therefore, these features of the protocol might result in its very low view management cost compared with the cost incurred by maintaining hierarchical member list for delegate groups in the previous protocols.
{"title":"Decentralized Multi-group Communication Protocol Supporting Causal Order","authors":"Chayoung Kim, Jinho Ahn","doi":"10.1109/ICCSN.2010.47","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.47","url":null,"abstract":"Previous gossip-based protocols developed for sensor networks or various kinds of P2P networks assume that all processes in a system are interested in all events occurring while communicating among them. Though all query nodes in a large group are running the same application, they might join various multicast groups depending on their interests. However, despite the significant importance of message delivery order guarantees, little work on gossip-based protocols exists supporting multicast groups and satisfying these constraints in a scalable way. In this paper, we present an efficient and scalable causal order guaranteeing multicast protocol to use only local views supporting multi-groups. In the proposed protocol, multicast groups are defined by interests associated with the processes and join/leave messages are disseminated by gossip communication based on local views. So, group memberships are dynamically changing by their own members in multicast groups with high probabilistic reliability. Also, group ID order lists are delivered to possibly overlapping multicast groups to ensure causal order delivery. Therefore, these features of the protocol might result in its very low view management cost compared with the cost incurred by maintaining hierarchical member list for delegate groups in the previous protocols.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"38 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":"128881091","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}
Since the small-world effect and the scale-free characteristic discovery, the research of complex network obtained rapidly development in the past several years, the complex networks’ anti-frangibility is one of research focal points. This article analysised the scale-free networks’ frangibility, and obtained that the scale-free networks’ frangibility is mainly caused by combining attack to the hubs. From the two aspects of minimum degree and hubs, through setting maximum degree and minimum degree to control the hubs and the stochastic production connections separately, established the scale-free networks’ anti-frangibity model based on this. The simulation experiment indicated that through setting the minimum degree and controlling to hubs, can strengthen the scale-free networks’ anti-rangibility ability
{"title":"Research on Degree Control Resistance to Frangibility of Scale-Free Networks","authors":"Jingju Gao, Yongwei Meng","doi":"10.1109/ICCSN.2010.59","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.59","url":null,"abstract":"Since the small-world effect and the scale-free characteristic discovery, the research of complex network obtained rapidly development in the past several years, the complex networks’ anti-frangibility is one of research focal points. This article analysised the scale-free networks’ frangibility, and obtained that the scale-free networks’ frangibility is mainly caused by combining attack to the hubs. From the two aspects of minimum degree and hubs, through setting maximum degree and minimum degree to control the hubs and the stochastic production connections separately, established the scale-free networks’ anti-frangibity model based on this. The simulation experiment indicated that through setting the minimum degree and controlling to hubs, can strengthen the scale-free networks’ anti-rangibility ability","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 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":"130712451","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}
Automatic modulation classification (AMC) is a scheme to identify the data samples automatically. Usually, in wireless communication, especially through the Rayleigh fading channel, AMC performance will severe degrade. This paper presents a new method for AMC, using a modified Joint Power Estimation and modulation types of the transmitted signals by observing the receive Modulation Classification (JPEMC) algorithm. The advantage of our new algorithm is we don’t need the channel information as a priori. The Monte Carlo simulation shows that the performance of our algorithm can be better than the existing AMC algorithms.
{"title":"Research on Modulation Classification of MQAM Signals Using Joint Moments","authors":"Ning An, Bingbing Li, M. Huang","doi":"10.1109/ICCSN.2010.32","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.32","url":null,"abstract":"Automatic modulation classification (AMC) is a scheme to identify the data samples automatically. Usually, in wireless communication, especially through the Rayleigh fading channel, AMC performance will severe degrade. This paper presents a new method for AMC, using a modified Joint Power Estimation and modulation types of the transmitted signals by observing the receive Modulation Classification (JPEMC) algorithm. The advantage of our new algorithm is we don’t need the channel information as a priori. The Monte Carlo simulation shows that the performance of our algorithm can be better than the existing AMC algorithms.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 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":"130973991","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}
Denial of services attacks prevents legitimate users from using a service. One particular type of this attack is known as SYN flood, where external hosts attempt to overwhelm the server machine by sending a constant stream of TCP connection request. There are several approaches for dealing with this attack that firewall is one of them. In this paper we attempt to prevent of this attack with iptables firewalls.
{"title":"Preventing of SYN Flood Attack with Iptables Firewall","authors":"Sara Mirzaie, Alireza Karimi Elyato, M. Sarram","doi":"10.1109/ICCSN.2010.74","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.74","url":null,"abstract":"Denial of services attacks prevents legitimate users from using a service. One particular type of this attack is known as SYN flood, where external hosts attempt to overwhelm the server machine by sending a constant stream of TCP connection request. There are several approaches for dealing with this attack that firewall is one of them. In this paper we attempt to prevent of this attack with iptables firewalls.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"79 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":"131699913","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}
Jiho Kim, Jungyu Lee, Soonhyung Park, Ohyoung Song
Ubiquitous computing environment pursues context-aware in order words personalized service by collecting contexts through sensors located over wide area and presenting the service automatically depending not on the user’s request but on the situations that are needed. But in order to provide the personalized service, contexts collected through various sensors are needed and they include private information. Therefore, it is important to keep a balance between the convenience by presenting service and protecting private information. In this paper, we classify and grade user’s various contexts requested in ubiquitous computing environment. Based on these, we make decisions on whether to present the service or not by profile-matching between user profile and privacy requirements for providing service.
{"title":"Dynamic Privacy Management in Ubiquitous Computing Environments","authors":"Jiho Kim, Jungyu Lee, Soonhyung Park, Ohyoung Song","doi":"10.1109/ICCSN.2010.122","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.122","url":null,"abstract":"Ubiquitous computing environment pursues context-aware in order words personalized service by collecting contexts through sensors located over wide area and presenting the service automatically depending not on the user’s request but on the situations that are needed. But in order to provide the personalized service, contexts collected through various sensors are needed and they include private information. Therefore, it is important to keep a balance between the convenience by presenting service and protecting private information. In this paper, we classify and grade user’s various contexts requested in ubiquitous computing environment. Based on these, we make decisions on whether to present the service or not by profile-matching between user profile and privacy requirements for providing service.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"2008 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":"125583436","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 presents a brief introduction to Web Service and P2P technology and analyzes their advantages and disadvantages, and gets the conclusion that P2P computing platform based Web Service is an ideal Web Service implementation. The cost of establishment and maintenance of system will reduce after adopting the service integration and resource autonomy of P2P. A P2P based Web Service architecture is proposed and the working mechanism is designed in the paper. This architecture can not only provide Web Service efficiently but also guarantee the robust system.
{"title":"Research of Web Service Based on P2P","authors":"Baohua Jin, Dongyao Zou","doi":"10.1109/ICCSN.2010.24","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.24","url":null,"abstract":"This paper presents a brief introduction to Web Service and P2P technology and analyzes their advantages and disadvantages, and gets the conclusion that P2P computing platform based Web Service is an ideal Web Service implementation. The cost of establishment and maintenance of system will reduce after adopting the service integration and resource autonomy of P2P. A P2P based Web Service architecture is proposed and the working mechanism is designed in the paper. This architecture can not only provide Web Service efficiently but also guarantee the robust system.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"637 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":"122952397","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
扫码关注我们
求助内容：
应助结果提醒方式：