Selfish Mules: Social Profit Maximization in Sparse Sensornets using Rationally-Selfish Human Relays

Future smart cities will require sensing on a scale hitherto unseen. Fixed infrastructures have limitations regarding sensor maintenance, placement and connectivity. Employing the ubiquity of mobile phones is one approach to overcoming some of these problems. Here, mobility and social patterns of phone owners can be exploited to optimize data forwarding efficiency. The question remains, how can we stimulate phone owners to serve as data relays? In this paper, we combine network science principles and Lyapunov optimization techniques, to maximize global social profit across this hybrid sensor and mobile phone network. Sensor data packets are produced and traded (transmitted) over a virtual economic network using a lightweight social-economic-aware backpressure algorithm, combining rate control, routing, and resource pricing. Phone owners can get benefits through relaying sensor data. Our algorithm is fully distributed and makes no probabilistic/stochastic assumptions regarding mobility, topology, and channel conditions, nor does it require prediction. The global social profit achieved by our algorithm can perform close to (or better than) an ideal algorithm with perfect prediction- proven by rigorous theoretical analysis. Simulation results further demonstrate that the proposed algorithm outperforms pure backpressure and social-aware schemes; highlighting the advantage of building systems combining communication with other types of networks.

[1]  David K. Y. Yau,et al.  Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach , 2006, IEEE/ACM Transactions on Networking.

[2]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  A.R. Sharafat,et al.  Pareto-Efficient and Goal-Driven Power Control in Wireless Networks: A Game-Theoretic Approach With a Novel Pricing Scheme , 2009, IEEE/ACM Transactions on Networking.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  Marco Conti,et al.  From opportunistic networks to opportunistic computing , 2010, IEEE Communications Magazine.

[7]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[8]  Sanjay Shakkottai,et al.  Back-pressure routing and rate control for ICNs , 2010, MobiCom '10.

[9]  Arif Quraishi,et al.  How Smart is Your City? , 2011 .

[10]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

[11]  Lei Ying,et al.  Back-Pressure Routing for Intermittently Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  John S. Heidemann,et al.  Data muling with mobile phones for sensornets , 2011, SenSys.

[13]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[14]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[15]  Thomas F. La Porta,et al.  On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks , 2013, IEEE Transactions on Mobile Computing.

[16]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[17]  Andreas Terzis,et al.  Using mobile robots to harvest data from sensor fields , 2009, IEEE Wireless Communications.

[18]  Ahmed Helmy,et al.  Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[19]  Alexander L. Stolyar,et al.  Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[20]  Michael J. Neely Optimal Backpressure Routing for Wireless Networks with Multi-Receiver Diversity , 2006 .

[21]  Dusit Niyato,et al.  Competitive Pricing for Spectrum Sharing in Cognitive Radio Networks: Dynamic Game, Inefficiency of Nash Equilibrium, and Collusion , 2008, IEEE Journal on Selected Areas in Communications.

[22]  Michael J. Neely,et al.  Universal scheduling for networks with arbitrary traffic, channels, and mobility , 2010, 49th IEEE Conference on Decision and Control (CDC).

[23]  Xiaodong Lin,et al.  Pi: A practical incentive protocol for delay tolerant networks , 2010, IEEE Transactions on Wireless Communications.

[24]  Alexandros G. Dimakis,et al.  Efficient Algorithms for Renewable Energy Allocation to Delay Tolerant Consumers , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[25]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[26]  Shivakant Mishra,et al.  CenWits: a sensor-based loosely coupled search and rescue system using witnesses , 2005, SenSys '05.

[27]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[28]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[29]  Michael J. Neely Optimal pricing in a free market wireless network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[30]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[31]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[32]  Leana Golubchik,et al.  Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints , 2011, 2011 Proceedings IEEE INFOCOM.

[33]  Athanasios V. Vasilakos,et al.  Backpressure-based routing protocol for DTNs , 2010, SIGCOMM '10.

[34]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[35]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[36]  Peter I. Corke,et al.  Data muling over underwater wireless sensor networks using an autonomous underwater vehicle , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[37]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[38]  Eytan Modiano,et al.  Optimal Control of Wireless Networks with Finite Buffers , 2010, 2010 Proceedings IEEE INFOCOM.

[39]  Gregory M. P. O'Hare,et al.  How Smart Is Your City? , 2012, Science.

[40]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[41]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[42]  Evangelos D. Spyrou,et al.  Using social network theory for modeling human mobility , 2010, IEEE Network.

[43]  Qinghua Li,et al.  Social-Aware Multicast in Disruption-Tolerant Networks , 2012, IEEE/ACM Transactions on Networking.

[44]  Mung Chiang,et al.  Stochastic network utility maximisation - a tribute to Kelly's paper published in this journal a decade ago , 2008, Eur. Trans. Telecommun..

[45]  Jenna Burrell,et al.  Vineyard computing: sensor networks in agricultural production , 2004, IEEE Pervasive Computing.