Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones

Sausen, Paulo Sérgio; Spohn, Marco Aurélio; Perkusich, Ângelo

doi:10.1016/j.ins.2009.11.016

Cited by 46 publications

(27 citation statements)

References 21 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…WSN lifetime problem include network structure [1], sensor activity scheduling [2,3] data aggregation [4,5,6], data compression [7], and routing protocol [8,9,10].Wireless Sensor Network (WSN) comprises of tiny sensor nodes with very limited initial energy and are deployed in sensing area of particular intersect to fetch necessary environment data and sending it back to end user via base station. One of the major issues in WSN is energy efficient coverage in which any loss of data due to lack of energy or power in sensor node.…”

Section: Related Workmentioning

confidence: 99%

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

krishnaraju¹,

Siddappa²

2016

IOSR

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

krishnaraju¹,

Siddappa²

2016

IOSR

View full text Add to dashboard Cite

“…Sausen et al [46] investigated about the techniques of energy efficient routing in wireless sensor network using dual tactics.…”

Section: Approach In Simentioning

confidence: 99%

An Investigational Study of Energy Conservation Techniques in Hierarchical Routing Protocols in Wireless Sensor Network

Hemawathi.¹,

Basavaraju²

2014

IJCA

View full text Add to dashboard Cite

In the advent of wireless networking, wireless sensor network (WSN) has been a constant target of research due to its potential data aggregation techniques in hostile environment. Even after crossing more than a decade, wireless sensor network is still more under research and development and less on commercial deployment when it comes to large scale wireless environment. Although, there are various issues exists in WSN that ranges from quality of service to security policies, it was frequently seen that root cause of majority of the issues originates from the energy that backs up the sensor motes to transmit the data to base station. The past research work has witness massive volumes of algorithms using various sophisticated technologies in order to mitigate the issues of energy problems in sensor motes, however, till date none of the prior studies has yet been standardized and hence the issues of unwanted power depletion still persist because of numerous unsolved factors. This paper is an attempt to study only the prominent techniques that has been introduced in the past for energy efficiency exclusively for hierarchical routing protocols. A brief review of some prior Swarm Intelligence (SI) techniques is also given a special focus for the similar purpose in this paper.

show abstract

“…To guarantee the QoS of RT traffics in a cell, many researchers [2,13,18,19] proposed the pinwheel scheduling algorithms to reduce the jitter of variable bit rate (VBR) traffic in a cell. In other applications, such as the medium access control (MAC) layer of CDMA and TDMA-based wireless networks [10,22,23], many pinwheel scheduling schemes are proposed for solving the frame-based packet scheduling problems. These pinwheel methods provide low delay and low jitter for RT traffic and short-queue length for non-RT traffic.…”

Section: Introductionmentioning

confidence: 99%

An Efficient DVS Algorithm for Pinwheel Task Schedules

Chen¹,

Chen²

2011

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-In this paper, we focus on the pinwheel task model with a variable voltage processor with d discrete voltage/speed levels. We propose an intra-task DVS algorithm, which constructs a minimum energy schedule for k tasks in O(d+k log k) time. We also give an inter-task DVS algorithm with O(d+n log n) time, where n denotes th e number of jobs. Previous approaches solve this problem by generating a canonical schedule beforehand and adjusting the tasks' speed in O(dn log n) or O(n 3 ) time. However, the length of a canonical schedule depends on the hyper period of those task periods and is of exponential length in general. In our approach, the tasks with arbitrary periods are first transformed into harmonic periods and then profile their key features. Afterward, an optimal discrete voltage schedule can be computed directly from those features.

show abstract

Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones

Cited by 46 publications

References 21 publications

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

Implementation of an efficient algorithm to enhance connectivity and lifetime in wireless sensor networks

An Investigational Study of Energy Conservation Techniques in Hierarchical Routing Protocols in Wireless Sensor Network

An Efficient DVS Algorithm for Pinwheel Task Schedules

Contact Info

Product

Resources

About