• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1606-1609
• /
• 2002

MAC state models appeared with an effort to overcome technical demerits of CDMA in provisioning packet data service. In the scenario of sojourn and transition on MAC states, the design of state sojourn time is a critical issue for an efficient utilization of limited recource; a longer sojourn time leads to more resource being preserved for inactive stations, while more connection components should be recovered with a shorter sojourn time. Thus, the sojourn time at each MAC state must be optimized in consideration of these two conflicting arguments. In this paper, we first present a generic MAC state model. Secondly, based on the generic model, we reveal a relation of inactive period and the delay time of the last packet served in pre- ceding active period and specify a loss function reflect-ing two antinomic features that result from a change of state sojourn time. Using the proposed loss function, we construct a decision problem to find an optima3 rule for state sojourn times. Finally, we present a way of computing Bayes rule by use of the posterior distribution of inactivity duration for given observation on the delay time of last packet. Furthermore, Bayes rules are explicitly expressed for special arrival processes and investigated with respect to traffic load and loss parameters.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.619-621
• /
• 2001

현재 대부분의 액티브 네트워크에서 액티브 노드로 전송된 패킷은 프로그램 코드와 데이터를 동시에 가지고 있으며, 기존 네트웍 방식에서의 저장(store)-전송(forward) 형태와는 달리 저장(store)-연산(compute)-전송(forward) 방식으로 패킷 처리를 한다 이 과정에서 패킷에 악성 코드가 추가되거나 실제 데이터가 변경되는 경우에는 데이터의 무결성을 보장할 수 없다. 따라서 이 논문에서는 액티브 노드에 들어오는 패킷과 그 노드에서 처리가 이루어진 후 나가는 패킷을 비교하여 악의적이거나 악의 적이지는 않지만 실수로 인한 패킷의 오류를 방어함으로서 액티브 노드의 QoS를 향상시켜주는 방식을 제안한다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.2
• /
• pp.175-181
• /
• 2014

Location awareness is one of the key functions to build an U-city. Recently, many of works for the location-aware systems are emerging to be applied to on-going large-scale apartment complex. For example, when dwellers or cars with active tags are move in the apartment complex, the active tags broadcast their own identifiers periodically and receivers such that routers use this information to calculate the location of the active tags. Since the active tags can actually move between routers and coordinators, it requires a hand-off mechanism. In this paper, we investigate the hand-off problem occurred in location awareness system based on ZigBee active tags. We propose and analyze a new approach for handling the hand-off problem. Through a mathematical analysis, we show that our approach diminishes the quantity of packet transfer than ZigBee's approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1646-1652
• /
• 2010

The communication in wireless sensor network is divided into several layers, because of each of them do their role, the wireless communication is possible, the MAC (Medium Access Control) layer of the one of sensor network communications layer is used to the data errors, control flow, and manage resources. Using MAC Protocol, it ensures the communication between sensor node. In this paper, highlighted the energy efficiency of the S-MAC, T-MAC protocol it emphasized the efficiency of energy by lessening the woken time of all nods effectively, transmitting and receiving the control packet on only necessary nods through use of a method that RTS packet is added to SYNC packet and making other nods sleep. On sending SYNC+RTS packet and receiving the packet, nod noticed that it wasn't necessary to be awaked on this period, would be in Sleep mode, demonstrated mathematically that energy is more effective than existing protocol, and simulated with MATLAB.

• Convergence Security Journal
• /
• v.13 no.2
• /
• pp.155-163
• /
• 2013

Connection hijacking attack using the vulnerability of the TCP protocol to redirect TCP stream goes through your machine actively (Active Attack). The SKEY such as one-time password protection mechanisms that are provided by a ticket-based authentication system such as Kerberos or redirection, the attacker can bypass.Someone TCP connection if you have access on TCP packet sniffer or packet generator is very vulnerable. Sniffer to defend against attacks such as one-time passwords and token-based authentication and user identification scheme has been used. Active protection, but these methods does not sign or encrypt the data stream from sniffing passwords over insecure networks, they are still vulnerable from attacks. For many people, an active attack is very difficult and so I think the threat is low, but here to help break the illusion successful intrusion on the UNIX host, a very aggressive attack is presented. The tools available on the Internet that attempt to exploit this vulnerability, known as the recent theoretical measures is required. In this paper, we propose analysis techniques on a wireless network intruder detection.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1013-1016
• /
• 2000

기존의 end-to-end 방식에서는 네트워크 내부에서 혼잡(congestion)이 발생했을 경우 각 endpoint에서 즉시 알아 낼 수 없기 때문에 일정시간 동안 수신된 packet의 순서에 대한 정보로 혼잡이 발생했는지에 대해 추론하는 것이다. 따라서 네트워크 내부에서 직접적으로 정보를 얻거나 처리를 해 줄 수 있다면 기존 방식보다 처리율이 향상될 것이다. 본 논문에서는 Active Network 메커니즘을 이용하여 라우터를 구성하고 관련 모의실험결과를 보인다. 이를 통해서 기존의 방식보다 향상된 혼잡제어를 제시한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.53-58
• /
• 2012

With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.4
• /
• pp.491-497
• /
• 2015

In this paper a method of design and Implementation of RFID based control system for reducing standby power consumption at the power outlet is described. The system is composed of a RF controlled power outlet having relay and an active RFID tag communicating with the RF reader module controlling the relay. When the tag carried by human approaches to the RF reader the reader recognizes the tag and switch off the relay based on the RSSI level measurement. A low power packet prediction algorithm has been used to decrease the DC power consumption at both the tag and the RF reader. The result of experiment shows that successful operation of the relay control has been obtained while low power operation of the tag and the reader is achieved using above algorithm. Also setting the distance between the reader and the tag by controlling transmission power of the tag and adjusting the duty cycle of the packet waiting time when the reader is in idle state allows us to reduce DC power consumption at both the reader and the tag.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.528-535
• /
• 2012

This paper proposes silence drop first(SDF) active buffer management algorithm to increase the voice capacity when silence suppression is used. This algorithm finds and drops silence packet rather than voice packet in the queue for resolving buffer overflow of queue. Simulations with voice codec of G.729A and G.711 are performed. By using proposed SDF algorithm, the voice capacity is increased by 84.21% with G.729A and 38.46% with G.711. Further more, SDF algorithm reduces the required link capacity and loosens the silence packet inter-arrival time limit to provide target voice quality compared with that of conventional algorithms.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.