• 한국인터넷방송통신학회논문지
• /
• 제11권4호
• /
• pp.39-45
• /
• 2011

본 논문에서는 무선 인지 애드 혹 네트워크에서 다중 채널 숨겨진 지국 문제(hidden terminal problem)를 해결하고 네트워크 성능을 향상시키기 위하여, 이웃 휴지 노드(idle node)들을 활용하는 효율적인 다중 채널 MAC 프로토콜을 제안한다. 제안된 알고리즘은 각 노드가 단일 송수신기를 갖고, 제어 메시지 교환을 위한 공동 제어 채널을 활용하는 무선 인지 애드 혹 네트워크에 활용될 수 있다. 특히, 제안된 알고리즘에서는 데이터를 교환하고자 하는 통신 노드들이 한 홉(hop) 밖에서 사용되고 있는 데이터 채널에 대한 정보를 가지고 있는 이웃 휴지 노드들을 활용하여 데이터 채널을 선택함으로써 다중 채널 숨겨진 지국 문제를 효율적으로 해결할 수 있다. 시뮬레이션을 통해, 제안된 알고리즘이 중 채널 숨겨진 지국 문제를 최소화하고 2차 사용자간의 데이터 채널 선택시 발생하는 출돌(collision)을 줄임으로써 네트워크의 처리율을 증가시킬 수 있음을 보였다.

• Journal of Communications and Networks
• /
• 제12권3호
• /
• pp.231-239
• /
• 2010

In cluster-based wireless sensor networks, the energy could be saved when the nodes that have data to transmit participate in cooperative multiple-input multiple-output (MIMO). In this paper, by making the idle nodes that have no data to transmit participate in the cooperative MIMO, it is found that much more energy could be saved. The number of the idle nodes that participate in the cooperative MIMO is optimized to minimize the total energy consumption. It is also found that the optimal number of all the nodes participating in cooperative communication does not vary with the number of nodes that have data to transmit. The proposition is proved mathematically. The influence of long-haul distance and modulation constellation size on the total energy consumption is investigated. A cooperative MIMO scheme with help-node participation is proposed and the simulation results show that the proposed scheme achieves significant energy saving.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.299-310
• /
• 2016

In practical wireless relay communication systems, non-destination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

• 전기학회논문지P
• /
• 제63권1호
• /
• pp.34-39
• /
• 2014

In cognitive radios, secondary users can use the spectrum exclusively allocated to a primary wireless system if the secondary users detect the spectrum in idle states. Because the secondary users can utilize the idle state of the spectrum, the utilization rate of the spectrum can be improved. The idle states can be detected by using secondary users' sensing schemes. However, the wireless channel environment where secondary users perform the spectrum sensing is not very friendly to secondary users because the signal-to-noise ratio of the received primary signal is very low. Hence, cooperative sensing scheme where more than one secondary user take part in the spectrum sensing is generally used in cognitive radios. In this paper, we investigate the cooperative sensing performance for machine-to-machine communication devices operated by batteries with limited energy. In general, the energy consumed for the spectrum sensing increases as the length of the sensing period and the number of cooperative sensing nodes. Accordingly, even though the total amount of the consumed energy is the same, an energy allocation methodology how to distribute the energy to the sensing period and sensing nodes can achieve the optimum sensing performance, which is numerically analyzed.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권5호
• /
• pp.298-305
• /
• 2014

In this study, a novel Randomly Shifted Certification Authority Authentication protocol was used in ad hoc networks to provide authentication by considering the MAC layer characteristics. The nodes achieve authentication through the use of public key certificates issued by a CA, which assures the certificate's ownership. As a part of providing key management, the active CA node transfers the image of the stored public keys to other idle CA nodes. Finally the current active CA randomly selects the ID of the available idle CA and shifts the CA ownership by transferring it. Revoking is done if any counterfeit or duplicate non CA node ID is found. Authentication and integrity is provided by preventing MAC control packets, and Enhanced Hash Message Authentication Code (EHMAC) can be used. Here EHMAC with various outputs is introduced in all control packets. When a node transmits a packet to a node with EHMAC, verification is conducted and the node replies with the transmitter address and EHMAC in the acknowledgement.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.681-685
• /
• 2004

Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.61-62
• /
• 2006

