Pub Date : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928882
M. Takahashi, Bin Tang, Neeraj Jaggi
We study data preservation in intermittently connected sensor networks, wherein the sensor nodes do not always have connected paths to the base station. In such networks, the generated data is first stored inside the network before being uploaded to the base station when uploading opportunity arises. How to preserve the data inside the network is therefore an important problem. The problem becomes more challenging when sensor nodes have finite and unreplenishable battery energy. In this paper, we identify, formulate and study the data preservation problem in the intermittently connected sensor networks under energy constraints at sensor nodes. The problem aims to preserve the data inside the network for maximum possible time, by distributing the data items from low energy nodes to high energy nodes. We first show that this problem is NP-hard. We then design a centralized greedy heuristic and a distributed data distribution algorithm, and compare their performances using simulations.
{"title":"Energy-efficient data preservation in intermittently connected sensor networks","authors":"M. Takahashi, Bin Tang, Neeraj Jaggi","doi":"10.1109/INFCOMW.2011.5928882","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928882","url":null,"abstract":"We study data preservation in intermittently connected sensor networks, wherein the sensor nodes do not always have connected paths to the base station. In such networks, the generated data is first stored inside the network before being uploaded to the base station when uploading opportunity arises. How to preserve the data inside the network is therefore an important problem. The problem becomes more challenging when sensor nodes have finite and unreplenishable battery energy. In this paper, we identify, formulate and study the data preservation problem in the intermittently connected sensor networks under energy constraints at sensor nodes. The problem aims to preserve the data inside the network for maximum possible time, by distributing the data items from low energy nodes to high energy nodes. We first show that this problem is NP-hard. We then design a centralized greedy heuristic and a distributed data distribution algorithm, and compare their performances using simulations.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972510","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928922
G. Bartlett, J. Heidemann, C. Papadopoulos
As desktops and servers become more complicated, they employ an increasing amount of automatic, non-user initiated communication. Such communication can be good (OS updates, RSS feed readers, and mail polling), bad (keyloggers, spyware, and botnet command-and-control), or ugly (adware or unauthorized peer-to-peer applications). Communication in these applications is often regular, but with very long periods, ranging from minutes to hours. This infrequent communication and the complexity of today's systems makes these applications difficult for users to detect and diagnose. In this paper we present a new approach to identify low-rate periodic network traffic and changes in such regular communication. We employ signal-processing techniques, using discrete wavelets implemented as a fully decomposed, iterated filter bank. This approach not only detects low-rate periodicities, but also identifies approximate times when traffic changed. We implement a self-surveillance application that externally identifies changes to a user's machine, such as interruption of periodic software updates, or an installation of a keylogger.
{"title":"Low-rate, flow-level periodicity detection","authors":"G. Bartlett, J. Heidemann, C. Papadopoulos","doi":"10.1109/INFCOMW.2011.5928922","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928922","url":null,"abstract":"As desktops and servers become more complicated, they employ an increasing amount of automatic, non-user initiated communication. Such communication can be good (OS updates, RSS feed readers, and mail polling), bad (keyloggers, spyware, and botnet command-and-control), or ugly (adware or unauthorized peer-to-peer applications). Communication in these applications is often regular, but with very long periods, ranging from minutes to hours. This infrequent communication and the complexity of today's systems makes these applications difficult for users to detect and diagnose. In this paper we present a new approach to identify low-rate periodic network traffic and changes in such regular communication. We employ signal-processing techniques, using discrete wavelets implemented as a fully decomposed, iterated filter bank. This approach not only detects low-rate periodicities, but also identifies approximate times when traffic changed. We implement a self-surveillance application that externally identifies changes to a user's machine, such as interruption of periodic software updates, or an installation of a keylogger.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129208695","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928925
A. Nguyen, Baochun Li, M. Welzl, F. Eliassen
Dealing with a high churn rate is very challenging in live peer-to-peer streaming. State-of-the-art studies try to mitigate the problem by exploiting peer dynamic models, analyzing traces from real world systems, or using enhanced coding techniques, e.g., network coding. Applications of social networking in peer-to-peer systems, especially on file sharing, have recently received research attention. In such systems, the establishment of connections among peers is based on social relationships among users, which are, however, not formed in the context of a peer-to-peer session but, e.g., imported from other social networks. Since friends in such a separate social network do not always have similar interests, they may not necessarily join or stay long in the same peer-to-peer session. We believe that a tight integration between the high level social network of users and the low level overlay of peers would bring significant benefits in dealing with high churn rates and providing personalized streaming services. This paper presents Stir, the first attempt towards an integrated social peer-to-peer streaming system. The key feature of Stir is that social relationships among users are spontaneously formed in a streaming session, and can be exploited directly by the underlying streaming protocol. Stir users, who join the same session, can make friends by means of spontaneous communication, e.g., instant messaging. Such social network formation provides a reliable indication to deal with high churn rate. Our simulations with real social data and peer dynamic traces have demonstrated the benefits of Stir and shed light on building such a system in practice.
{"title":"Stir: Spontaneous social peer-to-peer streaming","authors":"A. Nguyen, Baochun Li, M. Welzl, F. Eliassen","doi":"10.1109/INFCOMW.2011.5928925","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928925","url":null,"abstract":"Dealing with a high churn rate is very challenging in live peer-to-peer streaming. State-of-the-art studies try to mitigate the problem by exploiting peer dynamic models, analyzing traces from real world systems, or using enhanced coding techniques, e.g., network coding. Applications of social networking in peer-to-peer systems, especially on file sharing, have recently received research attention. In such systems, the establishment of connections among peers is based on social relationships among users, which are, however, not formed in the context of a peer-to-peer session but, e.g., imported from other social networks. Since friends in such a separate social network do not always have similar interests, they may not necessarily join or stay long in the same peer-to-peer session. We believe that a tight integration between the high level social network of users and the low level overlay of peers would bring significant benefits in dealing with high churn rates and providing personalized streaming services. This paper presents Stir, the first attempt towards an integrated social peer-to-peer streaming system. The key feature of Stir is that social relationships among users are spontaneously formed in a streaming session, and can be exploited directly by the underlying streaming protocol. Stir users, who join the same session, can make friends by means of spontaneous communication, e.g., instant messaging. Such social network formation provides a reliable indication to deal with high churn rate. Our simulations with real social data and peer dynamic traces have demonstrated the benefits of Stir and shed light on building such a system in practice.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388444","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928946
Osman Yağan, Dajun Qian, Junshan Zhang, D. Cochran
We consider a cyber-physical system consisting of two interacting networks, i.e., a cyber-network overlaying a physical-network. In the event of attacks, due to the interdependence between the networks, node failures in one network may result in a cascade of failures affecting both networks - potentially leading to the collapse of the entire infrastructure. Robustness against such catastrophic failure hinges heavily on the allocation of the interconnecting links that connect nodes in one network to nodes in the other network for proper functioning. Assuming that no information about the degree distribution within each of the two constituent networks, we develop a “uniform” allocation strategy that allots inter-network links equally across all nodes. Our findings indicate that, from a network resilience perspective, uniform allocation of internetwork edges yields a significant gain compared to random allocation.
{"title":"On allocating interconnecting links against cascading failures in cyber-physical networks","authors":"Osman Yağan, Dajun Qian, Junshan Zhang, D. Cochran","doi":"10.1109/INFCOMW.2011.5928946","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928946","url":null,"abstract":"We consider a cyber-physical system consisting of two interacting networks, i.e., a cyber-network overlaying a physical-network. In the event of attacks, due to the interdependence between the networks, node failures in one network may result in a cascade of failures affecting both networks - potentially leading to the collapse of the entire infrastructure. Robustness against such catastrophic failure hinges heavily on the allocation of the interconnecting links that connect nodes in one network to nodes in the other network for proper functioning. Assuming that no information about the degree distribution within each of the two constituent networks, we develop a “uniform” allocation strategy that allots inter-network links equally across all nodes. Our findings indicate that, from a network resilience perspective, uniform allocation of internetwork edges yields a significant gain compared to random allocation.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433115","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 : 2011-04-10DOI: 10.1504/IJSN.2011.043670
Ningning Cheng, K. Govindan, P. Mohapatra
Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.
{"title":"Rendezvous based trust propagation to enhance distributed network security","authors":"Ningning Cheng, K. Govindan, P. Mohapatra","doi":"10.1504/IJSN.2011.043670","DOIUrl":"https://doi.org/10.1504/IJSN.2011.043670","url":null,"abstract":"Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128383700","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928884
Limei Peng, C. Qiao, Wan Tang, Chan-Hyun Youn, Xinwan Li, Guiling Wu, Jianping Chen, Ting Wang
In this paper, we propose and evaluate a novel approach to switching traffic between the pods (or containers) of servers all optically. We show that the proposed approach, called Labeled Optical Burst Switching with Home Circuit (or LOBS-HC) requires a fewer wavelengths (and transceivers) than existing approaches based on wavelength routing or optical circuit switching (OCS). In addition, it is also more suitable than optical burst switching (OBS) and electronic switching. Simulation results from OPNET confirm that LOBS-HC achieves good performance for dynamic inter-pod traffic that is common in a datacenter.
{"title":"A novel approach to optically switching inter-pod traffic in datacenters","authors":"Limei Peng, C. Qiao, Wan Tang, Chan-Hyun Youn, Xinwan Li, Guiling Wu, Jianping Chen, Ting Wang","doi":"10.1109/INFCOMW.2011.5928884","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928884","url":null,"abstract":"In this paper, we propose and evaluate a novel approach to switching traffic between the pods (or containers) of servers all optically. We show that the proposed approach, called Labeled Optical Burst Switching with Home Circuit (or LOBS-HC) requires a fewer wavelengths (and transceivers) than existing approaches based on wavelength routing or optical circuit switching (OCS). In addition, it is also more suitable than optical burst switching (OBS) and electronic switching. Simulation results from OPNET confirm that LOBS-HC achieves good performance for dynamic inter-pod traffic that is common in a datacenter.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133034424","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928807
Rong Yu, Yan Zhang, Yanrong Chen, Chujia Huang, Yang Xiao, M. Guizani
It is envisioned that home networks will shift from the current machine-to-human communications to the machine-to-machine (M2M) paradigm with the rapid penetration of embedded devices in home surroundings. In this paper, we first proposed an architecture of home M2M networks that is decomposed into three sub-areas depending on the radio service ranges and potential applications. We then concentrate on the Quality-of-Service (QoS) management in home M2M networks. Although generic QoS architectures for home M2M networks have been proposed in existing standards, the concrete QoS schemes and algorithms are still missing. Based on the proposed architecture, a cross-layer design of distributed admission and rate control is put forwarded. This proposed scheme, named DRAC, is integrated with a game theory analysis module to model the competition of radio bandwidth among M2M home devices, and embrace the distributed operations of QoS-aware and fair sharing in transmission opportunities. Simulation results indicate that the proposed DRAC scheme allows the M2M home devices to intelligently share the radio bandwidth based on QoS demands in resource-constrained home M2M networks.
{"title":"Distributed rate and admission control in home M2M networks: A non-cooperative game approach","authors":"Rong Yu, Yan Zhang, Yanrong Chen, Chujia Huang, Yang Xiao, M. Guizani","doi":"10.1109/INFCOMW.2011.5928807","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928807","url":null,"abstract":"It is envisioned that home networks will shift from the current machine-to-human communications to the machine-to-machine (M2M) paradigm with the rapid penetration of embedded devices in home surroundings. In this paper, we first proposed an architecture of home M2M networks that is decomposed into three sub-areas depending on the radio service ranges and potential applications. We then concentrate on the Quality-of-Service (QoS) management in home M2M networks. Although generic QoS architectures for home M2M networks have been proposed in existing standards, the concrete QoS schemes and algorithms are still missing. Based on the proposed architecture, a cross-layer design of distributed admission and rate control is put forwarded. This proposed scheme, named DRAC, is integrated with a game theory analysis module to model the competition of radio bandwidth among M2M home devices, and embrace the distributed operations of QoS-aware and fair sharing in transmission opportunities. Simulation results indicate that the proposed DRAC scheme allows the M2M home devices to intelligently share the radio bandwidth based on QoS demands in resource-constrained home M2M networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124157305","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928950
Theerasak Thapngam, Shui Yu, Wanlei Zhou, G. Beliakov
Current DDoS attacks are carried out by attack tools, worms and botnets using different packet-transmission strategies and various forms of attack packets to beat defense systems. These problems lead to defense systems requiring various detection methods in order to identify attacks. Moreover, DDoS attacks can mix their traffics during flash crowds. By doing this, the complex defense system cannot detect the attack traffic in time. In this paper, we propose a behavior based detection that can discriminate DDoS attack traffic from traffic generated by real users. By using Pearson's correlation coefficient, our comparable detection methods can extract the repeatable features of the packet arrivals. The extensive simulations were tested for the accuracy of detection. We then performed experiments with several datasets and our results affirm that the proposed method can differentiate traffic of an attack source from legitimate traffic with a quick response. We also discuss approaches to improve our proposed methods at the conclusion of this paper.
{"title":"Discriminating DDoS attack traffic from flash crowd through packet arrival patterns","authors":"Theerasak Thapngam, Shui Yu, Wanlei Zhou, G. Beliakov","doi":"10.1109/INFCOMW.2011.5928950","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928950","url":null,"abstract":"Current DDoS attacks are carried out by attack tools, worms and botnets using different packet-transmission strategies and various forms of attack packets to beat defense systems. These problems lead to defense systems requiring various detection methods in order to identify attacks. Moreover, DDoS attacks can mix their traffics during flash crowds. By doing this, the complex defense system cannot detect the attack traffic in time. In this paper, we propose a behavior based detection that can discriminate DDoS attack traffic from traffic generated by real users. By using Pearson's correlation coefficient, our comparable detection methods can extract the repeatable features of the packet arrivals. The extensive simulations were tested for the accuracy of detection. We then performed experiments with several datasets and our results affirm that the proposed method can differentiate traffic of an attack source from legitimate traffic with a quick response. We also discuss approaches to improve our proposed methods at the conclusion of this paper.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413960","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928813
Yun Li, Nan Yu, Weiyi Zhang, Weiliang Zhao, X. You, M. Daneshmand
LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.
{"title":"Enhancing the performance of LEACH protocol in wireless sensor networks","authors":"Yun Li, Nan Yu, Weiyi Zhang, Weiliang Zhao, X. You, M. Daneshmand","doi":"10.1109/INFCOMW.2011.5928813","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928813","url":null,"abstract":"LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115873103","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 : 2011-04-10DOI: 10.1109/INFCOMW.2011.5928912
Mira Yun, Danielle Bragg, Amrinder Arora, Hyeong-Ah Choi
We consider the problem of identifying battlefield events using sensors deployed in the area. The goal is to alert centralized headquarters about the occurrence of significant events so that it can respond appropriately to the events. We propose a mechanism using which the sensors can exchange information using signatures of events instead of data to save on transmission costs. Further, we propose an algorithm that dynamically generates phases of information exchange based on the cost and selectivity of each filter.We present simulation results that compare the proposed algorithm to other alternatives. Our results show that the proposed algorithm detects events while minimizing the transmission and processing costs at sensors.
{"title":"Battle event detection using sensor networks and distributed query processing","authors":"Mira Yun, Danielle Bragg, Amrinder Arora, Hyeong-Ah Choi","doi":"10.1109/INFCOMW.2011.5928912","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928912","url":null,"abstract":"We consider the problem of identifying battlefield events using sensors deployed in the area. The goal is to alert centralized headquarters about the occurrence of significant events so that it can respond appropriately to the events. We propose a mechanism using which the sensors can exchange information using signatures of events instead of data to save on transmission costs. Further, we propose an algorithm that dynamically generates phases of information exchange based on the cost and selectivity of each filter.We present simulation results that compare the proposed algorithm to other alternatives. Our results show that the proposed algorithm detects events while minimizing the transmission and processing costs at sensors.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116729429","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
扫码关注我们
求助内容：
应助结果提醒方式：