Sociological orbit aware location approximation and routing (SOLAR) in MANET

Ghosh, Joy; Philip, Sumesh J.; Qiao, Chunming

doi:10.1016/j.adhoc.2005.10.003

Cited by 102 publications

(63 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This algorithm might not deliver messages in some situations, and requires global knowledge, such as the locations of the access points. Similarly, In Solar [6], Ghosh et al used a set of hubs for probabilitybased routing in semi-deterministic mobility modeling of DTNs. In [8], Hui et al identify the logical topology using statistical information, i.e.…”

Section: Related Workmentioning

confidence: 99%

“…Flooding-based approaches for networks with general mobility include [7] and [19]. Probability-based routing without a message delivery guarantee for semi-deterministic mobility models include [6], [10], [11], and [1]. Like many of the previous works, this paper focuses on deterministic mobility where the mobility of the nodes are predetermined and, therefore, the contacts are predictable.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scalable Routing in Cyclic Mobile Networks

Liu

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

The non-existence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semi-deterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semi-deterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm which routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra's algorithm in terms of delay and hop-count. At the same time, the per node storage overhead is substantially reduced and becomes scalable.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Scalable Routing in Cyclic Mobile Networks

Liu

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…In the literature, some routing approaches are based on deterministic mobility [8], [9], [12]- [14], [16], [19], [20] while some others are based on nonpredictable mobility [2], [5], [6], [11], [15], [18], [21]. Here, we discuss the situation of non-predictable mobility: nodes move dynamically in different directions with different speeds.…”

Section: Related Workmentioning

confidence: 99%

“…DF is PDF with a probability of 100% and PDF is TPDF without the threshold. In our simulations, we set TH if m k is currently held by u i then 8: end if 20: end if else 21: end if 22: end for to be 0.05, 0.1, 0.25, and 0.5, and the probability to be 80% for the Content trace and 85% for the Info trace. We still look at the three metrics: delivery ratio, latency and number of copies.…”

Section: Simulations Of Tpdfmentioning

confidence: 99%

Probability Delegation Forwarding in Delay Tolerant Networks

Xiao

Shen

Groves

et al. 2009

2009 Proceedings of 18th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

Abstract-Delay tolerant networks are a type of wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time. In such a network, one of the critical issues is to reliably deliver data with a low latency. Naive forwarding approaches, such as flooding and its derivatives, make the routing cost (here defined as the number of copies duplicated for a message) very high. Many efforts have been made to reduce the cost while maintaining performance. Recently, an approach called delegation forwarding (DF) caught significant attention in the research community because of its simplicity and good performance. In a network with N nodes, it reduces the cost to O( √ N ) which is better than O(N ) in other methods. In this paper, we extend the DF algorithm by putting forward a new scheme called probability delegation forwarding (PDF) that can further reduce the cost to O(N log 2+2p (1+p) ), p ∈ (0, 1). Simulation results show that PDF can achieve similar delivery ratio, which is the most important metric in DTNs, as the DF scheme at a lower cost if p is not too small. In addition, we propose the threshold probability delegation forwarding (TPDF) scheme to close the latency gap between the DF and PDF schemes.

show abstract

“…By selecting a real urban area for the emergency and rescue scenario, the density of nodes has been computed and the mobility model needed for the validation study of AODV, DSDV and CBRP in the routing model. Ghosh et al [40] have proposed a mobility framework to achieve this macrolevel abstraction of orbital movement. However, till date none of the studies are yet standardized for benchmarking highlighting an open-issue of research to solve the routing overhead problems in MANET.…”

Section: Related Workmentioning

confidence: 99%

Reviewing Contribution for Mitigating Routing Overhead and Adopting Signal Strength in MANET

Joshi¹,

Biradar²

2014

IJCA

View full text Add to dashboard Cite

Routing is one of the crucial phenomenons in any networking principles. However, formulation and operation of the routing protocols are not so easy in dynamic topologies like mobile adhoc network. Since past decade there has been an evolution of various routing protocols in mobile adhoc network community that are claimed to be efficient by various researchers, it became important to understand their effectiveness. Hence, the proposed study chooses to understand and scale the effectiveness of the existing routing protocols in mobile adhoc network from routing overhead minimization and adoption of signal strength in enhancing route behavior. The study has discussed some of the significant contributions and interesting outcomes with support of discussion on precise research gaps of the existing literatures.

show abstract

Sociological orbit aware location approximation and routing (SOLAR) in MANET

Cited by 102 publications

References 28 publications

Scalable Routing in Cyclic Mobile Networks

Scalable Routing in Cyclic Mobile Networks

Probability Delegation Forwarding in Delay Tolerant Networks

Reviewing Contribution for Mitigating Routing Overhead and Adopting Signal Strength in MANET

Contact Info

Product

Resources

About