Joint optimization of a protocol stack for sensor networks

Shah, Rahul; Bonivento, A.; Petrović, Dragan; Lin, E.; Greunen, J. van; Rabaey, Jan M.

doi:10.1109/milcom.2004.1493314

Cited by 39 publications

(21 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the least-cost opportunistic routing (LCOR) [5], it needs to enumerate all the neighboring node combinations to get the least cost OR paths. While some other variants [18,11,6] use the location information of nodes to define the candidate set and relay priority. In GeRaF [18], the next-hop neighbors of the current forwarding node are divided into sets of priority regions with nodes closer to the destination having higher relay priorities.…”

Section: Opportunistic Routingmentioning

confidence: 99%

“…So there exists a tradeoff between the medium time [2], which is directly relative to the throughput, and other performance goals, such as packet advancement and delivery reliability. This trade-off is not well studied in the existing works [18,11,3].…”

Section: Introductionmentioning

confidence: 99%

“…However, it is not an ideal approach for wireless networks with broadcast links of time varying qualities. Recently, a new routing paradigm, known as opportunistic routing [18,11,3] (or contention-based forwarding [6]), was proposed to cope with the unreliability of link quality.…”

Section: Introductionmentioning

confidence: 99%

“…Owing to the broadcast nature and spatial diversity of the wireless medium, the probability of at least one forwarding candidate correctly receiving the packet will increase when multiple candidates are involved, thus improve the packet delivery efficiency such as throughput [3,6] or energy efficiency [11,18,13].…”

Section: Introductionmentioning

confidence: 99%

“…Several variants of opportunistic routing [18,11,6] leverage the location information of nodes to select forwarding candidates and prioritize them. For example, in [18], all the available next-hop neighbors that are nearer than the sender to the destination are selected as the candidates, and the nodes closer to the destination are given higher relay priorities.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks

et al. 2007

View full text Add to dashboard Cite

Geographic opportunistic routing (GOR) is a new routing concept in multihop wireless networks. In stead of picking one node to forward a packet to, GOR forwards a packet to a set of candidate nodes and one node is selected dynamically as the actual forwarder based on the instantaneous wireless channel condition and node position and availability at the time of transmission. GOR takes advantages of the spatial diversity and broadcast nature of wireless communications and is an efficient mechanism to combat the unreliable links. The existing GOR schemes typically involve as many as available next-hop neighbors into the local opportunistic forwarding, and give the nodes closer to the destination higher relay priorities. In this paper, we focus on realizing GOR's potential in maximizing throughput. We start with an insightful analysis of various factors and their impact on the throughput of GOR, and propose a local metric named expected one-hop throughput (EOT) to balance the tradeoff between the benefit (i.e., packet advancement and transmission reliability) and the cost (i.e., medium time delay). We identify an upper bound of EOT and proof its concavity. Based on the EOT, we also propose a local candidate selection and prioritization algorithm. Simulation results validate our analysis and show that the metric EOT leads to both higher one-hop and path throughput than the corresponding pure GOR and geographic routing.

show abstract

Section: Opportunistic Routingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks

et al. 2007

View full text Add to dashboard Cite

show abstract

On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks

2012

View full text Add to dashboard Cite

Power control based cooperative opportunistic routing in wireless sensor networks

Zhu

2009

J. Electron.(China)

View full text Add to dashboard Cite

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the cooperation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.

show abstract

Joint optimization of a protocol stack for sensor networks

Cited by 39 publications

References 3 publications

On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks

On Throughput Efficiency of Geographic Opportunistic Routing in Multihop Wireless Networks

On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks

Power control based cooperative opportunistic routing in wireless sensor networks

Contact Info

Product

Resources

About