Research Article
Students Social Based Mobility Model for MANET-DTN Networks
| input: Load or generate Nodeinfo, Schedule and | | Position matrices. | | for to days do | | if day is weekend day then // day==weekend | | ∀nodes → WeekendList | | Call Function: WEEKEND (WeekendList) | | end | | while Time slot ≠ last Time slot of the day do | | - Generate Random state of every node and | | write states into Random State matrix; | | for ∀ nodes do | | if ∈node’s free time then | | the particular student has its free | | time; | | if node then | | node | | else | | node | | end | | else if ∈node’s travel time to school | | then | | if node then | | node | | else | | node | | end | | else if ∈node’s school time then | | node | | else if ∈node’s travel time from school | | then | | if node then | | node | | else | | node | | end | | else | | if node ∈behave Randomly according | | Random State then | | node | | end | | end | | end | | Call Funnctions: WEEKEND (WeekendList), | | DORMITORY (), | | CITYSET (CitySettlementList), | | TRACE1 (), | | TRACE2 (), | | TRACE3 (), | | SCHOOL (), | | RANDOM (), | | ; | | end | | end |
|
