• Title/Summary/Keyword: BS 노드

Search Result 51, Processing Time 0.03 seconds

A Study on Application SCTP SNOOP for Improving a Data Transmission in Wireless Network (무선망에서 데이터 전송 향상을 위한 SCTP SNOOP 적용 연구)

  • Hwang, Eun-Ah;Seong, Bok-Sob;Kim, Jeong-Ho
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.126-129
    • /
    • 2007
  • Recently the use of wireless network increases according to it solves the hand-off and with path loss, pading, noise etc of wireless network the research for transmission error improvement is developed. TCP and SCTP of standard where it guarantees the reliability of wire network apply in wireless network the congestion control, flow control mechanism used it decreases the efficiency of data transfer throughputs. In this paper, It mixes SCTP and SNOOP for SCTP apply on wireless network, to improve BS(Basic Station) operation processes when the transmission error occurs in wireless network. BS send ZWP(Zero Window Probe) to MN(Mobile Node) when the transmission error occurs so, check path and status and update RWND and error status checked. It selects the new path, send ZWA(Zero Window Advertisement) to FH(Fixed Host) and the prevents call to congestion control or flow control and it does to make wait status standing. Continuously of data transfer after the connection of wireless network is stabilized, it make increase about 10% the transmission throughput of data.

  • PDF

A Late Binding Update Strategy for Reducing Session Handoff Blocking Probability in Vehicular Networks (차량 네트워크에서 세션 핸드오프 봉쇄 확률을 줄이기 위한 늦은 바인딩 업데이트 기법)

  • Kim, Younghyun;Pack, Sangheon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.699-701
    • /
    • 2010
  • 스마트폰, PDA와 같은 다양한 무선통신 단말들이 출현하면서 차량 내에서도 인터넷 서비스를 사용하려는 사용자들이 증가하고 있다. 이에 따라 이동중인 차량 내에서 인터넷 엑세스를 위해, 그리고 차량이 다른 서브넷 사이를 이동하더라도 시그널링 오버헤드가 크지 않게 하기 위해, network mobility basic support (NEMO BS) protocol이 제안되었다. 그러나 차량 내의 노드들에게 QoS를 지원하기 위해서 session admission 기법 등이 필요하다. 이 때, 차량 내에서 발생하는 세션은 new session과 handoff session으로 구분할 수 있는데, new session의 봉쇄보다 handoff session의 봉쇄가 서비스 만족도 측면에서 더 큰 임팩트를 가진다. 따라서 본 논문에서는 차량 외부에서 차량으로 이동한 노드들의 handoff session 봉쇄확률을 줄이기 위한 늦은 바인딩 업데이트 기법을 제안한다.

A Study on Heterogeneous Node communication for Wireless Sensor Networks (무선 센서 네트워크에서 이기종 단말간 통신기법 연구)

  • Park, Chan-Heum;Lee, Bok-Man;Kim, Chong-Gun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.958-961
    • /
    • 2008
  • 유비쿼터스 컴퓨팅 기술의 진보로 무선 센서 네트워크의 관심이 높아지고 있다. 센서 네트워크는 MAC 프로토콜에서 정해진 전송 스케줄에 따라 주기적인 수면(sleep)을 통해 에너지를 절약하는 연구가 진행되어 왔다. 그리고 센서 노드가 센싱한 데이터를 BS(Base Station)로 전달하기 위한 라우팅 경로 기법과 클러스터링 기법 등이 제시되고 있다. 센서 네트워크에서 가장 중요한 이슈중의 하나는 제한된 자원 즉, 센서 노드에 주어진 에너지를 활용하여 네트워크의 수명을 최대로 연장 하는 것이다. 본 논문에서는 S-MAC 프로토콜의 스케줄관리 기법을 이용하여 무선 센서 네트워크에서 서로 다른 그룹 간의 통신을 원활하게 하기 위한 통신기법을 제시한다.

An Energy Efficient Cluster Formation Algorithm for Wireless Sensor Networks (무선 센서 네트워크를 위한 에너지 효율적인 클러스터 구성 알고리즘)

  • Han, Uk-Pyo;Lee, Hee-Choon;Chung, Young-Jun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.185-190
    • /
    • 2007
  • The efficient node energy utilization is one of important performance factors in wireless sensor networks because sensor nodes operate with limited battery power. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing each energy consumption of the sensor node in the network. In this paper, we proposed a cluster formation algorithm to extend the lifetime of the networks and to maintain a balanced energy consumption of nodes. To obtain it, we add a tiny slot in a round frame, which enables to exchange the residual energy messages between the base station (BS). cluster heads, and nodes. The performance of the proposed protocol has been examined and evaluated with the NS 2 simulator. As a result of simulation, we have confirmed that our proposed algorithm show the better performance in terms of lifetime than LEACH. Consequently, our proposed protocol can effectively extend the network lifetime without other critical overhead and performance degradation.

