Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366589
S. Firdous, M. Ikram
A diffusely backscattered polarized beam of laser radiation from a turbid medium has been characterized by optics calculus. The Stokes and Mueller parameters of polarized light are represented as a column matrix and the optical turbid medium as a 4/spl times/4 matrix. The tissue like turbid phantom system is considered homogeneous and the scattering medium contains one kind of randomly distributed asymmetric particles. We use polarized light from a He-Ne laser (/spl lambda/=632.5 nm) focused on the scattering medium. Different polarization components of backscattered light are obtained by varying the polarization state of the incident laser light and the analyzer configuration. The calculation of the 16 elements of the output Mueller matrix shows that theoretically only seven elements of backscattered light are independent and the remaining nine can be calculated through a symmetry relation. It is also confirmed through experiments. The matrix calculus concept for diffusely backscattered light fully characterizes the turbid medium. The experimental and theoretical results are in good agreement.
{"title":"Characterization of turbid medium through diffusely backscattering polarized light with matrix calculus-II","authors":"S. Firdous, M. Ikram","doi":"10.1109/INCC.2004.1366589","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366589","url":null,"abstract":"A diffusely backscattered polarized beam of laser radiation from a turbid medium has been characterized by optics calculus. The Stokes and Mueller parameters of polarized light are represented as a column matrix and the optical turbid medium as a 4/spl times/4 matrix. The tissue like turbid phantom system is considered homogeneous and the scattering medium contains one kind of randomly distributed asymmetric particles. We use polarized light from a He-Ne laser (/spl lambda/=632.5 nm) focused on the scattering medium. Different polarization components of backscattered light are obtained by varying the polarization state of the incident laser light and the analyzer configuration. The calculation of the 16 elements of the output Mueller matrix shows that theoretically only seven elements of backscattered light are independent and the remaining nine can be calculated through a symmetry relation. It is also confirmed through experiments. The matrix calculus concept for diffusely backscattered light fully characterizes the turbid medium. The experimental and theoretical results are in good agreement.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123660917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366581
A. I. Bhatti, S. I. Shah
The paper addresses the problem of convergence time reduction for the line echo cancellation problem in the context of VoIP applications. Training signals can be used for this purpose. Intuitively speaking, any decorrelated signal, such as white noise, can be used as a training signal. C. Antweiler and H.-G. Symanzik (see Proc. ICASSP-1995, p.3031-4, 1995) have shown that a certain signal, called perfect sequence, can be such a training signal. The method for generating such signals is not easy to use, neither can it be extended to arbitrary lengths. The authors propose another candidate signal, called maximum length pseudo random binary sequence (mlPRBS), to be a perfect sequence. The conditions on such a signal are further analyzed and highlighted. It is shown that the proposed training signal fulfils such requirements. The claims are backed by simulation results. The simulation elements used are available in the public domain.
{"title":"Training of line echo canceller with PRBS signals","authors":"A. I. Bhatti, S. I. Shah","doi":"10.1109/INCC.2004.1366581","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366581","url":null,"abstract":"The paper addresses the problem of convergence time reduction for the line echo cancellation problem in the context of VoIP applications. Training signals can be used for this purpose. Intuitively speaking, any decorrelated signal, such as white noise, can be used as a training signal. C. Antweiler and H.-G. Symanzik (see Proc. ICASSP-1995, p.3031-4, 1995) have shown that a certain signal, called perfect sequence, can be such a training signal. The method for generating such signals is not easy to use, neither can it be extended to arbitrary lengths. The authors propose another candidate signal, called maximum length pseudo random binary sequence (mlPRBS), to be a perfect sequence. The conditions on such a signal are further analyzed and highlighted. It is shown that the proposed training signal fulfils such requirements. The claims are backed by simulation results. The simulation elements used are available in the public domain.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366580
S. Nizami, I. Marsland, B. Hashem
The paper proposes a simple scheduling algorithm based on adaptive embedded modulation (EM) for the downlink in urban wireless networks. Embedded modulation allows multiple users to share a single downlink channel simultaneously. The proposed EM scheduling algorithm embeds the user which has the largest carrier-to-interference ratio (C/I) with each of the lower C/I users in turn. Simulation results show that the EM scheduler, employing adaptive coded modulation, can improve the average throughput of a given downlink by up to 33% over a round robin scheduler, while still maintaining acceptable fairness amongst the system users.
{"title":"A high-capacity scheduling algorithm for systems employing embedded modulation","authors":"S. Nizami, I. Marsland, B. Hashem","doi":"10.1109/INCC.2004.1366580","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366580","url":null,"abstract":"The paper proposes a simple scheduling algorithm based on adaptive embedded modulation (EM) for the downlink in urban wireless networks. Embedded modulation allows multiple users to share a single downlink channel simultaneously. The proposed EM scheduling algorithm embeds the user which has the largest carrier-to-interference ratio (C/I) with each of the lower C/I users in turn. Simulation results show that the EM scheduler, employing adaptive coded modulation, can improve the average throughput of a given downlink by up to 33% over a round robin scheduler, while still maintaining acceptable fairness amongst the system users.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366570
A. Pirzada, A. Datta, C. McDonald
Ad-hoc networks come into existence when two or more wireless mobile nodes agree to pass packets for each other. The wireless range of these nodes is usually limited to hundred of meters; however, with mutual cooperation these nodes are able to provide extended communication coverage. Ad-hoc on-demand distance vector (AODV) is a routing protocol frequently used to establish such networks. The correct execution of the protocol requires sustained benevolent behaviour by all participating nodes. This is difficult to achieve and malicious nodes frequently tamper with the AODV routing process. We propose a novel and pragmatic method for establishing trustworthy routes in an AODV based ad-hoc network without necessitating the use of cryptography. We accentuate that our model is most appropriate for ad-hoc networks that can be established on the fly without requiring a dedicated trust infrastructure or pre-configuration of nodes.
{"title":"Trustworthy routing with the AODV protocol","authors":"A. Pirzada, A. Datta, C. McDonald","doi":"10.1109/INCC.2004.1366570","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366570","url":null,"abstract":"Ad-hoc networks come into existence when two or more wireless mobile nodes agree to pass packets for each other. The wireless range of these nodes is usually limited to hundred of meters; however, with mutual cooperation these nodes are able to provide extended communication coverage. Ad-hoc on-demand distance vector (AODV) is a routing protocol frequently used to establish such networks. The correct execution of the protocol requires sustained benevolent behaviour by all participating nodes. This is difficult to achieve and malicious nodes frequently tamper with the AODV routing process. We propose a novel and pragmatic method for establishing trustworthy routes in an AODV based ad-hoc network without necessitating the use of cryptography. We accentuate that our model is most appropriate for ad-hoc networks that can be established on the fly without requiring a dedicated trust infrastructure or pre-configuration of nodes.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366568
F. Janjua, S. Sultan, M. Muzaffar, Z. Ahmed, S.A. Khan
Mobile ad-hoc networks (MANETs) are a new paradigm of wireless communication for mobile hosts. Recently, there has been an increased interest in infrastructureless secure mobile ad-hoc networks (SMANETs). One of the fundamental challenges facing the designers of the SMANETs, especially for military networks, is to provide central command and control over the network. The paper presents an optimal solution for such a network by securing an ad-hoc network running a table driven protocol. The system minimizes computation, power dissipation, and bandwidth by customizing the security algorithm for a specific application. We use a semi-centralized technique, instead of a decentralized one, which requires more computational costs along with high consumption of power and bandwidth. The optimized link state routing protocol (OLSR) is used as the protocol, but the solution can be easily tailored for other proactive protocols for ad-hoc networks. Our main focus is on authenticating each mobile node using computationally inexpensive hashing techniques and public key exchange mechanisms in an asymmetric key set-up. In order to protect the protocol from replay attacks, distributed timestamps have been utilized. The goal is a survivable system that works well even in the presence of malicious nodes.
{"title":"Authenticated routing of table driven protocol in an ad-hoc environment","authors":"F. Janjua, S. Sultan, M. Muzaffar, Z. Ahmed, S.A. Khan","doi":"10.1109/INCC.2004.1366568","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366568","url":null,"abstract":"Mobile ad-hoc networks (MANETs) are a new paradigm of wireless communication for mobile hosts. Recently, there has been an increased interest in infrastructureless secure mobile ad-hoc networks (SMANETs). One of the fundamental challenges facing the designers of the SMANETs, especially for military networks, is to provide central command and control over the network. The paper presents an optimal solution for such a network by securing an ad-hoc network running a table driven protocol. The system minimizes computation, power dissipation, and bandwidth by customizing the security algorithm for a specific application. We use a semi-centralized technique, instead of a decentralized one, which requires more computational costs along with high consumption of power and bandwidth. The optimized link state routing protocol (OLSR) is used as the protocol, but the solution can be easily tailored for other proactive protocols for ad-hoc networks. Our main focus is on authenticating each mobile node using computationally inexpensive hashing techniques and public key exchange mechanisms in an asymmetric key set-up. In order to protect the protocol from replay attacks, distributed timestamps have been utilized. The goal is a survivable system that works well even in the presence of malicious nodes.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366567
Z. H. Mir, S.A. Khan
Location-based routing has received significant attention for ad hoc networking. The motivation to use location-based routing is that it eliminates the need to maintain routes and therefore is very well suited for highly mobile networks. However, as an essential prerequisite for location-based routing, a location service is needed from which a node can learn the current position of other nodes present in the network. We present a zone-based location service (ZLS), which provides a mechanism to track the location information of other nodes in mobile ad hoc networks. Preliminary results indicate that the zone-based location service (ZLS) can be combined with a packet forwarding strategy to provide an efficient location-based routing protocol in a mobile ad hoc environment. The simulation results reported are our first steps towards meeting this goal.
{"title":"A zone-based location service for mobile ad hoc networks","authors":"Z. H. Mir, S.A. Khan","doi":"10.1109/INCC.2004.1366567","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366567","url":null,"abstract":"Location-based routing has received significant attention for ad hoc networking. The motivation to use location-based routing is that it eliminates the need to maintain routes and therefore is very well suited for highly mobile networks. However, as an essential prerequisite for location-based routing, a location service is needed from which a node can learn the current position of other nodes present in the network. We present a zone-based location service (ZLS), which provides a mechanism to track the location information of other nodes in mobile ad hoc networks. Preliminary results indicate that the zone-based location service (ZLS) can be combined with a packet forwarding strategy to provide an efficient location-based routing protocol in a mobile ad hoc environment. The simulation results reported are our first steps towards meeting this goal.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121920861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366583
M. Akhtar, H. Waqar
The telecommunications sector at the global level is passing through rapid technological developments and an increasingly liberal policy environment. The same holds true for Pakistan where the sector has been exposed to reforms witnessing a significant expansion of both fixed and mobile networks and striking improvements in quality. Pakistan may be categorized among those Asian economies which have partially privatized the state owned telecom sector while deferring the introduction of full scale competition to a future time. There exists a service competition rather than network competition. To inculcate and strengthen the concept of a market driven economy, the government of Pakistan established an independent regulator with the name of Pakistan Telecommunications Authority (PTA) in 1996. The paper reveals the fact that there has been a marked improvement in various fields, like the degree of competition, infrastructure, cost reduction and quality.
{"title":"Liberalizing telecom sector in Pakistan: issues and prospects","authors":"M. Akhtar, H. Waqar","doi":"10.1109/INCC.2004.1366583","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366583","url":null,"abstract":"The telecommunications sector at the global level is passing through rapid technological developments and an increasingly liberal policy environment. The same holds true for Pakistan where the sector has been exposed to reforms witnessing a significant expansion of both fixed and mobile networks and striking improvements in quality. Pakistan may be categorized among those Asian economies which have partially privatized the state owned telecom sector while deferring the introduction of full scale competition to a future time. There exists a service competition rather than network competition. To inculcate and strengthen the concept of a market driven economy, the government of Pakistan established an independent regulator with the name of Pakistan Telecommunications Authority (PTA) in 1996. The paper reveals the fact that there has been a marked improvement in various fields, like the degree of competition, infrastructure, cost reduction and quality.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366599
S. Abrar
A new algorithm is presented for the blind equalization of complex signals. This algorithm combines the benefits of the well-known reduced-constellation algorithm (RCA) and decision-directed algorithm (DDA). The contribution lies in the technique of incorporating the sliced symbols (outcome of the decision device) in the weight adaptation process. Unlike the RCA, where the reduced constellation contains only four symbol points, the proposed algorithms uses all symbols of the signal constellation by compacting them in some statistical manner. The steady-state characteristics of the proposed algorithm are demonstrated by way of simulations and are compared to those of RCA. It is observed that the new algorithm has a better steady-state performance than RCA.
{"title":"Compact constellation algorithm for blind equalization of QAM signals","authors":"S. Abrar","doi":"10.1109/INCC.2004.1366599","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366599","url":null,"abstract":"A new algorithm is presented for the blind equalization of complex signals. This algorithm combines the benefits of the well-known reduced-constellation algorithm (RCA) and decision-directed algorithm (DDA). The contribution lies in the technique of incorporating the sliced symbols (outcome of the decision device) in the weight adaptation process. Unlike the RCA, where the reduced constellation contains only four symbol points, the proposed algorithms uses all symbols of the signal constellation by compacting them in some statistical manner. The steady-state characteristics of the proposed algorithm are demonstrated by way of simulations and are compared to those of RCA. It is observed that the new algorithm has a better steady-state performance than RCA.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129401474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366596
S. Bashir, M. Rehman, H. F. Ahmad, A. Ali, H. Suguri
Multi-agent systems are one of the significant areas in the field of distributed systems. Scalability is one of the issues which effect successful deployment of a particular multi-agent system. Performance and scalability of a system cannot be decoupled because, within a limited number of resources, performance of a multi-agent system varies as the load is increased. Message transport service (MTS) provides the means for agents to communicate across the platform. For high performance, MTS must be dynamically scalable. Existing architectures, which are claimed to be scalable, have some shortcomings. They are centralized, and use component replication or distribution, which has some drawbacks. Priority based queues are one way to achieve dynamic scalability at component level. Peer communication channels provide a mechanism to distribute the load while communication is taking place among different machines. Moreover, peer-to-peer architecture is a hybrid approach to achieving scalability, as it is a blend of the merits of component distribution and replication.
{"title":"Distributed and scalable message transport service for high performance multi-agent systems","authors":"S. Bashir, M. Rehman, H. F. Ahmad, A. Ali, H. Suguri","doi":"10.1109/INCC.2004.1366596","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366596","url":null,"abstract":"Multi-agent systems are one of the significant areas in the field of distributed systems. Scalability is one of the issues which effect successful deployment of a particular multi-agent system. Performance and scalability of a system cannot be decoupled because, within a limited number of resources, performance of a multi-agent system varies as the load is increased. Message transport service (MTS) provides the means for agents to communicate across the platform. For high performance, MTS must be dynamically scalable. Existing architectures, which are claimed to be scalable, have some shortcomings. They are centralized, and use component replication or distribution, which has some drawbacks. Priority based queues are one way to achieve dynamic scalability at component level. Peer communication channels provide a mechanism to distribute the load while communication is taking place among different machines. Moreover, peer-to-peer architecture is a hybrid approach to achieving scalability, as it is a blend of the merits of component distribution and replication.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128974389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-06-11DOI: 10.1109/INCC.2004.1366576
M. Mufti, Aasia
As the availability of mobile communication facilities becomes more and more important for the modern information era, there is a growing appreciation of the need to establish mobility standards on strong security foundations. One particular aspect of security that has a great impact in a mobile scenario is authentication. Authentication, by definition, is the guarantee that a received message has indeed originated from the claimed sender. The importance of authentication is highlighted by the growing number of denial of service (DoS) attacks in recent years. The major source of DoS attacks in Mobile IP networks is the absence or weakness of authentication procedures between the various communicating entities. The paper analyzes the security aspects of the basic Mobile IP for IPv4 with reference to DoS attacks. It then presents a new authentication scheme that the authors have developed as a part of a Mobile IP. The scheme is based on public key cryptography and is scalable enough to be adopted on a network of arbitrary size. Protocol implementation is demonstrated by the development of a patch for the Linux kernel.
{"title":"Design and implementation of a secure Mobile IP protocol","authors":"M. Mufti, Aasia","doi":"10.1109/INCC.2004.1366576","DOIUrl":"https://doi.org/10.1109/INCC.2004.1366576","url":null,"abstract":"As the availability of mobile communication facilities becomes more and more important for the modern information era, there is a growing appreciation of the need to establish mobility standards on strong security foundations. One particular aspect of security that has a great impact in a mobile scenario is authentication. Authentication, by definition, is the guarantee that a received message has indeed originated from the claimed sender. The importance of authentication is highlighted by the growing number of denial of service (DoS) attacks in recent years. The major source of DoS attacks in Mobile IP networks is the absence or weakness of authentication procedures between the various communicating entities. The paper analyzes the security aspects of the basic Mobile IP for IPv4 with reference to DoS attacks. It then presents a new authentication scheme that the authors have developed as a part of a Mobile IP. The scheme is based on public key cryptography and is scalable enough to be adopted on a network of arbitrary size. Protocol implementation is demonstrated by the development of a patch for the Linux kernel.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126438647","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
扫码关注我们
求助内容：
应助结果提醒方式：