Pub Date : 2013-12-01DOI: 10.1109/ICON.2013.6781975
P. Jamjareegulgarn
This paper proposes cooperative diversity-based wireless body area network (WBAN) for healthcare service in order to mitigate the undesired effects of WBAN due to high path loss and fading as well as to keep a low transmit power while meeting to the desired WBAN quality of services, i.e., low outage probability and low bit error rate. In this paper, we consider all of the sensors which are placed on the human body, so CM3 B channel model is taken into account for computing the path loss of each WBAN link. Three well-known schemes for proactive relay selection have been addressed and applied in WBAN so as to compare the performance with the direct communication. The performance is evaluated in terms of outage probability (Pout) and bit error rate (BER). The simulation results confirm that Pout of cooperative diversity-based WBAN can be reduced higher 99.68% than that of direct communication at SNR of 0 dB and can be achieved below 4.5*10-4 at the low SNR of 0 - 6 dB. Moreover, BER of cooperative diversity-based WBAN can also be significantly decreased higher 99.89% than that of direct communication at all SNRs of 0 - 10 dB.
{"title":"Performance evaluation for cooperative diversity-based wireless body area network","authors":"P. Jamjareegulgarn","doi":"10.1109/ICON.2013.6781975","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781975","url":null,"abstract":"This paper proposes cooperative diversity-based wireless body area network (WBAN) for healthcare service in order to mitigate the undesired effects of WBAN due to high path loss and fading as well as to keep a low transmit power while meeting to the desired WBAN quality of services, i.e., low outage probability and low bit error rate. In this paper, we consider all of the sensors which are placed on the human body, so CM3 B channel model is taken into account for computing the path loss of each WBAN link. Three well-known schemes for proactive relay selection have been addressed and applied in WBAN so as to compare the performance with the direct communication. The performance is evaluated in terms of outage probability (Pout) and bit error rate (BER). The simulation results confirm that Pout of cooperative diversity-based WBAN can be reduced higher 99.68% than that of direct communication at SNR of 0 dB and can be achieved below 4.5*10-4 at the low SNR of 0 - 6 dB. Moreover, BER of cooperative diversity-based WBAN can also be significantly decreased higher 99.89% than that of direct communication at all SNRs of 0 - 10 dB.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126823435","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781981
Anik Sengupta, Rahul Thakur, C. Siva, Ram Murthy
The recent trend in wireless communication networks has seen the focus shift from spectrum efficiency to energy efficiency. Use of multi clock-rate sampling devices to provide reduced power idle listening promises to significantly reduce power consumption in wireless devices without affecting throughput or transmission range. However, the use of frequency agnostic preamble to enable multi clock-rate detection causes linear scaling of preamble length, and consequently, the goodput performance of the network suffers. In this paper, we look at a modification of RObust Header Compression (ROHC) as a means to restrict header length scaling and its applicability in networks of multi-frequency sampling wireless devices. We analyze the modified preamble compression scheme deployed on multi clock-rate sampling wireless devices and determine performance metrics such as channel utilization and goodput across different error rates and downclocking factors. The energy efficiency performance of such a network is also studied. The results obtained are validated using extensive simulation.
{"title":"An efficient preamble compression for multi clock-rate sampling wireless devices","authors":"Anik Sengupta, Rahul Thakur, C. Siva, Ram Murthy","doi":"10.1109/ICON.2013.6781981","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781981","url":null,"abstract":"The recent trend in wireless communication networks has seen the focus shift from spectrum efficiency to energy efficiency. Use of multi clock-rate sampling devices to provide reduced power idle listening promises to significantly reduce power consumption in wireless devices without affecting throughput or transmission range. However, the use of frequency agnostic preamble to enable multi clock-rate detection causes linear scaling of preamble length, and consequently, the goodput performance of the network suffers. In this paper, we look at a modification of RObust Header Compression (ROHC) as a means to restrict header length scaling and its applicability in networks of multi-frequency sampling wireless devices. We analyze the modified preamble compression scheme deployed on multi clock-rate sampling wireless devices and determine performance metrics such as channel utilization and goodput across different error rates and downclocking factors. The energy efficiency performance of such a network is also studied. The results obtained are validated using extensive simulation.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114622904","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 propose an anti-interference cooperative spectrum sharing strategy in cognitive two-phase full-duplex relaying networks, in which the secondary system acts as a decode-and-forward relay to assist the primary system achieve the target transmission rate. As a reward, the secondary system can gain access to the licensed primary spectrum to transmit its own signal in both two phases. Since the two systems use different bandwidth to transmit their signals, there will be no interference effect between primary and secondary systems. We study the joint optimization of the two-phase bandwidth allocation to maximize the received rate of the secondary system. Simulation results are given to verify our analysis and illustrate the advantages of the proposed strategy.
{"title":"An anti-interference cooperative spectrum sharing strategy with full-duplex","authors":"Weidang Lu, Jing Wang, Feng Li, Jingyu Hua, L. Meng, Xinjian Zhao","doi":"10.1109/ICON.2013.6781939","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781939","url":null,"abstract":"In this paper, we propose an anti-interference cooperative spectrum sharing strategy in cognitive two-phase full-duplex relaying networks, in which the secondary system acts as a decode-and-forward relay to assist the primary system achieve the target transmission rate. As a reward, the secondary system can gain access to the licensed primary spectrum to transmit its own signal in both two phases. Since the two systems use different bandwidth to transmit their signals, there will be no interference effect between primary and secondary systems. We study the joint optimization of the two-phase bandwidth allocation to maximize the received rate of the secondary system. Simulation results are given to verify our analysis and illustrate the advantages of the proposed strategy.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125334142","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781945
Shoushou Ren, Yinlong Liu, Xinghua Yang, Xu Zhou, Hui Tang, S. Ci
With the rapid development of wireless networks and mobile terminals (MTs), cooperation among MTs in heterogeneous wireless networks is currently widely investigated. Cooperation among MTs has a lot of advantages such as increasing network throughput, decreasing file download time, saving energy. Traffic distribution, which means how to distribute the traffic to the cooperating MTs, is a key issue in MTs cooperation. To improve the quality of service and user's experience, we propose two distribution approaches: time-based approach and AHP-based (analytic hierarchy process based) approach. In time-based approach, an optimization model is used, in which the transmit time is decreased to the shortest. Besides, with the QoS parameters and cost taken into consideration, we proposed the AHP-based approach, in which the client's preference is also considered. Both the two proposed approaches show better performance than the traditional approach.
{"title":"Two traffic distribution approaches in terminal cooperation over heterogeneous wireless networks","authors":"Shoushou Ren, Yinlong Liu, Xinghua Yang, Xu Zhou, Hui Tang, S. Ci","doi":"10.1109/ICON.2013.6781945","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781945","url":null,"abstract":"With the rapid development of wireless networks and mobile terminals (MTs), cooperation among MTs in heterogeneous wireless networks is currently widely investigated. Cooperation among MTs has a lot of advantages such as increasing network throughput, decreasing file download time, saving energy. Traffic distribution, which means how to distribute the traffic to the cooperating MTs, is a key issue in MTs cooperation. To improve the quality of service and user's experience, we propose two distribution approaches: time-based approach and AHP-based (analytic hierarchy process based) approach. In time-based approach, an optimization model is used, in which the transmit time is decreased to the shortest. Besides, with the QoS parameters and cost taken into consideration, we proposed the AHP-based approach, in which the client's preference is also considered. Both the two proposed approaches show better performance than the traditional approach.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131949481","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781971
P. Chowdhury, I. S. Misra
The increasing demand for multimedia communication over wireless platform necessitates the QoS-aware packet scheduling schemes in Broadband Wireless Access (BWA) networks. This paper deals with the analysis of queue size of QoS-aware Weighted Hybrid Packet Scheduling Schemes (WHPSS) for heterogeneous traffic classes in BWA networks. By categorizing the heterogeneous traffics of BWA networks into several classes (i.e. Class-1, Class-2, Class-3) depending upon their QoS requirement, we analyze the effect of queue size in WHPSS using three dimensional Continuous Time Markov Chain (CTMC) model. The analysis has been carried out with respect to the several performance parameters such as queuing delay, packet loss rate and throughput. This paper aims to observe the effect of queue size for each traffic flow to maximize the throughput of the network under the specified constraint of queuing delay and packet loss rate. Thus, the analysis helps to determine suitable queue size in the BWA network under varied traffic condition satisfying the required QoS constraints.
{"title":"Queue size analysis of QoS-aware Weighted Hybrid Packet Scheduling Scheme for BWA networks","authors":"P. Chowdhury, I. S. Misra","doi":"10.1109/ICON.2013.6781971","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781971","url":null,"abstract":"The increasing demand for multimedia communication over wireless platform necessitates the QoS-aware packet scheduling schemes in Broadband Wireless Access (BWA) networks. This paper deals with the analysis of queue size of QoS-aware Weighted Hybrid Packet Scheduling Schemes (WHPSS) for heterogeneous traffic classes in BWA networks. By categorizing the heterogeneous traffics of BWA networks into several classes (i.e. Class-1, Class-2, Class-3) depending upon their QoS requirement, we analyze the effect of queue size in WHPSS using three dimensional Continuous Time Markov Chain (CTMC) model. The analysis has been carried out with respect to the several performance parameters such as queuing delay, packet loss rate and throughput. This paper aims to observe the effect of queue size for each traffic flow to maximize the throughput of the network under the specified constraint of queuing delay and packet loss rate. Thus, the analysis helps to determine suitable queue size in the BWA network under varied traffic condition satisfying the required QoS constraints.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115250848","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781934
Yasuhiro Watashiba, Y. Kido, S. Date, H. Abe, Koheix Ichikawa, Hiroaki Yamanaka, Eiji Kawai, H. Takemura
Network performance in high-performance computing environments such as supercomputers and Grid systems takes a role of great importance in deciding the overall performance of computation. However, most Job Management Systems (JMSs) available today, which are responsible for managing multiple computing resources for distribution and balancing of a computational workload, do not consider network awareness for resource management and allocation. In this paper, the authors briefly overview our proposed and prototyped network-aware JMS that can allocate an appropriate set of computing and network resources to a job request. Also, we evaluate the usefulness and effectiveness of our proposal. Experiments conducted with the prototype implementation imply that our proposed network-aware JMS could reduce job execution time by 23.4 percent.
{"title":"Prototyping and evaluation of a network-aware Job Management System on a cluster system","authors":"Yasuhiro Watashiba, Y. Kido, S. Date, H. Abe, Koheix Ichikawa, Hiroaki Yamanaka, Eiji Kawai, H. Takemura","doi":"10.1109/ICON.2013.6781934","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781934","url":null,"abstract":"Network performance in high-performance computing environments such as supercomputers and Grid systems takes a role of great importance in deciding the overall performance of computation. However, most Job Management Systems (JMSs) available today, which are responsible for managing multiple computing resources for distribution and balancing of a computational workload, do not consider network awareness for resource management and allocation. In this paper, the authors briefly overview our proposed and prototyped network-aware JMS that can allocate an appropriate set of computing and network resources to a job request. Also, we evaluate the usefulness and effectiveness of our proposal. Experiments conducted with the prototype implementation imply that our proposed network-aware JMS could reduce job execution time by 23.4 percent.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115165546","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781985
Wei Gan, Zhiqiang Shi, Chen Zhang, Limin Sun, D. Ionescu
The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) allows a node to operate in storing or non-storing mode. However, as the network size increases, non-storing RPL will introduce lots of communication overhead, while storing RPL will consume lots of memory. In this paper, we improve the storing mode in RPL by reducing the memory consumption. Our performance studies show that our scheme effectively reduces communication overhead compared with the pure non-storing mode. In addition, it makes sure that the number of routing table entry stored in a node does not exceed a pre-specified factor N. When a node stores N routing table entries, it still has enough memory to run the node program and store the collected sensor data. Even when the size of network is large, nodes near the root can still provide adequate space to store the routing table entries using our scheme, but in pure storing mode they may not.
IPv6 RPL (Routing Protocol for Low-power and Lossy Networks)允许节点以存储或非存储方式运行。然而，随着网络规模的增加，非存储RPL将引入大量通信开销，而存储RPL将消耗大量内存。本文通过减少内存消耗来改进RPL中的存储模式。我们的性能研究表明，与纯非存储模式相比，我们的方案有效地降低了通信开销。此外，它确保存储在节点中的路由表项的数量不超过预先指定的因子N。当一个节点存储N个路由表项时，它仍然有足够的内存来运行节点程序并存储收集到的传感器数据。即使网络规模很大，使用我们的方案，根附近的节点仍然可以提供足够的空间来存储路由表项，但在纯存储模式下，它们可能不会。
{"title":"MERPL: A more memory-efficient storing mode in RPL","authors":"Wei Gan, Zhiqiang Shi, Chen Zhang, Limin Sun, D. Ionescu","doi":"10.1109/ICON.2013.6781985","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781985","url":null,"abstract":"The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) allows a node to operate in storing or non-storing mode. However, as the network size increases, non-storing RPL will introduce lots of communication overhead, while storing RPL will consume lots of memory. In this paper, we improve the storing mode in RPL by reducing the memory consumption. Our performance studies show that our scheme effectively reduces communication overhead compared with the pure non-storing mode. In addition, it makes sure that the number of routing table entry stored in a node does not exceed a pre-specified factor N. When a node stores N routing table entries, it still has enough memory to run the node program and store the collected sensor data. Even when the size of network is large, nodes near the root can still provide adequate space to store the routing table entries using our scheme, but in pure storing mode they may not.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127973178","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781984
E. T. Yazdi, A. Willig, K. Pawlikowski
The duration time spent by end devices in orphan state in beacon-enabled IEEE 802.15.4 networks has a direct relationship with their energy consumption. The latency experienced for performing a coordinator discovery process and a successful association is related to such factors as beacon interval length, channel interference, message signaling, etc. To mitigate the overall energy consumption of the end devices in Wireless Body Sensor Networks (WBSNs), different coordinator discovery schemes are proposed in this study. The main focus of this paper is to improve the overall energy consumption and success rate of end devices. However, the performance evaluation results reveal that the proposed passive coordinator discovery schemes have insignificant statistical difference in the overall success rate and energy consumption of the WBSN.
{"title":"Shortening orphan time in IEEE 802.15.4: What can be gained?","authors":"E. T. Yazdi, A. Willig, K. Pawlikowski","doi":"10.1109/ICON.2013.6781984","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781984","url":null,"abstract":"The duration time spent by end devices in orphan state in beacon-enabled IEEE 802.15.4 networks has a direct relationship with their energy consumption. The latency experienced for performing a coordinator discovery process and a successful association is related to such factors as beacon interval length, channel interference, message signaling, etc. To mitigate the overall energy consumption of the end devices in Wireless Body Sensor Networks (WBSNs), different coordinator discovery schemes are proposed in this study. The main focus of this paper is to improve the overall energy consumption and success rate of end devices. However, the performance evaluation results reveal that the proposed passive coordinator discovery schemes have insignificant statistical difference in the overall success rate and energy consumption of the WBSN.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134241226","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 : 2013-12-01DOI: 10.1109/ICON.2013.6782002
L. Chaisorn, Yongkang Wong
International usage and interest in Closed-Circuit Television (CCTV) for surveillance of public spaces has proved to be an effective in forensic, or reactive response to crime and terrorism. In the ideal scenario, it would be useful to detect events, in real-time or close to real-time, in order to mitigate possible harm. However, it is an issue to adequately monitor the video feeds with security guards. In this paper, we address the key problems in the existing surveillance system, followed by some discussions on the integration of social signal and video search to enhance the traditional surveillance system. We shows the performance of face-based identity inference under surveillance. as well as video indexing and search results. Finally, we discuss the related future research direction in this area.
{"title":"Video analytics for surveillance camera networks","authors":"L. Chaisorn, Yongkang Wong","doi":"10.1109/ICON.2013.6782002","DOIUrl":"https://doi.org/10.1109/ICON.2013.6782002","url":null,"abstract":"International usage and interest in Closed-Circuit Television (CCTV) for surveillance of public spaces has proved to be an effective in forensic, or reactive response to crime and terrorism. In the ideal scenario, it would be useful to detect events, in real-time or close to real-time, in order to mitigate possible harm. However, it is an issue to adequately monitor the video feeds with security guards. In this paper, we address the key problems in the existing surveillance system, followed by some discussions on the integration of social signal and video search to enhance the traditional surveillance system. We shows the performance of face-based identity inference under surveillance. as well as video indexing and search results. Finally, we discuss the related future research direction in this area.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131792212","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 : 2013-12-01DOI: 10.1109/ICON.2013.6781943
S. Pumpichet, Xinyu Jin, N. Pissinou
The data imprecision received at a base station is common in mobile wireless sensor networks. In scenarios, data cleaning based on spatio-temporal relationships among sensors is not practical due to the unique, but commonly found, characteristics of sensor networks. As one of the first methods to clean sensor data in such environments, our proposed method deploys a sketch technique to periodically summarize N sensor samples into a fixed size array of memory and manage to recover values of missing or corrupted sensor samples at the base station. Our evaluation demonstrates that, with a small fixed portion of additional data transmission compared to original N data, the proposed method outperforms the existing data cleaning methods which assume the spatio-temporal relationship among sensors.
{"title":"Sketch-based data recovery in sensor data streams","authors":"S. Pumpichet, Xinyu Jin, N. Pissinou","doi":"10.1109/ICON.2013.6781943","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781943","url":null,"abstract":"The data imprecision received at a base station is common in mobile wireless sensor networks. In scenarios, data cleaning based on spatio-temporal relationships among sensors is not practical due to the unique, but commonly found, characteristics of sensor networks. As one of the first methods to clean sensor data in such environments, our proposed method deploys a sketch technique to periodically summarize N sensor samples into a fixed size array of memory and manage to recover values of missing or corrupted sensor samples at the base station. Our evaluation demonstrates that, with a small fixed portion of additional data transmission compared to original N data, the proposed method outperforms the existing data cleaning methods which assume the spatio-temporal relationship among sensors.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121050306","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
扫码关注我们
求助内容：
应助结果提醒方式：