8/10/2019 IEEE 2014 DOTNET MOBILE COMPUTING PROJECT Optimal Multicast Capacity and Delay Tradeoffs in MANETs

1/5

8/10/2019 IEEE 2014 DOTNET MOBILE COMPUTING PROJECT Optimal Multicast Capacity and Delay Tradeoffs in MANETs

2/5

work in e.isting system studied a dense network with fi.ed unit area" he helping nodes in theirwork are wireless, but have higher power and only act as relays instead of sources ordestinations" 0ther E.isting works all study static networks"

Disadvantages Of Existing System:

1 2imiting factors1 2ow redundancy"

roposed System:

In 3roposed #ystem, assume that at each time slot, bits can be transmitted in a successfultransmission" Mobility time scales$ wo time scales of mobility are considered in this paper$

*ast mobility$ he mobility of nodes is at the same time scale as the transmission of packets, i"e",in each time&slot, only one transmission is allowed"

#low mobility$ he mobility of nodes is much slower than the transmission of packets, i"e",multiple transmissions may happen within one time&slot"

Advantages Of roposed System:

4 he advantage of dimensional mobility lies in the fact that it is simple and easily predictable,thus increasing the inter contact rate"4 hough nodes are limited to only moving hori-ontally or vertically, the mobility range on theirorbit lines is not restricted"

Algorit!m "sed:

Algorithm 5 6oint7#cheduling algorithm

In this algorithm, there are two types of transmissions$%" #ource&8elay(#&8! transmission and

8/10/2019 IEEE 2014 DOTNET MOBILE COMPUTING PROJECT Optimal Multicast Capacity and Delay Tradeoffs in MANETs

3/5

'" 8elay&9estination(8&9! transmission" hus, when a particularly pair is selected, there will be two conditions$ #&8 pair or 8&9 pair"

%! If node Nsend contains packet 3 in its relaying pool to be sent to Nreceive, and Nsend is inthe same cell as Nreceive, we call Nsend and Nreceive a 8&9 pair"

'! If node Nsend does not contain packet 3 in its relaying pool to be sent toNreceive, whilenode Nreceive does not contain packet 3 in its relaying pool to be sent to Nsend, and Nsend is inthe same cell as Nreceive, we call Nsendand Nreceive a #&8 pair"

Modules:%" #:HE9;2IN 302I:IE#'" HE E80 ENE0;# NE /08

8/10/2019 IEEE 2014 DOTNET MOBILE COMPUTING PROJECT Optimal Multicast Capacity and Delay Tradeoffs in MANETs

4/5

/hen this happens successfully, we say that the chosen relay node has successfully captured thedestination of packet" /e call this chosen relay node the last mobile relay for packet anddestination" And we call the distance between the last mobile relay and the destination as thecapture range"

2. Duplication*or a packet p that has not been successfully delivered, the scheduler needs to decide whether toduplicate packet p to other nodes that does not have the packet at the beginning of the time&slot"

he scheduler also needs to decide which nodes to relay from and relay to, and how"

HE E80 ENE0;# NE /08

8/10/2019 IEEE 2014 DOTNET MOBILE COMPUTING PROJECT Optimal Multicast Capacity and Delay Tradeoffs in MANETs

5/5

4 Mouse & wo or hree ?utton Mouse4 Monitor & 2:972E9 Soft%are &e'uirements:

0perating system $ /indows B3" :oding 2anguage $ :C"Net" ool $ =I#;A2 # ;9I0 '@@D"

&eference:6inbei hang, Binbing /ang, Senior Member, IEEE , Biaohua ian, Member, IEEE Fun /ang,Biaoyu :hu, and Fu :heng, G0ptimal Multicast :apacity and 9elay radeoffs in MANE s ,IEEE 8AN#A: I0N# 0N M0?I2E :0M3; IN " '@% "