Sensor Networks and Their Applications: Investigating the Role of Sensor Web Enablement

The Engineering Doctorate (EngD) was conducted in conjunction with BT Research on state-of-the-art Wireless Sensor Network (WSN) projects. The first area of work is a literature review of WSN project applications, some of which the author worked on as a BT Researcher based at the world renowned Adastral Park Research Labs in Suffolk (2004-09). WSN applications are examined within the context of Machine-to-Machine (M2M); Information Networking (IN); Internet/Web of Things (IoT/WoT); smart home and smart devices; BT’s 21st Century Network (21CN); Cloud Computing; and future trends. In addition, this thesis provides an insight into the capabilities of similar external WSN project applications. Under BT’s Sensor Virtualization project, the second area of work focuses on building a Generic Architecture for WSNs with reusable infrastructure and ‘infostructure’ by identifying and trialling suitable components, in order to realise actual business benefits for BT. The third area of work focuses on the Open Geospatial Consortium (OGC) standards and their Sensor Web Enablement (SWE) initiative. The SWE framework was investigated to ascertain its potential as a component of the Generic Architecture. BT’s SAPHE project served as a use case. BT Research’s experiences of taking this traditional (vertical) stove-piped application and creating SWE compliant services are described. The author’s findings were originally presented in a series of publications and have been incorporated into this thesis along with supplementary WSN material from BT Research projects. SWE 2.0 specifications are outlined to highlight key improvements, since work began at BT with SWE 1.0. The fourth area of work focuses on Complex Event Processing (CEP) which was evaluated to ascertain its potential for aggregating and correlating the shared project sensor data (‘infostructure’) harvested and for enabling data fusion for WSNs in diverse domains. Finally, the conclusions and suggestions for further work are provided

REPUTATION COMPUTATION IN SOCIAL NETWORKS AND ITS APPLICATIONS

This thesis focuses on a quantification of reputation and presents models which compute reputation within networked environments. Reputation manifests past behaviors of users and helps others to predict behaviors of users and therefore reduce risks in future interactions. There are two approaches in computing reputation on networks- namely, the macro-level approach and the micro-level approach. A macro-level assumes that there exists a computing entity outside of a given network who can observe the entire network including degree distributions and relationships among nodes. In a micro-level approach, the entity is one of the nodes in a network and therefore can only observe the information local to itself, such as its own neighbors behaviors. In particular, we study reputation computation algorithms in online distributed environments such as social networks and develop reputation computation algorithms to address limitations of existing models. We analyze and discuss some properties of reputation values of a large number of agents including power-law distribution and their diffusion property. Computing reputation of another within a network requires knowledge of degrees of its neighbors. We develop an algorithm for estimating degrees of each neighbor. The algorithm considers observations associated with neighbors as a Bernoulli trial and repeatedly estimate degrees of neighbors as a new observation occurs. We experimentally show that the algorithm can compute the degrees of neighbors more accurately than a simple counting of observations. Finally, we design a bayesian reputation game where reputation is used as payoffs. The game theoretic view of reputation computation reflects another level of reality in which all agents are rational in sharing reputation information of others. An interesting behavior of agents within such a game theoretic environment is that cooperation- i.e., sharing true reputation information- emerges without an explicit punishment mechanism nor a direct reward mechanisms

Assessing the role of fluctuating renewables in energy transition: Methodologies and tools

Due to the environmental impacts brought by current energy schemes, the energy transition, a new paradigm shift from fossil fuels to renewable energy, has been widely accepted and is being realized through collective international, regional, and local efforts. Electricity, as the most direct and effective use of renewable energy sources (RES), plays a key role in the energy transition. In this paper, we first discuss a viable pathway to energy transition through the electricity triangle, highlighting the role of RES in electricity generation. Further, we propose methodologies for the planning of wind and solar PV, as well as how to address their uncertainty in generation expansion problems. Finally, by using a web-based tool, “RES-PLAT”, we demonstrate the scheme in a case study in Egypt, which evaluates the impacts and benefits of a large-scale RES expansion

Crossbow Volume 1

Student Integrated ProjectIncludes supplementary materialDistributing naval combat power into many small ships and unmanned air vehicles that capitalize on emerging technology offers a transformational way to think about naval combat in the littorals in the 2020 time frame. Project CROSSBOW is an engineered systems of systems that proposes to use such distributed forces to provide forward presence to gain and maiantain access, to provide sea control, and to project combat power in the littoral regions of the world. Project CROSSBOW is the result of a yearlong, campus-wide, integrated research systems engineering effort involving 40 student researchers and 15 supervising faculty members. This report (Volume I) summarizes the CROSSBOW project. It catalogs the major features of each of the components, and includes by reference a separate volume for each of the major systems (ships, aircraft, and logistics). It also prresents the results of the mission and campaign analysis that informed the trade-offs between these components. It describes certain functions of CROSSBOW in detail through specialized supporting studies. The student work presented here is technologically feasible, integrated and imaginative. The student project cannot by itself provide definitive designs or analyses covering such a broad topic. It does strongly suggest that the underlying concepts have merit and deserve further serious study by the Navy as it transforms itself

A P2P Networking Simulation Framework For Blockchain Studies

