{"title":"A Quantitative Comparison of Energy Consumption and WSN Lifetime for LEACH and LEACH-SM","authors":"B. Bakr, L. Lilien","doi":"10.1109/ICDCSW.2011.55","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.55","url":null,"abstract":"Extending the period of operation (lifetime) of wireless sensor networks (WSNs) is one of the most critical issues. Their limitations are due to limited energy resources. Available research results reveal that significant improvement in WSN lifetime can be achieved by adding spares (spare nodes). At the moment of WSN deployment, the minimum required coverage of WSN targets is assured by the primaries (primary nodes). Spares, if activated, would provide an above-threshold (more than required), redundant target coverage, so can be switched off initially. They are ready to be switched on when any primary exhausts its energy. The spares must be properly managed. Mismanagement includes redundant and above-threshold coverage, which increase transmission of redundant data to cluster heads (collecting information from regular nodes, that is, primary nodes that are not cluster heads). Therefore, mismanaged spares can shorten WSN lifetime instead of extending it. To extend WSN lifetime, we propose the LEACHSM protocol, which modifies the prominent LEACH protocol by providing an optimal energy-saving spare management, including spare selection. LEACH-SM adds the spare selection phase to LEACH. This paper presents a quantitative comparison of energy consumption and WSN lifetime for both protocols.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520886","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}
{"title":"Democratic Leader Finding Algorithm for Large Mobile Ad Hoc Networks","authors":"Shantanu Sharma, Awadhesh Kumar Singh","doi":"10.1109/ICDCSW.2011.50","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.50","url":null,"abstract":"In order to monitor ad hoc applications, it is necessary for MANET to possess a coordinator. Hence, a large number of protocols have been proposed for coordinator election in MANETs. Although, most of the protocols focus on reducing the number of control messages, there have been very little attention on ensuring the high availability of leader in the event of various types of failures, e.g., leader crash and unreachability of leader, especially in the scenario like rescue and warfare, where absence of leader, even for a short duration, may lead to havoc. The motivation for the present article is to address this issue, especially for large MANETs where it is impossible for most applications to run in the absence of coordinator. The proposed protocol is inspired by prevailing parliamentary polity, followed in most of the democratic countries, which always ensures the existence of an executive in order to coordinate and monitor various activities in addition to taking decisions regarding affairs of the state.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116118596","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}
{"title":"The Edge of Smartness","authors":"C. Williamson","doi":"10.1109/ICDCSW.2011.24","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.24","url":null,"abstract":"This paper argues the need for \"smart edge\" devices to enhance the performance, functionality, and security of data center networks. Three examples, drawn primarily from the prior networking literature, are used to illustrate this point. The first example is the TCP in-cast problem, wherein highly concurrent TCP flows traverse a limited-buffer LAN switch, degrading system throughput. The second example is redundant traffic elimination (RTE), to economize on data movement, particularly over bandwidth-constrained Internet paths. The third example is CPU speed scaling, in which metrics such as energy consumption or economic cost trump throughput or response time metrics. The paper concludes with speculative ideas about other functionality that could also reside at the \"smart edge\".","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131960346","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}
{"title":"Marina-Scale Water Temperature Sensing in Real Time Using Microtomography","authors":"A. Goodney, D. Negandhi, K. Joshi, Young H. Cho","doi":"10.1109/ICDCSW.2011.43","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.43","url":null,"abstract":"Small scale marine environments (bays, channels, estuaries, marinas, etc.) are dynamic environments where diverse flora and fauna come into close contact with man-made processes. Yet water temperature monitoring of these coastal environments is usually spatially sparse due to the cost of acquiring, deploying and maintaining buoys. In this paper we introduce micro tomography: using precise time-of-flight calculations for acoustic signals sent over short distances (50 m) to measure water temperature. The traditional use of the technology is to construct low resolution temperature and current maps of large bodies of water useful for global climate study, however here we apply the key concepts to a sensor network to enable real-time monitoring of water temperature while also improving the spatial resolution of the data. As we use time-of-flight measurements to accomplish our goal, high precision and tight time synchronization are required of the network in order to produce meaningful temperature maps. On the other hand, the reduced scale introduces a new opportunity to utilize the technology to sense even the slightest change in temperature. To show our system is realizable we present our prototype underwater acoustic sensor nodes and experimental results that indicates a temperature resolution of approximately one-tenth of a degree Celsius. We also present our micro-tomography simulation software. With the simulator we can study the feasibility of building a more complex marina-scale tomography system and the requirements that must be met by the underlying sensor network.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379144","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}
{"title":"A Provenance Based Mechanism to Identify Malicious Packet Dropping Adversaries in Sensor Networks","authors":"Salmin Sultana, E. Bertino, Mohamed Shehab","doi":"10.1109/ICDCSW.2011.54","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.54","url":null,"abstract":"Malicious packet dropping attack is a major security threat to the data traffic in the sensor network, since it reduces the legal network throughput and may hinder the propagation of sensitive data. Dealing with this attack is challenging since the unreliable wireless communication feature and resource constraints of the sensor network may cause communication failure and mislead to the incorrect decision about the presence of such attack. In this paper, we propose a data provenance based mechanism to detect the attack and identify the source of attack i.e. the malicious node. For this purpose, we utilize the characteristics of the watermarking based secure provenance transmission mechanism that we proposed earlier and rely on the inter-packet timing characteristics after the provenance embedding. The scheme consists of three phases (i) Packet Loss Detection (ii) Identification of Attack Presence (iii) Localizing the Malicious Node/Link. The packet loss is detected based on the distribution of the inter-packet delays. The presence of the attack is determined by comparing the empricial average packet loss rate with the natural packet loss rate of the data flow path. To isolate the malicious link, we transmit more provenance information along with the sensor data. We present the experimental results to show the high detection accuracy and energy efficiency of the proposed scheme.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116414586","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}
{"title":"On Guided Navigation in Target Tracking Sensor Networks Using Alpha-Beta Filters","authors":"Surendra Sharma, Sarang Deshpande, K. Sivalingam","doi":"10.1109/ICDCSW.2011.60","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.60","url":null,"abstract":"Target tracking is a well studied application of wireless sensor networks. An interesting addition to this application is the presence of a mobile guided vehicle that is used to intercept the mobile target. The system provides the current (and sometimes predicted) position of the target to the guided vehicle, so that it can move towards the target. The objective is to reach the target in the shortest possible time. In this paper, two approaches, namely, alpha-beta predicted position based guidance and alpha-beta prediction proportional guidance, have been developed and evaluated for interception efficiency.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126245296","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}
Fan Ping, Xiaohu Li, Christopher McConnell, Rohini Vabbalareddy, Jeong-Hyon Hwang
{"title":"Towards Optimal Data Replication Across Data Centers","authors":"Fan Ping, Xiaohu Li, Christopher McConnell, Rohini Vabbalareddy, Jeong-Hyon Hwang","doi":"10.1109/ICDCSW.2011.49","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.49","url":null,"abstract":"There has been proliferation of data centers that provide both computation and storage resources at diverse geographic locations. In a variety of wide area applications, data can be replicated to serve users with lower latency. This paper presents a technique that can effectively reduce the overall data access delay through gradual migration of data replicas. In contrast to previous solutions that either randomly select replica locations or process a large log of past data accesses, this new technique maintains only a small, decentralized summary of recent data accesses while achieving near optimal performance. This paper also includes an evaluation study that substantiates the effectiveness of the developed technique, and plans for extending the current research outcomes.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133716198","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}
{"title":"Predict Energy Consumption of Trigger-Driven Sensor Network by Markov Chains","authors":"W. Zha, W. Ng","doi":"10.1109/ICDCSW.2011.12","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.12","url":null,"abstract":"Markov Model has been proved its feasibility of predicting the energy state of sensor nodes. Thus, user can monitor sensor nodes energy state in real-time without querying them frequently. However, a stationary state transition probability is required to apply Markov Model, which means the prediction is only applicable to schedule-driven sensor networks rather than trigger-driven sensor networks. In this paper, we will introduce how to use Markov Model to make prediction in trigger-driven sensor networks. By considering events distribution and query patterns, our proposed method managed to predict sensor node energy level information of trigger-driven sensor networks. Experimental results show that our proposed model is able to predict sensor node energy state accurately for trigger-driven sensor networks.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123102416","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}
{"title":"Privacy-Aware BedTree Based Solution for Fuzzy Multi-keyword Search over Encrypted Data","authors":"M. Chuah, Wei Hu","doi":"10.1109/ICDCSW.2011.11","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.11","url":null,"abstract":"As Cloud Computing technology becomes more mature, many organizations and individuals are interested in storing more sensitive data e.g. personal health records, customers related information in the cloud. Such sensitive data needs to be encrypted before it is outsourced to the cloud. Typically, the cloud servers also need to support a keyword search feature for these encrypted files. Traditional searchable encryption schemes typically only support exact keyword matches. However, users sometimes have typos or use slightly different formats e.g. \"data-mining\" versus \"data mining\". Thus, fuzzy keyword search is a useful feature to have. Recently, some researchers propose using wild card based approach to provide fuzzy keyword search. They also propose a solution for multi-keyword search. Their approaches have some limitations, namely (a) their fuzzy keyword search solution consumes large storage size since it inserts every fuzzy keyword as a leaf node in the index tree, (b) their fuzzy single-keyword search solution does not support multi-keyword search, (c) the existing multi-keyword search scheme does not provide efficient incremental updates. In this paper, we propose a privacy-aware bed tree based approach to support fuzzy multi-keyword feature. Incremental updates can be easily done using our solution. We have implemented our solution. Our evaluation results show that our approach is more cost-effective in terms of storage size and construction time. Our search time is usually better than the wild card approach for multi-keyword queries where many encrypted files are returned using single-word queries for approaches that do not support multi-keyword queries.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133041678","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}
Ville A. Satopaa, Jeannie R. Albrecht, David E. Irwin, B. Raghavan
{"title":"Finding a \"Kneedle\" in a Haystack: Detecting Knee Points in System Behavior","authors":"Ville A. Satopaa, Jeannie R. Albrecht, David E. Irwin, B. Raghavan","doi":"10.1109/ICDCSW.2011.20","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.20","url":null,"abstract":"Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These ``knees'' typically represent beneficial points that system designers have long selected to best balance inherent trade-offs. While prior work largely uses ad hoc, system-specific approaches to detect knees, we present Kneedle, a general approach to on line and off line knee detection that is applicable to a wide range of systems. We define a knee formally for continuous functions using the mathematical concept of curvature and compare our definition against alternatives. We then evaluate Kneedle's accuracy against existing algorithms on both synthetic and real data sets, and evaluate its performance in two different applications.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127902749","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}