Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.63
T. Hanselmann, Yu Zhang, M. Morelande, Mohd Ifran Md Nor, J. J. Tan, Xingshe Zhou, Yee Wei Law
A centralized self-localization algorithm is used to estimate sensor locations. From the known positions of at least 3 anchor nodes the remaining sensor positions are estimated using an efficient particle filter (PF) with progressive correction. The measurement model is a simple two-parameter log-normal shadowing model, where the parameters are estimated concurrently. Experiments using Crossbow Imote2 motes show that an error of less than 16% is achievable in an indoor environment. The results demonstrate that by using PF with progressive correction, a small number of measurements and a simple signal propagation model are sufficient to give low localization errors.
{"title":"Self-localization in wireless sensor networks using particle filtering with progressive correction","authors":"T. Hanselmann, Yu Zhang, M. Morelande, Mohd Ifran Md Nor, J. J. Tan, Xingshe Zhou, Yee Wei Law","doi":"10.4108/CHINACOM.2010.63","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.63","url":null,"abstract":"A centralized self-localization algorithm is used to estimate sensor locations. From the known positions of at least 3 anchor nodes the remaining sensor positions are estimated using an efficient particle filter (PF) with progressive correction. The measurement model is a simple two-parameter log-normal shadowing model, where the parameters are estimated concurrently. Experiments using Crossbow Imote2 motes show that an error of less than 16% is achievable in an indoor environment. The results demonstrate that by using PF with progressive correction, a small number of measurements and a simple signal propagation model are sufficient to give low localization errors.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678032","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.72
Hui Ji, Ju Liu, Dapeng Zhang, Guowei Zhang, Yuxi Liu
Unitary space-time modulation (USTM) is ideally suited for rapid fading scenarios, where neither the transmitter nor the receiver have the channel state information (CSI). However, it has received limited attention compared with the space-time coding schemes that need CSI. An important reason for that is USTM needs too large calculation amount when meeting with a large size constellation. We propose a size-reduced method for unitary space-time constellations in the sight of interleaving. Resorting to the UST (Unitary Space-Time) symbol-wise interleaving, we give a pseudo-random fading effect to the transmitted signals for the receiver to meet the channel requirement in theory. Simulation results show that compared with existing almost unachievable schemes, our method can greatly reduce the complexity of calculation only with a slight penalty in theory.
{"title":"Construction of Unitary Space-Time constellations in the interleaving sight","authors":"Hui Ji, Ju Liu, Dapeng Zhang, Guowei Zhang, Yuxi Liu","doi":"10.4108/CHINACOM.2010.72","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.72","url":null,"abstract":"Unitary space-time modulation (USTM) is ideally suited for rapid fading scenarios, where neither the transmitter nor the receiver have the channel state information (CSI). However, it has received limited attention compared with the space-time coding schemes that need CSI. An important reason for that is USTM needs too large calculation amount when meeting with a large size constellation. We propose a size-reduced method for unitary space-time constellations in the sight of interleaving. Resorting to the UST (Unitary Space-Time) symbol-wise interleaving, we give a pseudo-random fading effect to the transmitted signals for the receiver to meet the channel requirement in theory. Simulation results show that compared with existing almost unachievable schemes, our method can greatly reduce the complexity of calculation only with a slight penalty in theory.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757442","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.97
Liang Zhou, J. Rodrigues, L. Yeung
A challenging problem of providing media services over vehicular networks is how to optimize the media content dissemination and vehicle cache update by intelligently considering opportunistic vehicle meet and different service requirements. In this work, we study this problem in the context of P2P-based vehicular networks, and develop fully dynamic service schemes with the goals of maximizing the total user-satisfaction and achieving certain fairness. We first construct a general user-satisfaction model according to the network's transmission mechanism, as well as different media's delay-satisfaction characteristics. Then, we formulate the media service as an optimization problem, and propose a joint content dissemination and cache update scheme. We also provide the exact steps to achieve the optimal solution at equilibrium given the user-satisfaction function. It is worth noting that the proposed scheme is designed in a distributed manner which is amenable to online implementation for vehicle networks. In addition, we provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.
{"title":"User-satisfaction-based media services over vehicular networks","authors":"Liang Zhou, J. Rodrigues, L. Yeung","doi":"10.4108/CHINACOM.2010.97","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.97","url":null,"abstract":"A challenging problem of providing media services over vehicular networks is how to optimize the media content dissemination and vehicle cache update by intelligently considering opportunistic vehicle meet and different service requirements. In this work, we study this problem in the context of P2P-based vehicular networks, and develop fully dynamic service schemes with the goals of maximizing the total user-satisfaction and achieving certain fairness. We first construct a general user-satisfaction model according to the network's transmission mechanism, as well as different media's delay-satisfaction characteristics. Then, we formulate the media service as an optimization problem, and propose a joint content dissemination and cache update scheme. We also provide the exact steps to achieve the optimal solution at equilibrium given the user-satisfaction function. It is worth noting that the proposed scheme is designed in a distributed manner which is amenable to online implementation for vehicle networks. In addition, we provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993497","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.100
Qiang Xue, G. Abreu
In this paper, we provide asymptotic analysis of the mutual information (MI) of the basic two-hop amplify-and-forward (AF) channel, where the relaying node is selected out of a pool of N potential relay nodes based on instantaneous backward channel state information (CSI). The asymptotic formula obtained by implementing extreme value theory (EVT) adopts a simpler form compared to the exact MI expression, which makes it easier to operate with. Despite its simplicity, the asymptotic expression is quite accurate even with small N, which is confirmed by numerical simulation. We show that the power allocation coefficient obtained by optimizing the asymptotic expression is close to the optimal value obtained from simulation results.
{"title":"Mutual information of amplify-and-forward relaying with partial relay selection","authors":"Qiang Xue, G. Abreu","doi":"10.4108/CHINACOM.2010.100","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.100","url":null,"abstract":"In this paper, we provide asymptotic analysis of the mutual information (MI) of the basic two-hop amplify-and-forward (AF) channel, where the relaying node is selected out of a pool of N potential relay nodes based on instantaneous backward channel state information (CSI). The asymptotic formula obtained by implementing extreme value theory (EVT) adopts a simpler form compared to the exact MI expression, which makes it easier to operate with. Despite its simplicity, the asymptotic expression is quite accurate even with small N, which is confirmed by numerical simulation. We show that the power allocation coefficient obtained by optimizing the asymptotic expression is close to the optimal value obtained from simulation results.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131063876","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 utilize the cooperative transmission schemes in distributed antenna system (DAS). Since the distributed antennas are sufficiently separated with each other, therefore it is reasonable to assume the transmitted signals undergo independent fading channels with non-identical distribution. By using of the moment generation function, we deduced the numerical expression of outage probability from Gauss-Chebychev quadrature. Furthermore we conducted an extensive channel measurement, which verifies the advantage of cooperative transmission schemes under the composite fading conditions.
{"title":"Outage probability analysis for distributed antenna system with cooperative transmission schemes","authors":"Fei Xiong, Jianhua Zhang, Ping Zhang","doi":"10.4108/IWONCMM.2010.4","DOIUrl":"https://doi.org/10.4108/IWONCMM.2010.4","url":null,"abstract":"In this paper we utilize the cooperative transmission schemes in distributed antenna system (DAS). Since the distributed antennas are sufficiently separated with each other, therefore it is reasonable to assume the transmitted signals undergo independent fading channels with non-identical distribution. By using of the moment generation function, we deduced the numerical expression of outage probability from Gauss-Chebychev quadrature. Furthermore we conducted an extensive channel measurement, which verifies the advantage of cooperative transmission schemes under the composite fading conditions.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134115517","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.159
D. Zhang, Xiaoming Tao, Youzheng Wang, Jianhua Lu
The fundamental limit of wireless communication is the tradeoff between efficiency and reliability. In order to improve system efficiency and reliability simultaneously, we have to create and explore new degrees of freedom. Multi-domain collaboration can be regarded as a systematic approach to solve this issue. From a broader and higher perspective, multi-domain is utilized to create the degrees of freedom, and collaboration is adopted to exploit the benefit of new degrees of freedom. In this paper, we illustrate this essential idea with three scenarios of link, multiuser and network. To provide an overview of the core idea of of multi-domain collaboration, we also summarize some of our recent works under the general framework from a new perspective of degrees of freedom.
{"title":"Multi-domain collaboration: Create and exploit the degrees of freedom in wireless communication","authors":"D. Zhang, Xiaoming Tao, Youzheng Wang, Jianhua Lu","doi":"10.4108/CHINACOM.2010.159","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.159","url":null,"abstract":"The fundamental limit of wireless communication is the tradeoff between efficiency and reliability. In order to improve system efficiency and reliability simultaneously, we have to create and explore new degrees of freedom. Multi-domain collaboration can be regarded as a systematic approach to solve this issue. From a broader and higher perspective, multi-domain is utilized to create the degrees of freedom, and collaboration is adopted to exploit the benefit of new degrees of freedom. In this paper, we illustrate this essential idea with three scenarios of link, multiuser and network. To provide an overview of the core idea of of multi-domain collaboration, we also summarize some of our recent works under the general framework from a new perspective of degrees of freedom.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133461818","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.56
M. Fouda, T. Taleb, M. Guizani, N. Kato
The current Internet framework is, no longer, able to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a consequence, researchers envision the “future Internet” whereby all these issues may be effectively addressed. The future Internet architecture, amongst many components, is expected to comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming technologies. Since the conventional streaming techniques over P2P frameworks have a number of shortcomings, design issues pertaining to the P2P VoD schemes need to be seriously reconsidered. In this paper, we envision a scheme to effectively provide a VoD using P2P-based mesh overlay networks that may be part of the future Internet. Our scheme also comprises domain-based localization and congestion awareness strategies for the selection of the most appropriate peers. Empirical results have demonstrated the effectiveness of this scheme in terms of scalability and capability to reduce the startup latency and total link cost, and to also ensure a sustainable playback rate that is crucial for providing VoD services over the future Internet.
{"title":"Towards efficient P2P-based VoD provisioning in future internet","authors":"M. Fouda, T. Taleb, M. Guizani, N. Kato","doi":"10.4108/CHINACOM.2010.56","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.56","url":null,"abstract":"The current Internet framework is, no longer, able to support the heterogeneous networking technologies, mobile devices, increased number of users, and also the high user requirements for sophisticated services and applications. As a consequence, researchers envision the “future Internet” whereby all these issues may be effectively addressed. The future Internet architecture, amongst many components, is expected to comprise Peer-to-Peer (P2P) Video on Demand (VoD) streaming technologies. Since the conventional streaming techniques over P2P frameworks have a number of shortcomings, design issues pertaining to the P2P VoD schemes need to be seriously reconsidered. In this paper, we envision a scheme to effectively provide a VoD using P2P-based mesh overlay networks that may be part of the future Internet. Our scheme also comprises domain-based localization and congestion awareness strategies for the selection of the most appropriate peers. Empirical results have demonstrated the effectiveness of this scheme in terms of scalability and capability to reduce the startup latency and total link cost, and to also ensure a sustainable playback rate that is crucial for providing VoD services over the future Internet.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763540","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.125
Tie Qiu, Lei Wang, He Guo, Xiaoyan Liu, Lin Feng, Lei Shu
Embedded vector processor is a kind of high-performance parallel processor. Pipeline design is a key technology in embedded vector microprocessors. This paper proposes a new modeling method for vector processor pipeline using open queueing network by instruction set feature of vector processor. According to instruction set distribution of vector processor in the practical projects and owing in the pipeline modeling, the model of pipeline queueing network is analyzed. Total delay and mean delay are computed in every path. A better solution of pipeline is put forward as a result of delay data. Serving time of server nodes is averaged by partitioning for pipeline modeling and adding processing nodes in executing model. In conclusion, the delay data before and after improvement pipeline scheme are analyzed: the delay distributing of improvement scheme is almost equality and choke points with long delay and unequal are avoided.
{"title":"A new modeling method for vector processor pipeline using queueing network","authors":"Tie Qiu, Lei Wang, He Guo, Xiaoyan Liu, Lin Feng, Lei Shu","doi":"10.4108/CHINACOM.2010.125","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.125","url":null,"abstract":"Embedded vector processor is a kind of high-performance parallel processor. Pipeline design is a key technology in embedded vector microprocessors. This paper proposes a new modeling method for vector processor pipeline using open queueing network by instruction set feature of vector processor. According to instruction set distribution of vector processor in the practical projects and owing in the pipeline modeling, the model of pipeline queueing network is analyzed. Total delay and mean delay are computed in every path. A better solution of pipeline is put forward as a result of delay data. Serving time of server nodes is averaged by partitioning for pipeline modeling and adding processing nodes in executing model. In conclusion, the delay data before and after improvement pipeline scheme are analyzed: the delay distributing of improvement scheme is almost equality and choke points with long delay and unequal are avoided.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125960581","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 exchange of independent information between two nodes in a wireless network can be viewed as a two-way traffic flow. Such information exchange can be efficiently performed by exploiting relaying technique in a two-way channel. In this paper, we introduce two novel relaying techniques for Bidirectional Amplification of the Throughput (BAT) relaying in wireless multi-hop networks, termed as Equalized Detect-and-Forward (EDF) and Pre-equalized Amplify-and-Forward (PAF) BAT relaying schemes respectively. It is shown that the EDF BAT relaying scheme can decrease the complexity of the relay node by equalizing at the relay node, and the PAF BAT relaying scheme can reduce the signaling overhead by pre-equalizing at the transmitter. Furthermore, we analyze the achievable throughput of these relaying schemes, considering the impact of the location of the relay node.
{"title":"Novel bi-directional relaying schemes in a wireless multi-hop network","authors":"Shengyao Jin, Honglin Hu, Francois Gagnony, Olivier Mungery","doi":"10.4108/CHINACOM.2010.144","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.144","url":null,"abstract":"The exchange of independent information between two nodes in a wireless network can be viewed as a two-way traffic flow. Such information exchange can be efficiently performed by exploiting relaying technique in a two-way channel. In this paper, we introduce two novel relaying techniques for Bidirectional Amplification of the Throughput (BAT) relaying in wireless multi-hop networks, termed as Equalized Detect-and-Forward (EDF) and Pre-equalized Amplify-and-Forward (PAF) BAT relaying schemes respectively. It is shown that the EDF BAT relaying scheme can decrease the complexity of the relay node by equalizing at the relay node, and the PAF BAT relaying scheme can reduce the signaling overhead by pre-equalizing at the transmitter. Furthermore, we analyze the achievable throughput of these relaying schemes, considering the impact of the location of the relay node.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"404 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678603","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.61
Tzu-Chieh Tsai, Tong-Yen Hsieh, Wen-Ching Lo
Peer-to-Peer (P2P) applications are popular recently and have become one of the hottest research topics. The participants can share their resources (such as processing power, disk storage, and network bandwidth) in the P2P architecture to collaborate file downloading and streaming services. In this paper, we design and implement an Interactive Internet Radio system using the P2P approach, called PeerIIR. When the host, co-hosts, and calliners are speaking at the same time, they will produce multiple streams which need to deliver to all the audience on the system. This will consume the network bandwidth inefficiently, or even exhaust the link capacity of the audience. Thus, how to process multiple streams produced at the same time and to deliver to all the audience efficiently is the key issue. When there is only one program host producing the audio stream, a distribution tree is built to distribute it. If there are co-hosts or calliners speaking, a distributed mixer negotiation algorithm is performed to build a voice mixing tree among PeerIIR servers. Therefore the audio streams are mixed distributedly and step by step along the mixing tree to save transmission bandwidth. The results from series of simulation show that the performance for response time and link/node stress is enhanced compared with some related works.
{"title":"PeerIIR: Peer-to-Peer interactive internet radio system","authors":"Tzu-Chieh Tsai, Tong-Yen Hsieh, Wen-Ching Lo","doi":"10.4108/CHINACOM.2010.61","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.61","url":null,"abstract":"Peer-to-Peer (P2P) applications are popular recently and have become one of the hottest research topics. The participants can share their resources (such as processing power, disk storage, and network bandwidth) in the P2P architecture to collaborate file downloading and streaming services. In this paper, we design and implement an Interactive Internet Radio system using the P2P approach, called PeerIIR. When the host, co-hosts, and calliners are speaking at the same time, they will produce multiple streams which need to deliver to all the audience on the system. This will consume the network bandwidth inefficiently, or even exhaust the link capacity of the audience. Thus, how to process multiple streams produced at the same time and to deliver to all the audience efficiently is the key issue. When there is only one program host producing the audio stream, a distribution tree is built to distribute it. If there are co-hosts or calliners speaking, a distributed mixer negotiation algorithm is performed to build a voice mixing tree among PeerIIR servers. Therefore the audio streams are mixed distributedly and step by step along the mixing tree to save transmission bandwidth. The results from series of simulation show that the performance for response time and link/node stress is enhanced compared with some related works.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450342","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
扫码关注我们
求助内容：
应助结果提醒方式：