• 제목/요약/키워드: Ubiquitous Networks

검색결과 603건 처리시간 0.026초

Energy-Efficient Traffic Grooming in Bandwidth Constrained IP over WDM Networks

  • Chen, Bin;Yang, Zijian;Lin, Rongping;Dai, Mingjun;Lin, Xiaohui;Su, Gongchao;Wang, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권6호
    • /
    • pp.2711-2733
    • /
    • 2018
  • Minimizing power consumption in bandwidth limited optical traffic grooming networks is presented as a two-objective optimization problem. Since the main objective is to route a connection, the network throughput is maximized first, and then the minimum power consumption solution is found for this maximized throughput. Both transparent IP over WDM (Tp-IPoWDM) and translucent IP over WDM (Tl-IPoWDM) network may be applied to examine such bi-objective algorithms. Simulations show that the bi-objective algorithms are more energy-efficient than the single objective algorithms where only the throughput is optimized. For a Tp-IPoWDM network, both link based ILP (LB-ILP) and path based ILP (PB-ILP) methods are formulated and solved. Simulation results show that PB-ILP can save more power than LB-ILP because PB-ILP has more path selections when lightpath lengths are limited. For a Tl-IPoWDM network, only PB-ILP is formulated and we show that the Tl-IPoWDM network consumes less energy than the Tp-IPoWDM network, especially under a sparse network topology. For both kinds of networks, it is shown that network energy efficiency can be improved by over-provisioning wavelengths, which gives the network more path choices.

R3: A Lightweight Reactive Ring based Routing Protocol for Wireless Sensor Networks with Mobile Sinks

  • Yu, Sheng;Zhang, Baoxian;Yao, Zheng;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5442-5463
    • /
    • 2016
  • Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

IP 기반 유비쿼터스 센서 네트워크에서의 침입 탐지 (Detecting Intrusion in IP-Based Ubiquitous Sensor Networks)

  • 시드 아민 오베이드;홍충선
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (A)
    • /
    • pp.134-137
    • /
    • 2008
  • A novel Intrusion Detection and Response System (IDRS) for IP based Ubiquitous Sensor Networks (IP-USN) is proposed. According to the best of our knowledge this is the first security framework for any kind of IP based sensor devices. The proposed scheme is fast, lightweight in terms of computation and memory, which make it appropriate for resource constrained sensor devices.

  • PDF

Partial Relay Selection in Decode and Forward Cooperative Cognitive Radio Networks over Rayleigh Fading Channels

  • Zhong, Bin;Zhang, Zhongshan;Zhang, Dandan;Long, Keping;Cao, Haiyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권11호
    • /
    • pp.3967-3983
    • /
    • 2014
  • The performance of an partial relay selection on the decode-and-forward (DF) mode cognitive radio (CR) relay networks is studied, with some important factors, including the outage probability, the bit error ratio (BER), and the average channel capacity being analyzed. Different from the conventional relay selection schemes, the impact of spectrum sensing process as well as the spectrum utilization efficiency of primary users on the performance of DF-based CR relaying networks has been taken into consideration. In particular, the exact closed-form expressions for the figures of merit such as outage probability, BER, and average channel capacity over independent and identically distributed (i.i.d.) Rayleigh fading channels, have been derived in this paper. The validity of the proposed analysis is proven by simulation, which showed that the numerical results are consistent with the theoretical analysis in terms of the outage probability, the BER and the average channel capacity. It is also shown that the full spatial diversity order can always be obtained at the signal-to-noise ratio (SNR) range of [0dB, 15dB] in the presence of multiple potential relays.

