• Title/Summary/Keyword: Opportunistic network

Search Result 136, Processing Time 0.024 seconds

Channel Prediction-Based Channel Allocation Scheme for Multichannel Cognitive Radio Networks

  • Lee, Juhyeon;Park, Hyung-Kun
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.209-216
    • /
    • 2014
  • Cognitive radio (CR) has been proposed to solve the spectrum utilization problem by dynamically exploiting the unused spectrum. In CR networks, a spectrum selection scheme is an important process to efficiently exploit the spectrum holes, and an efficient channel allocation scheme must be designed to minimize interference to the primary network as well as to achieve better spectrum utilization. In this paper, we propose a multichannel selection algorithm that uses spectrum hole prediction to limit the interference to the primary network and to exploit channel characteristics in order to enhance channel utilization. The proposed scheme considers both the interference length and the channel capacity to limit the interference to primary users and to enhance system performance. By using the proposed scheme, channel utilization is improved whereas the system limits the collision rate of the CR packets.

Coded Cooperation Communication over Two-Way Relay Network (양 방향 중계 네트워크에서의 부호화 협력 통신)

  • Park, Ji-Hwan;Kong, Hyung-Yun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.1
    • /
    • pp.24-29
    • /
    • 2011
  • Comparing conventional one-way relaying, two-way relaying scheme with network coding can achieve high throughput by reducing the transmission time. Coded cooperation protocol, which is a algorithm that uses coding on physical layer, can achieve high reliability. In this paper, we propose coded cooperation protocol over two-way relay network. Simulation results show proposed protocol has better performance in terms of reliability and throughput compare with conventional amplify and forward protocol. Also, with same throughput, proposed protocol has better performance in terms of reliability compare with the conventional hybrid decoded and forward protocol.

A WSN-based Safety Management System in School-Zone (무선센서네트워크 기반의 스쿨존 안전관리 시스템)

  • Lee, Chang-Bok;Lee, Jin-Kwan;Park, Sang-Jun;Lee, Jong-Chan;Park, Ki-Hong
    • Convergence Security Journal
    • /
    • v.9 no.1
    • /
    • pp.19-27
    • /
    • 2009
  • In this paper, we propose a safety management system which prevents the occurrence of crime and accident from rising in school neighborhood. This system offers a monitoring method for safety of children which make intelligent space from environment and location sensing data through wireless communication between sensors attached to children and fixed sensor network in school neighborhood. Also, We propose a strategic safety management plan using opportunistic network when node is out of school zone network. Many students can easily receive the service of low cost from WSN-based School zone network than existing service from GPS individually by using our scheme.

  • PDF

QoS-Guaranteed Capacity of Centralized Cognitive Radio Networks with Interference Averaging Techniques

  • Wang, Jing;Lin, Mingming;Hong, Xuemin;Shi, Jianghong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.18-34
    • /
    • 2014
  • It is widely believed that cognitive radio (CR) networks have an opportunistic nature and therefore can only support best-effort traffics without quality-of-service (QoS) guarantees. In this paper, we propose a centralized CR network that adopts interference averaging techniques to support QoS guaranteed traffics under interference outage constraints. In such a CR network, a CR user adaptively adjusts its transmit power to compensate for the channel loss, thereby keeping the receive signal power at the CR base station (BS) at a constant level. The closed-form system capacity of such a CR network is analyzed and derived for a single cell with one CR BS and multiple CR users, taking into account various key factors such as interference outage constraints, channel fading, cell radius, and locations of primary users. The accuracy of the theoretical results is validated by Monte Carlo simulations. Numerical and simulation results show promising capacity potential for deploying QoS-guaranteed CR networks in frequency bands with fixed primary receivers. Our work can provide theoretical guidelines for the strategic planning of centralized CR networks.

Proposed Message Transit Buffer Management Model for Nodes in Vehicular Delay-Tolerant Network

  • Gballou Yao, Theophile;Kimou Kouadio, Prosper;Tiecoura, Yves;Toure Kidjegbo, Augustin
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.153-163
    • /
    • 2023
  • This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

