Hong Xia, Yan Chen, Haichang Gao, Zeng-zhi Li, Yanping Chen
Matchmaking is the basis of service discovery and composition. Using ontology semantically express the capabilities of services, accurately match, discovery and composition service. Domain ontologies and Formal Concept Analysis (FCA) aim at modeling concepts, the role of FCA in ontology engineering is supporting the critical task of reusing independently developed domain ontologies. Evaluating concept similarity identifies the different concepts that are semantically close. In this paper, using concept and attribute of Web services to construct the ontology. Also, an ontology-based method for assessing similarity between FCA concepts is proposed. Such a method is intended to support the ontology engineer in difficult activities such as ontology merging and ontology mapping in the development of the Semantic Web.
{"title":"Concept Lattice-Based Semantic Web Service Matchmaking","authors":"Hong Xia, Yan Chen, Haichang Gao, Zeng-zhi Li, Yanping Chen","doi":"10.1109/ICCSN.2010.69","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.69","url":null,"abstract":"Matchmaking is the basis of service discovery and composition. Using ontology semantically express the capabilities of services, accurately match, discovery and composition service. Domain ontologies and Formal Concept Analysis (FCA) aim at modeling concepts, the role of FCA in ontology engineering is supporting the critical task of reusing independently developed domain ontologies. Evaluating concept similarity identifies the different concepts that are semantically close. In this paper, using concept and attribute of Web services to construct the ontology. Also, an ontology-based method for assessing similarity between FCA concepts is proposed. Such a method is intended to support the ontology engineer in difficult activities such as ontology merging and ontology mapping in the development of the Semantic Web.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"61 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":"131808120","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 proposes BER analysis of Impulse Radio Ultra Wideband (IR-UWB) pulse modulations over S-V channel model. The UWB pulse is Gaussian monocycle pulse modulated using Pulse Position Modulation (PPM) and Pulse Shape Modulation (PSM). The channel model is generated from S-V model introduced by Intel lab. Bit-error rate (BER) is measured over several of bit rates. The result shows that the modulations are appropriate for both LOS and NLOS channel, and PPM has better performance in bit rates and SNR. Moreover, as standard of speed has been given for UWB, the communication is appropriate with high bit rates in LOS channel.
{"title":"IR-UWB Pulse Position Modulation and Pulse Shape Modulation Through S-V Channel Model","authors":"R. Hidayat, Y. Miyanaga","doi":"10.1109/ICCSN.2010.40","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.40","url":null,"abstract":"This paper proposes BER analysis of Impulse Radio Ultra Wideband (IR-UWB) pulse modulations over S-V channel model. The UWB pulse is Gaussian monocycle pulse modulated using Pulse Position Modulation (PPM) and Pulse Shape Modulation (PSM). The channel model is generated from S-V model introduced by Intel lab. Bit-error rate (BER) is measured over several of bit rates. The result shows that the modulations are appropriate for both LOS and NLOS channel, and PPM has better performance in bit rates and SNR. Moreover, as standard of speed has been given for UWB, the communication is appropriate with high bit rates in LOS channel.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"34 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":"121145250","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}
An analytical approach is developed to evaluate the Bit Error Rate (BER) performance of an OFDM wireless link over a faded channel impaired by Carrier Frequency Offset (CFO) and phase noise. The analysis is further extended to an OFDM system with receive diversity taking into consideration the effects of above system impairments. The analysis is developed for SIMO OFDM to find the expression of the unconditional bit error rate of the wireless link with Rayleigh fading assuming Gaussian probability density function of the CFO and phase noise. Analysis is carried out for both Maximal Ratio Receiver Combining (MRRC) and selective combining techniques. BER performance results are evaluated numerically following the analytical approach. The results are depicted in terms of BER versus Signal to Noise Ratio (SNR) with different fading variances and for different values of CFO and phase noise variances. Results show that the system BER is highly deteriorated due to fading, CFO and phase noise. Thus, there is significant penalty in signal power at a given BER. System BER performance results are evaluated with different receiver diversity combining techniques. It is noticed that there is significant improvement in system performance increasing the receiver sensitivity due to the application of the receive diversity techniques.
{"title":"Performance Limitations of a SIMO OFDM Wireless Link Impaired by Carrier Frequency Offset, Phase Noise and Rayleigh Fading","authors":"M. Hasan, S. Majumder","doi":"10.1109/ICCSN.2010.85","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.85","url":null,"abstract":"An analytical approach is developed to evaluate the Bit Error Rate (BER) performance of an OFDM wireless link over a faded channel impaired by Carrier Frequency Offset (CFO) and phase noise. The analysis is further extended to an OFDM system with receive diversity taking into consideration the effects of above system impairments. The analysis is developed for SIMO OFDM to find the expression of the unconditional bit error rate of the wireless link with Rayleigh fading assuming Gaussian probability density function of the CFO and phase noise. Analysis is carried out for both Maximal Ratio Receiver Combining (MRRC) and selective combining techniques. BER performance results are evaluated numerically following the analytical approach. The results are depicted in terms of BER versus Signal to Noise Ratio (SNR) with different fading variances and for different values of CFO and phase noise variances. Results show that the system BER is highly deteriorated due to fading, CFO and phase noise. Thus, there is significant penalty in signal power at a given BER. System BER performance results are evaluated with different receiver diversity combining techniques. It is noticed that there is significant improvement in system performance increasing the receiver sensitivity due to the application of the receive diversity techniques.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"7 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":"131160255","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}
Error Concealment is a very useful method to improve the video quality. It aims at using the maximum received video data to recover the lost information of the picture at the decoder. Lagrange interpolation algorithm is the most effective interpolation for error concealment while it lost some detail information. Hermite interpolation algorithm considers the change rate of the motion vector as well as the motion vector itself, which is more accurate. In this paper, we propose a novel method which uses hermite interpolation to predict the lost motion vectors. We take the change rate (derivative) of motion vector into account, and synthesizing the horizontal and vertical recovered motion vectors adaptively by the minimum distance method. The experimental result shows that our method achieves higher PSNR values than Lagrange interpolation.
{"title":"A Hermite Interpolation Based Motion Vector Recovery Algorithm for H.264/AVC","authors":"Heng Li, Yanchun Zhong","doi":"10.1109/ICCSN.2010.62","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.62","url":null,"abstract":"Error Concealment is a very useful method to improve the video quality. It aims at using the maximum received video data to recover the lost information of the picture at the decoder. Lagrange interpolation algorithm is the most effective interpolation for error concealment while it lost some detail information. Hermite interpolation algorithm considers the change rate of the motion vector as well as the motion vector itself, which is more accurate. In this paper, we propose a novel method which uses hermite interpolation to predict the lost motion vectors. We take the change rate (derivative) of motion vector into account, and synthesizing the horizontal and vertical recovered motion vectors adaptively by the minimum distance method. The experimental result shows that our method achieves higher PSNR values than Lagrange interpolation.","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":"132728359","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}
Developing correct and complete real-world software applications is a difficult task in terms of the number and flexibility of the essential components and their interrelationship. As the field of agent-based computing matures, the requirements of well-founded techniques and methodology for such systems modeling will increased. This paper used integration of two well known modeling techniques, X-machines and Z notation for modeling and writing the specification of agent-based systems. This modeling approach supports the behavioral modeling, data modeling and property analysis of agent-based systems. It also provides a mechanism for translating the formal model to executable code.
{"title":"Modeling Agent-Based Systems Using X-Machine and Z Notation","authors":"G. Ali, N. Zafar","doi":"10.1109/ICCSN.2010.76","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.76","url":null,"abstract":"Developing correct and complete real-world software applications is a difficult task in terms of the number and flexibility of the essential components and their interrelationship. As the field of agent-based computing matures, the requirements of well-founded techniques and methodology for such systems modeling will increased. This paper used integration of two well known modeling techniques, X-machines and Z notation for modeling and writing the specification of agent-based systems. This modeling approach supports the behavioral modeling, data modeling and property analysis of agent-based systems. It also provides a mechanism for translating the formal model to executable code.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"7 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":"133224134","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}
Conventional silicon based computing technology has reached to its upper physical limits of Design complexity, processing power, memory, energy consumption, density and heat dissipation. Therefore, there is need of searching for new alternative computing Medias, which can overcome all these conventional computation problems. The structure and type of these new alternative computing paradigms is a major challenge.
{"title":"Limitation of Silicon Based Computation and Future Prospects","authors":"Shazia Hassan, Humaira, M. Asghar","doi":"10.1109/ICCSN.2010.81","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.81","url":null,"abstract":"Conventional silicon based computing technology has reached to its upper physical limits of Design complexity, processing power, memory, energy consumption, density and heat dissipation. Therefore, there is need of searching for new alternative computing Medias, which can overcome all these conventional computation problems. The structure and type of these new alternative computing paradigms is a major challenge.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"112 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":"132027820","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}
Cluster-based routing protocol is currently a hot research in wireless sensor network. In this paper, we propose an improved method RECHS(Redundant and Energy-efficient Clusterhead Selection) for LEACH protocol to balance network load and to extend the network life. In order to selecting reasonable clusterheads, our scheme first selects initial clusterheads and initial redundant clusterheads. By comparing of the two nodes with our method, the node which has better performance will be elected as clusterhead, and the other node will be as redundant clusterhead at the current round. The new algorithm is an effective solution for the problem of the unreasonable distribution of clusterhead, as well as the issue of the clusterhead fails. Simulation results show that it prolongs the network life effectively, the time which first node dies, half of the nodes alive and last node dies is later than LEACH, the security of network has also been increased.
基于集群的路由协议是当前无线传感器网络研究的热点。本文提出了一种改进的LEACH协议冗余节能簇头选择方法RECHS(Redundant and efficient Clusterhead Selection)，以平衡网络负载，延长网络寿命。为了选择合理的簇头，首先选择初始簇头和初始冗余簇头。通过对两个节点进行比较，选出性能较好的节点作为簇头，另一个节点作为当前轮的冗余簇头。该算法有效地解决了簇头分布不合理以及簇头失效的问题。仿真结果表明，该方法有效地延长了网络的寿命，第一个节点死亡、一半存活节点死亡和最后一个节点死亡的时间都比LEACH算法晚，同时提高了网络的安全性。
{"title":"A Redundant and Energy-Efficient Clusterhead Selection Protocol for Wireless Sensor Network","authors":"Hao Wang, Pu Tu, Ping Wang, Jian Yang","doi":"10.1109/ICCSN.2010.46","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.46","url":null,"abstract":"Cluster-based routing protocol is currently a hot research in wireless sensor network. In this paper, we propose an improved method RECHS(Redundant and Energy-efficient Clusterhead Selection) for LEACH protocol to balance network load and to extend the network life. In order to selecting reasonable clusterheads, our scheme first selects initial clusterheads and initial redundant clusterheads. By comparing of the two nodes with our method, the node which has better performance will be elected as clusterhead, and the other node will be as redundant clusterhead at the current round. The new algorithm is an effective solution for the problem of the unreasonable distribution of clusterhead, as well as the issue of the clusterhead fails. Simulation results show that it prolongs the network life effectively, the time which first node dies, half of the nodes alive and last node dies is later than LEACH, the security of network has also been increased.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"135 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":"132573416","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 transmission control protocol (TCP) is widely used in wired and wireless networks. It provides reliable transport services between end-to-end hosts. Since TCP performance affects the overall network performance, several analytical models were proposed to describe the steady-state throughput of bulk transfer TCP flows (i.e., a flow with large amount of data to send, such as FTP transfers). However, most TCP flows in the Internet world are short-lived to see few losses and they cannot reach the steady-state, consequently their performance is determined by the startup effects such as the connection establishment and the slow start mechanisms. Surprisingly, all of the previous models did not investigate the heterogeneity of wireless networks which is considered the most important issue in wired-cum-wireless networks. The heterogeneity is shown by different characteristics and different segment loss probability for various types of wireless networks such as IEEE 802.11 WLAN and 3G cellular network. Moreover, wireless TCP flows are much shorter than wired flows due to the time varying characteristics of wireless networks. In this research, a recursive and analytical model is developed and used to determine the performance of TCP in heterogeneous wired-cum-wireless networks in terms of average completion time for the short-lived TCP flows is proposed. The proposed model focuses on heterogeneous wireless networks. The proposed model is based on the knowledge of average dropping probability, the average roundtrip time and the flow size both wired and wireless links. The simulation results are very much the same as the values obtained from the analytical model.
{"title":"A Novel Recursive Method for Analysis Performance of TCP Flow in Wireless LAN","authors":"M. Hassani, Meysam Mohammadi, Sanaz Pashforoush","doi":"10.1109/ICCSN.2010.13","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.13","url":null,"abstract":"The transmission control protocol (TCP) is widely used in wired and wireless networks. It provides reliable transport services between end-to-end hosts. Since TCP performance affects the overall network performance, several analytical models were proposed to describe the steady-state throughput of bulk transfer TCP flows (i.e., a flow with large amount of data to send, such as FTP transfers). However, most TCP flows in the Internet world are short-lived to see few losses and they cannot reach the steady-state, consequently their performance is determined by the startup effects such as the connection establishment and the slow start mechanisms. Surprisingly, all of the previous models did not investigate the heterogeneity of wireless networks which is considered the most important issue in wired-cum-wireless networks. The heterogeneity is shown by different characteristics and different segment loss probability for various types of wireless networks such as IEEE 802.11 WLAN and 3G cellular network. Moreover, wireless TCP flows are much shorter than wired flows due to the time varying characteristics of wireless networks. In this research, a recursive and analytical model is developed and used to determine the performance of TCP in heterogeneous wired-cum-wireless networks in terms of average completion time for the short-lived TCP flows is proposed. The proposed model focuses on heterogeneous wireless networks. The proposed model is based on the knowledge of average dropping probability, the average roundtrip time and the flow size both wired and wireless links. The simulation results are very much the same as the values obtained from the analytical model.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"5 3 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":"128204778","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}
Mobile WiMAX (Worldwide Interoperability for Microwave Access) is being touted as the most promising and potential broadband wireless technology. And the popularity rate has been surging to newer heights as the knowledge-backed service era unfolds steadily. Especially Mobile WiMAX is being projected as a real and strategic boon for developing counties such as India due to its wireless coverage acreage is phenomenally high. Mobile WiMAX has spurred tremendous interest from operators seeking to deploy high-performance yet cost-effective broadband wireless networks. The IEEE 802.16e standard based Mobile WiMAX system will be investigated for the purpose of Quality of Service provisioning. As a technical challenge, radio resource management will be primarily considered and main is the costly spectrum and the increasingly more demanding applications with ever growing number of subscribers. It is necessary to provide Quality of Service (QoS) guaranteed with different characteristics. As a possible solution the scheduling algorithms will be taken into main consideration and the present well known algorithms will be described. In this paper, we have highlighted the following critical issues for Mobile WiMAX technologies. This paper specifically discussed about the below mentioned in detail.• QoS Requirements For IEEE 802.16 Service Classes• Achieving efficient radio resource management• Deficit Round Robin (DRR) Scheduling algorithm• Modified Deficit Round Robin (MDRR) scheduling algorithm’s attributes, properties and architecture
{"title":"Analysis and Modification of Scheduling Algorithm for IEEE 802.16e (Mobile WiMAX)","authors":"C. Ravichandiran, P. Raj, Vaithiyanathan","doi":"10.1109/ICCSN.2010.87","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.87","url":null,"abstract":"Mobile WiMAX (Worldwide Interoperability for Microwave Access) is being touted as the most promising and potential broadband wireless technology. And the popularity rate has been surging to newer heights as the knowledge-backed service era unfolds steadily. Especially Mobile WiMAX is being projected as a real and strategic boon for developing counties such as India due to its wireless coverage acreage is phenomenally high. Mobile WiMAX has spurred tremendous interest from operators seeking to deploy high-performance yet cost-effective broadband wireless networks. The IEEE 802.16e standard based Mobile WiMAX system will be investigated for the purpose of Quality of Service provisioning. As a technical challenge, radio resource management will be primarily considered and main is the costly spectrum and the increasingly more demanding applications with ever growing number of subscribers. It is necessary to provide Quality of Service (QoS) guaranteed with different characteristics. As a possible solution the scheduling algorithms will be taken into main consideration and the present well known algorithms will be described. In this paper, we have highlighted the following critical issues for Mobile WiMAX technologies. This paper specifically discussed about the below mentioned in detail.• QoS Requirements For IEEE 802.16 Service Classes• Achieving efficient radio resource management• Deficit Round Robin (DRR) Scheduling algorithm• Modified Deficit Round Robin (MDRR) scheduling algorithm’s attributes, properties and architecture","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"10 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":"128414502","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 the Internet, nodes are identified using IP addresses that depend on their topological location. IPv4/IPv6 translation technology involves address mapping between IPv6 and IPv4 nodes and the methods used to translate protocols, where nodes are in their respective IP version of network. A detailed study is made on the IPv6 addressing architecture, various IPv6 configuring mechanisms and obtaining care-of-address. The study clearly reveals that IPv6 addressing in IPv4 network and vice-versa are not considered. The paper points out the need of IPv6 addressing in IPv4 network and proposes a new addressing mechanism with a clear implementation procedure, while not restricting any IPv6 mobile node to roam only in IPv6 based networks. The newly configured IPv6 address in the proposal is referred to as P46CGA, which includes the extensions to IPv6 stateless addressing mechanism, cryptographic methods, IPv4 router address. Using IPv4 router address in IPv6 addressing in IPv4 network helps the other routers in the internet to identify easily the current location of IPv6 node and to establish communication between them. The main focus of the proposal is to permit an IPv6 mobile node to roam also into IPv4 based network and get serviced besides roaming in IPv6 based network.
{"title":"IPv6 Addressing Architecture in IPv4 Network","authors":"J. Gnana Jayanthi, S. Rabara","doi":"10.1109/ICCSN.2010.116","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.116","url":null,"abstract":"In the Internet, nodes are identified using IP addresses that depend on their topological location. IPv4/IPv6 translation technology involves address mapping between IPv6 and IPv4 nodes and the methods used to translate protocols, where nodes are in their respective IP version of network. A detailed study is made on the IPv6 addressing architecture, various IPv6 configuring mechanisms and obtaining care-of-address. The study clearly reveals that IPv6 addressing in IPv4 network and vice-versa are not considered. The paper points out the need of IPv6 addressing in IPv4 network and proposes a new addressing mechanism with a clear implementation procedure, while not restricting any IPv6 mobile node to roam only in IPv6 based networks. The newly configured IPv6 address in the proposal is referred to as P46CGA, which includes the extensions to IPv6 stateless addressing mechanism, cryptographic methods, IPv4 router address. Using IPv4 router address in IPv6 addressing in IPv4 network helps the other routers in the internet to identify easily the current location of IPv6 node and to establish communication between them. The main focus of the proposal is to permit an IPv6 mobile node to roam also into IPv4 based network and get serviced besides roaming in IPv6 based network.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"90 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":"123457872","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
扫码关注我们
求助内容：
应助结果提醒方式：