Data acquisition in multiple-sink sensor networks

Das, Abhimanyu; Dutta, Debojyoti

doi:10.1145/1031495.1031531

Cited by 28 publications

(33 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vincze et al [53] study how to minimize the average source-sink distance. Das and Dutta [15] define optimal policies to select, at each source, the sink minimizing energy consumption. These scenarios differ from ours in that we require sinks to simultaneously collect data from possibly overlapping subsets of sources.…”

Section: Related Workmentioning

confidence: 99%

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

Mottola

Picco

2011

IEEE Trans. on Mobile Comput.

102

View full text Add to dashboard Cite

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 compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks. Next, we illustrate heuristics approximating the optimal solution in a distributed setting, and their implementation in MUSTER. To increase network lifetime, MUSTER minimizes the number of nodes involved in many-tomany routing and balances their forwarding load. We evaluate MUSTER in emulation and in a real WSN testbed. Results indicate that our protocol builds near-optimal routing paths, doubles the WSN lifetime, and overall delivers to the user 2.5 times the amount of raw data w.r.t. mainstream protocols. Moreover, MUSTER is intrinsically amenable to in-network aggregation, pushing the improvements up to a 180% increase in lifetime and a 4-time increase in data yield.

show abstract

Section: Related Workmentioning

confidence: 99%

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

Mottola

Picco

2011

IEEE Trans. on Mobile Comput.

102

View full text Add to dashboard Cite

show abstract

“…Reference [10] presents a methodology for optimally designing the topology to optimize the communication cost for wireless sensor networks with multiple sinks. Reference [2] proposes a model to adopt existing single-sink algorithms to multi-sink networks. Reference [13] proposes a two-tier data dissemination approach for large-scale sensor networks, which is completely proactive and energy-inefficient.…”

Section: Related Workmentioning

confidence: 99%

“…There are energy aware protocols in the literature, generally using multi-hop paths to use the energy more efficiently. However, increase in the hop number between the source and the destination nodes bears some issues that must be considered [1], [2]. First, nodes close to the sink deplete their energies quickly; leaving the sink unreachable and the system into offstate [3].…”

Section: Introductionmentioning

confidence: 99%

A Routing Algorithm for Mobile Multiple Sinks in Large-Scale Wireless Sensor Networks

Soytürk

Altılar

2007

2007 2nd International Symposium on Wireless Pervasive Computing

View full text Add to dashboard Cite

show abstract

“…In this case, even if multiple sinks are present, these simply act as cluster-heads, with each sensor node reporting to only one of them. Similarly, the proposal in [25] studies the problem of selecting, at each node, one of the many sinks present in the system to minimize the overall energy expenditures. Clearly, this is a different problem w.r.t.…”

Section: Related Workmentioning

confidence: 99%

Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks

Ciciriello

Mottola

Picco

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently, however, scenarios with multiple sinks are increasingly being proposed, e.g., to deal with actuator nodes or to support high-level programming abstractions. The resulting many-to-many communication makes the existing solutions for single-sink scenarios inefficient. In this paper, we propose a scheme for routing data efficiently from multiple sources to multiple sinks. We first study the problem from a theoretical standpoint, by mapping it to the multi-commodity network design problem. This allows us to derive an optimal solution that, albeit based on global knowledge and therefore impractical, provides us with a theoretical lower bound to evaluate decentralized solutions against. Then, we propose our own decentralized scheme, based on a periodic adaptation of the message routes aimed at minimizing the number of network links exploited. The resulting protocol is simple and easily implementable on WSN devices. The evaluation of our implementation shows that our protocol generates 50% less overhead than the base scheme without adaptation, a result close to the theoretical optimum we derived.

show abstract

Data acquisition in multiple-sink sensor networks

Cited by 28 publications

References 0 publications

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

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

A Routing Algorithm for Mobile Multiple Sinks in Large-Scale Wireless Sensor Networks

Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks

Contact Info

Product

Resources

About