Recently, blockchain becomes a disruptive technology of building distributed applications (DApps). Many researchers and institutions have devoted their resources to the development of more effective blockchain technologies and innovative applications. However, with the limitation of computing power and financial resources, it is hard for researchers to deploy and test their blockchain innovations in a large-scape physical network. Hence, in this dissertation, we proposed a peer-to-peer (P2P) networking simulation framework, which allows to deploy and test (simulate) a large-scale blockchain system with thousands of nodes in one single computer. We systematically reviewed existing research and techniques of blockchain simulator and evaluated their advantages and disadvantages. To achieve generality and flexibility, our simulation framework lays the foundation for simulating blockchain network with different scales and protocols. We verified our simulation framework by deploying the most famous three blockchain systems (Bitcoin, Ethereum and IOTA) in our simulation framework. We demonstrated the effectiveness of our simulation framework with the following three case studies: (a) Improve the performance of blockchain by changing key parameters or deploying new directed acyclic graph (DAG) structure protocol; (b) Test and analyze the attack response of Tangle-based blockchain (IOTA) (c) Establish and deploy a new smart grid bidding system for demand side in our simulation framework. This dissertation also points out a series of open issues for future research

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

Reasoning Under Uncertainty in Cyber-Physical Systems: Toward Efficient and Secure Operation

The increased sensing, processing, communication, and control capabilities introduced by cyber-physical systems bring many potential improvements to the operation of society's systems, but also introduce questions as to how one can ensure their efficient and secure operation. This dissertation investigates three questions related to decision-making under uncertainty in cyber-physical systems settings. First, in the context of power systems and electricity markets, how can one design algorithms that guide self-interested agents to a socially optimal and physically feasible outcome, subject to the fact that agents only possess localized information of the system and can only react to local signals? The proposed algorithms, investigated in the context of two distinct models, are iterative in nature and involve the exchange of messages between agents. The first model consists of a network of interconnected power systems controlled by a collection of system operators. Each system operator possesses knowledge of its own localized region and aims to prescribe the cost minimizing set of net injections for its buses. By using relative voltage angles as messages, system operators iteratively communicate to reach a social-cost minimizing and physically feasible set of injections for the whole network. The second model consists of a market operator and market participants (distribution, generation, and transmission companies). Using locational marginal pricing, the market operator is able to guide the market participants to a competitive equilibrium, which, under an assumption on the positivity of prices, is shown to be a globally optimal solution to the non-convex social-welfare maximization problem. Common to both algorithms is the use of a quadratic power flow approximation that preserves important non-linearities (power losses) while maintaining desirable mathematical properties that permit convergence under natural conditions. Second, when a system is under attack from a malicious agent, what models are appropriate for performing real-time and scalable threat assessment and response selection when we only have partial information about the attacker's intent and capabilities? The proposed model, termed the dynamic security model, is based on a type of attack graph, termed a condition dependency graph, and describes how an attacker can infiltrate a cyber network. By embedding a state space on the graph, the model is able to quantify the attacker's progression. Consideration of multiple attacker types, corresponding to attack strategies, allows one to model the defender's uncertainty of the attacker's true strategy/intent. Using noisy security alerts, the defender maintains a belief over both the capabilities/progression of the attacker (via a security state) and its strategy (attacker type). An online, tree-based search method, termed the online defense algorithm, is developed that takes advantage of the model's structure, permitting scalable computation of defense policies. Finally, in partially observable sequential decision-making environments, specifically partially observable Markov decision processes (POMDPs), under what conditions do optimal policies possess desirable structure? Motivated by the dynamic security model, we investigate settings where the underlying state space is partially ordered (i.e. settings where one cannot always say whether one state is better or worse than another state). The contribution lies in the derivation of natural conditions on the problem's parameters such that optimal policies are monotone in the belief for a class of two-action POMDPs. The extension to the partially ordered setting requires defining a new stochastic order, termed the generalized monotone likelihood ratio, and a corresponding class of order-preserving matrices, termed generalized totally positive of order 2.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/144026/1/miehling_1.pd

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

Mining a Small Medical Data Set by Integrating the Decision Tree and t-test

[[abstract]]Although several researchers have used statistical methods to prove that aspiration followed by the injection of 95% ethanol left in situ (retention) is an effective treatment for ovarian endometriomas, very few discuss the different conditions that could generate different recovery rates for the patients. Therefore, this study adopts the statistical method and decision tree techniques together to analyze the postoperative status of ovarian endometriosis patients under different conditions. Since our collected data set is small, containing only 212 records, we use all of these data as the training data. Therefore, instead of using a resultant tree to generate rules directly, we use the value of each node as a cut point to generate all possible rules from the tree first. Then, using t-test, we verify the rules to discover some useful description rules after all possible rules from the tree have been generated. Experimental results show that our approach can find some new interesting knowledge about recurrent ovarian endometriomas under different conditions.[[journaltype]]國外[[incitationindex]]EI[[booktype]]紙本[[countrycodes]]FI

MOCAST 2021

The 10th International Conference on Modern Circuit and System Technologies on Electronics and Communications (MOCAST 2021) will take place in Thessaloniki, Greece, from July 5th to July 7th, 2021. The MOCAST technical program includes all aspects of circuit and system technologies, from modeling to design, verification, implementation, and application. This Special Issue presents extended versions of top-ranking papers in the conference. The topics of MOCAST include:Analog/RF and mixed signal circuits;Digital circuits and systems design;Nonlinear circuits and systems;Device and circuit modeling;High-performance embedded systems;Systems and applications;Sensors and systems;Machine learning and AI applications;Communication; Network systems;Power management;Imagers, MEMS, medical, and displays;Radiation front ends (nuclear and space application);Education in circuits, systems, and communications