• Title/Summary/Keyword: Data forwarding method

Search Result 60, Processing Time 0.029 seconds

A Delay Efficient and Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 지연과 버스티 트래픽에 적합한 MAC 프로토콜)

  • Kim, Hye Yun;Kim, Seong Cheol
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.254-260
    • /
    • 2017
  • Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

An Adaptive Threshold Determining Method in Senor Networks using Fuzzy Logic (통계적 여과기법에서 퍼지 규칙을 이용한 적응적 보안 경계 값 결정 방법)

  • Sun, Chung-Il;Cho, Tae-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.177-180
    • /
    • 2008
  • There are many application areas of sensor networks, such as surveillance, hospital monitoring, and home network. These are dependent on the secure operation of networks, and will have serious outcome if the networks is injured. An adversary can inject false data into the network through the compromising node. Ye et al. proposed a statistical en-route filtering scheme (SEF) to detect such false data during forwarding process. In this scheme, it is important that the choice of the threshold value since it trades off security and overhead. This paper presents an adaptive threshold value determining method in the SEF using fuzzy logic. The fuzzy logic determines a security distance value by considering the situation of the network. The Sensor network is divided into several areas by the security distance value, it can each area to uses the different threshold value. The fuzzy based threshold value can reduce the energy consumption in transmitting.

  • PDF

Transmission Delay Estimation-based Forwarding Strategy for Load Distribution in Software-Defined Network (SDN 환경에서 효율적 Flow 전송을 위한 전송 지연 평가 기반 부하 분산 기법 연구)

  • Kim, Do Hyeon;Hong, Choong Seon
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.5
    • /
    • pp.310-315
    • /
    • 2017
  • In a centralized control structure, the software defined network controller manages all openflow enabled switched in a data plane and controls the telecommunication between all hosts. In addition, the network manager can easily deploy the network function to the application layer with a software defined network controller. For this reason, many methods for network management using a software defined network concept have been proposed. The main policies for network management are related to traffic Quality of Service and resource management. In order to provide Quality of Service and load distribution for network users, we propose an efficient routing method using a naive bayesian algorithm and transmission delay estimation module. In this method, the forwarding path is decided by flow class and estimated transmission delay result in the software defined network controller. With this method, the load on the network node can be distributed to improve overall network performance. The network user also gets better dynamic Quality of Service.

Development of Link Cost Function using Neural Network Concept in Sensor Network

  • Lim, Yu-Jin;Kang, Sang-Gil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.141-156
    • /
    • 2011
  • In this paper we develop a link cost function for data delivery in sensor network. Usually most conventional methods determine the optimal coefficients in the cost function without considering the surrounding environment of the node such as the wireless propagation environment or the topological environment. Due to this reason, there are limitations to improve the quality of data delivery such as data delivery ratio and delay of data delivery. To solve this problem, we derive a new cost function using the concept of Partially Connected Neural Network (PCNN) which is modeled according to the input types whether inputs are correlated or uncorrelated. The correlated inputs are connected to the hidden layer of the PCNN in a coupled fashion but the uncoupled inputs are in an uncoupled fashion. We also propose the training technique for finding an optimal weight vector in the link cost function. The link cost function is trained to the direction that the packet transmission success ratio of each node maximizes. In the experimental section, we show that our method outperforms other conventional methods in terms of the quality of data delivery and the energy efficiency.

A Study of Path Management to Efficient Traceback Technique for MANET (MANET에서 효율적 역추적을 위한 경로관리에 관한 연구)

  • Yang, Hwan Seok;Yang, Jeong Mo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.31-37
    • /
    • 2011
  • Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.

Cluster Group Multicast by Weighted Clustering Algorithm in Mobile Ad-hoc Networks (이동 에드-혹 네트워크에서 조합 가중치 클러스터링 알고리즘에 의한 클러스터 그룹 멀티캐스트)

  • 박양재;이정현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.37-45
    • /
    • 2004
  • In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

Energy-Efficient Face Routing Protocol Considering Radio Range in Wireless Sensor Networks (무선 센서 네트워크에서 무선 반경을 고려한 에너지 효율적인 페이스 라우팅 프로토콜)

  • Cho, Hyunchong;Kim, Sangdae;Kim, Cheonyong;Kim, Sang-Ha;Hwang, Chi-Jung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.1058-1069
    • /
    • 2015
  • In wireless sensor networks, geographic routing is known as an efficient method to transmit the data packet using the location information. Geographic routing relies on two techniques: greedy forwarding and face routing. Face routing helps to recover from greedy routing fail and is based on the planar graph in which does not cross each edge. However, the planarization causes frequently short transmission of data packet because it removes other edges except the shortest one. In other words, since the planarization removes the long edges, face routing could not exploit the efficient removed edges of communication graph. This problem brings about the excessive energy consumption of nodes. In this paper, we propose an energy efficient face routing protocol in wireless sensor networks. This proposed protocol searches the removed edges and transmits them via the edges. Simulation shows that the proposed protocol is more efficient in terms of energy consumption than the previous face routing.

Cooperative Multipath Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 협력 다중경로 라우팅 프로토콜)

  • Jung, Kwansoo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.5
    • /
    • pp.419-428
    • /
    • 2015
  • Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient cooperative multipath routing protocol with a small number of paths based on an inter path communication. The inter path communication (namely, cooperative multipath routing) in the proposed protocol helps to reinforce the multipath reliability and reduce the use of network resources. In addition, the proposed protocol provides a reliable end-to-end transmission time by using a transmission recovery method based on the local decision for the path or transmission failures.

A study on the Throughput Guarantee with TCP Traffic Control (전송률 보장을 위한 TCP 트래픽 제어에 관한 연구)

  • Lee, Myun-Sub
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.3
    • /
    • pp.303-308
    • /
    • 2016
  • Recently, as the rapid development of network technology and the increase of services required high bandwidth such as multimedia service, the network traffic dramatically increases. This massive increase of network traffic causes some problems such as the degradation of QoS and the lack of network resources and, to solve these problems, various research to guarantee QoS have been performing. Currently, The most representative method to guarantee the QoS is the DiffServ(: Differentiated Service). The DiffServ defines the AF(: Assured Forwarding) PHB(: Per Hop Behavior) and statistically ensures the throughput over the certain level of data rate. However, the TCP congestion control method that make up the majority of the Internet traffic is not fundamentally suitable to the DiffServ that guarantees the throughput without managing the individual flow. Therefore, in this paper, we present this mismatch through the simulation as an example and propose the solution by controlling the TCP of the terminal in the network. The proposed scheme utilizes the information of the reception window size included in the ACK frame and does not require any modification of the TCP algorithms currently in use.

A D2D communication architecture under full control using SDN

  • Ngo, Thanh-Hai;Kim, Younghan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3435-3454
    • /
    • 2016
  • Device-to-device (D2D) communication is a potential solution to the incessant increase in data traffic on cellular networks. The greatest problem is how to control the interference between D2D users and cellular mobile users, and between D2D users themselves. This paper proposes a solution for this issue by putting the full control privilege in cellular network using the software-defined networking (SDN) concept. A software virtual switch called Open vSwitch and several components are integrated into mobile devices for data forwarding and radio resource mapping, whereas the control functions are executed in the cellular network via a SDN controller. This allows the network to assign radio resources for D2D communication directly, thus reducing interference. This solution also brings out many benefits, including resource efficiency, energy saving, topology flexibility, etc. The advantages and disadvantages of this architecture are analyzed by both a mathematical method and a simple implementation. The result shows that implementation of this solution in the next generation of cellular networks is feasible.