• Title/Summary/Keyword: Data Dissemination Protocol

Search Result 64, Processing Time 0.025 seconds

On Data Dissemination Protocol Considering Between Energy and Distance in Wireless Sensor Networks (무선 센서 네트워크에서 잔여 에너지와 전송거리의 조율을 통한 데이터 전송 프로토콜)

  • Seo, Jae-Wan;Kim, Moon-Seong;Cho, Sang-Hun;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.131-140
    • /
    • 2008
  • In this paper, we present a data dissemination protocol that guarantees energy-efficient data transmission and maximizes network lifetime. SPMS that outperforms the well-known protocol SPIN uses the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path, maximizing the network lifetime is impossible. In this paper, we propose a protocol for data dissemination called the protocol Considering Between Energy and Distance (ConBED). It solves the network lifetime problem using the residual energy and the distance between nodes to determine a path for data dissemination. The simulation results show that ConBED guarantees energy-efficient transmission and increases the network lifetime by approximately 69% than that of SPMS.

  • PDF

A Robust Energy Saving Data Dissemination Protocol for IoT-WSNs

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5744-5764
    • /
    • 2018
  • In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.165-174
    • /
    • 2006
  • Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

A Hierarchical Data Dissemination Protocol in Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크에서 계층적 데이터 전달 프로토콜)

  • Chu, Seong-Eun;Kang, Dae-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1505-1510
    • /
    • 2008
  • In large-scale wireless sensor networks, the deployed nodes cannot be replaced or recharged after first deployment. Also, dead nodes maγ lead to the partition of whole networks. While performing data dissemination under a battery power constraint, energy efficiency is a key design factor of routing protocol. As a solution for the efficient data dissemination, in this paper, we propose a protocol namely Hierarchical Data Dissemination (HDD) which provides scalable and efficient data delivery to multiple sources and mobile sinks. HDD uses the facts that sink nodes are central gathering Points and source-centric data forwarding paths are constructed and it is maintained with two-tier communications. The performance of HDD is compared with TTDD about the energy consumption, data delivery time and data success ration. The extensive simulation results show that HDD Routing Protocol outperforms TIDD by more than $1.5{\sim}3times$ on energy consumption.

Location Service and Data Dissemination Protocol for Mobile Sink Groups in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크 그룹을 위한 위치 서비스와 데이터 전송 프로토콜)

  • Yoon, Min;Lee, Euisin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1431-1439
    • /
    • 2016
  • In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

A Proactive Dissemination Protocol using Residual Energy and Signal Strength for WSNs (무선 센서 네트워크에서 에너지 잔량과 신호세기를 이용한 데이터 전송 프로토콜)

  • Park, Soo-Yeon;Kim, Moon-Seong;Jeong, Eui-Hoon;Bang, Young-Cheo
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.33-39
    • /
    • 2010
  • In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.

A Probability-based Clustering Protocol for Data Dissemination in Wireless Sensor Networks (무선 센서 네트워크에서 확률 기반의 클러스터링을 이용한 계층적 데이터 전송 프로토콜)

  • Kim, Moon-Seong;Cho, Sang-Hun;Lim, Hyung-Jin;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.153-160
    • /
    • 2009
  • One of the major challenges of designing a dissemination protocol for Wireless Sensor Networks(WSNs) is energy efficiency. Recently, this issue has received much attention from the research community, and SPMS, which outperforms the well-known protocol SPIN, specially is a representative protocol. In addition, one of many characters of SPMS is the use of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a dissemination protocol using probability-based clustering which guarantees energy-efficient data transmission and maximizes network lifetime. The proposed protocol solves the network lifetime problem by a novel probability function, which is related to the residual energy and the transmission radius between nodes. The simulation results show that it guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 78% than that of SPMS.

  • PDF

Proactive Data Dissemination Protocol on Distributed Dynamic Sink Mobility Management in Sensor Networks (센서 네트워크에서 다수의 이동 싱크로의 에너지 효율적인 데이터 전파에 관한 연구)

  • Hwang Kwang-Il;Eom Doo-Seop;Hur Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9B
    • /
    • pp.792-802
    • /
    • 2006
  • In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

Data Dissemination Protocol based on Predictable Mobility of Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 예측 가능한 싱크 이동성을 기반으로 한 데이타 전달 프로토콜)

  • Park, Soo-Chang;Lee, Eui-Sin;Jin, Min-Sook;Choi, Young-Hwan;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.276-280
    • /
    • 2008
  • Many dissemination protocols on the mobility support in wireless sensor networks have been designed based on the assumption that the movement trace of sinks, such as soldiers and fire fighters, is random. However, the mobility of the sinks in many applications, for example, the movement trace of a soldier on operation in a battle field, can be determined in advance. In this paper, we propose a Predictable Mobility-based Data Dissemination protocol that enables data to directly route from source nodes to moving sinks by taking into consideration predictable movement behavior of the sinks. We also show the superiority of the predictable mobility-based data dissemination protocol through the performance comparison with the random mobility-based data dissemination protocols.

WSN Data Dissemination Protocol by N-hop Access Guarantee Backbone (N홉 접근보장의 백본을 이용한 무선 센서 네트워크 데이터 전송 프로토콜)

  • Kim, Moon-Seong;Cho, Sang-Hun;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.1
    • /
    • pp.43-50
    • /
    • 2009
  • Flooding and SPIN, which are well-known WSN(Wireless Sensor Network) proactive protocols, spontaneously disseminate the sensed data without a request from an arbitrary sink node. However, these methods disseminate the data even to some nodes that do not need it, which is energy inefficient. In this paper, we introduce a semi-proactive protocol to disseminate only to pertinent nodes instead of all nodes in order to overcome this weakness. Thus some nodes, such as arbitrary sink nodes that need the sensed data, could easily obtain the data within some hops. The simulation result shows that the proposed protocol has higher average node energy efficiency than that of well-known earlier work, SPIN. If a proactive protocol, such as SPIN, is changed to semi-proactive and has only a 1-hop burden, then the energy efficiency enhancement is up to about 83% compared with SPIN.

  • PDF