We study the problem of scheduling multi sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors under a given number of visits in each period.
{"title":"Complexity Results for Wireless Sensor Network Scheduling","authors":"Fethi Jarray","doi":"10.4236/wsn.2010.24045","DOIUrl":"https://doi.org/10.4236/wsn.2010.24045","url":null,"abstract":"We study the problem of scheduling multi sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors under a given number of visits in each period.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123922664","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 most important components of the cognitive radio concept is its ability to measure, sense and learn. One also should be aware of the parameters related to the radio channel characteristics and the availability of spectrum and power. In cognitive radio technology, primary users can be defined as the users who have the highest priority on the usage of a specific part of the spectrum. Secondary users, have lower priority, and should not cause any interference to the primary users when using the technology. Therefore, the secondary users need to have certain cognitive radio capabilities, such as sensing the spectrum to check whether it is being used by primary user or not, and changing the radio parameters to exploit the unused part of the spectrum. In this paper we proposed a new approach for spectrum sensing, In the first approach the primary signal is known so we use the code value with match filter to detect the primary user, on the other hand, when the primary user signal is unknown we proposed a new strategy for energy detection in both non-cooperation and cooperation schemes. Then we will prove by simulation results that the new approach is better than the conventional energy detection.
{"title":"Detection Proposal Schemes for Spectrum Sensing in Cognitive Radio","authors":"N. Kamil, Xiuhua Yuan","doi":"10.4236/wsn.2010.24048","DOIUrl":"https://doi.org/10.4236/wsn.2010.24048","url":null,"abstract":"The most important components of the cognitive radio concept is its ability to measure, sense and learn. One also should be aware of the parameters related to the radio channel characteristics and the availability of spectrum and power. In cognitive radio technology, primary users can be defined as the users who have the highest priority on the usage of a specific part of the spectrum. Secondary users, have lower priority, and should not cause any interference to the primary users when using the technology. Therefore, the secondary users need to have certain cognitive radio capabilities, such as sensing the spectrum to check whether it is being used by primary user or not, and changing the radio parameters to exploit the unused part of the spectrum. In this paper we proposed a new approach for spectrum sensing, In the first approach the primary signal is known so we use the code value with match filter to detect the primary user, on the other hand, when the primary user signal is unknown we proposed a new strategy for energy detection in both non-cooperation and cooperation schemes. Then we will prove by simulation results that the new approach is better than the conventional energy detection.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127795687","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}
While sensor networks have been used in various applications because of the automatic sensing capability and ad-hoc organization of sensor nodes, the fault-prone characteristic of sensor networks has challenged the event detection and the anomaly detection which, to some extent, have neglected the importance of discriminating events and errors. Considering data uncertainty, in this article, we present the problem of data discrimination in fault-prone sensor networks, analyze the similarities and the differences between events and errors, and design a multi-level systematic discrimination framework. In each step, the framework filters erroneous data from the raw data and marks potential event samples for the next-step processing. The raw data set D is finally partitioned into three subsets, Devent, Derror and Dordinary. Both the scenario-based simulations and the experiments on real-sensed data are carried out. The statistical results of various discrimination metrics demonstrate high distinction ratio as well as the robustness in different cases of the network.
{"title":"Data Discrimination in Fault-Prone Sensor Networks","authors":"Xiaoning Cui, Qing Li, Bao-hua Zhao","doi":"10.4236/wsn.2010.24039","DOIUrl":"https://doi.org/10.4236/wsn.2010.24039","url":null,"abstract":"While sensor networks have been used in various applications because of the automatic sensing capability and ad-hoc organization of sensor nodes, the fault-prone characteristic of sensor networks has challenged the event detection and the anomaly detection which, to some extent, have neglected the importance of discriminating events and errors. Considering data uncertainty, in this article, we present the problem of data discrimination in fault-prone sensor networks, analyze the similarities and the differences between events and errors, and design a multi-level systematic discrimination framework. In each step, the framework filters erroneous data from the raw data and marks potential event samples for the next-step processing. The raw data set D is finally partitioned into three subsets, Devent, Derror and Dordinary. Both the scenario-based simulations and the experiments on real-sensed data are carried out. The statistical results of various discrimination metrics demonstrate high distinction ratio as well as the robustness in different cases of the network.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133969833","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}
A. Aghagolzadeh, S. Meshgini, M. Nooshyar, M. Aghagolzadeh
In this paper, we propose a new method for very low bit-rate video coding that combines H.264/AVC standard and two-dimensional discrete wavelet transform. In this method, first a two dimensional wavelet transform is applied on each video frame independently to extract the low frequency components for each frame and then the low frequency parts of all frames are coded using H.264/AVC codec. On the other hand, the high frequency parts of the video frames are coded by Run Length Coding algorithm, after applying a threshold to neglect the low value coefficients. Experiments show that our proposed method can achieve better rate-distortion performance at very low bit-rate applications below 16 kbits/s compared to applying H.264/AVC standard directly to all frames. Applications of our proposed video coding technique include video telephony, video-conferencing, transmitting or receiving video over half-rate traffic channels of GSM networks.
{"title":"Very Low Bit-Rate Video Coding by Combining H.264/AVC Standard and 2-D Discrete Wavelet Transform","authors":"A. Aghagolzadeh, S. Meshgini, M. Nooshyar, M. Aghagolzadeh","doi":"10.4236/wsn.2010.24044","DOIUrl":"https://doi.org/10.4236/wsn.2010.24044","url":null,"abstract":"In this paper, we propose a new method for very low bit-rate video coding that combines H.264/AVC standard and two-dimensional discrete wavelet transform. In this method, first a two dimensional wavelet transform is applied on each video frame independently to extract the low frequency components for each frame and then the low frequency parts of all frames are coded using H.264/AVC codec. On the other hand, the high frequency parts of the video frames are coded by Run Length Coding algorithm, after applying a threshold to neglect the low value coefficients. Experiments show that our proposed method can achieve better rate-distortion performance at very low bit-rate applications below 16 kbits/s compared to applying H.264/AVC standard directly to all frames. Applications of our proposed video coding technique include video telephony, video-conferencing, transmitting or receiving video over half-rate traffic channels of GSM networks.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241933","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}
So far path coverage problem has been studied widely to characterize the properties of the coverage of a path or a track in an area induced by a sensor network, in which the path or track is usually treated as a curve and the width of it can be ignored. However, sensor networks often are employed to carry out road surveillance or target tracking, in which the interesting area is only the surface of the road, thus the width of the road must be considered. This paper analyzes the optimal sensing coverage of the road in this kind of applications, assuming that sensor nodes are deployed along both sides of the road determinately. The optimal position of sensor nodes is studied considering the sensing range of sensors and the width of the road, and the purpose is to cover the road surface completely with minimal nodes. The isosceles triangle model is proposed and proved to be the most suitable, that is to say all sensors get the maximal available sensing area if any three nearest sensors located on both sides of the road form an isosceles triangle. Comparing with the equilateral triangle model proposed in other articles, this model increases the coverage rate and supplies complete coverage of the road.
{"title":"The Optimal Sensing Coverage for Road Surveillance","authors":"X. Cheng, Ping Liu, Z. Chen, H. B. Wu, X. Fan","doi":"10.4236/wsn.2010.24043","DOIUrl":"https://doi.org/10.4236/wsn.2010.24043","url":null,"abstract":"So far path coverage problem has been studied widely to characterize the properties of the coverage of a path or a track in an area induced by a sensor network, in which the path or track is usually treated as a curve and the width of it can be ignored. However, sensor networks often are employed to carry out road surveillance or target tracking, in which the interesting area is only the surface of the road, thus the width of the road must be considered. This paper analyzes the optimal sensing coverage of the road in this kind of applications, assuming that sensor nodes are deployed along both sides of the road determinately. The optimal position of sensor nodes is studied considering the sensing range of sensors and the width of the road, and the purpose is to cover the road surface completely with minimal nodes. The isosceles triangle model is proposed and proved to be the most suitable, that is to say all sensors get the maximal available sensing area if any three nearest sensors located on both sides of the road form an isosceles triangle. Comparing with the equilateral triangle model proposed in other articles, this model increases the coverage rate and supplies complete coverage of the road.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129839960","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 give an overview of the evolution of wireless mobiles starting from the first generation which is the analogue system started in 1980’s, and passing through the 2G technologies which are all digital networks and GSM is the most popular network. 2.5G networks will introduce the packet notion on the existing 2G networks and 3G will bring the quality of service as new perspective for the 3G partnership projet 3GPP and 3GPP2. However, high demand on data speed has pushed the operators to looking for 3.5G system. 3.99G networks are defined as long-term evolution for the existing 3G network and it will be based on OFDM and MIMO technologies. 4G networks was not yet defined, but requirement is to support heterogeneous networks at 100 Mbps mobility data speed.
{"title":"Wireless Mobile Evolution to 4G Network","authors":"Mohammed Jaloun, Z. Guennoun","doi":"10.4236/wsn.2010.24042","DOIUrl":"https://doi.org/10.4236/wsn.2010.24042","url":null,"abstract":"In this paper, we give an overview of the evolution of wireless mobiles starting from the first generation which is the analogue system started in 1980’s, and passing through the 2G technologies which are all digital networks and GSM is the most popular network. 2.5G networks will introduce the packet notion on the existing 2G networks and 3G will bring the quality of service as new perspective for the 3G partnership projet 3GPP and 3GPP2. However, high demand on data speed has pushed the operators to looking for 3.5G system. 3.99G networks are defined as long-term evolution for the existing 3G network and it will be based on OFDM and MIMO technologies. 4G networks was not yet defined, but requirement is to support heterogeneous networks at 100 Mbps mobility data speed.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144132","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}
Traditional sensor network and robot navigation are based on the map of detecting fields available in advance. The optimal algorithms are explored to solve the energy saving, shortest path problems, etc. However, in practical environment, there are many fields, whose map is difficult to get, and need to detect. This paper explores a kind of ad-hoc navigation algorithm based on the hybrid sensor network without the prior map. The system of navigation is composed of static nodes and mobile nodes. The static nodes monitor events occurring and broadcast. In the system, a kind of cluster broadcast method is adopted to determine the robot localization. The mobile nodes detect the adversary or dangerous fields and broadcast warning message. Robot gets the message and follows ad-hoc routine to arrive the events occurring place. In the whole process, energy saving has taken into account. The algorithms of nodes and robot are given in this paper. The simulate and practical results are available as well.
{"title":"A Sensing and Robot Navigation of Hybrid Sensor Network","authors":"Shuncai Yao, Jindong Tan, Hongxia Pan","doi":"10.4236/wsn.2010.24037","DOIUrl":"https://doi.org/10.4236/wsn.2010.24037","url":null,"abstract":"Traditional sensor network and robot navigation are based on the map of detecting fields available in advance. The optimal algorithms are explored to solve the energy saving, shortest path problems, etc. However, in practical environment, there are many fields, whose map is difficult to get, and need to detect. This paper explores a kind of ad-hoc navigation algorithm based on the hybrid sensor network without the prior map. The system of navigation is composed of static nodes and mobile nodes. The static nodes monitor events occurring and broadcast. In the system, a kind of cluster broadcast method is adopted to determine the robot localization. The mobile nodes detect the adversary or dangerous fields and broadcast warning message. Robot gets the message and follows ad-hoc routine to arrive the events occurring place. In the whole process, energy saving has taken into account. The algorithms of nodes and robot are given in this paper. The simulate and practical results are available as well.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115698468","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, a representative set of QoS models and QoS-aware on-demand routing protocols are reviewed with emphasis on their ability to support QoS in mobile ad-hoc networks (MANETs) possibly used in WSNs. In particular IntServ, DiffServ, FQMM, and SWAN QoS models are reviewed followed by different QoS-aware on-demand routings in MANETs from different perspectives such as the challenges, classifications, algorithmic aspects in QoS provisions. Tradeoff in providing support to real time (RT) and best effort (BE) traffic is highlighted. Finally, a detailed and comprehensive comparison table is provided for better understanding of QoS provision in MANETs.
{"title":"Comparative Review of QoS-Aware On-Demand Routing in Ad Hoc Wireless Networks","authors":"Ning Zhang, A. Anpalagan","doi":"10.4236/wsn.2010.24038","DOIUrl":"https://doi.org/10.4236/wsn.2010.24038","url":null,"abstract":"In this paper, a representative set of QoS models and QoS-aware on-demand routing protocols are reviewed with emphasis on their ability to support QoS in mobile ad-hoc networks (MANETs) possibly used in WSNs. In particular IntServ, DiffServ, FQMM, and SWAN QoS models are reviewed followed by different QoS-aware on-demand routings in MANETs from different perspectives such as the challenges, classifications, algorithmic aspects in QoS provisions. Tradeoff in providing support to real time (RT) and best effort (BE) traffic is highlighted. Finally, a detailed and comprehensive comparison table is provided for better understanding of QoS provision in MANETs.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114786193","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}
A large variety of permutation routing protocols in a single-hop Network are known in the literature. Since they are single hop, there is always a wireless link connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a hybrid clustering mechanism to perform permutation routing in multi-hop ad hoc Networks. We first propose to partition the network in single-hop clusters also named cliques. Secondly, we run a local permutation routing to broadcast items to their local destinations in each clique. Next we partition the clusterheads of cliques with the hierarchical clustering technique. We show how the outgoing items can be routed to their destination cliques. We give an estimation of the number of broadcast rounds in the worse case. More precisely, we show that solving the permutation routing problem on a multi-hop sensor network need 2 (1 ) ( ) 2 max max (/ ) kO k HUB HUB np k in the worse case. Where n is the number of the data items stored in the network, p is the number of sensors, |HUBmax| is the number of sensors in the clique of maximum size and k is the number of cliques after the first clustering. Finally, simulation results show that our algorithm performs better than the naive multiple gossiping. To the best of our knowledge, it is the first algorithm for permutation routing in multi-hop radio networks.
文献中已知在单跳网络中有各种各样的排列路由协议。由于它们是单跳，所以总是有一个无线链路连接两个节点。在多跳环境中解决此问题的一种方法是将节点划分为集群，其中每个集群中的一个称为clusterhead的节点负责路由服务。在本文中，我们提出了一种混合聚类机制来实现多跳自组织网络中的排列路由。我们首先提出将网络划分为单跳集群，也称为团。其次，我们运行本地排列路由，将项目广播到每个团中的本地目的地。然后利用分层聚类技术对团簇头进行划分。我们将展示如何将传出的项目路由到它们的目的地群组。给出了最坏情况下广播轮数的估计。更准确地说，我们证明了在多跳传感器网络上解决排列路由问题需要2 (1)()2 max max (/) kO k HUB HUB npk。式中n为网络中存储的数据项数，p为传感器数量，|HUBmax|为最大规模的团中传感器数量，k为第一次聚类后的团数。仿真结果表明，该算法的性能优于单纯的多重八卦算法。据我们所知，这是多跳无线网络中第一个排列路由算法。
{"title":"A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks","authors":"A. Bomgni, J. Myoupo","doi":"10.4236/wsn.2010.24040","DOIUrl":"https://doi.org/10.4236/wsn.2010.24040","url":null,"abstract":"A large variety of permutation routing protocols in a single-hop Network are known in the literature. Since they are single hop, there is always a wireless link connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a hybrid clustering mechanism to perform permutation routing in multi-hop ad hoc Networks. We first propose to partition the network in single-hop clusters also named cliques. Secondly, we run a local permutation routing to broadcast items to their local destinations in each clique. Next we partition the clusterheads of cliques with the hierarchical clustering technique. We show how the outgoing items can be routed to their destination cliques. We give an estimation of the number of broadcast rounds in the worse case. More precisely, we show that solving the permutation routing problem on a multi-hop sensor network need 2 (1 ) ( ) 2 max max (/ ) kO k HUB HUB np k in the worse case. Where n is the number of the data items stored in the network, p is the number of sensors, |HUBmax| is the number of sensors in the clique of maximum size and k is the number of cliques after the first clustering. Finally, simulation results show that our algorithm performs better than the naive multiple gossiping. To the best of our knowledge, it is the first algorithm for permutation routing in multi-hop radio networks.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116667041","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 monitoring systems, multiple sensor nodes can detect a single target of interest simultaneously and the data collected are usually highly correlated and redundant. If each node sends data to the base station, energy will be wasted and thus the network energy will be depleted quickly. Data aggregation is an important paradigm for compressing data so that the energy of the network is spent efficiently. In this paper, a novel data aggregation algorithm called Redundancy Elimination for Accurate Data Aggregation (READA) has been proposed. By exploiting the range of spatial correlations of data in the network, READA applies a grouping and compression mechanism to remove duplicate data in the aggregated set of data to be sent to the base station without largely losing the accuracy of the final aggregated data. One peculiarity of READA is that it uses a prediction model derived from cached values to confirm whether any outlier is actually an event which has occurred. From the various simulations conducted, it was observed that in READA the accuracy of data has been highly preserved taking into consideration the energy dissipated for aggregating the data.
{"title":"READA: Redundancy Elimination for Accurate Data Aggregation in Wireless Sensor Networks","authors":"K. Khedo, Rubeena Doomun, Sonum Aucharuz","doi":"10.4236/wsn.2010.24041","DOIUrl":"https://doi.org/10.4236/wsn.2010.24041","url":null,"abstract":"In monitoring systems, multiple sensor nodes can detect a single target of interest simultaneously and the data collected are usually highly correlated and redundant. If each node sends data to the base station, energy will be wasted and thus the network energy will be depleted quickly. Data aggregation is an important paradigm for compressing data so that the energy of the network is spent efficiently. In this paper, a novel data aggregation algorithm called Redundancy Elimination for Accurate Data Aggregation (READA) has been proposed. By exploiting the range of spatial correlations of data in the network, READA applies a grouping and compression mechanism to remove duplicate data in the aggregated set of data to be sent to the base station without largely losing the accuracy of the final aggregated data. One peculiarity of READA is that it uses a prediction model derived from cached values to confirm whether any outlier is actually an event which has occurred. From the various simulations conducted, it was observed that in READA the accuracy of data has been highly preserved taking into consideration the energy dissipated for aggregating the data.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122045080","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
扫码关注我们
求助内容：
应助结果提醒方式：