유비쿼터스 그린하우스를 위한 무선 메쉬 네트워크를 이용한 에너지 효율적인 센서 네트워크 (Energy efficient Sensor Network for ubiquitous greenhouse by using Wireless Mesh Networks)

  • 임혁진;주휘동;이명훈;여현
    • 한국정보통신학회논문지
    • /
    • 제12권12호
    • /
    • pp.2307-2314
    • /
    • 2008
  • 유비쿼터스 센서 네트워크는 현재 다양한 분야로 활용되고 있는 추세이다. 이러한 유비쿼터스 센서 네트워크를 그린 하우스에 적용하여 작물생장정보 및 환경데이터 수집 등 유용한 정보를 모니터링 할 수 있다. 하지만 센서노드의 한정된 에너지 자원으로 네트워크 확장을 통한 대규모 네트워크를 구성하여 운영하기에는 부적절하다. 본 논문에서는 상기 문제점을 해결하기 위해 유비쿼터스 센서 네트워크에 무선 메쉬 네트워크 기술을 적용하여 시뮬레이션을 구현하였다. 도출된 결론을 통해 유비쿼터스 센서 네트워크에 무선 메쉬 네트워크 기술을 적용했을 때 에너지 측면에서 효율성이 높아진 것을 확인할 수 있었다.

Method of Profile Storage for Improving Accuracy and Searching Time on Ubiquitous Computing

  • Jang, Chang-Bok;Lee, Joon-Dong;Lee, Moo-Hun;Cho, Sung-Hoon;Choi, Eui-In
    • 한국멀티미디어학회논문지
    • /
    • 제9권12호
    • /
    • pp.1709-1718
    • /
    • 2006
  • Users are able to use the information and service more free than previous wire network due to development of wireless network and device. For this reason, various studies on ubiquitous networks have been conducted. Various contexts brought in this ubiquitous environment, have recognized user's action through sensors. This results in the provision of better services. Because services exist in various places in ubiquitous networks, the application has the time of services searching. In addition, user's context is very dynamic, so a method needs to be found to recommend services to user by context. Therefore, techniques for reducing the time of service and increasing accuracy of recommendation are being studied. But it is difficult to quickly and appropriately provide large numbers of services, because only basic context information is stored. For this reason, we suggest DUPS(Dimension User Profile System), which stores location, time, and frequency information of often used services. Because previous technique used to simple information for recommending service without predicting services which is going to use on future, we can provide better service, and improve accuracy over previous techniques.

  • PDF

A Virtual-Queue based Backpressure Scheduling Algorithm for Heterogeneous Multi-Hop Wireless Networks

  • Jiao, Zhenzhen;Zhang, Baoxian;Zheng, Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.4856-4871
    • /
    • 2015
  • Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

유비쿼터스 전자거래를 위한 쓰레시홀드 링 그룹 서명 (A Threshold Ring Group Signature for Ubiquitous Electronic Commerce)

  • 성순화
    • 정보처리학회논문지D
    • /
    • 제14D권4호
    • /
    • pp.373-380
    • /
    • 2007
  • 유비쿼터스 전자거래를 통하여 사용자는 언제 어디서나 네트워크에 접근하여 편리한 정보를 개인과 그룹, 그룹과 그룹 사이에서 교환할 수 있다. 사용자가 이러한 유비쿼터스 전자거래를 안전하게 사용하기 위해서는, 전자 정보의 무결성과 인증의 특성을 가지는 디지털 서명이 필수 조건이다. 유비쿼터스 네트워크에서의 디지털 서명은 언제 어디서나 필요에 따라 그룹을 만들기도 하고 해체하기도 하므로, 유비쿼터스 전자거래는 신뢰된 그룹 관리자와 셋업 프로시져 철회 프로시져 등이 필요 없는 디지털 서명이 요구된다. 따라서 본 논문에서는 안전한 유비쿼터스 전자거래를 위한 디지털 서명으로서 쓰레시홀드 링 서명을 제안한다. 제안된 디지털 서명은 위조의 위험이 없는(무결성) 링 서명과 메시지가 다른 서명자에 의해 서명되는 것을 증명할 수 없는 문제를 해결하는(인증) (n,t)링 서명을 사용한다. 그러므로 제안된 쓰레시홀드 링 서명은 무결성과 인증을 만족하는 차세대 유비쿼터스 그룹 서명이다.