Geographical Routing With Location Service in Intermittently Connected MANETs

Kuiper, Erik; Nadjm‐Tehrani, Simin

doi:10.1109/tvt.2010.2091658

Cited by 103 publications

(75 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An intermediate node has two roles-either a relay node used for cooperative relaying or a forwarding node used in the traditional multihop sense. In addition, two basic assumptions 1 for the proposed protocol are made as follows: 1) every node is aware of its own geographic location, which can be accomplished by means of a localization technique such as [16] or a GPS (Global Positioning System) receiver [17]; 2) the location information of the destination can be obtained by the source via location service [18], [19]. Based on the philosophy of Greedy Forwarding, the goal is to make local route decisions for establishing a path from s to d, along which each hop uses the power-optimized cooperation under an SERbased QoS (Quality-of-Service) constraint.…”

Section: B Network Modelmentioning

confidence: 99%

See 1 more Smart Citation

Coverage-Extended Cooperative Geographic Routing with Optimal Power Allocation for Wireless Multihop Networks

Syue

Wang

Gauthier³

et al. 2012

2012 IEEE 75th Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

Abstract-Cooperative geographic routing has emerged as an efficient, scalable routing paradigm that exploits the joint merit of cooperative diversity and position-aided localized operation to enhance the network performance. In terms of the hop efficiency, an existing scheme called Relay-Aware Cooperative Routing (RACR) has offered a cross-layer approach based on its quantitative study of how physical-layer cooperation leads to link-layer radio coverage extension, under the policy of equal power allocation (EPA) over the cooperating nodes. However, the effect of cooperation-based radio coverage extension dramatically varies with the power allocation policy in use. In this paper, we extend the RACR scheme by addressing a power-optimized cooperative geographic routing problem. With the joint optimization of relaying position and power allocation, the maximum cooperative transmission range is derived. We then, according to the result, present a modified cross-layer routing protocol taking into account the effectuation of optimal power allocation (OPA). Simulation results show that the proposed scheme effectively improves the coverage extension performance as well as reduces the average number of hops.

show abstract

Section: B Network Modelmentioning

confidence: 99%

“…Since both the P * 1 and P * 2 are k-dependent (i.e., given a relay's position k, P 1 and P 2 can be optimized with respect to k), (19) becomes:…”

Section: Analysis Of Power-optimized Cooperativementioning

confidence: 99%

Coverage-Extended Cooperative Geographic Routing with Optimal Power Allocation for Wireless Multihop Networks

Syue

Wang

Gauthier³

et al. 2012

2012 IEEE 75th Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

show abstract

“…One such protocol is our earlier proposed LAROD-LoDiS [11]. In LAROD packets are forwarded towards the destination, and when this is not possible forwarding is paused until node movement allows the packet to be moved further towards the destination.…”

Section: A Routingmentioning

confidence: 99%

“…With known or predicted statistical properties regarding packet forwarding and knowledge about acceptable delivery latencies, the Forward-Wait framework can answer questions like "What % of transmitted packets in this network will reach the destination with an average delay of X?". As an example of a routing protocol that is suitable for this type of modeling, we use the Location-Aware Routing for Delay-tolerant networks (LAROD) protocol [11].…”

Section: Introductionmentioning

confidence: 99%

Predicting the performance of geographic delay-tolerant routing

Kuiper¹,

Nadjm‐Tehrani

2011

2011 - MILCOM 2011 Military Communications Conference

Self Cite

View full text Add to dashboard Cite

Abstract-Performing large scale physical experiments to evaluate the packet delivery ratio, latency, and resource utilization in mobile ad hoc networks is a costly and difficult exercise. A more cost-effective method of performing trade-off studies in connection with protocol evaluations is simulation. However, simulations are often time consuming and require a detailed description of a given scenario's mobility and topology. A more general approach for scalability and performance studies is the use of abstract models of behavior in networks of mobile nodes. This paper illustrates the power of such a model by illustrating the prediction capability of the Forward-Wait framework with respect to the routing performance of geographic delay-tolerant routing. The Forward-Wait mathematical framework describes packet movements as a sequence of alternating forwarding and waiting phases. Key input parameters to the Forward-Wait framework are distributions describing the forwarding and waiting phases, and the source destination distance. The paper shows how these distributions can be derived and used to predict the routing performance in different scenarios and a variety of network sizes.

show abstract

“…EMEED is designed for use in networks where the number of nodes is large and they exhibit non-uniform mobility patterns, for example each node visits some locations more often than others. There are many DTNs for which these assumptions hold, for example, wildlife tracking networks [1], [2], Vehicular DTNs [3], [4], and Unmanned Aerial Vehicle (UAV) DTNs [5].…”

Section: Introductionmentioning

confidence: 99%

Routing using partition-wide information in wireless Delay Tolerant Networks

Sidera

Toumpis

2013

2013 12th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

View full text Add to dashboard Cite

Abstract-We present the Extended Minimum Estimated Expected Delay (EMEED) protocol. EMEED is designed for use in wireless Delay Tolerant Networks (DTNs) that consist of a large number of highly mobile nodes with non-uniform mobility patterns. Under the EMEED protocol, any two nodes that are often in contact, either directly or through a multihop path, disseminate in the network the expected time they have to wait until they come into contact. Nodes route packets according to routing tables created using these expected times. When its main parameter, the contact radius, is equal to unity, the EMEED protocol operates similarly to the well known MEED protocol. However, using simulations, we show that for many mobility scenarios, when the contact radius is greater than unity, the EMEED protocol performs far better than MEED, in terms of throughput and delay, with only a modest increase in the control overhead.

show abstract

Geographical Routing With Location Service in Intermittently Connected MANETs

Cited by 103 publications

References 22 publications

Coverage-Extended Cooperative Geographic Routing with Optimal Power Allocation for Wireless Multihop Networks

Coverage-Extended Cooperative Geographic Routing with Optimal Power Allocation for Wireless Multihop Networks

Predicting the performance of geographic delay-tolerant routing

Routing using partition-wide information in wireless Delay Tolerant Networks

Contact Info

Product

Resources

About