Scalable Routing in Cyclic Mobile Networks
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science topics
Active In SP

Posts: 610
Joined: Jun 2010
02-07-2010, 06:22 PM

Scalable Routing in Cyclic Mobile Networks


The nonexistence 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 then; we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.

Algorithm / Technique used:

DTN Hierarchical Routing (DHR) Algorithm.

Algorithm Description:

Our proposed DHR is quite straightforward after the hierarchical network has been built. DHR is also a hop by- hop routing. Each node makes its forwarding decision in two phases. The first phase runs only when the highest level, on which the cluster of the current node and that of the destination are different.

Existing System:

Routing in communication networks involves the indirection from a persistent name (or ID) to a locator and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these indirections up-to-date. In this paper, we propose Weak State Routing (WSR), a routing mechanism for large-scale highly dynamic networks. WSRâ„¢s novelty is that it uses random directional walks biased occasionally by weak indirection state information in intermediate nodes. The indirection state information is weak, i.e. interpreted not as absolute truth, but as probabilistic hints. Nodes only have partial information about the region a destination node is likely to be. This method allows us to aggregate information about a number of remote locations in a geographic region. In other words, the state information maps a set-of-IDs to a geographical region.

Proposed System:

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 that 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.

Hardware Requirements:

¢ System : Pentium IV 2.4 GHz.
¢ Hard Disk : 40 GB.
¢ Floppy Drive : 1.44 Mb.
¢ Monitor : 15 VGA Colour.
¢ Mouse : Logitech.
¢ Ram : 256 Mb.

Software Requirements:

¢ Operating system : - Windows XP Professional.
¢ Coding Language : - Java.
¢ Tool Used : - Eclipse.
Use Search at wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: scalable routing in cyclic mobile networks pdf, scalable routing in cyclic mobile networks ppt, scalable routing in cyclic mobile networks projects, scalable routing in cyclic mobile network, scalable routing in cyclic mobile networks project, scalable routing in cyclic network algorithm source code, coding pdf for weak state routing in largescale dynamic networks,
Popular Searches: scalable routing in cyclic mobile networks, heterogeneous system cyclic voltammetry, weak state routing for large scale dynamic networks, seminar report on cyclic codes, cyclic loading on geocells, cyclic roll loading, distributed and scalable routing,

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Switching and Traffic Grooming in WDM Networks at java project topics 3 929 09-09-2016, 02:27 PM
Last Post: Dhanabhagya
  intel centrino mobile technology ppt jaseelati 0 256 05-01-2015, 04:49 PM
Last Post: jaseelati
  The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks seminar flower 3 2,724 09-12-2014, 09:25 PM
Last Post: Guest
  Detection and Localization of Multiple Spoofing Attackers in Wireless Networks seminar flower 4 1,789 02-06-2014, 09:51 AM
Last Post: seminar project topic
Last Post: seminar project topic
  Hop-by-Hop Routing in Wireless Mesh Networks with Bandwidth Guarantees Abstract seminar projects maker 2 741 08-03-2014, 12:43 PM
Last Post: seminar project topic
  Enhancing the Trust of Internet Routing With Lightweight Route Attestation Report project girl 2 943 10-01-2014, 04:16 PM
Last Post: seminar project topic
  Online Mobile Phone Shop seminar class 15 11,988 22-10-2013, 07:51 PM
Last Post: vishalonne
  Identifying Evolving Groups in Dynamic Multimode Networks Projects9 2 1,127 30-09-2013, 10:54 AM
Last Post: Guest
  Routing Security in Ad Hoc Wireless Networks seminar projects maker 0 544 26-09-2013, 02:20 PM
Last Post: seminar projects maker