Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850332
R. Raulefs
In this paper we explore a multicarrier system in the downlink that applies transmit antenna diversity for multiple users with a chunk based decision. Chunks are blocks of multiple subcarriers that allow the base station to allocate resources for multiple users experiencing a similar channel. The decision of similar channels is described only by the K factor which defines the ratio of the constant part versus the Rayleigh fading part. Higher K factors, like 10 and above, of the channel ask for different strategies as the performance degrades significantly in case of transmit imported frequency diversity. This allows to create diversity for users in Rayleigh fading channels and apply coherent addition of the received signals for users in Ricean fading channels.
{"title":"Chunk Based Diversity","authors":"R. Raulefs","doi":"10.1109/SARNOF.2009.4850332","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850332","url":null,"abstract":"In this paper we explore a multicarrier system in the downlink that applies transmit antenna diversity for multiple users with a chunk based decision. Chunks are blocks of multiple subcarriers that allow the base station to allocate resources for multiple users experiencing a similar channel. The decision of similar channels is described only by the K factor which defines the ratio of the constant part versus the Rayleigh fading part. Higher K factors, like 10 and above, of the channel ask for different strategies as the performance degrades significantly in case of transmit imported frequency diversity. This allows to create diversity for users in Rayleigh fading channels and apply coherent addition of the received signals for users in Ricean fading channels.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"02 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130589519","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850318
Zhendong Ma, F. Kargl, Michael Weber
The emerging vehicle-to-vehicle/vehicle-to-infrastructure (V2X) communication systems enable a new way of collaboration among the vehicles, the operators of transportation systems, and the service providers. However, many functionalities of V2X systems rely on detailed location information. This raises concerns on location privacy of the users of such systems. Although privacy protection mechanisms have been developed, existing privacy metrics are inappropriate or insufficient to reflect the true underlying privacy values in such systems. Without a proper metric, preserving location privacy in V2X communication systems becomes difficult due to the lack of a benchmark to evaluate any given protection mechanisms. In this paper, we develop a quantitative metric to measure and quantify location privacy in V2X systems. To do so, we introduce the concept of snapshots, which capture the information related to a user in a given space and time. Then the level of location privacy is quantified as the uncertainty of the information related to that user. Our analyses show that the metric provides the users, the system designers, and other stakeholders a valuable tool to evaluate the risk and measure the level of location privacy in V2X communication systems.
{"title":"A location privacy metric for V2X communication systems","authors":"Zhendong Ma, F. Kargl, Michael Weber","doi":"10.1109/SARNOF.2009.4850318","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850318","url":null,"abstract":"The emerging vehicle-to-vehicle/vehicle-to-infrastructure (V2X) communication systems enable a new way of collaboration among the vehicles, the operators of transportation systems, and the service providers. However, many functionalities of V2X systems rely on detailed location information. This raises concerns on location privacy of the users of such systems. Although privacy protection mechanisms have been developed, existing privacy metrics are inappropriate or insufficient to reflect the true underlying privacy values in such systems. Without a proper metric, preserving location privacy in V2X communication systems becomes difficult due to the lack of a benchmark to evaluate any given protection mechanisms. In this paper, we develop a quantitative metric to measure and quantify location privacy in V2X systems. To do so, we introduce the concept of snapshots, which capture the information related to a user in a given space and time. Then the level of location privacy is quantified as the uncertainty of the information related to that user. Our analyses show that the metric provides the users, the system designers, and other stakeholders a valuable tool to evaluate the risk and measure the level of location privacy in V2X communication systems.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115153941","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850344
M. Di Renzo, F. Graziosi, F. Santucci
In this paper, we propose a novel unified analytical framework for the analysis of Channel Capacity over fading channels, which exploits the flexibility and generality of the well-known Moment Generating Function (MGF-) based approach, instead of the usual Probability Density Function (PDF-) based one. In particular, we will introduce a novel transform operator called Ei-Transform, and show that Channel Capacity with side information at the receiver and side information at the transmitter and receiver can be readily expressed as the Ei-Transform of the first derivative of the MGF of the received Signal-to-Noise Ratio (SNR) in the former case, and the Ei-Transform of a linear combination of MGF and truncated MGF (along with their derivatives) of the received SNR in the latter case. The proposed framework turns out to be a useful technique to the analysis and computation of Channel Capacity in all those application scenarios in which estimating the MGF of the received SNR is much simpler than estimating the PDF. Finally, a simple numerical method, which is based on the Gauss-Chebyshev Quadrature (GCQ) rule, for computing Ei-Transform integrals will be described, and numerical results will be shown to validate the accuracy of the proposed MGF-based approach.
{"title":"Ei-transform: A useful and general framework for channel capacity analysis over fading channels","authors":"M. Di Renzo, F. Graziosi, F. Santucci","doi":"10.1109/SARNOF.2009.4850344","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850344","url":null,"abstract":"In this paper, we propose a novel unified analytical framework for the analysis of Channel Capacity over fading channels, which exploits the flexibility and generality of the well-known Moment Generating Function (MGF-) based approach, instead of the usual Probability Density Function (PDF-) based one. In particular, we will introduce a novel transform operator called Ei-Transform, and show that Channel Capacity with side information at the receiver and side information at the transmitter and receiver can be readily expressed as the Ei-Transform of the first derivative of the MGF of the received Signal-to-Noise Ratio (SNR) in the former case, and the Ei-Transform of a linear combination of MGF and truncated MGF (along with their derivatives) of the received SNR in the latter case. The proposed framework turns out to be a useful technique to the analysis and computation of Channel Capacity in all those application scenarios in which estimating the MGF of the received SNR is much simpler than estimating the PDF. Finally, a simple numerical method, which is based on the Gauss-Chebyshev Quadrature (GCQ) rule, for computing Ei-Transform integrals will be described, and numerical results will be shown to validate the accuracy of the proposed MGF-based approach.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116517325","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850363
P. Sotiriadis
Motivated by the “open problem” questions stated recently in [1], this work provides mathematical estimates of the Flying-Adder frequency synthesizer's deterministic jitter. The analytical results have been verified using MATLAB.
{"title":"Intrinsic jitter of flying-adder frequency synthesizers","authors":"P. Sotiriadis","doi":"10.1109/SARNOF.2009.4850363","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850363","url":null,"abstract":"Motivated by the “open problem” questions stated recently in [1], this work provides mathematical estimates of the Flying-Adder frequency synthesizer's deterministic jitter. The analytical results have been verified using MATLAB.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125870552","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850293
Li-Chun Wang, Wei-Cheng Liu, Sau-Hsuan Wu
This paper addresses the analysis of diversitymultiplexing tradeoff (DMT) for a cooperative system using network coding, called the cooperative network coding (CNC) system, which combines a decode-and-forward (DF) relay with the information mixing and broadcast techniques. The outage probability in the high signal-to-noise ratio (SNR) regime is also provided in the closed-form. Our scheme has two users' nodes and one relay node. All nodes are half duplex, i.e., they cannot transmit and receive data at the same time. The two users can communicate to each other directly as well as via the relay node indirectly. Our results show that network coding can help the relay nodes provide cooperative multiplexing gain as well as diversity gain. Compared with the pure DF protocol of which maximal diversity and multiplexing gain are 1 and 1/2, respectively, the maximal diversity and multiplexing gain of the CNC protocol are 2 and 2/3, respectively. The CNC protocol has even better DMT performance than an improved version of DF, selection decode-and-forward (SDF), of which maximal diversity and multiplexing gain are 2 and 1/2, respectively. The impact of wireless lossy channel on performance gains of the network coding is analyzed and can be quantitatively evaluated in the presented DMT curve, which gives us more insight than the capacity analysis does. This is because the capacity analysis only tells us about the maximal error-free transmission rate, while the DMT curve gives us the optimal tradeoff between the error rate and data rate.
{"title":"Diversity-multiplexing tradeoff analysis of a cooperative network coding system","authors":"Li-Chun Wang, Wei-Cheng Liu, Sau-Hsuan Wu","doi":"10.1109/SARNOF.2009.4850293","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850293","url":null,"abstract":"This paper addresses the analysis of diversitymultiplexing tradeoff (DMT) for a cooperative system using network coding, called the cooperative network coding (CNC) system, which combines a decode-and-forward (DF) relay with the information mixing and broadcast techniques. The outage probability in the high signal-to-noise ratio (SNR) regime is also provided in the closed-form. Our scheme has two users' nodes and one relay node. All nodes are half duplex, i.e., they cannot transmit and receive data at the same time. The two users can communicate to each other directly as well as via the relay node indirectly. Our results show that network coding can help the relay nodes provide cooperative multiplexing gain as well as diversity gain. Compared with the pure DF protocol of which maximal diversity and multiplexing gain are 1 and 1/2, respectively, the maximal diversity and multiplexing gain of the CNC protocol are 2 and 2/3, respectively. The CNC protocol has even better DMT performance than an improved version of DF, selection decode-and-forward (SDF), of which maximal diversity and multiplexing gain are 2 and 1/2, respectively. The impact of wireless lossy channel on performance gains of the network coding is analyzed and can be quantitatively evaluated in the presented DMT curve, which gives us more insight than the capacity analysis does. This is because the capacity analysis only tells us about the maximal error-free transmission rate, while the DMT curve gives us the optimal tradeoff between the error rate and data rate.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123538755","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850380
S. Reidt, S. Wolthusen, S. Balfe
This paper presents a novel algorithm for enhancing the efficiency and robustness of distributed trust authority protocols for mobile ad hoc networks (MANETs). Our algorithm determines a quorum of trust authority nodes required for a distributed protocol run based upon a set of quality metrics and establishes an efficient routing strategy to contact these nodes. An implementation and efficiency analysis illustrates the viability of our algorithm for small tactical networks consisting of 50 to 150 nodes and shows an approximate 32% reduction in communication overhead over traditional broadcast-based approaches to trust authority computations.
{"title":"Robust and efficient communication overlays for trust authority computations","authors":"S. Reidt, S. Wolthusen, S. Balfe","doi":"10.1109/SARNOF.2009.4850380","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850380","url":null,"abstract":"This paper presents a novel algorithm for enhancing the efficiency and robustness of distributed trust authority protocols for mobile ad hoc networks (MANETs). Our algorithm determines a quorum of trust authority nodes required for a distributed protocol run based upon a set of quality metrics and establishes an efficient routing strategy to contact these nodes. An implementation and efficiency analysis illustrates the viability of our algorithm for small tactical networks consisting of 50 to 150 nodes and shows an approximate 32% reduction in communication overhead over traditional broadcast-based approaches to trust authority computations.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124705483","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850356
Masood Maqbool, M. Coupechoux, P. Godlewski
The stationary probabilities of different modulation and coding schemes (MCS) are required for dimensioning an OFDMA based network. In this paper, we introduce a semi-analytical approach to find out these stationary probabilities for a WiMAX network in downlink (DL) with users served by the best base station (BS). Using Monte Carlo simulations, we find the spatial distributions of effective signal to interference-plus-noise ratio (SINReff) for different values of shadowing standard deviation (σSH). With the help of distribution fit, we show that generalized extreme value (GEV) distribution provides a good fit for different frequency reuse schemes. Furthermore, by applying curve fitting, we demonstrate that the parameters of GEV distributions, as a function of (σSH) values, can be expressed using polynomials. These polynomial can then be used off-line (in place of time consuming simulations) to find out GEV cumulative distribution function (CDF), and hence the stationary probabilities of MCS, for any desired value of (σSH). We further show that these polynomials can be used for other cell configurations with acceptable deviation and significant time saving.
{"title":"A semi-analytical method to model effective SINR spatial distribution in WiMAX networks","authors":"Masood Maqbool, M. Coupechoux, P. Godlewski","doi":"10.1109/SARNOF.2009.4850356","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850356","url":null,"abstract":"The stationary probabilities of different modulation and coding schemes (MCS) are required for dimensioning an OFDMA based network. In this paper, we introduce a semi-analytical approach to find out these stationary probabilities for a WiMAX network in downlink (DL) with users served by the best base station (BS). Using Monte Carlo simulations, we find the spatial distributions of effective signal to interference-plus-noise ratio (SINReff) for different values of shadowing standard deviation (σSH). With the help of distribution fit, we show that generalized extreme value (GEV) distribution provides a good fit for different frequency reuse schemes. Furthermore, by applying curve fitting, we demonstrate that the parameters of GEV distributions, as a function of (σSH) values, can be expressed using polynomials. These polynomial can then be used off-line (in place of time consuming simulations) to find out GEV cumulative distribution function (CDF), and hence the stationary probabilities of MCS, for any desired value of (σSH). We further show that these polynomials can be used for other cell configurations with acceptable deviation and significant time saving.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127268510","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850337
M. Chang, Tsung-Da Hsieh
For real bandlimited periodic signals, the author in [2] derives the realizable ideal D/C converter that is composed of finite number of finite-duration periodic pulses. However, we can not apply the results in [2] for complex bandlimited periodic signals, such as the baseband signals in the orthogonal frequency-division multiplexing (OFDM) system. In this paper, we first derive the realizable ideal D/C converter for the complex baseband signals of the OFDM system. The proposed D/C converter is composed of only finite-number of finite-duration complex periodic pulses, and therefore is realizable within one period of the signal. Based on the orthogonality among the circularly-shifted interpolation pulses, we also propose a realizable ideal C/D converter that could implement the ideal sampling for the OFDM signals. Due to the complex interpolation pulse, the signals in the I- and Q-channels are coupled together in the ideal D/C (or C/D) converter, and we can not decouple the ideal D/C (or C/D) converter into two independent D/C (or C/D) converters in the I- and Q-channels.
{"title":"Realizable Ideal D/C and C/D converters for OFDM signals","authors":"M. Chang, Tsung-Da Hsieh","doi":"10.1109/SARNOF.2009.4850337","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850337","url":null,"abstract":"For real bandlimited periodic signals, the author in [2] derives the realizable ideal D/C converter that is composed of finite number of finite-duration periodic pulses. However, we can not apply the results in [2] for complex bandlimited periodic signals, such as the baseband signals in the orthogonal frequency-division multiplexing (OFDM) system. In this paper, we first derive the realizable ideal D/C converter for the complex baseband signals of the OFDM system. The proposed D/C converter is composed of only finite-number of finite-duration complex periodic pulses, and therefore is realizable within one period of the signal. Based on the orthogonality among the circularly-shifted interpolation pulses, we also propose a realizable ideal C/D converter that could implement the ideal sampling for the OFDM signals. Due to the complex interpolation pulse, the signals in the I- and Q-channels are coupled together in the ideal D/C (or C/D) converter, and we can not decouple the ideal D/C (or C/D) converter into two independent D/C (or C/D) converters in the I- and Q-channels.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129694501","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850309
Dalei Wu, Zhu Han, S. Ci, Guan-Ming Su, Haohong Wang, Hui Tang
This paper addresses cooperative video summary delivery over wireless networks which inherits both advantages from cooperative communication and from video summarization. In this work, a novel decode-process-and-forward (DPF) scheme is proposed for video summary transmission, where a relay node with video processing capability is involved to generate a concise version of the summary frame, called summary of summary (SoS). The SoS information is effectively consumed by the destination side to enhance its error concealment capability, leading to an improved video reconstruction quality. This paper proposes a generic cross-layer optimization framework for cooperative video summary transmission, which jointly considers the source coding, relay processing parameters, power allocation, and error concealment strategy to achieve the best video quality. The problem is solved by using Lagrangian relaxation and dynamic programming (DP). Experimental results show that the proposed scheme significantly outperforms the direct transmission scheme, the multipath scheme, and the decode-and-forward transmission scheme by up to 25%.
{"title":"Cooperative video summary transmission in wireless networks","authors":"Dalei Wu, Zhu Han, S. Ci, Guan-Ming Su, Haohong Wang, Hui Tang","doi":"10.1109/SARNOF.2009.4850309","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850309","url":null,"abstract":"This paper addresses cooperative video summary delivery over wireless networks which inherits both advantages from cooperative communication and from video summarization. In this work, a novel decode-process-and-forward (DPF) scheme is proposed for video summary transmission, where a relay node with video processing capability is involved to generate a concise version of the summary frame, called summary of summary (SoS). The SoS information is effectively consumed by the destination side to enhance its error concealment capability, leading to an improved video reconstruction quality. This paper proposes a generic cross-layer optimization framework for cooperative video summary transmission, which jointly considers the source coding, relay processing parameters, power allocation, and error concealment strategy to achieve the best video quality. The problem is solved by using Lagrangian relaxation and dynamic programming (DP). Experimental results show that the proposed scheme significantly outperforms the direct transmission scheme, the multipath scheme, and the decode-and-forward transmission scheme by up to 25%.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030109","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850378
D. Agrawal
It is our hypothesis that for a complex system of systems operating in a dynamic, uncertain environment the traditional approach of forward, static security is insufficient. What is required are macroscopic schemata for security that incorporate mechanisms which monitor the overall environment and feed their observations back into the security mechanisms so that they can adjust their ‘posture’ accordingly. Such schemata must also account for system-wide aggregated security risks in addition to risk presented by the individual users and information objects. We propose one such schema in this work.
{"title":"A new schema for security in dynamic uncertain environments","authors":"D. Agrawal","doi":"10.1109/SARNOF.2009.4850378","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850378","url":null,"abstract":"It is our hypothesis that for a complex system of systems operating in a dynamic, uncertain environment the traditional approach of forward, static security is insufficient. What is required are macroscopic schemata for security that incorporate mechanisms which monitor the overall environment and feed their observations back into the security mechanisms so that they can adjust their ‘posture’ accordingly. Such schemata must also account for system-wide aggregated security risks in addition to risk presented by the individual users and information objects. We propose one such schema in this work.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513521","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
扫码关注我们
求助内容：
应助结果提醒方式：