A Low-Cost Flooding Algorithm for Wireless Sensor Networks

Ou, Liang; Şekercioğlu, Y. Ahmet; Mani, N.

doi:10.1109/wcnc.2007.641

Cited by 13 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, [2,16] proposed probabilistic forwarding methods to avoid massive redundant transmissions. Based on the construction of virtual broadcast backbone and broadcasting along the backbone, [3][4][5][6][7] proposed different technologies to reduce broadcast redundancy. Specifically, much recent research has been done to minimize the broadcast transmissions and minimize the broadcast latency based on different The number of nodes in the network The period of sleeping schedule Δ…”

Section: Related Workmentioning

confidence: 99%

Sleeping Schedule-Aware Local Broadcast in Wireless Sensor Networks

Hong

et al. 2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Broadcast is widely used in applications in wireless sensor networks (WSNs). In the last decade, the broadcast problem in WSNs has been well studied. However, few of existing broadcasting strategies have considered the scenarios with sleeping schedules, which have been emerging as a prevalent energy-saving method for WSNs. In WSNs with sleeping schedule, each node switches on and off periodically, rendering the broadcast problem more difficult. To handle the periodical sleep issue, we focus on designing effective sleeping schedule-aware broadcast algorithms. We practically propose SALB, a sleeping schedule-aware local broadcast algorithm. In SALB, a typical local algorithm for constructing connected dominating set is employed to form the broadcast backbone. To guarantee proper transmission of broadcast messages, a sleep-aware forwarding mechanism is implemented. Moreover, heuristic strategies are used to decrease the number of transmissions and the broadcast latency. Theoretical analysis shows that the number of transmissions for SALB is within 4(min(Δ,| |) + ) ( is constant) is constant) times of the optimal value. And the broadcast latency of SALB is within 4| | + 1 times of the optimal value (Δ is the maximum degree in the network, | | is the scheduling period length). The performance of SALB is evaluated via simulations.

show abstract

Section: Related Workmentioning

confidence: 99%

Sleeping Schedule-Aware Local Broadcast in Wireless Sensor Networks

Hong

et al. 2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Thus, the goal is to reduce the Weighted Average Delay in order to achieve lower overall latency. The partial derivative of (7) over the PER of i-th path is calculated as (7).…”

Section: (K)mentioning

confidence: 99%

“…Traditional flooding approaches suffer from broadcast storm and energy inefficiency problems, which were thoroughly studied in [5] and [6]. The floodingbased schemes presented in [7], [8], [9] and [10] are designed for broadcast traffic. However, the aim of this work is to simplify sensor data collection, rather than point-to-multipoint communication.…”

Section: Introductionmentioning

confidence: 99%

Towards reliable and lightweight communication in industrial wireless sensor networks

Barać

Gidlund

et al. 2012

IEEE 10th International Conference on Industrial Informatics

View full text Add to dashboard Cite

Abstract-In this paper we address the issues of timeliness and transmission reliability of existing industrial communication standards. We combine a Forward Error Correction coding scheme on the Medium Access Control layer with a lightweight routing protocol to form an IEEE 802.15.4-conformable solution, which can be implemented into already existing hardware without violating the standard. After laying the theoretical foundations, we conduct a performance evaluation of the proposed solution. The results show a substantial gain in reliability and reduced latency, compared to the uncoded transmissions, as well as common Wireless Sensor Network routing protocols. I. INTRODUCTIONThe research efforts to introduce Wireless Sensor Networks (WSN) into Process Automation (PA) have produced three major industrial communication standards: WirelessHART [1], ISA100.11a [2] and WIA-PA [3]. The solutions based on these specifications shall satisfy the stringent performance requirements of PA applications and collect the sensor data in a reliable and timely manner. Nevertheless, a number of field tests, such as [4], reveal the fact that high communication reliability and real time performance can hardly be achieved. Some downsides of the existing solutions are worth mentioning. Routing protocols encountered in existing industrial communication standards are overcomplicated. Path failures in a dynamic environment (such as industrial) are frequent, triggering tedious path recalculation processes, during which transmission of data traffic is put on hold. Control message overhead is a natural side effect in such an environment, and exchange of routing tables, beacons and other control messages consumes bandwidth; Error Control and Correction: industrial communication standards do not approach the problem of error control in a preemptive manner. Instead, packet retransmissions are employed, which may boost the data latency in the network and deliver outdated data to the sink. Consequently, rethinking of current designs deserves consideration.Flooding is the most rudimentary routing technique and flooding-based algorithms are often seen as a way to simplify data dissemination in WSNs. Traditional flooding approaches suffer from broadcast storm and energy inefficiency problems, which were thoroughly studied in [5] and [6]. The floodingbased schemes presented in [7], [8], [9] and [10] are designed for broadcast traffic. However, the aim of this work is to simplify sensor data collection, rather than point-to-multipoint communication. Flooding-based routing schemes encountered

show abstract

“…These redundancies may increase the energy consumption and degrade the network performance due to their excessive transmissions and collisions. To address this problem, various efficient flooding algorithms have been proposed [2,8,16]. The number of broadcast packets can be minimized by using a minimum connected dominating set [3,4].…”

Section: A Basic Techniques For Reprogrammingmentioning

confidence: 99%

Policy-Based Reprogramming for Wireless Sensor Networks

Lee

Choi

Nah

et al. 2010

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

View full text Add to dashboard Cite

Program codes running on the sensor nodes need to be updated from time to time to fix bugs, tune the parameters, insert new functions, or delete useless codes. In this paper, we propose a policy-based reprogramming framework that can optimize the reprogramming process based on the execution characteristics of modules that constitute the WSN applications. To accomplish this we model the characteristics of a module as a tuple of the following four criteria; region, residence, synchronization and real-time properties of the module. According to the class of a module and the type of a reprogramming operation, we adaptively use 3 different reprogramming techniques; efficient code dissemination using connected dominating set, selective code dissemination, and code acquisition. Experimentation results confirm that this policy-based reprogramming can achieve substantial improvement in both the energy consumption and the reprogramming latency compared to existing solutions for various reprogramming scenarios.

show abstract

A Low-Cost Flooding Algorithm for Wireless Sensor Networks

Cited by 13 publications

References 10 publications

Sleeping Schedule-Aware Local Broadcast in Wireless Sensor Networks

Sleeping Schedule-Aware Local Broadcast in Wireless Sensor Networks

Towards reliable and lightweight communication in industrial wireless sensor networks

Policy-Based Reprogramming for Wireless Sensor Networks

Contact Info

Product

Resources

About