Efficient broadcast in opportunistic networks using optimal stopping theory
暂无分享,去创建一个
[1] Di Huang,et al. An Optimal Stopping Decision method for Routing in opportunistic networks , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).
[2] Alʹbert Nikolaevich Shiri︠a︡ev,et al. Optimal stopping rules , 1977 .
[3] Christos Anagnostopoulos,et al. Time-optimized contextual information forwarding in mobile sensor networks , 2014, J. Parallel Distributed Comput..
[4] Stathes Hadjiefthymiades,et al. Multivariate context collection in mobile sensor networks , 2013, Comput. Networks.
[5] Stathes Hadjiefthymiades,et al. Optimal stopping of the context collection process in mobile sensor networks , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).
[6] Ciprian Dobre,et al. SPRINT: Social prediction-based opportunistic routing , 2013, 2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).
[7] Mads Haahr,et al. Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.
[8] Jörg Ott,et al. The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.
[9] Katsunori Ano. Optimal selection problem with three stops , 1989 .
[10] Ying Peng,et al. Energy-Efficient Transmission Strategy by Using Optimal Stopping Approach for Mobile Networks , 2016, Mob. Inf. Syst..
[11] Martin Everett,et al. Ego network betweenness , 2005, Soc. Networks.
[12] Sergi Robles,et al. Softwarecast: A code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks , 2017, Ad Hoc Networks.
[13] Mahbub Hassan,et al. Performance analysis of geography-limited broadcasting in multihop wireless networks , 2011, Wirel. Commun. Mob. Comput..
[14] Sung-Bong Yang,et al. A forwarding scheme based on swarm intelligence and percolation centrality in opportunistic networks , 2016, Wirel. Networks.
[15] Anders Lindgren,et al. Probabilistic routing in intermittently connected networks , 2003, MOCO.
[16] Pan Hui,et al. BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .
[17] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .
[18] Xiang-Yang Li,et al. Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.
[19] Thrasyvoulos Spyropoulos,et al. Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.
[20] Pan Hui,et al. Evaluating the Impact of Social Selfishness on the Epidemic Routing in Delay Tolerant Networks , 2010, IEEE Communications Letters.
[21] Xiaofei Wang,et al. Cooperation enforcement scheme based on reputation for delay tolerant networks , 2011, Proceedings of 2011 International Conference on Computer Science and Network Technology.
[22] Guohong Cao,et al. User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.
[23] Vasilis Friderikos,et al. Optimal stopping for energy efficiency with delay constraints in Cognitive Radio networks , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).
[24] Cauligi S. Raghavendra,et al. Efficient Broadcasting in Delay Tolerant Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[25] Stratis Ioannidis,et al. Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd , 2011, 2011 Proceedings IEEE INFOCOM.
[26] Stathes Hadjiefthymiades,et al. Delay-tolerant delivery of quality information in ad hoc networks , 2011, J. Parallel Distributed Comput..
[27] Vaskar Raychoudhury,et al. A survey of routing and data dissemination in Delay Tolerant Networks , 2016, J. Netw. Comput. Appl..
[28] Junshan Zhang,et al. Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach , 2009, IEEE Transactions on Information Theory.
[29] John Skvoretz,et al. Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.
[30] Mitsushi Tamaki. Recognizing both the maximum and the second maximum of a sequence , 1979 .
[31] Pan Hui,et al. A socio-aware overlay for publish/subscribe communication in delay tolerant networks , 2007, MSWiM '07.
[32] Zhiyuan Li,et al. Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks , 2017, Comput. Networks.
[33] Katia Obraczka,et al. A survey on congestion control for delay and disruption tolerant networks , 2015, Ad Hoc Networks.
[34] Linton C. Freeman,et al. Centered graphs and the structure of ego networks , 1982, Math. Soc. Sci..
[35] Jon Crowcroft,et al. ML-SOR: Message routing using multi-layer social networks in opportunistic communications , 2015, Comput. Networks.
[36] M. Barthelemy. Betweenness centrality in large complex networks , 2003, cond-mat/0309436.
[37] Stathes Hadjiefthymiades,et al. Adaptive epidemic dissemination as a finite-horizon optimal stopping problem , 2018, Wireless Networks.