We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Environmental sustainability has been of increasing interest in designing any system in recent times. Computing systems usually contribute to this drive of sustainability from two different perspectives: (i) the energy perspective and (ii) the equipment-recycling perspective. Sections 6.1 and 6.2 describe these perspectives of sustainability of computing systems in general. All subsequent sections will focus on how to ensure sustainability for BANs from the energy perspective.
The energy perspective
Sustainability from the energy perspective, also referred to as energy-sustainability, has two main objectives: (i) reducing the carbon footprint from the power grid and (ii) reducing the need for battery replacement (for computing equipment running on limited-energy batteries). To ensure that both these objectives are attained, energy-sustainability can be described as the balance between the power required for computation and the power available from renewable or green energy sources (e.g., sources in the environment such as solar power). Ideally, if the power available from external renewable energy sources is more than the power required for computation then a power grid (or battery) might not be needed, and computation can be said to be energy-sustainable. However, in reality, both the available and the required power may vary over time. For example, solar power is available only during the day, but power may be required during the night (depending on the time-varying computing operations performed). In such a case, power may need to be extracted from a power grid (or battery) during the night, thus making computing operations unsustainable.
Body area networks (BANs) are networks of wireless sensors and medical devices embedded in clothing, worn on or implanted in the body, and have the potential to revolutionize healthcare by enabling pervasive healthcare. However, due to their critical applications affecting human health, challenges arise when designing them to ensure they are safe for the user, sustainable without requiring frequent battery replacements and secure from interference and malicious attacks. This book lays the foundations of how BANs can be redesigned from a cyber-physical systems perspective (CPS) to overcome these issues. Introducing cutting-edge theoretical and practical techniques and taking into account the unique environment-coupled characteristics of BANs, the book examines how we can re-imagine the design of safe, secure and sustainable BANs. It features real-world case studies, suggestions for further investigation and project ideas, making it invaluable for anyone involved in pervasive and mobile healthcare, telemedicine, medical apps and other cyber-physical systems.
With ever-increasing demands on capacity, quality of service, speed, and reliability, current Internet systems are under strain and under review. Combining contributions from experts in the field, this book captures the most recent and innovative designs, architectures, protocols, and mechanisms that will enable researchers to successfully build the next-generation Internet. A broad perspective is provided, with topics including innovations at the physical/transmission layer in wired and wireless media, as well as the support for new switching and routing paradigms at the device and sub-system layer. The proposed alternatives to TCP and UDP at the data transport layer for emerging environments are also covered, as are the novel models and theoretical foundations proposed for understanding network complexity. Finally, new approaches for pricing and network economics are discussed, making this ideal for students, researchers, and practitioners who need to know about designing, constructing, and operating the next-generation Internet.
Designing efficient IP networks and maintaining them effectively poses a range of challenges, but in this highly competitive industry it is crucial that these are overcome. Weaving together theory and practice, this text sets out the design and management principles of large-scale IP networks, and the need for these tasks to be underpinned by actual measurements. Discussions of the types of measurements available in IP networks are included, along with the ways in which they can assist both in the design phase as well as in the monitoring and management of IP applications. Other topics covered include IP network design, traffic engineering, network and service management and security. A valuable resource for graduate students and researchers in electrical and computer engineering and computer science, this is also an excellent reference for network designers and operators in the communication industry.
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.
Do you need to know how to write systems, services, and applications using the TinyOS operating system? Learn how to write nesC code and efficient applications with this indispensable guide to TinyOS programming. Detailed examples show you how to write TinyOS code in full, from basic applications right up to new low-level systems and high performance applications. Two leading figures in the development of TinyOS also explain the reasons behind many of the design decisions made and, for the first time, how nesC relates to and differs from other C dialects. Handy features such as a library of software design patterns, programming hints and tips, end-of-chapter exercises, and an appendix summarizing the basic application-level TinyOS APIs make this the ultimate guide to TinyOS for embedded systems programmers, developers, designers, and graduate students.
Distributed systems are fast becoming the norm in computer science. Formal mathematical models and theories of distributed behaviour are needed in order to understand them. This book proposes a distributed pi-calculus called Dpi, for describing the behaviour of mobile agents in a distributed world. It is based on an existing formal language, the pi-calculus, to which it adds a network layer and a primitive migration construct. A mathematical theory of the behaviour of these distributed systems is developed, in which the presence of types plays a major role. It is also shown how in principle this theory can be used to develop verification techniques for guaranteeing the behavior of distributed agents. The text is accessible to computer scientists with a minimal background in discrete mathematics. It contains an elementary account of the pi-calculus, and the associated theory of bisimulations. It also develops the type theory required by Dpi from first principles.
Do you need to improve wireless system performance? Learn how to maximise the efficient use of resources with this systematic and authoritative account of wireless resource management. Basic concepts, optimization tools and techniques, and application examples, are thoroughly described and analysed, providing a unified framework for cross-layer optimization of wireless networks. State-of-the-art research topics and emerging applications, including dynamic resource allocation, cooperative networks, ad hoc/personal area networks, UWB, and antenna array processing, are examined in depth. If you are involved in the design and development of wireless networks, as a researcher, graduate student or professional engineer, this is a must-have guide to getting the best possible performance from your network.
The world is increasingly populated with interactive agents distributed in space, real or abstract. These agents can be artificial, as in computing systems that manage and monitor traffic or health; or they can be natural, e.g. communicating humans, or biological cells. It is important to be able to model networks of agents in order to understand and optimise their behaviour. Robin Milner describes in this book just such a model, by presenting a unified and rigorous structural theory, based on bigraphs, for systems of interacting agents. This theory is a bridge between the existing theories of concurrent processes and the aspirations for ubiquitous systems, whose enormous size challenges our understanding. The book is reasonably self-contained mathematically, and is designed to be learned from: examples and exercises abound, solutions for the latter are provided. Like Milner's other work, this is destined to have far-reaching and profound significance.
Learn the core theory and explore real-world networking issues with this richly illustrated example-based textbook. It provides an accurate view of modern networks through detailed coverage of the most relevant networking technologies, with no unnecessary extras. Carefully designed, affordable laboratory exercises based on open-source software networking tools are included for hands-on practice with real networking devices. Numerous case studies and examples further link theory to practice, whilst the topologies, tools and configurations needed to carry out practical exercises are provided to guide students through each task. Its bottom-up approach is easy for students to follow and perfect for lab-oriented courses.
Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.
The TCP/IP family of protocols have become the de facto standard in the world of networking, are found in virtually all computer communication systems, and form the basis of today's Internet. TCP/IP Essentials is a hands-on guide to TCP/IP technologies, and shows how the protocols are implemented in practice. The book contains a series of extensively tested laboratory experiments that span the various elements of protocol definition and behavior. Topics covered include bridges, routers, LANs, static and dynamic routing, multicast and realtime service, and network management and security. The experiments are described in a Linux environment, with parallel notes on Solaris implementation. The book includes many homework exercises, and supplementary material for instructors is available. The book is aimed at students of electrical and computer engineering and students of computer science taking courses in networking. It is also an ideal guide for engineers studying for networking certifications.
Wireless technology is a truly revolutionary paradigm shift, enabling multimedia communications between people and devices from any location. It also underpins exciting applications such as sensor networks, smart homes, telemedicine, and automated highways. This book provides a comprehensive introduction to the underlying theory, design techniques and analytical tools of wireless communications, focusing primarily on the core principles of wireless system design. The book begins with an overview of wireless systems and standards. The characteristics of the wireless channel are then described, including their fundamental capacity limits. Various modulation, coding, and signal processing schemes are then discussed in detail, including state-of-the-art adaptive modulation, multicarrier, spread spectrum, and multiple antenna techniques. The concluding chapters deal with multiuser communications, cellular system design, and ad-hoc network design. Design insights and tradeoffs are emphasized throughout the book. It contains many worked examples, over 200 figures, almost 300 homework exercises, over 700 references, and is an ideal textbook for students.
Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics.
This textbook is designed as a first book on concurrent programming for computer science undergraduates, and provides a comprehensive introduction to the problems of concurrency. Concurrency is of vital importance in many areas of computer science, particularly in operating systems. It is also increasingly being taught in undergraduate courses. The book builds on the student's familiarity with sequential programming in a high level language, which will make it very accessible to computer science students. The book is concerned mainly with the high level aspects of concurrency, which will be equally applicable to traditional time sliced or more recent truly parallel systems.
This comprehensive treatment of network information theory and its applications provides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon's point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the classroom, for self-study, and as a reference for researchers and engineers in industry and academia.
The past decade has seen many advances in physical layer wireless communication theory and their implementation in wireless systems. This textbook takes a unified view of the fundamentals of wireless communication and explains the web of concepts underpinning these advances at a level accessible to an audience with a basic background in probability and digital communication. Topics covered include MIMO (multi-input, multi-output) communication, space-time coding, opportunistic communication, OFDM and CDMA. The concepts are illustrated using many examples from real wireless systems such as GSM, IS-95 (CDMA), IS-856 (1 x EV-DO), Flash OFDM and UWB (ultra-wideband). Particular emphasis is placed on the interplay between concepts and their implementation in real systems. An abundant supply of exercises and figures reinforce the material in the text. This book is intended for use on graduate courses in electrical and computer engineering and will also be of great interest to practising engineers.
Essential for getting to grips with the Weightless standard for M2M communications, this definitive guide describes and explains the new standard in an accessible manner. It helps you to understand the Weightless standard by revealing its background and rationale. Designed to make clear the context and the fundamental design decisions for Weightless and to provide a readable overview of the standard, it details principal features and issues of the technology, the business case for deployment, network performance and some important applications. This informative book guides you through the key decisions and requirements involved in designing and deploying a Weightless network. Includes a chapter on applications, explaining the relevance of the standard and its potential. Written by one of the lead designers of Weightless, this is an ideal guide for everyone involved with the standard, from those designing equipment to those making use of the technology.
This book is a guide to the Weightless technology. The definitive documentation for Weightless is the Weightless standard as published by the Weightless SIG and this book in no way is intended as an alternative. However, standards documents are not designed for readability and it is often helpful to start with a more descriptive text. This book is designed to explain the context for Weightless, the key design decisions and to provide a readable overview to the standard. That may be sufficient for some, and for those that will go on to read the standard they will better understand the details that they find there.
This book was written to accompany version 0.6 of the standard. This is referred to throughout the book simply as the standard. Of course, this standard will evolve and it is envisaged that this book will be updated to accompany major revisions to the standard.
Why the name ‘Weightless’? Like many standards such as Zigbee and Bluetooth, the name chosen is often more whimsy than descriptive. In this case, it came indirectly from making the point that this was not a new generation of cellular standard, measured in generations (2G, 3G …). Indeed, it was outside of this generation pattern and so perhaps zero-G. Zero-G is often associated with no gravity leading to weightlessness … At the time it was conceived most thought that a different name would emerge during the early standardisation process, but as is often the case names acquire a momentum all of their own, even those that have no weight.