Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700320
Matsuura Satoshi, Ochiai Hideya, Kimura Shingo, Fujikawa Kazutoshi, S. Hideki
We add data processing components onto content-based networks. Content-based networks provide publish/subscribe system in distributed environment and appropriate for notifications and alerts. If content-based networks process published data and create meaningful information, this system enhance the application fields in ubiquitous sensing environment. In this paper, we describe how to add data processing components onto content-based networks. On the contrary, data processing components causes concentrations of sensor data. We also describe load distribution mechanism of these components. Performance evaluations of our implementation shows that load distribution mechanism works well, and proposed system secure the scalability by adding data components.
{"title":"A large scale content-based network considering publish/process/subscribe","authors":"Matsuura Satoshi, Ochiai Hideya, Kimura Shingo, Fujikawa Kazutoshi, S. Hideki","doi":"10.1109/GLOCOMW.2010.5700320","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700320","url":null,"abstract":"We add data processing components onto content-based networks. Content-based networks provide publish/subscribe system in distributed environment and appropriate for notifications and alerts. If content-based networks process published data and create meaningful information, this system enhance the application fields in ubiquitous sensing environment. In this paper, we describe how to add data processing components onto content-based networks. On the contrary, data processing components causes concentrations of sensor data. We also describe load distribution mechanism of these components. Performance evaluations of our implementation shows that load distribution mechanism works well, and proposed system secure the scalability by adding data components.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677246","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}
Future Long Term Evolution (LTE) Radio Access Network (RAN) will benefit from a significant degree of self-organization. Autonomic Load Balancing (ALB) is considered as an important self-organizing function in LTE RAN. In this work, distributed ALB is achieved by Autonomic Network Management (ANM). Load conditions of eNBs (E-UTRAN NodeB) can be detected. Sizes and shapes of cellular coverage can be adjusted automatically according to load conditions, so as to balance load. Simulation results demonstrated that by the use of ALB, the system capacity can be improved significantly.
{"title":"Achieving distributed load balancing in self-organizing LTE radio access network with autonomic network management","authors":"Heng Zhang, Xue-song Qiu, Luoming Meng, Xidong Zhang","doi":"10.1109/GLOCOMW.2010.5700361","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700361","url":null,"abstract":"Future Long Term Evolution (LTE) Radio Access Network (RAN) will benefit from a significant degree of self-organization. Autonomic Load Balancing (ALB) is considered as an important self-organizing function in LTE RAN. In this work, distributed ALB is achieved by Autonomic Network Management (ANM). Load conditions of eNBs (E-UTRAN NodeB) can be detected. Sizes and shapes of cellular coverage can be adjusted automatically according to load conditions, so as to balance load. Simulation results demonstrated that by the use of ALB, the system capacity can be improved significantly.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131866440","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-12-01DOI: 10.1109/GLOCOMW.2010.5700157
C. Hoefer, Georgios Karagiannis
Cloud computing is a highly discussed topic, and many big players of the software industry are entering the development of cloud services. Several companies want to explore the possibilities and benefits of cloud computing, but with the amount of cloud computing services increasing quickly, the need for a taxonomy framework rises. This paper describes the available cloud computing services, and proposes a tree-structured taxonomy based on their characteristics, to easily classify cloud computing services making it easier to compare them.
{"title":"Taxonomy of cloud computing services","authors":"C. Hoefer, Georgios Karagiannis","doi":"10.1109/GLOCOMW.2010.5700157","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700157","url":null,"abstract":"Cloud computing is a highly discussed topic, and many big players of the software industry are entering the development of cloud services. Several companies want to explore the possibilities and benefits of cloud computing, but with the amount of cloud computing services increasing quickly, the need for a taxonomy framework rises. This paper describes the available cloud computing services, and proposes a tree-structured taxonomy based on their characteristics, to easily classify cloud computing services making it easier to compare them.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355898","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-12-01DOI: 10.1109/GLOCOMW.2010.5700209
Xiaolie Ye, L. Liao
The OWL 1has been as a modeling language to formalize context-awareness pervasive environments. And also, various kinds of context ontologies in the OWL are proposed to conceptualize the entities for describing pervasive computing environments. With increasingly considering about spatial and temporal expressive capabilities and properties related for pervasive computing, these approaches provide some methods for context reasoning. However, for context reasoning on temporal properties relating to the behaviors of each entity in pervasive environments, the reasoning mechanism in these approach are not sufficient to follow ontology reasoning, such ontology entailment or consistence. Therefore, the OWL-based Past Linear Temporal Logic is proposed to formulate temporal properties along a sequence of context or situation changes using a fragment of the OWL. In particular, with refining the method for reducing the validity of contextual temporal properties into the entailment relationship in the OWL, we propose an approach to transform the verification of the authenticity in a sequence of interactions into the validity of the Past-LTL formula corresponding.
{"title":"OWL-based verifying temporal properties for pervasive computing","authors":"Xiaolie Ye, L. Liao","doi":"10.1109/GLOCOMW.2010.5700209","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700209","url":null,"abstract":"The OWL 1has been as a modeling language to formalize context-awareness pervasive environments. And also, various kinds of context ontologies in the OWL are proposed to conceptualize the entities for describing pervasive computing environments. With increasingly considering about spatial and temporal expressive capabilities and properties related for pervasive computing, these approaches provide some methods for context reasoning. However, for context reasoning on temporal properties relating to the behaviors of each entity in pervasive environments, the reasoning mechanism in these approach are not sufficient to follow ontology reasoning, such ontology entailment or consistence. Therefore, the OWL-based Past Linear Temporal Logic is proposed to formulate temporal properties along a sequence of context or situation changes using a fragment of the OWL. In particular, with refining the method for reducing the validity of contextual temporal properties into the entailment relationship in the OWL, we propose an approach to transform the verification of the authenticity in a sequence of interactions into the validity of the Past-LTL formula corresponding.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492892","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-12-01DOI: 10.1109/GLOCOMW.2010.5700281
L. Dolecek
Emerging non-volatile memory devices show tremendous promise for a wide variety of applications, ranging from consumer electronics to server technologies. The advent of such multi-scale opportunities also carries a unique set of challenges. Increasingly popular Flash memory devices possess an intrinsic asymmetry during the write operation: programming memory cells to values lower than currently stored values is considerably slower and more costly than programming to higher values. It is critical to keep this cost low, as it directly affects memory lifetime and performance. Concurrently, demands for higher densities under reduced technology sizing make the data reliability a formidable objective. To address the compound issue of sustained and low-cost data reliability and high performance, in this work we propose a methodology to provide guaranteed immunity to a prescribed number of asymmetric errors, while having asymptotically negligible redundancy. Our construction uses ideas from additive and combinatorial number theory, and builds upon recently introduced coding schemes. We first show how this construction can be used in the single level cell (SLC) setup, and subsequently extend the construction to the setting with several levels per cell, including multi-level cell (MLC) and triple-level (TLC) setting. We also discuss practical aspects of such schemes, including methods for systematic encoding, correction of limited-magnitude errors, and the additional protection under a certain number of bidirectional errors. This number-theoretic based approach is a promising direction for extending the lifetime of memories at sustained reliability.
{"title":"Towards longer lifetime of emerging memory technologies using number theory","authors":"L. Dolecek","doi":"10.1109/GLOCOMW.2010.5700281","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700281","url":null,"abstract":"Emerging non-volatile memory devices show tremendous promise for a wide variety of applications, ranging from consumer electronics to server technologies. The advent of such multi-scale opportunities also carries a unique set of challenges. Increasingly popular Flash memory devices possess an intrinsic asymmetry during the write operation: programming memory cells to values lower than currently stored values is considerably slower and more costly than programming to higher values. It is critical to keep this cost low, as it directly affects memory lifetime and performance. Concurrently, demands for higher densities under reduced technology sizing make the data reliability a formidable objective. To address the compound issue of sustained and low-cost data reliability and high performance, in this work we propose a methodology to provide guaranteed immunity to a prescribed number of asymmetric errors, while having asymptotically negligible redundancy. Our construction uses ideas from additive and combinatorial number theory, and builds upon recently introduced coding schemes. We first show how this construction can be used in the single level cell (SLC) setup, and subsequently extend the construction to the setting with several levels per cell, including multi-level cell (MLC) and triple-level (TLC) setting. We also discuss practical aspects of such schemes, including methods for systematic encoding, correction of limited-magnitude errors, and the additional protection under a certain number of bidirectional errors. This number-theoretic based approach is a promising direction for extending the lifetime of memories at sustained reliability.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115093880","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-12-01DOI: 10.1109/GLOCOMW.2010.5700319
S. Støa, R. Chávez-Santiago, I. Balasingham
Long-term implantable devices communicating with receivers in the outer human body through a wireless interface are one of the most prominent applications of micro/nano-technology in medicine. Ultra wideband (UWB) interfaces have great potential for the communication links of these telemedicine applications due to their inherent low power consumption, high transmission rates, and simple electronics. Novel implant medical sensors and actuators operate in the abdomen at different depths, which makes an "abdominal" channel model essential for the proper design of the UWB communication interfaces of said devices. This paper presents a statistical model for the propagation of a UWB pulse through the abdominal region in the 1–6 GHz frequency band. For the development of this statistical model, numerical electromagnetic (EM) simulations were conducted using a digital anatomical model that includes the dielectric properties of human tissues; using this EM simulator, the channel responses of many in-body probes were computed. Based on the statistical analysis of the obtained data, we provide the mathematical expressions to calculate the path loss and shadowing at depths between 10–150 mm inside the abdomen. In addition, the channel impulse response (CIR) can be reproduced using a set of statistical formulas also provided. Our proposed model approximates very well the abdominal in-body channel properties, thereby eliminating the need for time-consuming and complex numerical simulations.
{"title":"An ultra wideband communication channel model for the human abdominal region","authors":"S. Støa, R. Chávez-Santiago, I. Balasingham","doi":"10.1109/GLOCOMW.2010.5700319","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700319","url":null,"abstract":"Long-term implantable devices communicating with receivers in the outer human body through a wireless interface are one of the most prominent applications of micro/nano-technology in medicine. Ultra wideband (UWB) interfaces have great potential for the communication links of these telemedicine applications due to their inherent low power consumption, high transmission rates, and simple electronics. Novel implant medical sensors and actuators operate in the abdomen at different depths, which makes an \"abdominal\" channel model essential for the proper design of the UWB communication interfaces of said devices. This paper presents a statistical model for the propagation of a UWB pulse through the abdominal region in the 1–6 GHz frequency band. For the development of this statistical model, numerical electromagnetic (EM) simulations were conducted using a digital anatomical model that includes the dielectric properties of human tissues; using this EM simulator, the channel responses of many in-body probes were computed. Based on the statistical analysis of the obtained data, we provide the mathematical expressions to calculate the path loss and shadowing at depths between 10–150 mm inside the abdomen. In addition, the channel impulse response (CIR) can be reproduced using a set of statistical formulas also provided. Our proposed model approximates very well the abdominal in-body channel properties, thereby eliminating the need for time-consuming and complex numerical simulations.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117195891","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-12-01DOI: 10.1109/GLOCOMW.2010.5700451
Yuh-Rong Chen, S. Radhakrishnan, S. Dhall, S. Karabuk
Improving latency is the key to a successful online game-playing experience. With the use of multiple servers along with a well-provisioned network it is possible to reduce the latency. Given a network of servers, game clients, and a desired delay bound, we have designed algorithms to determine the subnetwork of servers whose cardinality is minimal. We have considered the cases wherein the subnetwork architecture is a client-server and a peer-to-peer. We have also provided exhaustive empirical evaluations of our algorithms and compared their performance with the optimum. Experimental results show that our polynomial-time algorithms could find good solutions quickly.
{"title":"Server selection with delay constraints for online games","authors":"Yuh-Rong Chen, S. Radhakrishnan, S. Dhall, S. Karabuk","doi":"10.1109/GLOCOMW.2010.5700451","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700451","url":null,"abstract":"Improving latency is the key to a successful online game-playing experience. With the use of multiple servers along with a well-provisioned network it is possible to reduce the latency. Given a network of servers, game clients, and a desired delay bound, we have designed algorithms to determine the subnetwork of servers whose cardinality is minimal. We have considered the cases wherein the subnetwork architecture is a client-server and a peer-to-peer. We have also provided exhaustive empirical evaluations of our algorithms and compared their performance with the optimum. Experimental results show that our polynomial-time algorithms could find good solutions quickly.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123684631","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-12-01DOI: 10.1109/GLOCOMW.2010.5700392
M. Ramkumar, Bayu Anggorojati, A. Stefan, R. Neeli, R. Prasad
This paper proposes a novel admission control (AC) algorithm for guaranteed quality of service (QoS) to all users. The proposed solution provides better utilization of system capacity using adaptive modulation (AM). A scheduler based on a per user priority function is also given in this paper. The AC is given by allocating the exact number of slots for each user that will meet its QoS. For every new user the number of slots required to meet its service requirements is estimated based on its channel quality information (CQI), packet arrival rate and buffer length. Using the average QoS achieved, the satisfaction index (SI) and priority is calculated for every user, which is used as key input for the scheduler. Further, the resource allocation in time and frequency for Orthogonal Frequency Division Multiplexing (OFDMA) systems is also discussed based on user satisfaction and number of slots required for each user. Finally, the proposed design is validated with OFDMA systems, but can be extended to any wireless system.
{"title":"QoS-guaranteed admission control for OFDMA-based systems","authors":"M. Ramkumar, Bayu Anggorojati, A. Stefan, R. Neeli, R. Prasad","doi":"10.1109/GLOCOMW.2010.5700392","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700392","url":null,"abstract":"This paper proposes a novel admission control (AC) algorithm for guaranteed quality of service (QoS) to all users. The proposed solution provides better utilization of system capacity using adaptive modulation (AM). A scheduler based on a per user priority function is also given in this paper. The AC is given by allocating the exact number of slots for each user that will meet its QoS. For every new user the number of slots required to meet its service requirements is estimated based on its channel quality information (CQI), packet arrival rate and buffer length. Using the average QoS achieved, the satisfaction index (SI) and priority is calculated for every user, which is used as key input for the scheduler. Further, the resource allocation in time and frequency for Orthogonal Frequency Division Multiplexing (OFDMA) systems is also discussed based on user satisfaction and number of slots required for each user. Finally, the proposed design is validated with OFDMA systems, but can be extended to any wireless system.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125843078","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-12-01DOI: 10.1109/GLOCOMW.2010.5700242
Sameera S. Ponda, Olivier Huber, Han-Lim Choi, J. How
This paper proposes an extension to the Consensus-Based Bundle Algorithm (CBBA), a distributed task allocation framework previously developed at the Aerospace Control Laboratory (ACL), MIT, designed to address complex mission planning for a team of heterogeneous agents operating in a dynamic environment. A key assumption of CBBA involves having a connected network, a constraint which is not always feasible in realistic mission scenarios. In this paper, we present a mechanism that aims at preventing and repairing network disconnects. The dynamic network topology is predicted using available information within the planner and relay tasks are created to strengthen the connectivity of the network. By employing underutilized resources, the presented approach improves network connectivity without limiting the scope of the active agents thus improving mission performance.
{"title":"Avoid communication outages in decentralized planning","authors":"Sameera S. Ponda, Olivier Huber, Han-Lim Choi, J. How","doi":"10.1109/GLOCOMW.2010.5700242","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700242","url":null,"abstract":"This paper proposes an extension to the Consensus-Based Bundle Algorithm (CBBA), a distributed task allocation framework previously developed at the Aerospace Control Laboratory (ACL), MIT, designed to address complex mission planning for a team of heterogeneous agents operating in a dynamic environment. A key assumption of CBBA involves having a connected network, a constraint which is not always feasible in realistic mission scenarios. In this paper, we present a mechanism that aims at preventing and repairing network disconnects. The dynamic network topology is predicted using available information within the planner and relay tasks are created to strengthen the connectivity of the network. By employing underutilized resources, the presented approach improves network connectivity without limiting the scope of the active agents thus improving mission performance.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759628","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-12-01DOI: 10.1109/GLOCOMW.2010.5700262
L. A. Lastras-Montaño, A. Jagmohan, M. Franceschini
We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.
{"title":"An area and latency assessment for coding for memories with stuck cells","authors":"L. A. Lastras-Montaño, A. Jagmohan, M. Franceschini","doi":"10.1109/GLOCOMW.2010.5700262","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700262","url":null,"abstract":"We explore the implementation in hardware of encoders for algebraic codes for binary memories that have some cells stuck to given values. The location and stuck values of the cells are assumed to be known at encode time, but not at decode time. Recently, an algorithm for BCH-like codes for stuck cells was developed that relies on a type of polynomial interpolation in an extension field followed by a step of projection of the result of the interpolation back into the binary field. In this article, we report on the area and latency of a sequential implementation of this encoding algorithm for a variety of values for the number of stuck cells. The statistics on area and latency follow from preliminary circuit synthesis results obtained from a full VHDL implementation of these examples.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124777873","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
扫码关注我们
求助内容：
应助结果提醒方式：