• Corpus ID: 14549809

Centralized Routing for Resource-Constrained Wireless Sensor Networks (SYS 5)

@article{Stathopoulos2006CentralizedRF,
  title={Centralized Routing for Resource-Constrained Wireless Sensor Networks (SYS 5)},
  author={Thanos Stathopoulos and Lewis Girod and Jan K. Heideman and Deborah Estrin and Karen Weeks},
  journal={Center for Embedded Network Sensing},
  year={2006},
  url={https://api.semanticscholar.org/CorpusID:14549809}
}
CentRoute is a unicast routing protocol that utilizes source routing to form paths from a node to the sink and vice-versa that has constant state requirements on the resource-constrained nodes and as a result can scale to networks of high density.
No Paper Link Available
15 Citations
Background Citations
2
Methods Citations
3

15 Citations

A case for hierarchical routing in low-power wireless embedded networks

A framework that captures the common characteristics of the protocols and identifies design points at which the protocols differ is developed, and a number of practical issues and limitations of which sensornet developers adopting hierarchical routing should be aware are identified.

Exploring a Centralized/Distributed Hybrid Routing Protocol for Low Power Wireless Networks and Large-Scale Datacenters

This work presents PLayer, a policy-aware switching layer for datacenters that enables network administrators to explicitly dictate the middlebox traversal sequence of classes of traffic in their network, and presents a centralized PLayer design, discussing its ability to handle the demanding scalability requirements ofdatacenters and providing a comparison of the two designs.

Hierarchical Routing in Low-Power Wireless Networks

The objective of this dissertation is to provide a point-to-point routing protocol for sensornets, which is extremely challenging due to their embedding in physical space and the low-power wireless communication they employ.

Clustering strategies for improving the lifetime of two-tiered sensor networks

A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

LINKORD: link ordering-based data gathering protocol for wireless sensor networks

A data gathering protocol is introduced which uses the proposed path cost function to construct high-throughput paths and employs a newly designed congestion control mechanism during the data transmission process to provide energy-efficient and high-throughput data delivery.

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks

Design of fault tolerant wireless sensor networks satisfying survivability and lifetime requirements

Energy Aware Design Strategies for Heterogeneous Sensor Networks

    A. Bari
    Engineering, Computer Science
  • 2010
This dissertation presents two strategies for the placement of relay nodes, and five energy-aware strategies forThe clustering and routing in a hierarchical, heterogeneous, two-tiered sensor network using relay nodes as cluster heads.

Integration and Analysis of Neighbor Discovery and Link Quality Estimation in Wireless Sensor Networks

This work proposes adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment.

22 References

Taming the underlying challenges of reliable multihop routing in sensor networks

This work study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques, and narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments.

Exploiting heterogeneity in sensor networks

While it is proved that optimal deployment is very hard in general, it is also shown that only a modest number of reliable, long-range backhaul links and line-powered nodes are required to have a significant impact.

Dynamic Source Routing in Ad Hoc Wireless Networks

This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

This paper investigates modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP, to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks.

Directed diffusion for wireless sensor networking

The use of directed diffusion for a simple remote-surveillance sensor network analytically and experimentally indicates that directed diffusion can achieve significant energy savings and can outperform idealized traditional schemes (e.g., omniscient multicast) under the investigated scenarios.

Reverse path forwarding of broadcast packets

Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks which can be implemented in existing networks with less complexity than that required for the known alternatives.

A Reliable Multicast Mechanism for Sensor Network Applications

The StateSync abstraction defines a data model based on key-value pairs, a reliability model w i t h a probabilistic la­ tency bound, and an event-driven publish/subscribe A P I, an abstraction for reliable dissemination of application state through a multi-hop wireless network.

Tenet: An Architecture for Tiered Embedded Networks (SYS 8)

It is argued that this principle leads to fragile and unmanageable systems and explored an alternative, the Tenet architecture, which constrains multimode fusion to the master tier while allowing motes to process locally-generated sensor data.

Ad hoc On-Demand Distance Vector (AODV) Routing

The Ad hoc On-Demand Distance Vector routing protocol uses destination sequence numbers to ensure loop freedom at all times, avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.

Versatile low power media access for wireless sensor networks

B-MAC's flexibility results in better packet delivery rates, throughput, latency, and energy consumption than S-MAC, and the need for flexible protocols to effectively realize energy efficient sensor network applications is illustrated.