In this paper, using Bianchi's model with channel idle probability we analyze performance of power management scheme of IEEE 802.11 DCF according to ATIM window size and number of nodes for wireless ad hoc networks. The analytical results show that, when the number of nodes is given, the selected ATIM window size limits the performance.

• 한국정보과학회논문지:정보통신
• /
• 제31권5호
• /
• pp.482-489
• /
• 2004

Mobile IP에서 이동노드의 불필요한 위치 등록으로 인하여 발생되는 네트워크 시그널링 오버헤드를 줄이고자 IETF에서는 IP 페이징 기법을 제안하였다. IP 페이징 기법을 지원하기 위하여 이동노드는 active on, active off, idle 중 한가지 상태를 유지하여야 한다. Active on 상태는 이동노드에 데이터 세션이 형성되어 데이타를 수신하거나 또는 송신하는 상태를 말한다. 이때 이동노드가 데이타의 송수신을 완료하고 나면 이동노드는 active off 상태로 바뀌게 되며 active timer를 구동한다. 그 후 일정시간 동안 이동노드가 데이타를 송수신하지 않고 페이징 영역 간 이동이 발생하지 않으면 active timer가 만료된다. 이때 이동노드의 상태는 idle 상태로 바뀌게 된다 기존의 IP 페이징 기법에서는 고정된 active timer 값을 사용하고 있으나 본 논문에서는 이동노드의 이동성 및 트래픽 특성에 따라 active timer 값을 동적으로 설정하여 불필요한 위치갱신 작업을 줄일 수 있는 IP 페이징 기법을 제안한다. 또한 본 논문의 제안기법과 기존의 IP 페이징 기법간의 위치 갱신 및 페이징 비용에 대한 수학적 모델을 수립하고 성능평가를 수행한다. 이를 이용하여 성능 분석을 수행한 결과 기존 기법에 비하여 제안 기법이 보다 효율적임을 보여주고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2433-2452
• /
• 2017

Recently, the pipeline-forwarding has been proposed as a new technique to resolve the end-to-end latency problem of the duty-cycle MAC protocols in Wireless Sensor Networks (WSNs). Some protocols based on this technique such as PMAC and PRI-MAC have shown an improvement not only in terms of reducing end-to-end latency but also in terms of reducing power consumption. In these protocols, however, the sensor nodes still waste a significant amount of energy for unnecessary idle listening during contention period of upstream nodes to check the channel activity. This paper proposes a new pipeline-forwarding duty-cycle MAC protocol, named RP-MAC (Reduced Pipelined duty-cycle MAC), which tries to reduce the waste of energy. By taking advantage of ACK mechanism and shortening the handshaking procedure, RP-MAC minimizes the time for checking the channel and therefore reduces the energy consumption due to unnecessary idle listening. When comparing RP-MAC with the existing solution PRI-MAC and RMAC, our QualNet-based simulation results show a significant improvement in term of energy consumption.

• 한국군사과학기술학회지
• /
• 제24권1호
• /
• pp.115-122
• /
• 2021

In this paper, we propose a dynamic slot allocation scheme to improve the slot utilization rate in tactical multi-hop networks in which the channel condition varies due to node movements. The proposed scheme takes advantage of the fact that nodes that are more than three hops apart can use the same slot simultaneously. The frame is divided into two parts: the control period and the data period. To know the available slot information within two-hop distance, the node exchanges a slot allocation information with one-hop neighbors during the control period. The node can get the information on idle slots that are not used within two-hop distance but assigned already to other nodes that are more than three-hop away. The identified idle slot can be used by the node, which increases the slot utilization rate. The performance analysis results of the proposed scheme show that it increases the slot utilization rate sufficiently despite the overhead of the control period in the multi-hop networks of the future soldier system.