Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382435
T. Banerjee, Smruti Padhy, A. Kherani
We consider a sensor network where the nodes are capable of energy harvesting, i.e., can use energy from surrounding environment to recharge their battery. We consider the problem of controlling the activity of a sensor node. This problem is cast as controlling the service rate of a station in a closed three-queue system. We obtain the Norton's equivalent of the system and show the structure of the optimal rate control policy for various combinations of rate structures and utility function.
{"title":"Optimal Dynamic Activation Policies in Sensor Networks","authors":"T. Banerjee, Smruti Padhy, A. Kherani","doi":"10.1109/COMSWA.2007.382435","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382435","url":null,"abstract":"We consider a sensor network where the nodes are capable of energy harvesting, i.e., can use energy from surrounding environment to recharge their battery. We consider the problem of controlling the activity of a sensor node. This problem is cast as controlling the service rate of a station in a closed three-queue system. We obtain the Norton's equivalent of the system and show the structure of the optimal rate control policy for various combinations of rate structures and utility function.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103436","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382459
Abhishek K. Gupta, P. Nuggehalli, J. Kuri
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.
{"title":"An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks","authors":"Abhishek K. Gupta, P. Nuggehalli, J. Kuri","doi":"10.1109/COMSWA.2007.382459","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382459","url":null,"abstract":"This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178253","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382584
M. Fecko, Ibrahim Hökelek, S. Samtani, A. Staikos
To perform optimizations as the network changes dynamically, distributed network agents rely on information that is dispersed in the network. A data dissemination service for the agents can benefit from data filtering at selected nodes in a data distribution tree. Controlled dissemination filter (CDF) offers an efficient filtering functionality such as sifting, collection, aggregation, and scoping. We defined a number of new objective functions for the data-flow channelization algorithms, and created both centralized and distributed algorithms to optimize filter placement in polynomial time. We also designed an application of the CDF to information flows relevant to the unicast routing control agent (URCA) and showed how the CDF reduces the bandwidth consumed by data dissemination without impairing the URCA decision-making functionalities.
{"title":"Controlled Dissemination Filter (CDF) for Integrated Link Selection Agents","authors":"M. Fecko, Ibrahim Hökelek, S. Samtani, A. Staikos","doi":"10.1109/COMSWA.2007.382584","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382584","url":null,"abstract":"To perform optimizations as the network changes dynamically, distributed network agents rely on information that is dispersed in the network. A data dissemination service for the agents can benefit from data filtering at selected nodes in a data distribution tree. Controlled dissemination filter (CDF) offers an efficient filtering functionality such as sifting, collection, aggregation, and scoping. We defined a number of new objective functions for the data-flow channelization algorithms, and created both centralized and distributed algorithms to optimize filter placement in polynomial time. We also designed an application of the CDF to information flows relevant to the unicast routing control agent (URCA) and showed how the CDF reduces the bandwidth consumed by data dissemination without impairing the URCA decision-making functionalities.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615826","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382495
Sun-Hee Lim, Okyeon Yi, Chang-Hoon Jung, Ki-Seok Bang
A wireless network has a handover problem between heterogeneous or homogeneous network entitles. We describe in this paper a handover scenario between a WLAN and a WiBro network and propose a fast and efficient authentication scheme for the handover between a WLAN and a WiBro. In the scheme, a Serving Network(SN) plays a key distribution center role so that the Mobile Node (MN) can be quickly associated to a Target Nerwork(TN) before starting a full authentication scheme where a remote Authentication Center (AC) is involved.
{"title":"A Fast and Efficient Authentication Protocol for a Seamless Handover between a WLAN and WiBro","authors":"Sun-Hee Lim, Okyeon Yi, Chang-Hoon Jung, Ki-Seok Bang","doi":"10.1109/COMSWA.2007.382495","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382495","url":null,"abstract":"A wireless network has a handover problem between heterogeneous or homogeneous network entitles. We describe in this paper a handover scenario between a WLAN and a WiBro network and propose a fast and efficient authentication scheme for the handover between a WLAN and a WiBro. In the scheme, a Serving Network(SN) plays a key distribution center role so that the Mobile Node (MN) can be quickly associated to a Target Nerwork(TN) before starting a full authentication scheme where a remote Authentication Center (AC) is involved.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"23 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114106076","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382618
Ramasuri Narayanam, Y. Narahari
We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoc wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to be bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme.
{"title":"Broadcast in Ad hoc Wireless Networks with Selfish Nodes: A Bayesian Incentive Compatibility Approach","authors":"Ramasuri Narayanam, Y. Narahari","doi":"10.1109/COMSWA.2007.382618","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382618","url":null,"abstract":"We consider the incentive compatible broadcast (ICB) problem in ad hoc wireless networks with selfish nodes. We design a Bayesian incentive compatible broadcast (BIC-B) protocol to address this problem. VCG mechanism based schemes have been popularly used in the literature to design dominant strategy incentive compatible (DSIC) protocols for ad hoc wireless networks. VCG based mechanisms have two critical limitations: (i) the network is required to be bi-connected, (ii) the resulting protocol is not budget balanced. Our proposed BIC-B protocol overcomes these difficulties. We also prove the optimality of the proposed scheme.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126893889","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382581
N. Sundaram, P. Ramanathan
The paper proposes a method to estimate the location of nodes in a sensor network. The network has a few nodes whose locations are accurately known. The other nodes estimate their location based on neighborhood relationships gathered by them through message exchanges over a wireless ad hoc network. The paper shows that by incorporating non-neighbor constraints, one can substantially improve the accuracy of location estimation as compared to only utilizing neighbor relationships. The expected location estimation error is analytically derived for a certain regular deployment. For other deployments, empirical evaluation of the proposed scheme shows that the node locations can be estimated accurately without the need for any specialized hardware. The paper proposes a method to estimate the location of nodes in a sensor network. The network has a few nodes whose locations are accurately known. The other nodes estimate their location based on neighborhood relationships gathered by them through message exchanges over a wireless ad hoc network. The paper shows that by incorporating non-neighbor constraints, one can substantially improve the accuracy of location estimation as compared to only utilizing neighbor relationships. The expected location estimation error is analytically derived for a certain regular deployment. For other deployments, empirical evaluation of the proposed scheme shows that the node locations can be estimated accurately without the need for any specialized hardware.
{"title":"Location Estimation Scheme using Connectivity Constraints for Wireless Ad Hoc Sensor Networks","authors":"N. Sundaram, P. Ramanathan","doi":"10.1109/COMSWA.2007.382581","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382581","url":null,"abstract":"The paper proposes a method to estimate the location of nodes in a sensor network. The network has a few nodes whose locations are accurately known. The other nodes estimate their location based on neighborhood relationships gathered by them through message exchanges over a wireless ad hoc network. The paper shows that by incorporating non-neighbor constraints, one can substantially improve the accuracy of location estimation as compared to only utilizing neighbor relationships. The expected location estimation error is analytically derived for a certain regular deployment. For other deployments, empirical evaluation of the proposed scheme shows that the node locations can be estimated accurately without the need for any specialized hardware. The paper proposes a method to estimate the location of nodes in a sensor network. The network has a few nodes whose locations are accurately known. The other nodes estimate their location based on neighborhood relationships gathered by them through message exchanges over a wireless ad hoc network. The paper shows that by incorporating non-neighbor constraints, one can substantially improve the accuracy of location estimation as compared to only utilizing neighbor relationships. The expected location estimation error is analytically derived for a certain regular deployment. For other deployments, empirical evaluation of the proposed scheme shows that the node locations can be estimated accurately without the need for any specialized hardware.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129525224","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382475
Matthias R. Brust, A. Andronache, S. Rothkugel, Z. Benenson
Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work presents topological criteria for robust clusterhead candidate selection, resilient to sporadic node mobility and failure as well as for efficient information dissemination. One of the main ideas of our approach is to avoid selecting nodes located close to the network partition border as such nodes are more likely to move out of the partition, thus causing a clusterhead re-election. We conducted experiments both for static topologies as well as for cases in the presence of node mobility. Our results showed that the frequency of clusterhead re-election and average shortest path length from the clusterhead decrease when considering topological criteria. Additionally, the clusters tend to be robust to clusterhead failure. The presented mechanisms rely on local topological information only and do not require geographical data.
{"title":"Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks","authors":"Matthias R. Brust, A. Andronache, S. Rothkugel, Z. Benenson","doi":"10.1109/COMSWA.2007.382475","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382475","url":null,"abstract":"Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work presents topological criteria for robust clusterhead candidate selection, resilient to sporadic node mobility and failure as well as for efficient information dissemination. One of the main ideas of our approach is to avoid selecting nodes located close to the network partition border as such nodes are more likely to move out of the partition, thus causing a clusterhead re-election. We conducted experiments both for static topologies as well as for cases in the presence of node mobility. Our results showed that the frequency of clusterhead re-election and average shortest path length from the clusterhead decrease when considering topological criteria. Additionally, the clusters tend to be robust to clusterhead failure. The presented mechanisms rely on local topological information only and do not require geographical data.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130412535","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382484
Prakash Kolan, Ram Vaithilingam, R. Dantu
Application-level filters, such as e-mail and VoIP spam filters, that analyze dynamic behavior changes are replacing static signature-recognition filters. These application-level filters learn behavior and use that knowledge to filter unwanted requests. Because behavior of a service request's participating entities changes rapidly, filters must adapt quickly by using end user's preferences about receiving that service request message. Many adaptive filters learn from the participating entities' behavior; however, none configure themselves automatically to an end user's changing tolerance levels. Also, filter administrators cannot manually change the threshold for each service request in real time. Traditional adaptive filters fail when administrators must optimize multiple filter thresholds manually and often. Thus, to improve a filter's learning, we must automate its threshold-update process. We propose an automatic threshold-calibration mechanism using Receiver Operating Characteristics (ROC) curves that updates the threshold based on an end user's feedback. To demonstrate the mechanism's real-time applicability, we integrated it in a Voice over IP (VoIP) spam filter that analyzes incoming Spam over IP Telephony (SPIT) calls. Using this mechanism, we observed good improvement in the VoIP spam filter's accuracy. Further, computing and updating the optimum threshold in realtime does not impede the filter's temporal performance because we update thresholds after each call's completion. Because we reach an optimum threshold for any initial setting, this mechanism works efficiently when we cannot predict end-user behavior. Furthermore, automatic calibration proves efficient when using multiple threshold values.
{"title":"Automatic Calibration Using Receiver Operating Characteristics Curves","authors":"Prakash Kolan, Ram Vaithilingam, R. Dantu","doi":"10.1109/COMSWA.2007.382484","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382484","url":null,"abstract":"Application-level filters, such as e-mail and VoIP spam filters, that analyze dynamic behavior changes are replacing static signature-recognition filters. These application-level filters learn behavior and use that knowledge to filter unwanted requests. Because behavior of a service request's participating entities changes rapidly, filters must adapt quickly by using end user's preferences about receiving that service request message. Many adaptive filters learn from the participating entities' behavior; however, none configure themselves automatically to an end user's changing tolerance levels. Also, filter administrators cannot manually change the threshold for each service request in real time. Traditional adaptive filters fail when administrators must optimize multiple filter thresholds manually and often. Thus, to improve a filter's learning, we must automate its threshold-update process. We propose an automatic threshold-calibration mechanism using Receiver Operating Characteristics (ROC) curves that updates the threshold based on an end user's feedback. To demonstrate the mechanism's real-time applicability, we integrated it in a Voice over IP (VoIP) spam filter that analyzes incoming Spam over IP Telephony (SPIT) calls. Using this mechanism, we observed good improvement in the VoIP spam filter's accuracy. Further, computing and updating the optimum threshold in realtime does not impede the filter's temporal performance because we update thresholds after each call's completion. Because we reach an optimum threshold for any initial setting, this mechanism works efficiently when we cannot predict end-user behavior. Furthermore, automatic calibration proves efficient when using multiple threshold values.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128756929","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382434
I. Saha, L. K. Sambasivan, R. Patro, S. K. Ghosh
In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.
{"title":"Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks","authors":"I. Saha, L. K. Sambasivan, R. Patro, S. K. Ghosh","doi":"10.1109/COMSWA.2007.382434","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382434","url":null,"abstract":"In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130121969","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 : 2007-07-09DOI: 10.1109/COMSWA.2007.382482
A. Sabbir, K. Ravindran, K. Kwiat
Distributed agreement protocols among a group of application processes are often built upon atomic multicast message delivery guarantees. Issues arise however when agreement protocols are realized in Information Assurance (IA) settings where extreme failure behaviors such as send-omission of processes and message timeliness violations are likely. The issues are compounded by security weaknesses in the communication software that make it easier for intruders to stage attacks. These issues impact the design of agreement protocols, which have hitherto assumed only benign failures such as process crash and network message loss/delay. In this paper, we revisit the distributed agreement problem, taking into account the IA dimension as well. Our study reveals the need for a secure centralized entity to realize the group decision-making and state coordination functions. Two functions are studied: dynamic group membership management to exclude non-cooperating members from the group and security-reinforced communications to enforce mutual anonymity of members. Our paper walks through a state-machine based realization of distributed agreements using secure atomic multicast protocol as an underlying communication substrate. The use of our approach in IA applications is also described.
{"title":"Secure Distributed Agreement Protocols for Information Assurance Applications","authors":"A. Sabbir, K. Ravindran, K. Kwiat","doi":"10.1109/COMSWA.2007.382482","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382482","url":null,"abstract":"Distributed agreement protocols among a group of application processes are often built upon atomic multicast message delivery guarantees. Issues arise however when agreement protocols are realized in Information Assurance (IA) settings where extreme failure behaviors such as send-omission of processes and message timeliness violations are likely. The issues are compounded by security weaknesses in the communication software that make it easier for intruders to stage attacks. These issues impact the design of agreement protocols, which have hitherto assumed only benign failures such as process crash and network message loss/delay. In this paper, we revisit the distributed agreement problem, taking into account the IA dimension as well. Our study reveals the need for a secure centralized entity to realize the group decision-making and state coordination functions. Two functions are studied: dynamic group membership management to exclude non-cooperating members from the group and security-reinforced communications to enforce mutual anonymity of members. Our paper walks through a state-machine based realization of distributed agreements using secure atomic multicast protocol as an underlying communication substrate. The use of our approach in IA applications is also described.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117171810","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
扫码关注我们
求助内容：
应助结果提醒方式：