Statistically Controlled Opportunistic Resource Block Sharing for Femto Cell Networks

  • Shin, Dae Kyu;Choi, Wan;Yu, Takki
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.469-475
    • /
    • 2013
  • In this paper, we propose an efficient interference management technique which controls the number of resource blocks (or subcarriers) shared with other cells based on statistical interference levels among cells. The proposed technique tries to maximize average throughput of a femto cell user under a constraint on non-real time control of a femto cell network while guaranteeing a target throughput value of a macro cell user. In our proposed scheme, femto cells opportunistically use resource blocks allocated to other cells if the required average user throughput is not attained with the primarily allocated resource blocks. The proposed method is similar to the underlay approach in cognitive radio systems, but resource block sharing among cells is statistically controlled. For the statistical control, a femto cell sever constructs a table storing average mutual interference among cells and periodically updates the table. This statistical approach fully satisfies the constraint of non-real time control for femto cell networks. Our simulation results show that the proposed scheme achieves higher average femto user throughput than conventional frequency reuse schemes for time varying number of users.

On the Multiuser Diversity in SIMO Interfering Multiple Access Channels: Distributed User Scheduling Framework

  • Shin, Won-Yong;Park, Dohyung;Jung, Bang Chul
    • Journal of Communications and Networks
    • /
    • v.17 no.3
    • /
    • pp.267-274
    • /
    • 2015
  • Due to the difficulty of coordination in the cellular uplink, it is a practical challenge how to achieve the optimal throughput scaling with distributed scheduling. In this paper, we propose a distributed and opportunistic user scheduling (DOUS) that achieves the optimal throughput scaling in a single-input multiple-output interfering multiple-access channel, i.e., a multi-cell uplink network, with M antennas at each base station (BS) and N users in a cell. In a distributed fashion, each BS adopts M random receive beamforming vectors and then selects M users such that both sufficiently large desired signal power and sufficiently small generating interference are guaranteed. As a main result, it is proved that full multiuser diversity gain can be achieved in each cell when a sufficiently large number of users exist. Numerical evaluation confirms that in a practical setting of the multi-cell network, the proposed DOUS outperforms the existing distributed user scheduling algorithms in terms of sum-rate.

CMP: A Context Information-based Routing Scheme with Energy-based Message Prioritization for Delay Tolerant Networks

  • Cabacas, Regin;Ra, In-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.295-304
    • /
    • 2014
  • Communication infrastructure supports wide variety of mobile services such as photo and file sharing, location tracking, social network services and instant messaging. However, instances like power-loss and natural disasters disrupt these communication infrastructures unable to render support to these mobile services. Delay-tolerant networks (DTNs) offer a solution to these problems at hand. By utilizing mobility and opportunistic contacts among mobile devices, a plausible communication network can be establish and enable support to mobile applications. This paper presents an energy-efficient, reliable message delivery routing scheme with message prioritization rules for DTN. It uses the context information of nodes (mobile devices) such as the contact history (location and time of contact), speed/velocity, moving direction to determine the best forwarders among nodes in the network. The remaining energy of the nodes is also used to determine the message types a node can deliver successfully. The simulation results show that proposed approach outperforms Epidemic and Prophet routing schemes in terms of delivery ratio, overhead ratio, delivered messages per types and remaining energy.

An Inter-Session Opportunistic Network Coding-aware Multipath Routing Protocol (세션간 네트워크 코딩 기회를 인식하는 다중 경로 라우팅 프로토콜)

  • Choi, Tae-Jong;Kang, Kyung-Ran;Cho, Young-Jong;Bang, June-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.536-549
    • /
    • 2012
  • An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.

Markov Chain Analysis of Opportunistic Cognitive Radio with Imperfect Sensing (불완전 센싱 기회적 인지 전파망의 Markov Chain 분석)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.1-8
    • /
    • 2010
  • Wireless multimedia service through the access to mobile telephone network or data network is a vital part of contemporary life, and the demand for frequency spectrum for new services is expected to explode as the ubiquitous computing proliferate. Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, we investigate the effects of imperfect sensing, misdetection and false alarm, on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. We analyzed the effects of the parameters such as sensing error, offered load on the system performance.