The project objective is to introduce Binary Spray and Wait with routine awareness routing algorithm in IZTECH(izmir institute of technology) which considers efficient use of network resources (i.e. bandwidth and energy) and ensures message delivery with minimum possible delay.
Proposed routing algorithm for DTN in IZTECH
3.1 Problem scenario
Consider IZTECH in which numbers of nodes are randomly deployed in different groups. The nodes have ability to communicate with their neighbors by exchanging messages whenever a chance raises that is when the nodes are in communication range of each other. The communication range of all nodes is of Bluetooth. Uniform range of transmission is considered. Nodes have same buffer size, speed and each group has same or different number of nodes. Initially all nodes don’t have any idea about the location of other nodes and will never know till the probability of having a node in certain location is high enough.
in need simple algorithm for the above project either in matlab, NS2, opnet,.... with mathematical expressions, like probability distribution, random walk of nodes,....
for more tails please read the attached docs file. named DTN project