Community-Based Message Transmission with Energy Efficient in Opportunistic Networks

An Opportunistic Networks is a wireless self-organized network, in which there is no need to build a fixed connectivity between source node and destination node, and the communication depends on the opportunity of node meeting. There are some classical message transmission algorithms, such as PRoPHET, MaxProp, and so on. In the Opportunity Networks with community characteristic, the different message transmission strategies can be sued in inter-community and intra-community. It improves the message successful delivery ratio significantly. The classical algorithms are CMTS and CMOT. We propose an energy efficient message forwarding algorithm EEMF for community-based Opportunistic Networks in this paper. When a message is transmitted, we consider not only the community characteristic, but also the residual energy of each node. The simulation results show that the EEMF algorithm can improve the message successful delivery ratio and reduce the network overhead obviously, in comparison with classical routing algorithms, such as PRoPHET, MaxProp, CMTS and CMOT. Meanwhile the EEMF algorithm can reduce the node's energy consumption and prolong the lifetime of network.

[1]  Sun Limin,et al.  A Message Transmission Scheme for Community-Based Opportunistic Network , 2009 .

[2]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[3]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Md. Yusuf Sarwar Uddin,et al.  A Low-energy, Multi-copy Inter-contact Routing Protocol for Disaster Response Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[5]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Yongjian Yang,et al.  Overview of Routing Algorithm in Pocket Switched Networks , 2014, 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications.

[7]  V. Stavroulaki,et al.  Opportunistic Networks , 2011, IEEE Vehicular Technology Magazine.

[8]  Xiaodong Liu,et al.  Community-based Message Opportunistic Transmission , 2015, ISD.

[9]  Yu-Chee Tseng,et al.  Measuring air quality in city areas by vehicular wireless sensor networks , 2011, J. Syst. Softw..

[10]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[11]  Gian Paolo Rossi,et al.  Bus switched networks: An ad hoc mobile platform enabling urban-wide communications , 2012, Ad Hoc Networks.

[12]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Suresh Singh,et al.  PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.

[14]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[15]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[16]  Yahong Liu,et al.  Community-based message transmission scheme in opportunistic social networks: Community-based message transmission scheme in opportunistic social networks , 2013 .

[17]  Limin Sun,et al.  Opportunistic Networks: Opportunistic Networks , 2009 .

[18]  Jie Wu,et al.  Homing spread: Community home-based multi-copy routing in mobile social networks , 2013, 2013 Proceedings IEEE INFOCOM.