19-07-2010, 09:03 AM
Hello,
I am Smitha Bheemaiah. Doing my M.tech.
I wanted the coding part of the IEEE project "Efficient routing in intermittently connected mobile networks: multiple copy case"
I had worked with this project in java platform but i didnt get good results, may be due to the coding part had lot of errors. I had to be using the buffers but I have used the database which is not recommended. So, I wanted some help regarding this.
I dont know exactly the simulation part also and hence I wanted the coding part so that I can understand the project well and if any documentations and PPTs are there please provide with that too at the earliest as possible within 21st july 2010.
I want the complete code and steps for how it works.
And I want the software and Hardware requirements used to work on this.
I want this before 21st of july 2010.
Abstract of this Project:
Abstract
Abstractâ€Intermittently connected mobile networks are wirelessnetworks where most of the time there does not exist a completepath from the source to the destination. There are many real networksthat follow this model, for example, wildlife tracking sensornetworks, military networks, vehicular ad hoc networks, etc. Inthis context, conventional routing schemes fail, because they try toestablish complete end-to-end paths, before any data is sent.To deal with such networks researchers have suggested to useflooding-based routing schemes. While flooding-based schemeshave a high probability of delivery, they waste a lot of energyand suffer from severe contention which can significantly degradetheir performance. Furthermore, proposed efforts to reduce theoverhead of flooding-based schemes have often been plaguedby large delays. With this in mind, we introduce a new familyof routing schemes that spray a few message copies into thenetwork, and then route each copy independently towards thedestination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message,but also has lower average delivery delays than existing schemes;furthermore, it is highly scalable and retains good performanceunder a large range of scenarios.Finally, we use our theoretical framework proposed in our 2004paper to analyze the performance of spray routing.We also use thistheory to show how to choose the number of copies to be sprayedand how to optimally distribute these copies to relays.
I would wait for a quick response. I wish I get some help from here at the earliest as possible.