2011
DOI: 10.1109/tmc.2010.250
|View full text |Cite
|
Sign up to set email alerts
|

MUSTER: Adaptive Energy-Aware Multisink Routing in Wireless Sensor Networks

Abstract: Abstract-Wireless sensor networks (WSNs) are increasingly proposed for applications characterized by many-to-many communication, where multiple sources report their data to multiple sinks. Unfortunately, mainstream WSN collection protocols are generally designed to account for a single sink and, dually, WSN multicast protocols optimize communication from a single source.In this paper we present MUSTER, a routing protocol expressly designed for many-to-many communication. First, we devise an analytical model to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
52
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 102 publications
(52 citation statements)
references
References 45 publications
0
52
0
Order By: Relevance
“…In these systems, multiple sink nodes (actuators) must collect data generated by multiple source nodes. Tree-based routing designed for data collection at a single sink becomes insufficient, and several transport protocols are specifically targeted at these scenarios [20].…”
Section: Discussionmentioning
confidence: 99%
“…In these systems, multiple sink nodes (actuators) must collect data generated by multiple source nodes. Tree-based routing designed for data collection at a single sink becomes insufficient, and several transport protocols are specifically targeted at these scenarios [20].…”
Section: Discussionmentioning
confidence: 99%
“…We essentially wrap a simplified version of an existing data collection protocol [35] with the APIs necessary to make it usable as an instance of report. We call it STREAM abstraction, as it primarily supports periodic traffic.…”
Section: Meta-abstractionsmentioning
confidence: 99%
“…Each node attaches its normalized buffer size in awareness packet (AP) and broadcasts it in order to update its neighbors routing table. The receiver node compares APs received from all neighbors, selects the next destination with lowest potential field, and then calculates the average cumulative queue length in the direction of sink based on Equation 5. Afterwards, this node broadcasts AP that includes the average cumulative queue length.…”
Section: Average Cumulative Queue Lengthmentioning
confidence: 99%
“…Therefore, using multiple sinks is proposed as a more feasible scheme for such networks [5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%