Shim6 is a host-centric multihoming solution for IPv6 networks which has been chosen by the IETF as a multihoming solution for the future Internet. Shim6 employs REAchability Protocol (REAP) for failure detection and recovery. REAP enables multi-addressed hosts which are involved in a communication to detect and recover path failures without breaking the transport layer sessions. One concern about deploying shim6 is the performance of REAP in large networks like campus or enterprise networks. We modeled and simulated this protocol by using stochastic activity networks (SAN) and performed an analysis of its performance. This paper presents the results of the simulation. We also investigated the effect of send timer and initial probes on the performance.
{"title":"A Performance Study on REAchability Protocol in Large Scale IPv6 Networks","authors":"H. Naderi, B. Carpenter","doi":"10.1109/ICCNT.2010.18","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.18","url":null,"abstract":"Shim6 is a host-centric multihoming solution for IPv6 networks which has been chosen by the IETF as a multihoming solution for the future Internet. Shim6 employs REAchability Protocol (REAP) for failure detection and recovery. REAP enables multi-addressed hosts which are involved in a communication to detect and recover path failures without breaking the transport layer sessions. One concern about deploying shim6 is the performance of REAP in large networks like campus or enterprise networks. We modeled and simulated this protocol by using stochastic activity networks (SAN) and performed an analysis of its performance. This paper presents the results of the simulation. We also investigated the effect of send timer and initial probes on the performance.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292368","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}
Velayutham Pavanasam, C. Subramaniam, Thulukkanam Srinivasan, J. D
The objective of this work is to propose a membrane computing model for software requirement engineering activities during the inception phase of the software development. The bio-inspired approach is used in requirement engineering for the transformation of user requirements into system requirements using a probabilistic distributed computing model with abstraction coefficients, amalgamation factors and clarity factors. The software company rules and policies are considered in the model and rewritten over a period of time. This model considers the different phases of software requirement engineering as membranes and the various requirements are considered as objects and the requirement engineering process hierarchy is modeled as a membrane structure. The key process activities like requirement analysis and requirements change management are considered as primary membranes in the model. The communication between primary membranes through corresponding reaction rules are derived to determine the design objects. The results for the transformation of various requirement engineering processes are verified using a simulation in JDesigner tool.
{"title":"Membrane Computing Model for Software Requirement Engineering","authors":"Velayutham Pavanasam, C. Subramaniam, Thulukkanam Srinivasan, J. D","doi":"10.1109/ICCNT.2010.129","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.129","url":null,"abstract":"The objective of this work is to propose a membrane computing model for software requirement engineering activities during the inception phase of the software development. The bio-inspired approach is used in requirement engineering for the transformation of user requirements into system requirements using a probabilistic distributed computing model with abstraction coefficients, amalgamation factors and clarity factors. The software company rules and policies are considered in the model and rewritten over a period of time. This model considers the different phases of software requirement engineering as membranes and the various requirements are considered as objects and the requirement engineering process hierarchy is modeled as a membrane structure. The key process activities like requirement analysis and requirements change management are considered as primary membranes in the model. The communication between primary membranes through corresponding reaction rules are derived to determine the design objects. The results for the transformation of various requirement engineering processes are verified using a simulation in JDesigner tool.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127104160","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 objective of this research is to propose a new data conjugate sub carrier mapping technique that combines ICI self cancellation method using data allocation in space-time-frequency block codes (STFBC) MIMO-OFDM system. It aims to achieve maximum diversity order and to compensate integrated effect of FO for ICI reduction in the system. Using theoretical derivation of the Common Phase Error (CPE), ICI and Carrier to Interference Ratio (CIR), a simulation model is then being used to compare with data conjugate adjacent method. The results show that the ICI contained in the received signals can be effectively reduced using the propose data conjugate method. Thus, the proposed method outperforms the adjacent method by approximately reducing the ICI at high signal to noise ratio (SNR) and CIR.
{"title":"A New Data-Conjugate Intercarrier (ICI) Self-Cancellation for ICI Reduction in Space Time Frequency Block Codes MIMO-OFDM System","authors":"A. Idris, K. Dimyati, S. Yusof","doi":"10.1109/ICCNT.2010.89","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.89","url":null,"abstract":"The objective of this research is to propose a new data conjugate sub carrier mapping technique that combines ICI self cancellation method using data allocation in space-time-frequency block codes (STFBC) MIMO-OFDM system. It aims to achieve maximum diversity order and to compensate integrated effect of FO for ICI reduction in the system. Using theoretical derivation of the Common Phase Error (CPE), ICI and Carrier to Interference Ratio (CIR), a simulation model is then being used to compare with data conjugate adjacent method. The results show that the ICI contained in the received signals can be effectively reduced using the propose data conjugate method. Thus, the proposed method outperforms the adjacent method by approximately reducing the ICI at high signal to noise ratio (SNR) and CIR.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122336256","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}
A number of models have been used for estimating frequency of accidents. Weighted and simple linear regressions are common and in the recent years artificial neural network models have also been used as prediction models of accidents. Researchers need to select and use some models with the best performance particularly with the minimum of mean square errors. In this paper, traffic volume, surface condition, heavy traffic, and monthly accident data have been analysed in two Iranian major freeways named Tehran-Qom and Karaj-Qazvin-zanjan and three different kinds of models including simple and weighted linear regression and artificial neural network have been developed for estimating the number of monthly accident based on the above input variables. The well-known software of MATLAB has been used for analytical process and principle component analysis technique has been used to ensure that input variables don’t have inter-relations. Principle components and loading have been calculated and results of PCA show that all input variables should be considered in modeling. The effectiveness of input variables based on T-test has been analyzed and the results show that traffic volume and surface condition have more effect in rural accidents. For models’ performance comparison, the mean square errors have been considered. It can be concluded, from the results, that artificial neural network has the best performance with minimum mean square errors.
{"title":"Comparison of Weighted and Simple Linear Regression and Artificial Neural Network Models in Freeway Accidents Prediction","authors":"A. Mahmoudabadi","doi":"10.1109/ICCNT.2010.73","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.73","url":null,"abstract":"A number of models have been used for estimating frequency of accidents. Weighted and simple linear regressions are common and in the recent years artificial neural network models have also been used as prediction models of accidents. Researchers need to select and use some models with the best performance particularly with the minimum of mean square errors. In this paper, traffic volume, surface condition, heavy traffic, and monthly accident data have been analysed in two Iranian major freeways named Tehran-Qom and Karaj-Qazvin-zanjan and three different kinds of models including simple and weighted linear regression and artificial neural network have been developed for estimating the number of monthly accident based on the above input variables. The well-known software of MATLAB has been used for analytical process and principle component analysis technique has been used to ensure that input variables don’t have inter-relations. Principle components and loading have been calculated and results of PCA show that all input variables should be considered in modeling. The effectiveness of input variables based on T-test has been analyzed and the results show that traffic volume and surface condition have more effect in rural accidents. For models’ performance comparison, the mean square errors have been considered. It can be concluded, from the results, that artificial neural network has the best performance with minimum mean square errors.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491936","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}
In this paper, we present an approach for improving key pre-distribution in wireless sensor networks by considering the average distance between the nodes. We compare and demonstrate that by incorporating a master key in the random pair-wise scheme, it is possible to reduce the average distance between the nodes and increase the network coverage. Our approach has the following characteristics: authenticity, scalability, flexibility and resistance to node capture. Experimental results showed that our approach is more scalable than its counterparts in random pair-wise scheme.
{"title":"Key Pre-Distribution and the Average Distance in Wireless Sensor Networks","authors":"S. Lawrence, Liao Qiaoliang, N. Mary, Fujian Bo","doi":"10.1109/ICCNT.2010.98","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.98","url":null,"abstract":"In this paper, we present an approach for improving key pre-distribution in wireless sensor networks by considering the average distance between the nodes. We compare and demonstrate that by incorporating a master key in the random pair-wise scheme, it is possible to reduce the average distance between the nodes and increase the network coverage. Our approach has the following characteristics: authenticity, scalability, flexibility and resistance to node capture. Experimental results showed that our approach is more scalable than its counterparts in random pair-wise scheme.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126479156","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 th implementation criteria to be made when th choice is between OSPF and IS-IS protocols that ar link state protocols and use the same Dijkstra algorithm for computing the best path through the network. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with OSPF and IS-IS routing protocols and it has been shown that IS-IS provides a better network and router convergence time, less bandwidth requirements and better throughput and queuing delay compared to OSPF. OSPF and IS-IS are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.
{"title":"Communication Service Provider's Choice between OSPF and IS-IS Dynamic Routing Protocols and Implementation Criteria Using OPNET","authors":"Sheela Ganesh Thorenoor","doi":"10.1109/ICCNT.2010.65","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.65","url":null,"abstract":"This paper presents th implementation criteria to be made when th choice is between OSPF and IS-IS protocols that ar link state protocols and use the same Dijkstra algorithm for computing the best path through the network. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with OSPF and IS-IS routing protocols and it has been shown that IS-IS provides a better network and router convergence time, less bandwidth requirements and better throughput and queuing delay compared to OSPF. OSPF and IS-IS are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133087588","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}
Product integration (PI) is considered as one of important processes for complex system development. The purpose of the PI process is to ensure that interfaces of components are compatible and able to work properly through the product life cycle. In case of changes, the cooperation between interfaces should be carefully managed and controlled for the completeness and compatibility of the overall system. In this research we propose a method for verifying interface compatibility of components from design document by extracting interface description from Unified Modeling Language (UML) component diagram and class diagram. Interface description is then used for constructing component dependency graph of which the traversal will automate the verification of component interface compatibility.
{"title":"An Approach to Verifying Interface Compatibility of Components with Component Dependency Graph","authors":"W. Areeprayolkij, Y. Limpiyakorn, D. Gansawat","doi":"10.1109/ICCNT.2010.81","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.81","url":null,"abstract":"Product integration (PI) is considered as one of important processes for complex system development. The purpose of the PI process is to ensure that interfaces of components are compatible and able to work properly through the product life cycle. In case of changes, the cooperation between interfaces should be carefully managed and controlled for the completeness and compatibility of the overall system. In this research we propose a method for verifying interface compatibility of components from design document by extracting interface description from Unified Modeling Language (UML) component diagram and class diagram. Interface description is then used for constructing component dependency graph of which the traversal will automate the verification of component interface compatibility.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009870","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}
Arash Habibi Lashkari, Behrang Parhizkar, Mike Ng Ah Ngan
The easy access and availability of wireless technologies and mobile computing and internet have lead to new opportunities in developing mobile applications which purpose is to make people’s life more easier. Nowadays, a person can possess more than one mobile device intend for different usage such as communication, entertainment, office works. This paper proposes a mobile application which will be able to estimate the position of a user within a building by using WIFI technology.
{"title":"WIFI-Based Indoor Positioning System","authors":"Arash Habibi Lashkari, Behrang Parhizkar, Mike Ng Ah Ngan","doi":"10.1109/ICCNT.2010.33","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.33","url":null,"abstract":"The easy access and availability of wireless technologies and mobile computing and internet have lead to new opportunities in developing mobile applications which purpose is to make people’s life more easier. Nowadays, a person can possess more than one mobile device intend for different usage such as communication, entertainment, office works. This paper proposes a mobile application which will be able to estimate the position of a user within a building by using WIFI technology.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115414797","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}
In this paper, we present a novel technique for localizing an event of interest in an underwater environment. The network consists of randomly deployed identical sensor nodes. Instead of proactively localizing every single node in the network as all proposed techniques set out to do, we approach localization from a reactive angle. We reduce the localization problem to the problem of finding 4-Node Coverage, in which we form a subset of nodes such that every node in the original set is covered by four nodes belonging to this special subset – which we call the anchor nodes for simplicity. This subset of anchor nodes behaves like a backbone to the localization process. We show that in terms of energy consumption, this localization technique far surpasses others in terms of energy efficiency.
{"title":"Reactive Localization in Underwater Wireless Sensor Networks","authors":"M. Watfa, T. Nsouli, Maya Al-Ayache, Omar Ayyash","doi":"10.1109/ICCNT.2010.58","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.58","url":null,"abstract":"In this paper, we present a novel technique for localizing an event of interest in an underwater environment. The network consists of randomly deployed identical sensor nodes. Instead of proactively localizing every single node in the network as all proposed techniques set out to do, we approach localization from a reactive angle. We reduce the localization problem to the problem of finding 4-Node Coverage, in which we form a subset of nodes such that every node in the original set is covered by four nodes belonging to this special subset – which we call the anchor nodes for simplicity. This subset of anchor nodes behaves like a backbone to the localization process. We show that in terms of energy consumption, this localization technique far surpasses others in terms of energy efficiency.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"326 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115872608","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 will analyze the state of ICT in Iran. The major Iranian telecommunication companies and their products will be described. The ICT activities and penetration rates during last decade until recent time will be investigated. Penetration of Internet and Mobile in the Middle East will be evaluated. The factors identified as obstacles of ICT penetration in Middle East will be discussed.
{"title":"Analysis of ICT Penetration in Iran and Middle East","authors":"M. Gerami","doi":"10.1109/ICCNT.2010.51","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.51","url":null,"abstract":"This paper will analyze the state of ICT in Iran. The major Iranian telecommunication companies and their products will be described. The ICT activities and penetration rates during last decade until recent time will be investigated. Penetration of Internet and Mobile in the Middle East will be evaluated. The factors identified as obstacles of ICT penetration in Middle East will be discussed.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127011827","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
扫码关注我们
求助内容：
应助结果提醒方式：