Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power

Abstract Opportunistic mobile ad hoc networks (MANETs) are a special class of sparse and disconnected MANETs where data communication exploits sporadic contact opportunities among nodes. We consider opportunistic MANETs where nodes move independently at random over a square of the plane. Nodes ex¬change data if they are at a distance at most r within each other, where r > 0 is the node transmission radius. The flooding time is the number of time-steps required to broadcast a message from a source node to every node of the network.

Abstract con… Flooding time is an important measure of how fast information can spread in dynamic networks. We derive the first upper bound on the flooding time, which is a decreasing function of the maximal speed of the nodes. The bound holds with high probability, and it is nearly tight. Our bound shows that, thanks to node mobility, even when the network is sparse and disconnected, information spreading can be fast.

Existing system THE IMPACT of node mobility in data propagation is cur¬rently one of the major issues in network theory. The new trend is to consider node mobility as a resource for data for-warding rather than a hurdle [6], [14], [16], [19]. This is well captured by the model known as opportunistic mobile ad hoc networks (opportunistic MANETs), an interesting recent evolu¬tion of MANETs [11], [13], [17], [32], [18], [26], [30]. Several emerging application scenarios can be considered as instances of opportunistic MANETs, such as vehicular networks (at least when traffic density is not high), certain types of mobile sensor networks, and pocket switched networks. The latter type of net¬work is formed by powerful handheld devices—able to establish direct wireless communication links through, e.g., a WiFi inter¬face—carried around by humans in their everyday life.

System specification HARDWARE REQUIREMENTS Processor : intel Pentium IV Ram : 512 MB Hard Disk : 80 GB HDD SOFTWARE REQUIREMENTS Operating System : windows XP / Windows 7 FrontEnd : Java BackEnd : MySQL 5

CONCLUSION Some interesting issues concerning the flooding time on geo- metric-MEG are still open. There is a logarithmic gap between our upper bound and the known lower bound [9], [31] when the move radius p is very large. Closing this gap is an open problem. Observe that our upper bound can be easily extended to the gossiping task (i.e., the all-to-all communication). It would be interesting to extend our analysis to other basic communication tasks such as data gathering and routing.

THANK YOU