This monograph provides an overview of the mathematical theories and computational algorithm design for contagion source detection in large networks. By leveraging network centrality as a tool for statistical inference, we can accurately identify the source of contagions, trace their spread, and predict future trajectories. This approach provides fundamental insights into surveillance capability and asymptotic behavior of contagion spreading in networks. Mathematical theory and computational algorithms are vital to understanding contagion dynamics, improving surveillance capabilities, and developing effective strategies to prevent the spread of infectious diseases and misinformation.
{"title":"Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms","authors":"C. Tan, Pei-Duo Yu","doi":"10.1561/1300000068","DOIUrl":"https://doi.org/10.1561/1300000068","url":null,"abstract":"This monograph provides an overview of the mathematical theories and computational algorithm design for contagion source detection in large networks. By leveraging network centrality as a tool for statistical inference, we can accurately identify the source of contagions, trace their spread, and predict future trajectories. This approach provides fundamental insights into surveillance capability and asymptotic behavior of contagion spreading in networks. Mathematical theory and computational algorithms are vital to understanding contagion dynamics, improving surveillance capabilities, and developing effective strategies to prevent the spread of infectious diseases and misinformation.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"480 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114586496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty just how fresh the information on a remote system is? Much work has been done on delay or latency in systems, but only recently has the concept of the freshness of information in or about a system become quantifiable. This is termed the Age of Information. Age of Information provides a whole new set of metrics and tools that can be used to characterize the freshness of information in communications, control and, indeed, information systems. In its early development, this monograph provides the reader with an easy-to-read tutorial-like introduction into this novel approach of dealing with information within systems. A critical summary of the work to date details the concept for the reader. A description of the fundamentals of the performance metrics is then presented before showing how the approach can be used as a tool in improving metrics in other contexts. The survey and tutorial nature of this monograph will save any researcher or student considerable time in understanding the basics of Age of Information, which is destined to become an important research topic in networked systems.
{"title":"Age of Information: A New Concept, Metric, and Tool","authors":"Antzela Kosta, N. Pappas, Vangelis Angelakis","doi":"10.1561/1300000060","DOIUrl":"https://doi.org/10.1561/1300000060","url":null,"abstract":"In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty just how fresh the information on a remote system is? Much work has been done on delay or latency in systems, but only recently has the concept of the freshness of information in or about a system become quantifiable. This is termed the Age of Information. Age of Information provides a whole new set of metrics and tools that can be used to characterize the freshness of information in communications, control and, indeed, information systems. In its early development, this monograph provides the reader with an easy-to-read tutorial-like introduction into this novel approach of dealing with information within systems. A critical summary of the work to date details the concept for the reader. A description of the fundamentals of the performance metrics is then presented before showing how the approach can be used as a tool in improving metrics in other contexts. The survey and tutorial nature of this monograph will save any researcher or student considerable time in understanding the basics of Age of Information, which is destined to become an important research topic in networked systems.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126465000","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}
Tomaso de Cola, A. Ginesi, G. Giambene, George C. Polyzos, V. Siris, N. Fotiou, Y. Thomas
Since their conception satellites have offered the promise of more capacity for terrestrial communication systems or to exploit their inherent multicasting and broadcasting capabilities. Recent advances in satellite technology have resulted in the integration of satellite and terrestrial networks to meet the quality and capacity requirements of modern day communication systems. Network and Protocol Architectures for Future Satellite Systems reviews the emerging technologies being deployed in the networking architectures being proposed in the framework of the Future Internet. Novel protocols such as Multi Path TCP (MPTCP) and networking trends such as Information Centric Networking (ICN) are described in depth and their application in segments deploying both satellite and terrestrial networks are illustrated. This is also the first monograph to review content-based networking extensively. This is becoming increasingly important driven by the ubiquitous nature of the internet. Applications to satellite communications are illustrated and the technical challenges to be further addressed are highlighted.
{"title":"Network and Protocol Architectures for Future Satellite Systems","authors":"Tomaso de Cola, A. Ginesi, G. Giambene, George C. Polyzos, V. Siris, N. Fotiou, Y. Thomas","doi":"10.1561/1300000046","DOIUrl":"https://doi.org/10.1561/1300000046","url":null,"abstract":"Since their conception satellites have offered the promise of more capacity for terrestrial communication systems or to exploit their inherent multicasting and broadcasting capabilities. Recent advances in satellite technology have resulted in the integration of satellite and terrestrial networks to meet the quality and capacity requirements of modern day communication systems. Network and Protocol Architectures for Future Satellite Systems reviews the emerging technologies being deployed in the networking architectures being proposed in the framework of the Future Internet. Novel protocols such as Multi Path TCP (MPTCP) and networking trends such as Information Centric Networking (ICN) are described in depth and their application in segments deploying both satellite and terrestrial networks are illustrated. This is also the first monograph to review content-based networking extensively. This is becoming increasingly important driven by the ubiquitous nature of the internet. Applications to satellite communications are illustrated and the technical challenges to be further addressed are highlighted.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"20 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132610684","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}
Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, by specifically utilizing wireless broadcast opportunities and receiver diversity. Opportunistic routing algorithms, which are specifically optimized to incorporate into the routing decisions a model of wireless transmission, take advantage of scheduling, multi-user, andreceiver diversity gains and result in significant reduction in the expected cost of routing per packet. The ability of the algorithm to take advantage of the aspects of wireless transmission, however, depends on the scalability and the additional overhead associated with the opportunistic routing as well as the availability of side information regarding wireless channel statistics, topology, etc. This monograph sheds light on the performance gains associated with incorporating into the routing strategy the nature of wireless transmission.This monograph first provides an overview of various opportunistic distance-vector algorithms that have been developed to incorporate wireless transmission and routing opportunities. Furthermore, an optimal opportunistic distance metric is proposed whose performance is examined against the performance of several routing algorithms from the literature. The performance is examined first in analytical examples, then via simulation to identify the strengths of the optimal opportunist routing algorithm. To allow for a scalable and distributed solution, the distributed computation of this optimal distance-metric is provided. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation. In addition to the construction of the opportunistic schemes in centralized and distributed fashions, this monograph also addresses how learning the wireless medium can be efficiently incorporated in the structure of routing algorithm. Finally, this monograph examines the dynamic congestion-based distance metric and its performance against other congestion aware solutions in the literature.
{"title":"Opportunistic Routing in Wireless Networks","authors":"T. Javidi, Eric Van Buhler","doi":"10.1561/1300000021","DOIUrl":"https://doi.org/10.1561/1300000021","url":null,"abstract":"Wireless multi-hop networks have become an important part of many modern communication systems. Opportunistic routing aims to overcome the deficiencies of conventional routing on wireless multi-hop networks, by specifically utilizing wireless broadcast opportunities and receiver diversity. Opportunistic routing algorithms, which are specifically optimized to incorporate into the routing decisions a model of wireless transmission, take advantage of scheduling, multi-user, andreceiver diversity gains and result in significant reduction in the expected cost of routing per packet. The ability of the algorithm to take advantage of the aspects of wireless transmission, however, depends on the scalability and the additional overhead associated with the opportunistic routing as well as the availability of side information regarding wireless channel statistics, topology, etc. This monograph sheds light on the performance gains associated with incorporating into the routing strategy the nature of wireless transmission.This monograph first provides an overview of various opportunistic distance-vector algorithms that have been developed to incorporate wireless transmission and routing opportunities. Furthermore, an optimal opportunistic distance metric is proposed whose performance is examined against the performance of several routing algorithms from the literature. The performance is examined first in analytical examples, then via simulation to identify the strengths of the optimal opportunist routing algorithm. To allow for a scalable and distributed solution, the distributed computation of this optimal distance-metric is provided. The performance of a distributed implementation of the optimal opportunistic routing algorithm is also examined via simulation. In addition to the construction of the opportunistic schemes in centralized and distributed fashions, this monograph also addresses how learning the wireless medium can be efficiently incorporated in the structure of routing algorithm. Finally, this monograph examines the dynamic congestion-based distance metric and its performance against other congestion aware solutions in the literature.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190678","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}
Random access represents possibly the simplest and yet one of the best known approaches for sharing a channel among several users. Since their introduction in the 1970s, random access schemes have been thoroughly studied and small variations of the pioneering Aloha protocol have since then become a key component of many communications standards, ranging from satellite networks to ad hoc and cellular scenarios. A fundamental step forward for this old paradigm has been witnessed in the past few years, with the development of new solutions, mainly based on the principles of successive interference cancellation, which made it possible to embrace constructively collisions among packets rather than enduring them as a waste of resources. These new lines of research have rendered the performance of modern random access protocols competitive with that of their coordinated counterparts, paving the road for a multitude of new applications. This monograph explores the main ideas and design principles that are behind some of such novel schemes, and aims at offering to the reader an introduction to the analytical tools that can be used to model their performance. After reviewing some relevant thoretical results for the random access channel, the volume focuses on slotted solutions that combine the approach of diversity Aloha with successive interference cancellation, and discusses their optimisation based on an analogy with the theory of codes on graphs. The potential of modern random access is then further explored considering two families of schemes: the former based on physical layer network coding to resolve collisions among users, and the latter leaning on the concept of receiver diversity. Finally, the opportunities and the challenges encountered by random access solutions recently devised to operate in asynchronous, i.e., unslotted, scenarios are reviewed and discussed.
{"title":"Modern Random Access Protocols","authors":"M. Berioli, G. Cocco, G. Liva, A. Munari","doi":"10.1561/1300000047","DOIUrl":"https://doi.org/10.1561/1300000047","url":null,"abstract":"Random access represents possibly the simplest and yet one of the best \u0000known approaches for sharing a channel among several users. Since \u0000their introduction in the 1970s, random access schemes have been thoroughly \u0000studied and small variations of the pioneering Aloha protocol \u0000have since then become a key component of many communications standards, \u0000ranging from satellite networks to ad hoc and cellular scenarios. \u0000A fundamental step forward for this old paradigm has been witnessed in \u0000the past few years, with the development of new solutions, mainly based \u0000on the principles of successive interference cancellation, which made it \u0000possible to embrace constructively collisions among packets rather than enduring \u0000them as a waste of resources. These new lines of research have \u0000rendered the performance of modern random access protocols competitive \u0000with that of their coordinated counterparts, paving the road for a \u0000multitude of new applications. \u0000This monograph explores the main ideas and design principles that \u0000are behind some of such novel schemes, and aims at offering to the \u0000reader an introduction to the analytical tools that can be used to model \u0000their performance. After reviewing some relevant thoretical results for the random \u0000access channel, the volume focuses on slotted solutions that combine the \u0000approach of diversity Aloha with successive interference cancellation, \u0000and discusses their optimisation based on an analogy with the theory \u0000of codes on graphs. The potential of modern random access is then \u0000further explored considering two families of schemes: the former based \u0000on physical layer network coding to resolve collisions among users, and \u0000the latter leaning on the concept of receiver diversity. Finally, the opportunities \u0000and the challenges encountered by random access solutions \u0000recently devised to operate in asynchronous, i.e., unslotted, scenarios \u0000are reviewed and discussed.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122456845","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}
Future vehicles will require massive sensing capability. Leveraging only onboard sensors, though, is challenging in crowded environments where the sensing field-of-view is obstructed. One potential solution is to share sensor data among the vehicles and infrastructure. This has the benefits of providing vehicles with an enhanced field-of-view and also additional redundancy to provide more reliability in the sensor data. A main challenge in sharing sensor data is providing the high data rates required to exchange raw sensor data. The large spectral channels at millimeter wave mmWave frequencies provide a means of achieving much higher data rates. This monograph provides an overview of mmWave vehicular communication with an emphasis on results on channel measurements, the physical PHY layer, and the medium access control MAC layer. The main objective is to summarize key findings in each area, with special attention paid to identifying important topics of future research. In addition to surveying existing work, some new simulation results are also presented to give insights on the effect of directionality and blockage, which are the two distinguishing features of mmWave vehicular channels. A main conclusion of this monograph is that given the renewed interest in high rate vehicle connectivity, many challenges remain in the design of a mmWave vehicular network.
{"title":"Millimeter Wave Vehicular Communications: A Survey","authors":"Vutha Va, Takayuki Shimizu, G. Bansal, R. Heath","doi":"10.1561/1300000054","DOIUrl":"https://doi.org/10.1561/1300000054","url":null,"abstract":"Future vehicles will require massive sensing capability. Leveraging only onboard sensors, though, is challenging in crowded environments where the sensing field-of-view is obstructed. One potential solution is to share sensor data among the vehicles and infrastructure. This has the benefits of providing vehicles with an enhanced field-of-view and also additional redundancy to provide more reliability in the sensor data. A main challenge in sharing sensor data is providing the high data rates required to exchange raw sensor data. The large spectral channels at millimeter wave mmWave frequencies provide a means of achieving much higher data rates. This monograph provides an overview of mmWave vehicular communication with an emphasis on results on channel measurements, the physical PHY layer, and the medium access control MAC layer. The main objective is to summarize key findings in each area, with special attention paid to identifying important topics of future research. In addition to surveying existing work, some new simulation results are also presented to give insights on the effect of directionality and blockage, which are the two distinguishing features of mmWave vehicular channels. A main conclusion of this monograph is that given the renewed interest in high rate vehicle connectivity, many challenges remain in the design of a mmWave vehicular network.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132565105","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}
I. Koutsopoulos, Thanasis G. Papaioannou, Vassiliki Hatzi
The aim of the smart electric energy grid is to improve efficiency, flexibility, and stability of the electric energy generation and distribution system, with the ultimate goal being the added value of energy-related services to the end-consumer and to facilitate energy generation and prudent consumption toward energy efficiency. New technologies, such as networks and sensors, are combined with consumer behaviour to create a complex eco-system in which many factors interact. Modeling and Optimization of the Smart Grid Ecosystem gives some structure to the complex ecosystem and surveys key research problems that have shaped the area. The emphasis is on the presentation of the control and optimization methodology used in approaching each of these problems. This methodology spans convex and linear optimization theory, game theory, and stochastic optimization. Modeling and Optimization of the Smart Grid Ecosystem serves as a reference for researchers wishing to understand the fundamental principles and research problems underpinning the smart grid ecosystem, and the main mathematical tools used to model and analyze such systems.
{"title":"Modeling and Optimization of the Smart Grid Ecosystem","authors":"I. Koutsopoulos, Thanasis G. Papaioannou, Vassiliki Hatzi","doi":"10.1561/1300000042","DOIUrl":"https://doi.org/10.1561/1300000042","url":null,"abstract":"The aim of the smart electric energy grid is to improve efficiency, flexibility, and stability of the electric energy generation and distribution system, with the ultimate goal being the added value of energy-related services to the end-consumer and to facilitate energy generation and prudent consumption toward energy efficiency. New technologies, such as networks and sensors, are combined with consumer behaviour to create a complex eco-system in which many factors interact. Modeling and Optimization of the Smart Grid Ecosystem gives some structure to the complex ecosystem and surveys key research problems that have shaped the area. The emphasis is on the presentation of the control and optimization methodology used in approaching each of these problems. This methodology spans convex and linear optimization theory, game theory, and stochastic optimization. Modeling and Optimization of the Smart Grid Ecosystem serves as a reference for researchers wishing to understand the fundamental principles and research problems underpinning the smart grid ecosystem, and the main mathematical tools used to model and analyze such systems.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"19 811 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130849951","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}
Distributed storage has been an active research area for decades. With the proliferation of cloud computing, there has been a rejuvenated interest in two perspectives. The first perspective is seen through the lenses of the cloud providers: how should we build global storage services for cloud hosted services and applications at scale with high reliability and availability guarantees, but also in a cost effective way? The second perspective is seen through the lenses of the service providers that utilize public clouds: how can we achieve high I/O performance over cloud storage within a cost budget? In this manuscript, we first present various kinds of distributed storage systems, their operational characteristics and the key techniques to improve their performance. We then focus on cloud storage, exclusively. Cloud storage has massive scales with the promise to provide as much storage capacity as their tenants demand. Cloud providers also promise very high durability, availability, and I/O performance. In this context, we cover the fundamental tradeoffs between storage efficiency and network bandwidth as well as I/O throughput and latency. Erasure codes play an essential role in these tradeoffs and, thus, we also present their design and usage in the context of cloud storage broadly. We pay particular attention on various queuing models and the corresponding performance analysis in the presence of coded storage. We provide exact and approximate solutions under various settings and assumptions. We describe optimal or near-optimal scheduling and coding strategies that are established based on these analyses.
{"title":"Building Reliable Storage Clouds: Models, Fundamental Tradeoffs, and Solutions","authors":"U. Kozat, Guanfeng Liang","doi":"10.1561/1300000051","DOIUrl":"https://doi.org/10.1561/1300000051","url":null,"abstract":"Distributed storage has been an active research area for decades. With the proliferation of cloud computing, there has been a rejuvenated interest in two perspectives. The first perspective is seen through the lenses of the cloud providers: how should we build global storage services for cloud hosted services and applications at scale with high reliability and availability guarantees, but also in a cost effective way? The second perspective is seen through the lenses of the service providers that utilize public clouds: how can we achieve high I/O performance over cloud storage within a cost budget? In this manuscript, we first present various kinds of distributed storage systems, their operational characteristics and the key techniques to improve their performance. We then focus on cloud storage, exclusively. Cloud storage has massive scales with the promise to provide as much storage capacity as their tenants demand. Cloud providers also promise very high durability, availability, and I/O performance. In this context, we cover the fundamental tradeoffs between storage efficiency and network bandwidth as well as I/O throughput and latency. Erasure codes play an essential role in these tradeoffs and, thus, we also present their design and usage in the context of cloud storage broadly. We pay particular attention on various queuing models and the corresponding performance analysis in the presence of coded storage. We provide exact and approximate solutions under various settings and assumptions. We describe optimal or near-optimal scheduling and coding strategies that are established based on these analyses.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122126438","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}
The current state-of-art in securing computers and data is tantamount to an arms race between the attackers on one hand and the software developers who have to provide the updates to counteract the attacks on the other. This monograph introduces a novel technique for designing secure protocols with provable security guarantees for wireless ad-hoc networks infiltrated with adversarial nodes. It does this by developing a system-theoretical approach to secure protocol design that provides provable and comprehensive security guarantees, where any features of a protocol that reduce complexity or maximize the network throughput do not come at the expense of security. The desired approach is one of security first and performance second, which is the reverse of the current approach. This novel approach uses a game-theoretic framework that addresses the deficiencies in the defense-in-depth approach to securing complex systems. A Clean Slate Approach to Secure Wireless Networking describes in detail the theory of using this approach in both closed synchronized and unsynchronized networks. It will be of interest to all researchers and designers working on securing wireless networks.
{"title":"A Clean Slate Approach to Secure Wireless Networking","authors":"Jonathan Ponniah, Yih-Chun Hu, P. R. Kumar","doi":"10.1561/1300000037","DOIUrl":"https://doi.org/10.1561/1300000037","url":null,"abstract":"The current state-of-art in securing computers and data is tantamount to an arms race between the attackers on one hand and the software developers who have to provide the updates to counteract the attacks on the other. This monograph introduces a novel technique for designing secure protocols with provable security guarantees for wireless ad-hoc networks infiltrated with adversarial nodes. It does this by developing a system-theoretical approach to secure protocol design that provides provable and comprehensive security guarantees, where any features of a protocol that reduce complexity or maximize the network throughput do not come at the expense of security. The desired approach is one of security first and performance second, which is the reverse of the current approach. This novel approach uses a game-theoretic framework that addresses the deficiencies in the defense-in-depth approach to securing complex systems. A Clean Slate Approach to Secure Wireless Networking describes in detail the theory of using this approach in both closed synchronized and unsynchronized networks. It will be of interest to all researchers and designers working on securing wireless networks.","PeriodicalId":188056,"journal":{"name":"Found. Trends Netw.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127547862","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
扫码关注我们
求助内容：
应助结果提醒方式：