This paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. It is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social network, but escaped from monitoring on the presence and mutual relationship of nodes. The method aims at integrating the expert investigator’s prior understanding, insi...

In this paper, we propose a novel game-theoretical solution to the multi-path routing problem in wireless ad hoc networks comprising selfish nodes with hidden information and actions. By incorporating a suitable traffic allocation policy, the proposed mechanism results in Nash equilibria where each node honestly reveals its true cost, and forwarding subgame perfect equilibrium in which each nod...

We present a new implementation of TDMA communication protocol for wireless sensor networks. The ITEM (Integrated TDMA E-ASAP Module) is a TinyOS 1.x module primarily determined for TelosB platform. It provides a TDMA (Time Division Multiple Access) communication protocol integrated with slot assignment protocol E-ASAP (Extended Adaptive Slot Assignment Protocol). The ITEM module deals with a c...

We introduce the following hidden hubs model H(n, k, σ0, σ1): the input is an n × n random matrix A with a subset S of k special rows (hubs); entries in rows outside S are generated from the Gaussian distribution p0 = N(0, σ 0), while for each row in S, an unknown subset of k of its entries are generated from p1 = N(0, σ 1), σ1 > σ0, and the rest of the entries from p0. The special rows with hi...

In a mesh network, each node acts as a router/repeater for other nodes in the network. These nodes can be fixed pieces of network infrastructure and/or can be the mobile devices themselves. In such networks, because of the heterogeneous transmission range of the clients and routers, link asymmetry problem exists. Link asymmetry poses several challenges such as the unidirectional link problem, t...

The hidden subgroup problem (HSP) has been attracting much attention in quantum computing, since several well-known algorithms including Shor's algorithm can be described a uniform framework as methods to address different instances of it. One the central issues about HSP is characterize its quantum/classical complexity. For example, from viewpoint learning theory, sample complexity crucial con...

All Rights Reserved iv Dedication This thesis is dedicated to my parents. They have supported me in my studies. and feedback on this thesis. I would also like to thank all the faculty members and staff of Indiana University South Bend who have taught and helped me during my studying. Finally, I would like to thank my parents for their support and patience. Abstract The RTS/CTS mechanism is an o...