Title :
Viral spread in mobile social network using network coding
Author :
Narmawala, Z. ; Srivastava, S.
Author_Institution :
Inst. of Technol., Nirma Univ., Ahmedabad, India
Abstract :
Delay tolerant ad hoc network between mobile devices is a promising paradigm which can avoid significant cost of cellular data transfer. Many interesting applications such as peer-to-peer file transfer, micro-blogging etc. are possible on this network. We propose viral spread (Many-to-all broadcast) for such networks. Viral spread can be useful to variety of such applications as well as for routing protocols which require flooding of control messages. As these devices are carried by humans, we exploit properties of human mobility like overlapping community structure and heterogeneous popularity of nodes for efficient forwarding. Buffering all packets from all sources of community at each node is prohibitive. As buffer space is limited and buffer occupancy level also has an impact on energy requirements, to reduce buffer usage, we probabilistically buffer received packet for forwarding. To offset for the loss in performance due to this, we employ network coding. Network coding is a mechanism in which nodes encode two or more incoming packets and forward encoded packets instead of forwarding them as it is. To compare performance of viral spread, we also modify epidemic routing from unicast to broadcast and from deterministic buffering all the packets to probabilistic buffering. As simulation results suggest, viral spread achieves significantly high packet delivery percentage and low average delivery delay than modified epidemic routing. From simulation results, we also suggest optimal values of forwarding probability and generation size to be used in viral spread.
Keywords :
delay tolerant networks; mobile ad hoc networks; network coding; routing protocols; average delivery delay; buffer occupancy level; buffer space; buffer usage reduction; cellular data transfer; control message flooding; delay tolerant ad-hoc network; deterministic buffering; encoded packet forwarding; energy requirements; epidemic routing; forwarding probability; generation size; heterogeneous node; human mobility; many-to-all broadcast; mobile devices; mobile social network; network coding; optimal values; overlapping community structure; packet buffering; packet delivery; probabilistic buffering; probabilistically buffer received packet; routing protocols; viral spread; Communities; Delays; Logic gates; Network coding; Probabilistic logic; Radiation detectors; Routing;
Conference_Titel :
India Conference (INDICON), 2014 Annual IEEE
Conference_Location :
Pune
Print_ISBN :
978-1-4799-5362-2
DOI :
10.1109/INDICON.2014.7030651