A Periodical Key Refreshment Scheme for Compromise-prone Sensor Nodes (오염에 취약한 센서노드들을 위한 주기적인 키갱신 방안)

  • Wang, Gi-Cheol;Kim, Ki-Young;Park, Won-Ju;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.11
    • /
    • pp.67-77
    • /
    • 2007
  • In sensor networks, it is very important to refresh communication keys of sensors in a periodic or on-demand manner. To perform a dynamic key management efficiently, sensor networks usually employ cluster architecture and each CH (Cluster Head) is responsible for key management within its cluster. In cluster-based sensor networks, CHs are likely to be targets of capture attacks, and capture of CHs threatens the survival of network significantly. In this paper, we propose a periodical key refreshment scheme which counteracts against capture of CHs. First, the proposed scheme reduces the threat caused by compromise of CHs by forcing each CH to manage a small number of sensors and changing CH role nodes periodically. Second, the proposed scheme flings attackers into confusion by involving other nodes in a key establishment between BS (Base Station) and a CH. Our numerical analyses showed that the proposed scheme is more secure than other schemes and robust against compromise of CHs.

Interleaved Hop-by-Hop Authentication in Wireless Sensor Network Using Fuzzy Logic to Defend against Denial of Service Attack (인터리브드 멀티홉 인증을 적용한 무선 센서네트워크에서 퍼지로직을 이용한 서비스 거부 공격에 대한 방어 기법)

  • Kim, Jong-Hyun;Cho, Tac-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.133-138
    • /
    • 2009
  • When sensor networks are deployed in open environments, an adversary may compromise some sensor nodes and use them to inject false sensing reports. False report attack can lead to not only false alarms but also the depletion of limited energy resources in battery powered networks. The Interleaved hop-by-hop authentication (IHA) scheme detects such false reports through interleaved authentication. In IHA, when a report is forwarded to the base station, all nodes on the path must spend energies on receiving, authenticating, and transmitting it. An dversary can spend energies in nodes by using the methods as a relaying attack which uses macro. The Adversary aim to drain the finite amount of energies in sensor nodes without sending false reports to BS, the result paralyzing sensor network. In this paper, we propose a countermeasure using fuzzy logic from the Denial of Service(DoS) attack and show an efficiency of energy through the simulataion result.

i-LEACH : Head-node Constrained Clustering Algorithm for Randomly-Deployed WSN (i-LEACH : 랜덤배치 고정형 WSN에서 헤더수 고정 클러스터링 알고리즘)

  • Kim, Chang-Joon;Lee, Doo-Wan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.1
    • /
    • pp.198-204
    • /
    • 2012
  • Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

Proactive Code Verification Protocol Using Empty Memory Deletion in Wireless Sensor Network (무선 센서 네트워크에서의 메모리 공간 삭제를 이용한 선행 코드-검증 기법)

  • Choi, Young-Geun;Kang, Jeon-Il;Lee, Kyung-Hee;Nyang, Dae-Hun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.4
    • /
    • pp.37-46
    • /
    • 2007
  • The authentication in WSN(Wireless Sensor Network) usually means the entity authentication, but owing to the data centric nature of sensor network, much more importance must be put on the authentication(or attestation) for code of sensor nodes. The naive approach to the attestation is for the verifier to compare the previously known memory contents of the target node with the actual memory contents in the target node, but it has a significant drawback. In this paper, we show what the drawback is and propose a countermeasure. This scheme can verify the whole memory space of the target node and provides extremely low probability of malicious code's concealment without depending on accurate timing information unlike SWATT. We provide two modes of this verification method: BS-to-node and node-to-node. The performance estimation in various environments is shown.

TPC-BS: Transmission Power Control based on Binary Search in the Wireless Sensor Networks (TPC-BS: 센서 네트워크에서 이진검색 방법을 이용한 빠른 전송전력 결정 방법)

  • Oh, Seung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1420-1430
    • /
    • 2011
  • This paper proposes a new method to optimize energy consumption in a wireless modem by setting up a transmission power value according to the distance between nodes and circumstance in the MAC layer of IEEE 802.15.4. The proposed method can dynamically find an optimal transmission power range using the binary search scheme and minimize overhead caused by multiple message transmissions when determining the optimal transmission power. The determined transmission power is used for transmitting data packets and can be modified dynamically depending on the changes in a network environment when exchanging data packets and acknowledgement signals. The results of the simulations show 30% reduction in energy consumption while 2.5 times increase in data transmission rate per unit of energy comparing with IEEE 802.15.4 standard.

Security Scheme for Prevent malicious Nodes in WiMAX Environment (WiMAX 환경에서 악의적 노드 예방을 위한 보안 기법)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol;Lee, Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.382-389
    • /
    • 2009
  • As the use of mobile device is popularized, the needs of variable services of WiMAX technique and the importance of security is increasing. There is a problem that can be easily attacked from a malicious attack because the action is achieved connectionlessly between neighbor link establishing procedure and TEK exchange procedure in mobile WiMAX even though typical 1 hop network security technique is adapted to WiMAX for satisfying these security requirement. In this paper, security connected mechanism which safely connects neighbor link establishing procedure of WiMAX and TEK exchange procedure additional to the basic function provided by IEEE 802.16e standard to satisfy security requirement of mobile WiMAX is proposed. The proposed mechanism strengthens the function of security about SS and BS by application random number and private value which generated by SS and BS to public key of neighbor link establishing procedure and TEK exchange procedure. Also, we can prevent from inside attack like man-in-the-middle which can occur in the request of TEK through cryptographic connection of neighbor link establishing procedure and TEK exchange procedure.