Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks

Kalosha, H.; Nayak, Amiya; Rührup, Stefan; Stojmenović, Ivan

doi:10.1109/infocom.2008.78

Cited by 45 publications

(34 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By jointly combining the source-relay and relay-destination distances, the optimal relay offering the best cooperative link can be efficiently determined. However, the selection process proposed by requires a central controller to decide which relay [6] is most helpful, leading to more overhead and power consumption.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Srimathy¹

2012

IJCSEIT

View full text Add to dashboard Cite

In Wireless Ad hoc network, cooperation of nodes can be achieved by more interactions at higher protocol layers, particularly the MAC (Medium Access Control) and network layers play vital role. MAC facilitates a routing protocol based on position location of nodes at network layer specially known as Beacon-less geographic routing (BLGR) using Contention-based selection process. This paper proposes two levels of cross-layer framework -a MAC network cross-layer design for forwarder selection (or routing) and a MAC-PHY for relay selection. Wireless networks suffers huge number of communication at the same time leads to increase in collision and energy consumption; hence focused on new Contention access method that uses a dynamical change of channel access probability which can reduce the number of contention times and collisions. Simulation result demonstrates the best

show abstract

Section: Related Workmentioning

confidence: 99%

“…For the contention process, CBF makes use of biased timers. The BLGF mechanism [6] is carried out using the timer's settings [11], applying an area-based assignment function. In addition, a solution to detect malicious nodes [13] normally operates during determination of a route.…”

Section: Related Workmentioning

confidence: 99%

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Srimathy¹

2012

IJCSEIT

View full text Add to dashboard Cite

show abstract

“…The later approach will have minor impact on the overall overhead, and can function with 1-hop positional knowledge. Alternatively, one can rely on beaconless routing that guarantees delivery [24]. We will not elaborate on the details of the protocol.…”

Section: Recovery Step Routingmentioning

confidence: 99%

“…Such messages use short packets that consume negligible energy compared to messages needed to transmit a full message that is being relayed, therefore they are ignored in our analysis. Solutions with reduced number of responses are described in [24,25]. Application of Face routing on G ′′ only decides on which edge (s, b) to follow to reach the destination node from a given node s. However, that edge does not need to be selected since it may be too long (|sb| > r * ).…”

Section: Recovery Step Routingmentioning

confidence: 99%

Energy-Aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles

Hamouda

Mitton

Pavkovic

et al. 2009

Int J Wireless Inf Networks

View full text Add to dashboard Cite

We propose, EtE, a novel end-to-end localized routing protocol for wireless sensor networks that is energy-efficient and guarantees delivery. To forward a packet, a node s in graph G computes the cost of the energy weighted shortest path between s and each of its neighbors in the forward direction towards the destination which minimizes the ratio of the cost of the shortest path to the progress (reduction in distance towards the destination). It then sends the message to the first node on the shortest path from s to x: say node x ′ . Node x ′ restarts the same greedy routing process until the destination is reached or an obstacle is encountered and the routing fails. To recover from the latter scenario, local minima trap, our algorithm invokes an energy-aware Face routing that guarantees delivery. Our work is the first to optimize energy consumption of Face routing. It works as follows. First, it builds a connected dominating set from graph G, second it computes its Gabriel graph to obtain the planar graph G ′ . Face routing is invoked and applied to G ′ only to determine which edges to follow in the recovery process. On each edge, greedy routing is applied. This two-phase (greedy-Face) End-to-End routing process (EtE) reiterates until the final destination is reached. Simulation results show that EtE outperforms several existing geographical routing on energy consumption metric and delivery rate. Moreover, we prove that the computed path length and the total energy of the path are constant factors of the optimal for dense networks.

show abstract

“…Due to the transient nature of wireless links, building a routing topology that meets such QoS requirements remains a key challenge. Thus, existing routing schemes have been adapted and optimized for WSNs and new routing protocols has been proposed [2], [3], [4], etc. Moreover, the necessity to connect sensor devices to the Internet led to the emergence of an IETF routing protocol, named RPL [5], that is optimized for data collection in wireless sensor networks.…”

Section: Introductionmentioning

confidence: 99%

QoS oriented Opportunistic Routing protocol for Wireless Sensor Networks

Lampin

Barthel

Augé-Blum

et al. 2012

2012 IFIP Wireless Days

View full text Add to dashboard Cite

Abstract-In the field, Wireless Sensor Networks face the harsh reality of radio physics, including asymmetric and long-range transient links. Classic routing schemes are hindered by these links, and therefore prune them from the network topology. In this paper, we investigate how to put these opportunistic wireless links to good use and actually provide higher quality of service. We propose QOR, short for QoS oriented Opportunistic Routing protocol for data collection in Wireless Sensor Networks. Unlike classic routing schemes, QOR takes advantage of opportunistic links to provide faster and more reliable transmissions.Our contribution is threefold. First, we propose a joint routing structure and addressing scheme that allows to identify a limited set of nodes than can become opportunistic relayers between a source sensor and the sink. Second, we define an original cascaded acknowledgement mechanism that brings reliable acknowledgment and replication-free forwarding to the opportunistic communication scheme. Finally, our performance evaluation assesses that QOR efficiently uses opportunistic links to provide reliable and replication-free data delivery.

show abstract

Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks

Cited by 45 publications

References 25 publications

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Error Performance Analysis Using Cooperative Contention-Based Routing in Wireless Adhoc Networks

Energy-Aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles

QoS oriented Opportunistic Routing protocol for Wireless Sensor Networks

Contact Info

Product

Resources

About