2007Unpublished venueRequires access

Data Dissemination for Wireless Sensor Networks

Min‐Gu Lee, Sunggu Lee

Open publisher page 29 citations

Abstract

Due to the special characteristics (limited battery power, limited computing capability, low bandwidth, need to collect sensor data from multiple fixed-location source nodes to a sink node that may be mobile, etc.) of wireless sensor networks, routing algorithms designed for general mobile ad hoc networks may not be directly applicable to wireless sensor networks. In one possible routing scheme for wireless sensor networks, each node maintains up-to-date hop-distances and next-hop nodes to the mobile sink node (or multiple mobile sink nodes). However, this type of method may require too much control overhead in order to maintain up-to-date and consistent hop-distances and next-hop nodes for all of the sensor nodes in the network. Therefore, we propose a new low-control-overhead data dissemination scheme, referred to as pseudo-distance data dissemination, for efficiently disseminating data packets from all sensor nodes to mobile sink nodes in a wireless sensor network

About this research paper

What this paper is about

Due to the special characteristics (limited battery power, limited computing capability, low bandwidth, need to collect sensor data from multiple fixed-location source nodes to a sink node that may be mobile, etc.) of wireless sensor networks, routing algorithms designed for general mobile ad hoc networks may not be directly applicable to wireless sensor networks. In one possible routing scheme for wireless sensor networks, each node maintains up-to-date hop-distances and next-hop nodes to the mobile sink node (or multiple mobile sink nodes). However, this type of method may require too much control overhead in order to maintain up-to-date and consistent hop-distances and next-hop nodes for all of the sensor nodes in the network. Therefore, we propose a new low-control-overhead data dissemination scheme, referred to as pseudo-distance data dissemination, for efficiently disseminating data packets from all sensor nodes to mobile sink nodes in a wireless sensor network

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Due to the special characteristics (limited battery power, limited computing capability, low bandwidth, need to collect sensor data from multiple fixed-location source nodes to a sink node that may be mobile, etc.) of wireless sensor networks, routing algorithms designed for general mobile ad hoc networks may not be directly applicable to wireless sensor networks. In one possible routing scheme for wireless sensor networks, each node maintains up-to-date hop-distances and next-hop nodes to the mobile sink node (or multiple mobile sink nodes). However, this type of method may require too much control overhead in order to maintain up-to-date and consistent hop-distances and next-hop nodes for all of the sensor nodes in the network. Therefore, we propose a new low-control-overhead data dissemination scheme, referred to as pseudo-distance data dissemination, for efficiently disseminating data packets from all sensor nodes to mobile sink nodes in a wireless sensor network

Key concepts: Computer network, Wireless sensor network, Computer science, Key distribution in wireless sensor networks, Mobile wireless sensor network, Dissemination, Wireless ad hoc network, Network packet

Related papers

Back to paper searchBrowse research topicsOriginal source
Data Dissemination for Wireless Sensor Networks — Research Paper | ScholarLens