Byoung-Suk Choi, Joon-Woo Lee, Jujang Lee, Kyoung-Taik Park
This paper presents a distributed wireless sensor network for multiple mobile agents localization. Localization of mobile agents, such as mobile robots, humans, and moving objects, in an indoor space is essential for robot-robot interaction (RRI) and human-robot interaction (HRI). The standard localization system, which is based on sensors installed in the robot body, is not suitable for multiple agents. Therefore, the concept of sensor network, which uses wireless sensors distributed in a specified space, is used in this study. By analyzing related studies, two solutions are proposed for the localization of mobile agents including humans: a new hardware system and a new software algorithm. The first solution focuses on the architectural design of the wireless sensor network for multiple agent localization. A passive RFID system is used, and then the architecture of the sensor network is adapted to suit the target system. The second solution centers on a localization algorithm based on the sensor network. The proposed localization algorithm improves the accuracy in the multiple agent localization system. The algorithm uses the displacement conditions of the mobile agents and the recognition changes between the RFID tags and RFID reader. Through experiments using a real platform, the usefulness of the proposed system is verified.
{"title":"Distributed Sensor Network Based on RFID System for Localization of Multiple Mobile Agents","authors":"Byoung-Suk Choi, Joon-Woo Lee, Jujang Lee, Kyoung-Taik Park","doi":"10.4236/wsn.2011.31001","DOIUrl":"https://doi.org/10.4236/wsn.2011.31001","url":null,"abstract":"This paper presents a distributed wireless sensor network for multiple mobile agents localization. Localization of mobile agents, such as mobile robots, humans, and moving objects, in an indoor space is essential for robot-robot interaction (RRI) and human-robot interaction (HRI). The standard localization system, which is based on sensors installed in the robot body, is not suitable for multiple agents. Therefore, the concept of sensor network, which uses wireless sensors distributed in a specified space, is used in this study. By analyzing related studies, two solutions are proposed for the localization of mobile agents including humans: a new hardware system and a new software algorithm. The first solution focuses on the architectural design of the wireless sensor network for multiple agent localization. A passive RFID system is used, and then the architecture of the sensor network is adapted to suit the target system. The second solution centers on a localization algorithm based on the sensor network. The proposed localization algorithm improves the accuracy in the multiple agent localization system. The algorithm uses the displacement conditions of the mobile agents and the recognition changes between the RFID tags and RFID reader. Through experiments using a real platform, the usefulness of the proposed system is verified.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520973","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}
Oscar Filio-Rodriguez, V. Kontorovich, S. Primak, F. Ramos-Alarcón
In this paper it is shown that cyclostationary spectrum sensing for Cognitive Radio networks, applying multiple cyclic frequencies for single user detection can be interpreted (with some assumptions) in terms of optimal incoherent diversity addition for “virtual diversity branches” or SIMO radar. This approach allows proposing, by analogy to diversity combining, suboptimal algorithms which can provide near optimal characteristics for the Neyman-Pearson Test (NPT) for single user detection. The analysis is based on the Generalized Gaussian (Klovsky-Middleton) Channel Model, which allows obtaining the NPT noise immunity characteristics: probability of misdetection error (PM) and probability of false alarm (Pfa) or Receiver Operational Characteristics (ROC) in the most general way. Some quasi-optimum algorithms such as energetic receiver and selection addition algorithm are analyzed and their comparison with the noise immunity properties (ROC) of the optimum approach is provided as well. Finally, the diversity combining approach is applied for the collaborative spectrum sensing and censoring. It is shown how the diversity addition principles are applied for distributed detection algorithms, called hereafter as SIMO radar or distributed SIMO radar, implementing Majority Addition (MA) approach and Weighted Majority Addition (WMA) principle.
{"title":"Collaborative Spectrum Sensing for Cognitive Radio: Diversity Combining Approach","authors":"Oscar Filio-Rodriguez, V. Kontorovich, S. Primak, F. Ramos-Alarcón","doi":"10.4236/wsn.2011.31004","DOIUrl":"https://doi.org/10.4236/wsn.2011.31004","url":null,"abstract":"In this paper it is shown that cyclostationary spectrum sensing for Cognitive Radio networks, applying multiple cyclic frequencies for single user detection can be interpreted (with some assumptions) in terms of optimal incoherent diversity addition for “virtual diversity branches” or SIMO radar. This approach allows proposing, by analogy to diversity combining, suboptimal algorithms which can provide near optimal characteristics for the Neyman-Pearson Test (NPT) for single user detection. The analysis is based on the Generalized Gaussian (Klovsky-Middleton) Channel Model, which allows obtaining the NPT noise immunity characteristics: probability of misdetection error (PM) and probability of false alarm (Pfa) or Receiver Operational Characteristics (ROC) in the most general way. Some quasi-optimum algorithms such as energetic receiver and selection addition algorithm are analyzed and their comparison with the noise immunity properties (ROC) of the optimum approach is provided as well. Finally, the diversity combining approach is applied for the collaborative spectrum sensing and censoring. It is shown how the diversity addition principles are applied for distributed detection algorithms, called hereafter as SIMO radar or distributed SIMO radar, implementing Majority Addition (MA) approach and Weighted Majority Addition (WMA) principle.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129056667","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}
Nowadays, sensor networks are widely installed around the world. Typical sensors provide data for healthcare, energy management, environmental monitoring, etc. In the future sensors will become a part of critical infrastructures. In such a scenario the network operator has to monitor the integrity of the network devices, otherwise the trustworthiness of the whole system is questionable. The problem is that every integrity protocol needs a secure channel between the devices. Therefore, we will introduce a covert channel for hidden transportation of integrity monitoring messages. The covert channel enables us to hide integrity check messages embedded into regular traffic without giving potential attackers a hint on the used integrity protocol.
{"title":"Concealed Integrity Monitoring for Wireless Sensor Networks","authors":"Björn Stelte, Thomas Bühring","doi":"10.4236/wsn.2011.31002","DOIUrl":"https://doi.org/10.4236/wsn.2011.31002","url":null,"abstract":"Nowadays, sensor networks are widely installed around the world. Typical sensors provide data for healthcare, energy management, environmental monitoring, etc. In the future sensors will become a part of critical infrastructures. In such a scenario the network operator has to monitor the integrity of the network devices, otherwise the trustworthiness of the whole system is questionable. The problem is that every integrity protocol needs a secure channel between the devices. Therefore, we will introduce a covert channel for hidden transportation of integrity monitoring messages. The covert channel enables us to hide integrity check messages embedded into regular traffic without giving potential attackers a hint on the used integrity protocol.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111144","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}
Recent advances in wireless communications are diffusing into many new applications. The tiny sensor node, which consists of sensing, data processing and communicating components, led to the idea of sensor networks. A sensor network composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The applications envisioned for sensor networks vary from monitoring inhospitable habitats and disaster areas to operating indoors for intrusion detection and equipment monitoring. In most cases the network designer would have little control over the exact deployment of the network. Nowadays Vehicular Networks are drawing lots of attention due to the wide variety of applications that they can provide. These applications include traffic monitoring, positioning, security etc. A lot of research work is being conducted to define the standard for vehicular communication. These include frequency allocation, standards for physical and link layers, routing algorithms, security issues and new applications. In this paper we discuss the disadvantages of the traffic monitoring by traditional methods and by using GPS equipped sensors. Then we propose a new routing protocol for a fixed topology containing both stationary and mobile nodes. We also try to optimize the energy of the sensor nodes. We simulate our routing algorithm in MATLAB and evaluate it for different possible cases.
{"title":"A Novel Routing Algorithm for Vehicular Sensor Networks","authors":"M. Piran, G. R. Murthy","doi":"10.4236/wsn.2010.212110","DOIUrl":"https://doi.org/10.4236/wsn.2010.212110","url":null,"abstract":"Recent advances in wireless communications are diffusing into many new applications. The tiny sensor node, which consists of sensing, data processing and communicating components, led to the idea of sensor networks. A sensor network composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The applications envisioned for sensor networks vary from monitoring inhospitable habitats and disaster areas to operating indoors for intrusion detection and equipment monitoring. In most cases the network designer would have little control over the exact deployment of the network. Nowadays Vehicular Networks are drawing lots of attention due to the wide variety of applications that they can provide. These applications include traffic monitoring, positioning, security etc. A lot of research work is being conducted to define the standard for vehicular communication. These include frequency allocation, standards for physical and link layers, routing algorithms, security issues and new applications. In this paper we discuss the disadvantages of the traffic monitoring by traditional methods and by using GPS equipped sensors. Then we propose a new routing protocol for a fixed topology containing both stationary and mobile nodes. We also try to optimize the energy of the sensor nodes. We simulate our routing algorithm in MATLAB and evaluate it for different possible cases.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131330044","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}
Employing cooperative communication in multihop wireless sensor networks provides the network with significant energy efficiency. However, the lifetime of such a network is directly dependant upon the lifetime of each of its individual sections (or clusters). Ignoring the fact that those sections close to sink have to forward more data (their own data plus the data received from the previous sections) and hence die sooner with considering equal section sizes, leads to a sub-optimal lifetime. In this paper, we optimize the section sizes of a multihop cooperative WSN so that it maximizes the network lifetime. Simulation results demonstrate a significant lifetime enhancement for the proposed optimal sectoring.
{"title":"Lifetime Optimization via Network Sectoring in Cooperative Wireless Sensor Networks","authors":"H. J. Rad, B. Abolhassani, Mohammad Abdizadeh","doi":"10.4236/wsn.2010.212108","DOIUrl":"https://doi.org/10.4236/wsn.2010.212108","url":null,"abstract":"Employing cooperative communication in multihop wireless sensor networks provides the network with significant energy efficiency. However, the lifetime of such a network is directly dependant upon the lifetime of each of its individual sections (or clusters). Ignoring the fact that those sections close to sink have to forward more data (their own data plus the data received from the previous sections) and hence die sooner with considering equal section sizes, leads to a sub-optimal lifetime. In this paper, we optimize the section sizes of a multihop cooperative WSN so that it maximizes the network lifetime. Simulation results demonstrate a significant lifetime enhancement for the proposed optimal sectoring.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124294748","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}
Helping hosts are intensively used in various schemes to restore partitioned Mobile Ad Hoc Networks (MANETs).Most of the existing schemes offers only deterministic deployment and fixed routes for the helping hosts, and are thus not able to deal with fluctuating network traffic, which is a practical condition in many MANET applications. In this paper, we argue that flexible helping hosts (referred to as Message Cabs (MCabs)), with deployment and routes that response to the changes in the traffic demand of the network, may overcome this drawback and reduce the message delay in the networks. To demonstrate the effectiveness of this observation, we propose a new helping host scheme namely the Message Cab (MCab) scheme for partition restoration in MANETs, and validate the performance through simulations.
{"title":"Message Cab (MCab): Partition Restoration in MANETs Using Flexible Helping Hosts","authors":"Ting Wang, C. Low","doi":"10.4236/WSN.2010.212107","DOIUrl":"https://doi.org/10.4236/WSN.2010.212107","url":null,"abstract":"Helping hosts are intensively used in various schemes to restore partitioned Mobile Ad Hoc Networks (MANETs).Most of the existing schemes offers only deterministic deployment and fixed routes for the helping hosts, and are thus not able to deal with fluctuating network traffic, which is a practical condition in many MANET applications. In this paper, we argue that flexible helping hosts (referred to as Message Cabs \u0000(MCabs)), with deployment and routes that response to the changes in the traffic demand of the network, may overcome this drawback and reduce the message delay in the networks. To demonstrate the effectiveness of this observation, we propose a new helping host scheme namely the Message Cab (MCab) scheme for partition restoration in MANETs, and validate the performance through simulations.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296575","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}
Masoume Jabbarifar, Alireza Shameli-Sendi, Alireza Sadighian, Naser Ezzati-Jivan, M. Dagenais
L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for the synchronization precision of two remote nodes was considered. Clustering in L-SYNC is according to larger degree techniques. These techniques reduce cluster overlapping, resulting in the routing algorithm requiring fewer hops to move from one cluster to another remote cluster. Even though L-SYNC offers higher precision compared to other algorithms, it does not support heterogeneous topologies and its synchronization algorithm can be influenced by unreliable data. In this paper, we present the L-SYNCng (L-SYNC next generation) protocol, working in heterogeneous topologies. Our proposed protocol is scalable in unreliable and noisy environments. Simulation results illustrate that L-SYNCng has better precision in synchronization and scalability.
{"title":"A Reliable and Efficient Time Synchronization Protocol for Heterogeneous Wireless Sensor Network","authors":"Masoume Jabbarifar, Alireza Shameli-Sendi, Alireza Sadighian, Naser Ezzati-Jivan, M. Dagenais","doi":"10.4236/wsn.2010.212109","DOIUrl":"https://doi.org/10.4236/wsn.2010.212109","url":null,"abstract":"L-SYNC is a synchronization protocol for Wireless Sensor Networks which is based on larger degree clustering providing efficiency in homogeneous topologies. In L-SYNC, the effectiveness of the routing algorithm for the synchronization precision of two remote nodes was considered. Clustering in L-SYNC is according to larger degree techniques. These techniques reduce cluster overlapping, resulting in the routing algorithm requiring fewer hops to move from one cluster to another remote cluster. Even though L-SYNC offers higher precision compared to other algorithms, it does not support heterogeneous topologies and its synchronization algorithm can be influenced by unreliable data. In this paper, we present the L-SYNCng (L-SYNC next generation) protocol, working in heterogeneous topologies. Our proposed protocol is scalable in unreliable and noisy environments. Simulation results illustrate that L-SYNCng has better precision in synchronization and scalability.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"73 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120820246","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}
Omnidirectional antennas are often used for radio frequency (RF) communication in wireless sensor networks (WSNs). Outside noise, electromagnetic interference (EMI), overloaded network traffic, large obstacles (vegetation and buildings), terrain and atmospheric composition, along with climate patterns can degrade signal quality in the form of data packet loss or reduced RF communication range. This paper explores the RF range reduction properties of a particular WSN designed to operate in agricultural crop fields to collect aggregate data composed of subsurface soil moisture and soil temperature. Our study, using simulation, anechoic and field measurements shows that the effect of antenna placement close to the ground (within 10 cm) signi?cantly changes the omnidirectional transmission pattern. We then develop and propose a prediction method that is more precise than current practices of using the Friis and Fresnel equations. Our prediction method takes into account environmental properties for RF communication range based on the height of nodes and gateways.
{"title":"Predicting Ground Effects of Omnidirectional Antennas in Wireless Sensor Networks","authors":"J. Janek, Jeffrey J. Evans","doi":"10.4236/wsn.2010.212106","DOIUrl":"https://doi.org/10.4236/wsn.2010.212106","url":null,"abstract":"Omnidirectional antennas are often used for radio frequency (RF) communication in wireless sensor networks (WSNs). Outside noise, electromagnetic interference (EMI), overloaded network traffic, large obstacles (vegetation and buildings), terrain and atmospheric composition, along with climate patterns can degrade signal quality in the form of data packet loss or reduced RF communication range. This paper explores the RF range reduction properties of a particular WSN designed to operate in agricultural crop fields to collect aggregate data composed of subsurface soil moisture and soil temperature. Our study, using simulation, anechoic and field measurements shows that the effect of antenna placement close to the ground (within 10 cm) signi?cantly changes the omnidirectional transmission pattern. We then develop and propose a prediction method that is more precise than current practices of using the Friis and Fresnel equations. Our prediction method takes into account environmental properties for RF communication range based on the height of nodes and gateways.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781877","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}
Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.
{"title":"Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks","authors":"R. Montemanni","doi":"10.4236/wsn.2010.212111","DOIUrl":"https://doi.org/10.4236/wsn.2010.212111","url":null,"abstract":"Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117249914","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}
We present a simulation framework for wireless sensor networks developed to allow the design exploration and the complete microprocessor-instruction-level debug of network formation, data congestion, nodes interaction, all in one simulation environment. A specifically innovative feature is the co-emulation of selected nodes at clock-cycle-accurate hardware processing level, allowing code debug and exact execution latency evaluation (considering both protocol stack and application), together with other nodes at abstract protocol level, meeting a designer’s needs of simulation speed, scalability and reliability. The simulator is centered on the Zigbee protocol and can be retargeted for different node micro-architectures.
{"title":"TikTak: A Scalable Simulator of Wireless Sensor Networks Including Hardware/Software Interaction","authors":"F. Menichelli, M. Olivieri","doi":"10.4236/wsn.2010.211098","DOIUrl":"https://doi.org/10.4236/wsn.2010.211098","url":null,"abstract":"We present a simulation framework for wireless sensor networks developed to allow the design exploration and the complete microprocessor-instruction-level debug of network formation, data congestion, nodes interaction, all in one simulation environment. A specifically innovative feature is the co-emulation of selected nodes at clock-cycle-accurate hardware processing level, allowing code debug and exact execution latency evaluation (considering both protocol stack and application), together with other nodes at abstract protocol level, meeting a designer’s needs of simulation speed, scalability and reliability. The simulator is centered on the Zigbee protocol and can be retargeted for different node micro-architectures.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682532","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
扫码关注我们
求助内容：
应助结果提醒方式：