[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

The term ‘‘Internet-of-Things’’ is used as an umbrella keyword for covering various aspects related to the extension of the Internet and the Web into the physical realm, by means of the widespread deployment of spatially distributed devices with embedded identification, sensing and/or actuation capabilities. Internet-of-Things envisions a future in which digital and physical entities can be linked, by means of appropriate information and communication technologies, to enable a whole new class of applications and services. In this article, we present a survey of technologies, applications and research challenges for Internetof-Things.

/pdf/internet-of-things-vision-applications-and-research-4xfstaiv80.pdf

Internet of things: Vision, applications and research challenges

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

Coverage control for mobile sensing networks

Home PURPOSE OF THE CENTER: To develop the center to address state-of-the-art research, create innovating educational programs, and support technology transfers using commercially viable results to assist the Army Research Laboratory to develop the next generation Future Combat System in the telecommunications sector that assures prevention of perceived threats, and Non Line of Sight/Beyond Line of Sight lethal support.

How to… home page

Power Aware Routing in Mobile Ad Hoc Networks

Radio frequency identification and wireless sensor networks are two important wireless technologies that have a wide variety of applications in current and future systems. RFID facilitates detection and identification of objects that are not easily detectable or distinguishable by using conventional sensor technologies. However, it does not provide information about the condition of the objects it detects. WSN, on the other hand, not only provides information about the condition of the objects and environment but also enables multihop wireless communications. Hence, the integration of these technologies expands their overall functionality and capacity. This article investigates recent research work and applications that integrate RFID with sensor networks. Four classes of integration are discussed: integrating tags with sensors, integrating tags with WSN nodes and wireless devices, integrating readers with WSN nodes and wireless devices, and a mix of RFID and WSNs. Finally, a discussion of new challenges and future work is presented.

Taxonomy and Challenges of the Integration of RFID and Wireless Sensor Networks

Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention, etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any centralized controller and common control channel (CCC). We propose a jump-stay channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users “jump” on available channels in the jump-pattern while “stay” on a specific channel in the stay-pattern. We prove that two users can achieve rendezvous in one of four possible pattern combinations: jump-stay, stay-jump, jump-jump, and stay-stay. Compared with the existing CH algorithms, our algorithm has the overall best performance in various scenarios and is applicable to rendezvous of multiuser and multihop scenarios. We derive upper bounds on the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithm for both 2-user and multiuser scenarios (shown in Table 1). Extensive simulations are conducted to evaluate the performance of our algorithm.

Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks

Cognitive radio networks (CRNs) have emerged as advanced and promising paradigm to exploit the existing wireless spectrum opportunistically. It is crucial for users in CRNs to search for neighbors via rendezvous process and thereby establish the communication links to exchange the information necessary for spectrum management and channel contention etc. This paper focuses on the design of algorithms for blind rendezvous, i.e., rendezvous without using any central controller and common control channel (CCC). We propose a jump-stay based channel-hopping (CH) algorithm for blind rendezvous. The basic idea is to generate CH sequence in rounds and each round consists of a jump-pattern and a stay-pattern. Users “jump” on available channels in the jump-pattern while “stay” on a specific channel in the stay-pattern. Compared with the existing CH algorithms, our algorithm achieves the following advances: i) guaranteed rendezvous without the need of time-synchronization; ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-to-rendezvous (TTR) and the upper-bound of expected TTR of our algorithm for both 2-user and multi-user scenarios (shown in Table I). Extensive simulations are further conducted to evaluate performance of our algorithm.

Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks

In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and propose three heuristic algorithms, namely, shortest path tree heuristic, greedy heuristic, and node weighted Steiner tree-based heuristic, which are centralized algorithms. The approximation ratio of the node weighted Steiner tree-based heuristic is proven to be (1 + 2 ln(n - 1)). Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.

https://www.cs.cityu.edu.hk/~jia/research/broadcast.pdf

Energy efficient broadcast routing in static ad hoc wireless networks

Rendezvous is a fundamental operation for cognitive users to establish communication links. In [5], we proposed a jump-stay (JS) rendezvous algorithm which was shown to have the overall best performance. In this work, we propose an enhanced jump-stay (EJS) algorithm. Compared with JS, EJS lowers the upper-bounds of both the maximum time-to-rendezvous (MTTR) and the expected time-to-rendezvous (E(TTR)) from O(P3) to O(P2) under the asymmetric model, while keeping the same order O(P) of upper-bounds of MTTR and E(TTR) under the symmetric mode, where P is the smallest prime number greater than the total number of channels.

Hai Liu

Papers

Taxonomy and Challenges of the Integration of RFID and Wireless Sensor Networks

Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks

Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks

Energy efficient broadcast routing in static ad hoc wireless networks

Enhanced Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks