• 한국콘텐츠학회논문지
• /
• 제5권4호
• /
• pp.245-253
• /
• 2005

멀티미디어 Ad Hoc 무선망은 매우 매력적인 화두이며 이를 통하여 멀티미디어 서비스를 고정된 기간망이 없이도 이동중인 최종 사용자들에게 제공할 수 있다. 그러나 특수한 설계상의 제약점으로 인하여 Ad Hoc 무선망에서 자원을 공정하게 분배하면서도 지연시간을 보장하는 것은 단순한 문제가 아니다. 본 논문에서는 분산적인 방법으로 지연시간 보장 공정 큐잉(DGFQ, Delay Guaranteed Fair Queueing) 방식을 멀티미디어 Ad Hoc 무선망에서 구현하고 성능 평가의 결과를 통하여 DGFQ 방식이 멀티미디어 무선망 환경에서도 제한된 지연시간을 보장할 수 있음을 보였다.

• 한국정보통신학회논문지
• /
• 제9권3호
• /
• pp.534-539
• /
• 2005

많은 수의 노드들로 구성되어 있는 센서 네트워크에서 가장 우선적으로 고려되어야 할 사항은 에너지 효율성(energy-efficiency)이다. 현재 센서 네트워크의 수명을 연장시키고, 트래픽을 줄이기 위해서 데이터 중심의 라우팅 프로토콜들이 제안되고 있다. 본 논문에서는 기존의 무선 애드 혹(ad hoc) 네트워크에서 연구되어진 많은 라우팅 알고리즘들이 센서 네트워크에 적용되었을 때 발생하는 문제점에 대해 살펴보고, 네트워크에서 전달되어지는 메시지의 수를 줄임과 동시에 노드가 소모하는 에너지 량을 최소화하는데 역점을 둔다. 본 논문은 네트워크 내에 플러딩 수행 시, 많은 오버헤드가 발생하는 것을 해결하기 위해 다중경로 플러딩(Restricted Multi-path flooding) 기법을 제안한다. 다중경로 플러딩 기법은 기존의 라우팅 기법과 달리 노드의 제한된 에너지를 효율적으로 활용하며, 여러 경로를 통해 수신된 정보를 이용하여 최적의 경로를 선택한 후 원격지 노드와 정보를 교환할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2732-2753
• /
• 2019

With the application of wireless sensor networks in the fields of ecological observation, defense military, architecture and urban management etc., the security problem is becoming more and more serious. Characteristics and constraint conditions of wireless sensor networks such as computing power, storage space and battery have brought huge challenges to protection research. Inspired by the danger theory in biological immune system, this paper proposes an intrusion detection model for wireless sensor networks. The model abstracts expressions of antigens and antibodies in wireless sensor networks, defines meanings and functions of danger signals and danger areas, and expounds the process of intrusion detection based on the danger theory. The model realizes the distributed deployment, and there is no need to arrange an instance at each sensor node. In addition, sensor nodes trigger danger signals according to their own environmental information, and do not need to communicate with other nodes, which saves resources. When danger is perceived, the model acquires the global knowledge through node cooperation, and can perform more accurate real-time intrusion detection. In this paper, the performance of the model is analyzed including complexity and efficiency, and experimental results show that the model has good detection performance and reduces energy consumption.

• Journal of Communications and Networks
• /
• 제14권2호
• /
• pp.169-178
• /
• 2012

In this paper, we study the advantages of using range extension cooperative transmission (CT) in multi-hop energy harvesting wireless sensor networks (EH-WSNs) from the network layer perspective. EH-WSNs rely on harvested energy, and therefore, if a required service is energy-intensive, the network may not be able to support the service successfully. We show that CT networks that utilize both range extension CT and non-CT routing can successfully support services that cannot be supported by non-CT networks. For a two-hop toy network, we show that range extension CT can provide better services than non-CT. Then, we provide a method of determining the supportable services that can be achieved by using optimal non-CT and CT routing protocols for EH-WSNs. Using our method and network simulations, we justify our claim that CT networks can provide better services than nonCT networks in EH-WSNs.

• 한국컴퓨터정보학회논문지
• /
• 제22권2호
• /
• pp.37-44
• /
• 2017

Wireless sensor networks are composed of many wireless sensor nodes that are sensing the environments. These networks have many constraints that are resource constraints, wireless communication, self-construction, etc. But they have many applications that are monitoring environment, tracking the object, etc. In this paper, a mechanism of finding QoS Satisfied multi-path is proposed in wireless sensor networks. In order to satisfy the QoS requirement, the proposed mechanism extends the AODV protocol to find multiple paths from a source node to a destination node by using the additional AODV message types that are proposed. This mechanism will be used to support many QoS applications such as minimum delay time, the better reliability and the better throughput by using the QoS satisfied multi-path. Overheads of the proposed mechanism are evaluated using simulation, and it is showed that QoS satisfied multiple paths are found with a little more overhead than the AODV mechanism.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.209-211
• /
• 2005

This paper proposes a adaptive medium-access control(MAC) protocol designed for low-power wireless multi-hop sensor networks which is used for connecting physical world and cyber computing space. Wireless multi-hop sensor networks use battery-operated computing and sensing device. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining inactive for long time, but becoming suddenly active when specific event is detected. These characteristics of multi-hop sensor networks and applications motivate a MAC that is different from traditional wireless MACs about power conservation scheme, such as IEEE 802.11. Proposed MAC uses a few techniques to reduce energy consumption. Result show that proposed MAC obtains more energy savings.

• 한국시뮬레이션학회논문지
• /
• 제14권4호
• /
• pp.95-106
• /
• 2005

Recent advances in wireless sensor networks have led to many routing protocols designed for energy-efficiency in wireless sensor networks. Despite that many routing protocols have been proposed in wireless sensor networks, a single routing protocol cannot be energy-efficient if the environment of the sensor network varies. This paper presents a fuzzy logic based Adaptive Routing (FAR) algorithm that provides energy-efficiency by dynamically changing protocols installed at the sensor nodes. The algorithm changes protocols based on the output of the fuzzy logic which is the fitness level of the protocols for the environment. A simulation is performed to show the usefulness of the proposed algorithm.

• 산업기술연구
• /
• 제26권A호
• /
• pp.147-152
• /
• 2006

Wireless Sensor Networks provide a new paradigm for sensing and disseminating information from various environments, with the potential to serve many and diverse applications. Recent advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas. For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field. In order to evaluate the application of field monitoring system, lab tests, field test and FEM analysis are conducted. Therefore the accuracy of RFID wireless sensor data is verified.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.433-435
• /
• 2007

Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.