• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.340-342
• /
• 2005

최근 기지국(Base Station)의 도움 없이 이동 단말기(Mobile Device) 간의 다중 무선 홉을 사용하여 송수신자 간의 데이터 전송을 가능하게 하는 Ad-hoc 통신망에 관한 연구가 활발히 진행되고 있다. Ad-hoc 통신망을 구성하는 이동 단말은 이동성을 고려하여 한정된 배터리로 동작을 하게 된다. Ad-hoc 통신망에서 이동 단말은 종단(End Host)으로만 동작하는 것이 아닌 중계 노드(Intermediate Node)로도 동작을 하기 때문에 통신상에 경로를 제공하는 중요한 역할도 한다. 하지만, 현재 인터넷 상에서 광범위하게 사용되고 있는 전송 규약인 TCP(Transmission Control Protocol)는 수동적인(Reactive)혼잡 제어(Congestion Control)방식으로 망의 혼잡으로 인한 패킷 손실 발생 이전까지 전송 윈도우의 크기를 증가 때문에 반복적인 혼잡과 그로 인한 패킷 손실로 인해 불필요한 재전송을 반복하게 된다. 이와 같이 기존 TCP는 무선 통신망에서 동작하는 이동 단말의 한정된 배터리 전원을 고려하지 않고 동작하기 때문에 이동 단말의 에너지를 불필요하게 낭비하는 문제를 가지게 된다. 본 논문은 Ad-hoc 망에서 이동 단말의 에너지 효율을 개선하기 위해 불필요한 재전송 방지 및 망 상태에 따라 전송률을 적절하게 조절하는 TCP의 새로운 혼잡 제어 기법을 제시하였다. 또한 ns-2 시뮬레이터를 이용한 실험을 통해 이동 단말의 에너지 효율이 제안된 혼잡 제어 기법에 의해 향상되었음을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.22-30
• /
• 2006

In this paper, the goal of our proposed algorithm is to reduce link -failure and route failure caused by dead nodes which consume all of the battery life. I propose an algorithm which provides a ability of changing mutes to neighbor nodes before some of intermediate nodes be shutting don to get the stable route maintenance. To achieve this goal, The proposed routing algerian uses additional new messages to check energy status for monitoring energy of neighbor nodes and to change the path to a neighbor node. From extensive simulations, results show that possibility of cut-offs and time-delay cause of packet-loss have been decreased and also the improvement of transmission effectiveness.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.87-94
• /
• 2008

In this paper, we propose a new vision-based fire detection method for a real-life application. Most previous vision-based methods using color information and temporal variation of pixel produce frequent false alarms because they used a lot of heuristic features. Furthermore there is also computation delay for accurate fire detection. To overcome these problems, we first detected candidated fire regions by using background modeling and color model of fire. Then we made probabilistic models of fire by using a fact that fire pixel values of consecutive frames are changed constantly and applied them to a Bayesian Network. In this paper we used two level Bayesian network, which contains the intermediate nodes and uses four skewnesses for evidence at each node. Skewness of R normalized with intensity and skewnesses of three high frequency components obtained through wavelet transform. The proposed system has been successfully applied to many fire detection tasks in real world environment and distinguishes fire from moving objects having fire color.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2013

Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.797-804
• /
• 2011

Network coding has recently emerged as an effective solution for multicast and broadcast communications in wireless ad hoc networks. In this paper, we propose a throughput performance model for IEEE 802.11 wireless networks with network coding. Specifically, we consider IEEE 802.11 DCF protocol and linear topology in which traffic sources are located at both ends and intermediate nodes act as relays performing network coding. The proposed analytic model has the form of nonlinear equations in terms of throughput of each node. The solution of the nonliear equations thus correspond to the end-to-end throughput. Extensive simulation experiments have been performed to validate accuracy of the proposed model. Numerical results show that the results of the proposed analytic model agree fairly well with the corresponding simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.455-462
• /
• 2009

In this paper, we propose a buffer management scheme for decreasing the packet loss due to buffer overflow and improving the packet fairness between nodes in IEEE 802.11 based multi-hop mesh networks. In the proposed scheme, each mesh router that is an intermediate node receives fairly packet sent from neighboring mesh routers and mobile nodes, and it improves the reception ratio of multi-hop traffic of neighboring mesh routers. Therefore, the proposed scheme can reduce transmission delay and energy consumption. In order to improving the packet loss and the packet fairness, the proposed scheme uses the modified RTS/CTS under the IEEE 802.11 MAC protocol and reduces the packet loss by recognizing the packet size to send to the destination in advance. By using the simulation, we evaluated the proposed scheme in terms of the packet loss ratio and the number of received packet in each mesh router, and compare it to a traditional scheme.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.15-23
• /
• 2002

We present a new MDA-based Mobile-IPv6 multicast routing algorithm for wirelese service operators to offer Mobile-IP over IMT-2000 service under IMT-2000 network by taking advantage of the existing infrastructure for IMT-2000 multimedia application services. The extended IMT-2000 system architectures use an PDSNs (i.e. IWFs), and the home network (i.e. Internet) backbone and intermediate network are composed of ATM entities. A key feature of the new protocol is the use of MDA(Multicast Delivery Agent) to reduce delivery path length of the multicast datagram. We show that proposed protocol is efficient in terms of various performance measures such as multicast traffic load, multicast related handoff, and average routing length when we implement it using the Mobile-IPv6. Particularly, the number of tunneling and average routing length of datagram are reduced relatively, the multicast traffic load is also decreased.