Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization
|
|
- Lorena Goodwin
- 5 years ago
- Views:
Transcription
1 Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization Ji Li 1 Zhipeng Cai 1 Mingyuan Yan 2 Yingshu Li 1 1 Department of Computer Science, Georgia State University 2 Department of Computer Science and Information Systems, University of North Georgia IEEE INFOCOM / 48
2 Introduction Online social networks become a hot research topic One of the most important research issues is the influence maximization problem Many existing works: only the influence propagation in the online social network is considered Related Works The influence can also propagate in the physical world 2 / 48
3 Introduction Contribution Propose a network model and an influence propagation model Influence propagation in Online social network Physical world Propose an event activation position selection problem Designed a heuristic algorithm for position selection problem 3 / 48
4 Network Model Two-layer graph G t = (V, E f, Ep) t V : set of n users deployed in [0, 1) 2 E f : friendship in the online social network, remains the same Ep: t neighbour in the physical world at time t, changes over time Influence propagation An event is activated in the physical world, users around the activation position may be influenced The influence propagates in both online social networks and the physical world simultaneously 4 / 48
5 Network Model Online Social Network Physical World u5 / IR 1, u5 may still be influenced since u3, u6 are u5 s friends and u3, u6 IR (u1, u7) / Ef,influence may propagate u1 u7 since (u1, u7) Ep t1 1 IR: influencing region 5 / 48
6 Measurements Datasets Two actual datasets named Brightkite and Gowalla Dataset origin: Stanford Large Network Dataset Collection [1] Findings Users positions in the physical world have high stability Influence of different users in an online social network varies a lot Convenient to propagate influence in the physical world High interdependency of geographical positions for friends in the online social networks Dataset details Measurement results 6 / 48
7 Influence Propagation Model Basic Influence Propagation Model E.t 0 E.t 0 + E.t init pro E.t 0 + E.t init pro + E.t add pro Initial propagation period Additional propagation period Initial propagation period: users around the activation position may be influenced Additional propagation period: influence propagates in online social networks and the physical world 7 / 48
8 Influence Propagation Model Initial Influence Propagation Physical World Influenced User Uninfluenced User In initial propagation period, users in the influencing region may be influenced Influencing probability: p(e, v, init inf) Details 8 / 48
9 Influence Propagation Model Influence Propagation in Online Social Networks Online Social Network Influenced User Newly Influenced User Uninfluenced User A influenced user v shares the event E with its friends with probability p(v, osn share) v s friend u be influenced with probability p(e, u, osn inf) Details 9 / 48
10 Influence Propagation Model Influence Propagation in the Physical World Physical World Influenced User Newly Influenced User Uninfluenced User Influenced user v propagates E with probability p(v, pw share) v will choose neighbours to share event E Neighbour u be influenced with probability p(e, u, phy inf) Details 10 / 48
11 Influence Propagation Model Cross Propagation Online social networks physical world User u Online Social Network user v User v P hysical W orld user w Physical world online social networks User u P hysical W orld user v User v Online Social Network user w 11 / 48
12 Optimal Event Activation Position Selection Problem Definition Problem Description A candidate position set C Select pos C to activate event E so that its influence can be maximized Other parameters of E are fixed Formalized Definition F (pos): number of influenced users if activate event E in pos Input: candidate position set C, event E, graph G t = (V, E f, E t p) Output: arg max pos C F (pos) 12 / 48
13 Optimal Event Activation Position Selection Heuristic Algorithm N s and N i : predefined constant P = randomly selected N s positions in C Iterate for N i times Replace pos 1 P with a new position pos 2 if F (pos 2 ) > F (pos 1 ) Return arg max pos P F (pos) F -based algorithm Details Algorithm code New position selection Why not other algorithms? 13 / 48
14 Experimental Results Distribution of Influenced Users number of influenced users initial only initial and OSN initial and OSN and PW number of influenced users initial only initial and OSN initial and OSN and PW influence probability influence probability (a) Brightkite (b) Gowalla Figure 1: Comparison of different propagation models Parameters and candidate position sets Omitted results 14 / 48
15 Experimental Results Distribution of Influenced Users Initial OSN PW 60 Initial OSN PW percentage percentage additional propagation time (a) Brightkite additional propagation time (b) Gowalla Figure 2: Comparison of different influence manners 15 / 48
16 Experimental Results The Optimal Activation Position Selection Algorithm execution time (ms) F F number of influenced users F F 0 Brightkite Gowalla different datasets (a) execution time 0 Brightkite Gowalla different datasets (b) number of influenced users Figure 3: Comparison between F -based and F -based heuristic algorithms 16 / 48
17 Conclusion Propose a new network model A new event influence propagation model is proposed based on the measurement results of two actual datasets An event activation position selection problem is defined A heuristic algorithm for the position selection problem is designed 17 / 48
18 Questions and Answers 18 / 48
19 Thank you very much 19 / 48
20 Appendix 20 / 48
21 Appendix: Measurements Introduction to the Datasets Basics Record formatte: (user-id, login-time, latitude, longitude, location-id) Use the random way point model to estimate users positions [7] Investigated login records period Brightkite: April 2008 through October 2010 Gowalla: December 2009 through October / 48
22 Appendix: Measurements Introduction to the Datasets Standardization Users positions in the physical world [0, 1) 2 Time stamps for the logins [0, 1) Data selection To make sure the users movements are correctly detected, we employ part of the original Brightkite and Gowalla datasets The users are distributed in 400km 400km rectangle regions These regions include New York, Washington and Philadelphia where users are densely distributed 22 / 48
23 Appendix: Measurements Introduction to the Datasets property Brightkite Gowalla # users # edges average degree # CC # nodes in largest CC # logins average login # triangles average CC size # edges in largest CC Table 1: Dataset Details Return 23 / 48
24 Appendix: Measurements Users Positions and Number of Friends distance distance percentage of distances (a) Brightkite percentage of distances (b) Gowalla Figure 4: The distribution of distances 24 / 48
25 Appendix: Measurements Users Positions and Number of Friends number of friends number of friends percentage of users (a) Brightkite percentage of users (b) Gowalla Figure 5: The distribution of numbers of friends 25 / 48
26 Appendix: Measurements Users Positions and Number of Friends number of users number of users distance x distance x 10 3 (a) Brightkite (b) Gowalla Figure 6: The distribution of number of neighbors 26 / 48
27 Appendix: Measurements Positions and Friendships friend non friend 50 friend non friend 30 percentage percentage r=0.001 r=0.002 r=0.003 different distances 0 r=0.001 r=0.002 r=0.003 different distances (a) Brightkite (b) Gowalla Figure 7: The percentage of users within a given distance 27 / 48
28 Appendix: Measurements Positions and Friendships friend non friend non friend friend distance distance percentage of distances (a) Brightkite percentage of distances (b) Gowalla Figure 8: The distribution of minimum distances 28 / 48
29 Appendix: Measurements Positions and Friendships non friend friend 10 1 non friend friend similarity similarity percentage of distances percentage of distances (a) Brightkite (b) Gowalla Figure 9: The distribution of trajectory similarities Return 29 / 48
30 Appendix: Influence Propagation Model Initial Influence Propagation p(e, v, init inf) = min(p 1 I 1 (E, v)i 2 (E, v), 1) I 1 (E, v) = I(J(E.type, v.interest), I max1 ) I(x, I max ) = (I max 1) 1 (1 x) J(E.type, v.interest) = p 1 : base influence probability E.type v.interest E.type v.interest T (E, v) I 2 (E, v) = I(, I max2 ) E.t init pro I max1 & I max2 : upper bound of increase T (E, v): time v stays in the influencing region Return 30 / 48
31 Appendix: Influence Propagation Model Influence Propagation in Online Social Networks p(v, osn share) = min(p 2 I 1 (E, v), 1) p(e, u, osn inf) = min(p 3 I 1 (E, u)i 3 (u, t), 1) I 3 (u, t) = I(min( n r(e, u, t) 1 n max, 1), I max3 ) p 2 / p 3 : base sharing/influencing probability I max3 : upper bound of increase n r (E, u, t): the number of descriptions of event E received by user u at time t n max : predefined constant Return 31 / 48
32 Appendix: Influence Propagation Model Influence Propagation in the Physical World p(v, pw share) = min(p 4 I 1 (E, v), 1) p(e, u, phy inf) = min(p 5 I 1 (E, u)i 4 (v, u), 1) { c if (v, u) Ef I 4 (v, u) = 1 otherwise p 4 / p 5 : base sharing/influencing probability v.share phy: set of different time instances for v to share E in the physical world c: predefined constant which satisfies c > 1 The roulette wheel method[8] is used to decide which neighbour to be chosen and I 4 (v, u) is used to calculate the weight Return 32 / 48
33 Appendix: Optimal Event Activation Position Selection Option 1 Idea: select the position with most users Problem: little interdependency between The number of influenced users The number of users in the initial influencing region Option 2 Idea: existing algorithm+influence propagation in the physical world Problem: distributions of top influencing users may be dispersive 33 / 48
34 Appendix: Optimal Event Activation Position Selection Option 3 Idea: use the monotonicity of function F (pos) Problem: values of function F (pos) may distribute highly irregularly Option 4 Idea: test each position in C Problem: does not work if C is an infinite set 34 / 48
35 Appendix: Optimal Event Activation Position Selection number of influenced users number of influenced users number of users in the initial influencing radius number of users in the initial influencing radius (a) Brightkite (b) Gowalla Figure 10: The number of influenced users vs. the number of users in the initial influencing region. 35 / 48
36 Appendix: Optimal Event Activation Position Selection y y x (a) Brightkite x (b) Gowalla Figure 11: User distribution 36 / 48
37 Appendix: Optimal Event Activation Position Selection number of influenced users y x number of influenced users y x (a) Brightkite (b) Gowalla Figure 12: Function F (pos) s values Return 37 / 48
38 Appendix: Optimal Event Activation Position Selection N c [pos 1 ] records how many times pos 1 is selected init and α (α > 1) are predefined constants Calculate the upper bound of dis(pos 1, pos 2 ) by = init α Nc[pos 1 ] Randomly select pos 2 {pos C dis(pos, pos 1 ) } Return 38 / 48
39 Optimal Event Activation Position Selection Heuristic Algorithm Problem: high computation cost Reason: complexity of the influence propagation model Solution: use another objective function F F -based heuristic algorithm: use F as the objective to evaluate the event activation position 39 / 48
40 Appendix: Optimal Event Activation Position Selection F (pos) = u U u.f riends + v Neg(u,t) v.friends Neg(u, t) t a randomly selected time instance in [E.t 0 + E.t init pro, E.t 0 + E.t init pro + E.t add pro ) v.friends the set of user v s friends in the online social network pos.x / pos.y the x-coordinate / y-coordinate of position pos Neg(u, t) u s neighbors in the physical world at time t U Users in the influencing region Table 2: Symbols in Function F Return 40 / 48
41 Appendix: Optimal Event Activation Position Selection Algorithm 1 Optimal Activation Position Selection Algorithm Input: candidate position set C, event E, graph G t = (V, E f, Ep) t Output: position to activate event E for i = 1 to N s do P [i]= randomly selected element in C, N c [i] = 0; end for for i = 1 to N i do find the minimum j satisfying j k=1 F (P [k]) Ns > rand; k=1 F (P [k]) randomly select pos {pos C dis(pos, P [j]) init α Nc[j] }; replace P [j] with pos if F (pos ) > F (P [j]); N c [j]++; end for return arg max pos P F (pos); Return 41 / 48
42 Appendix: Experimental Results parameter value parameter value parameter value E.r E.t E.t init pro 0.02 E.t add pro 0.2 I max1 3 I max2 1.5 I max3 6 r p 0.01 c 5 n max 10 α N s 10 N i 10 Table 3: Parameters for the Experiments dataset candidate position set Brightkite {(x, y) 0.5 x 0.6, 0.45 y 0.55} Gowalla {(x, y) 0.7 x 0.8, 0.6 y 0.7} Table 4: Candidate Position Set Return 42 / 48
43 Appendix: Experimental Results Number of Influenced Users number of influenced users number of influenced users initial propagation time influence probability initial propagation time influence probability (a) Brightkite (b) Gowalla Figure 13: The number of influenced users for different initial propagation time 43 / 48
44 Appendix: Experimental Results Number of Influenced Users number of influenced users additional propagation time (a) Brightkite influence probability additional propagation time number of influenced users (b) Gowalla influence probability Figure 14: The number of influenced users for different additional propagation time 44 / 48
45 Appendix: Experimental Results Appendix: Number of Influenced Users number of influenced users initial influence region number of influenced users influence probability initial influence region influence probability (a) Brightkite (b) Gowalla Figure 15: The number of influenced users for different initial influence radius Return 45 / 48
46 Appendix: Related Works [2] and [3] propose multiple influence maximization algorithms for LBSNs [4] uses the Brightkite and Gowalla datasets to study friendships in online social networks and users movements in the physical world [5] proposes a friendship prediction approach by fusing the topology and geographical features in LBSNs [6] studies the impact of social relations hidden in LBSNs Return 46 / 48
47 Appendix: References I [1] J. Leskovec and A. Krevl, Snap datasets: Stanford large network dataset collection, Jun [2] Y.-T. Wen, P.-R. Lei, W.-C. Peng, and X.-F. Zhou, Exploring social influence on location-based social networks, in IEEE ICDM, 2014, pp [3] T. Zhou, J. Cao, B. Liu, S. Xu, Z. Zhu, and J. Luo, Location-based influence maximization in social networks, in ACM CIKM, 2015, pp [4] E. Cho, S. A. Myers, and J. Leskovec, Friendship and mobility: user movement in location-based social networks, in ACM SIGKDD, 2011, pp [5] H. Luo, B. Guo, Z. W. Yu, Z. Wang, and Y. Feng, Friendship prediction based on the fusion of topology and geographical features in lbsn, in IEEE HPCC EUC, 2013, pp / 48
48 Appendix: References II [6] Y.-T. Wen, P.-R. Lei, W.-C. Peng, and X.-F. Zhou, Exploring social influence on location-based social networks, in IEEE ICDM, 2014, pp [7] D. B. Johnson and D. A. Maltz, Dynamic source routing in ad hoc wireless networks, in Mobile computing. Springer, 1996, pp [8] A. Lipowski and D. Lipowska, Roulette-wheel selection via stochastic acceptance, Physica A: Statistical Mechanics and its Applications, vol. 391, no. 6, pp , / 48
A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks
MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio
More informationA GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
More informationEasyChair Preprint. A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network
EasyChair Preprint 78 A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network Yuzhou Liu and Wuwen Lai EasyChair preprints are intended for rapid dissemination of research results and
More informationExtending lifetime of sensor surveillance systems in data fusion model
IEEE WCNC 2011 - Network Exting lifetime of sensor surveillance systems in data fusion model Xiang Cao Xiaohua Jia Guihai Chen State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing,
More informationAn Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction
, pp.319-328 http://dx.doi.org/10.14257/ijmue.2016.11.6.28 An Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction Xiaoying Yang* and Wanli Zhang College of Information Engineering,
More informationMinimum Cost Localization Problem in Wireless Sensor Networks
Minimum Cost Localization Problem in Wireless Sensor Networks Minsu Huang, Siyuan Chen, Yu Wang Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA. Email:{mhuang4,schen4,yu.wang}@uncc.edu
More informationHierarchical Agglomerative Aggregation Scheduling in Directional Wireless Sensor Networks
Hierarchical Agglomerative Aggregation Scheduling in Directional Wireless Sensor Networks Min Kyung An Department of Computer Science Sam Houston State University Huntsville, Texas 77341, USA Email: an@shsu.edu
More informationREIHE INFORMATIK TR Studying Vehicle Movements on Highways and their Impact on Ad-Hoc Connectivity
REIHE INFORMATIK TR-25-3 Studying Vehicle Movements on Highways and their Impact on Ad-Hoc Connectivity Holger Füßler, Marc Torrent-Moreno, Roland Krüger, Matthias Transier, Hannes Hartenstein, and Wolfgang
More informationIntroduction. Introduction ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS. Smart Wireless Sensor Systems 1
ROBUST SENSOR POSITIONING IN WIRELESS AD HOC SENSOR NETWORKS Xiang Ji and Hongyuan Zha Material taken from Sensor Network Operations by Shashi Phoa, Thomas La Porta and Christopher Griffin, John Wiley,
More informationp-percent Coverage in Wireless Sensor Networks
p-percent Coverage in Wireless Sensor Networks Yiwei Wu, Chunyu Ai, Shan Gao and Yingshu Li Department of Computer Science Georgia State University October 28, 2008 1 Introduction 2 p-percent Coverage
More informationCoverage in Sensor Networks
Coverage in Sensor Networks Xiang Luo ECSE 6962 Coverage problems Definition: the measurement of quality of service (surveillance) that can be provided by a particular sensor network Coverage problems
More informationPerformance Analysis of DV-Hop Localization Using Voronoi Approach
Vol.3, Issue.4, Jul - Aug. 2013 pp-1958-1964 ISSN: 2249-6645 Performance Analysis of DV-Hop Localization Using Voronoi Approach Mrs. P. D.Patil 1, Dr. (Smt). R. S. Patil 2 *(Department of Electronics and
More informationSIGNIFICANT advances in hardware technology have led
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 56, NO. 5, SEPTEMBER 2007 2733 Concentric Anchor Beacon Localization Algorithm for Wireless Sensor Networks Vijayanth Vivekanandan and Vincent W. S. Wong,
More informationResearch Article ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks
Sensors Volume 5, Article ID 89, 6 pages http://dx.doi.org/.55/5/89 Research Article ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks Peng Huang,, Feng Lin, Chang Liu,,5 Jian Gao, and Ji-liu
More informationUtilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks
This paper was presented as part of the Mini-Conference at IEEE INFOCOM 2011 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks Fulong Xu, Shuo Guo, Jaehoon Jeong, Yu Gu, Qing
More informationEnergy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networks
Energy-Balanced Cooperative Routing in Multihop Wireless Ad Hoc Networs Siyuan Chen Minsu Huang Yang Li Ying Zhu Yu Wang Department of Computer Science, University of North Carolina at Charlotte, Charlotte,
More informationPredicting Content Virality in Social Cascade
Predicting Content Virality in Social Cascade Ming Cheung, James She, Lei Cao HKUST-NIE Social Media Lab Department of Electronic and Computer Engineering Hong Kong University of Science and Technology,
More informationCoding aware routing in wireless networks with bandwidth guarantees. IEEEVTS Vehicular Technology Conference Proceedings. Copyright IEEE.
Title Coding aware routing in wireless networks with bandwidth guarantees Author(s) Hou, R; Lui, KS; Li, J Citation The IEEE 73rd Vehicular Technology Conference (VTC Spring 2011), Budapest, Hungary, 15-18
More informationOutline. Tracking with Unreliable Node Sequences. Abstract. Outline. Outline. Abstract 10/20/2009
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009 Presenter: Jing He Abstract This paper proposes
More informationNode Deployment Strategies and Coverage Prediction in 3D Wireless Sensor Network with Scheduling
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 8 (2017) pp. 2243-2255 Research India Publications http://www.ripublication.com Node Deployment Strategies and Coverage
More informationEfficient Recovery Algorithms for Wireless Mesh Networks with Cognitive Radios
Efficient Recovery Algorithms for Wireless Mesh Networks with Cognitive Radios Roberto Hincapie, Li Zhang, Jian Tang, Guoliang Xue, Richard S. Wolff and Roberto Bustamante Abstract Cognitive radios allow
More informationScienceDirect. An Integrated Xbee arduino And Differential Evolution Approach for Localization in Wireless Sensor Networks
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 48 (2015 ) 447 453 International Conference on Intelligent Computing, Communication & Convergence (ICCC-2015) (ICCC-2014)
More informationDelay-Tolerant Data Gathering in Energy Harvesting Sensor Networks With a Mobile Sink
Globecom 2012 - Ad Hoc and Sensor Networking Symposium Delay-Tolerant Data Gathering in Energy Harvesting Sensor Networks With a Mobile Sink Xiaojiang Ren Weifa Liang Research School of Computer Science
More informationSequential Multi-Channel Access Game in Distributed Cognitive Radio Networks
Sequential Multi-Channel Access Game in Distributed Cognitive Radio Networks Chunxiao Jiang, Yan Chen, and K. J. Ray Liu Department of Electrical and Computer Engineering, University of Maryland, College
More informationResearch Article A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010, Article ID 578370, 8 pages doi:10.1155/2010/578370 Research Article A New Iterated Local Search Algorithm
More informationVistradas: Visual Analytics for Urban Trajectory Data
Vistradas: Visual Analytics for Urban Trajectory Data Luciano Barbosa 1, Matthías Kormáksson 1, Marcos R. Vieira 1, Rafael L. Tavares 1,2, Bianca Zadrozny 1 1 IBM Research Brazil 2 Univ. Federal do Rio
More informationOptimal Multicast Routing in Ad Hoc Networks
Mat-2.108 Independent esearch Projects in Applied Mathematics Optimal Multicast outing in Ad Hoc Networks Juha Leino 47032J Juha.Leino@hut.fi 1st December 2002 Contents 1 Introduction 2 2 Optimal Multicasting
More informationSwarm Based Sensor Deployment Optimization in Ad hoc Sensor Networks
Swarm Based Sensor Deployment Optimization in Ad hoc Sensor Networks Wu Xiaoling, Shu Lei, Yang Jie, Xu Hui, Jinsung Cho, and Sungyoung Lee Department of Computer Engineering, Kyung Hee University, Korea
More informationParticle Swarm Optimization-Based Consensus Achievement of a Decentralized Sensor Network
, pp.162-166 http://dx.doi.org/10.14257/astl.2013.42.38 Particle Swarm Optimization-Based Consensus Achievement of a Decentralized Sensor Network Hyunseok Kim 1, Jinsul Kim 2 and Seongju Chang 1*, 1 Department
More informationThe Capability of Error Correction for Burst-noise Channels Using Error Estimating Code
The Capability of Error Correction for Burst-noise Channels Using Error Estimating Code Yaoyu Wang Nanjing University yaoyu.wang.nju@gmail.com June 10, 2016 Yaoyu Wang (NJU) Error correction with EEC June
More informationA Greedy Algorithm for Target Coverage Scheduling in Directional Sensor Networks
A Greedy Algorithm for Target Coverage Scheduling in Directional Sensor Networks Youn-Hee Han, Chan-Myung Kim Laboratory of Intelligent Networks Advanced Technology Research Center Korea University of
More informationBroadcast with Heterogeneous Node Capability
Broadcast with Heterogeneous Node Capability Intae Kang and Radha Poovendran Department of Electrical Engineering, University of Washington, Seattle, WA. email: {kangit,radha}@ee.washington.edu Abstract
More informationMulticast Energy Aware Routing in Wireless Networks
Ahmad Karimi Department of Mathematics, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran karimi@bkatu.ac.ir ABSTRACT Multicasting is a service for disseminating data to a group of hosts
More informationA Location-Aware Routing Metric (ALARM) for Multi-Hop, Multi-Channel Wireless Mesh Networks
A Location-Aware Routing Metric (ALARM) for Multi-Hop, Multi-Channel Wireless Mesh Networks Eiman Alotaibi, Sumit Roy Dept. of Electrical Engineering U. Washington Box 352500 Seattle, WA 98195 eman76,roy@ee.washington.edu
More informationFast Placement Optimization of Power Supply Pads
Fast Placement Optimization of Power Supply Pads Yu Zhong Martin D. F. Wong Dept. of Electrical and Computer Engineering Dept. of Electrical and Computer Engineering Univ. of Illinois at Urbana-Champaign
More informationOn the Performance of Cooperative Routing in Wireless Networks
1 On the Performance of Cooperative Routing in Wireless Networks Mostafa Dehghan, Majid Ghaderi, and Dennis L. Goeckel Department of Computer Science, University of Calgary, Emails: {mdehghan, mghaderi}@ucalgary.ca
More informationCalculation on Coverage & connectivity of random deployed wireless sensor network factors using heterogeneous node
Calculation on Coverage & connectivity of random deployed wireless sensor network factors using heterogeneous node Shikha Nema*, Branch CTA Ganga Ganga College of Technology, Jabalpur (M.P) ABSTRACT A
More informationA Wireless Array Based Cooperative Sensing Model in Sensor Networks
A Wireless Array Based Cooperative Sensing Model in Sensor Networks W. Li, Y. I. Kamil and A. Manikas Department of Electrical and Electronic Engineering Imperial College London, UK E-mail: {victor.li,
More informationPaper Presentation. Steve Jan. March 5, Virginia Tech. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
Paper Presentation Steve Jan Virginia Tech March 5, 2015 Steve Jan (Virginia Tech) Paper Presentation March 5, 2015 1 / 28 2 paper to present Nonparametric Multi-group Membership Model for Dynamic Networks,
More informationThe Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization
The Practical Performance of Subgradient Computational Techniques for Mesh Network Utility Optimization Peng Wang and Stephan Bohacek Department of Electrical and Computer Engineering University of Delaware,
More informationTICRec: A Probabilistic Framework to Utilize Temporal Influence Correlations for Time-aware Location Recommendations
: A Probabilistic Framework to Utilize Temporal Influence Correlations for Time-aware Location Recommendations Jia-Dong Zhang, Chi-Yin Chow, Member, IEEE Abstract In location-based social networks (LBSNs),
More informationOptimal Coded Information Network Design and Management via Improved Characterizations of the Binary Entropy Function
Optimal Coded Information Network Design and Management via Improved Characterizations of the Binary Entropy Function John MacLaren Walsh & Steven Weber Department of Electrical and Computer Engineering
More informationRethinking Offloading WiFi Access Point Deployment from User Perspective
Workshop on Smart Environments & Urban Networking, (SEUNet) in Proc. IEEE WiMob 2016, New York, NY, October 17, 2016, pp. 59-65. Rethinking Offloading WiFi Access Point Deployment from User Perspective
More informationUnderstanding Channel and Interface Heterogeneity in Multi-channel Multi-radio Wireless Mesh Networks
Understanding Channel and Interface Heterogeneity in Multi-channel Multi-radio Wireless Mesh Networks Anand Prabhu Subramanian, Jing Cao 2, Chul Sung, Samir R. Das Stony Brook University, NY, U.S.A. 2
More informationIndoor Positioning Technology Based on Multipath Effect Analysis Bing Xu1, a, Feng Hong2,b, Xingyuan Chen 3,c, Jin Zhang2,d, Shikai Shen1, e
3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 06) Indoor Positioning Technology Based on Multipath Effect Analysis Bing Xu, a, Feng Hong,b, Xingyuan
More informationConstructing K-Connected M-Dominating Sets
Constructing K-Connected M-Dominating Sets in Wireless Sensor Networks Yiwei Wu, Feng Wang, My T. Thai and Yingshu Li Georgia State University Arizona State University University of Florida Outline Introduction
More informationMULTIPLEX Foundational Research on MULTIlevel complex networks and systems
MULTIPLEX Foundational Research on MULTIlevel complex networks and systems Guido Caldarelli IMT Alti Studi Lucca node leaders Other (not all!) Colleagues The Science of Complex Systems is regarded as
More informationImproved MDS-based Algorithm for Nodes Localization in Wireless Sensor Networks
Improved MDS-based Algorithm for Nodes Localization in Wireless Sensor Networks Biljana Risteska Stojkoska, Vesna Kirandziska Faculty of Computer Science and Engineering University "Ss. Cyril and Methodius"
More informationGateways Placement in Backbone Wireless Mesh Networks
I. J. Communications, Network and System Sciences, 2009, 1, 1-89 Published Online February 2009 in SciRes (http://www.scirp.org/journal/ijcns/). Gateways Placement in Backbone Wireless Mesh Networks Abstract
More informationThe Genetic Algorithm
The Genetic Algorithm The Genetic Algorithm, (GA) is finding increasing applications in electromagnetics including antenna design. In this lesson we will learn about some of these techniques so you are
More informationAd Hoc and Neighborhood Search Methods for Placement of Mesh Routers in Wireless Mesh Networks
29 29th IEEE International Conference on Distributed Computing Systems Workshops Ad Hoc and Neighborhood Search Methods for Placement of Mesh Routers in Wireless Mesh Networks Fatos Xhafa Department of
More informationScheduling Data Collection with Dynamic Traffic Patterns in Wireless Sensor Networks
Scheduling Data Collection with Dynamic Traffic Patterns in Wireless Sensor Networks Wenbo Zhao and Xueyan Tang School of Computer Engineering, Nanyang Technological University, Singapore 639798 Email:
More informationA VORONOI DIAGRAM-BASED APPROACH FOR ANALYZING AREA COVERAGE OF VARIOUS NODE DEPLOYMENT SCHEMES IN WSNS
A VORONOI DIAGRAM-BASED APPROACH FOR ANALYZING AREA COVERAGE OF VARIOUS NODE DEPLOYMENT SCHEMES IN WSNS G Sanjiv Rao 1 and V Vallikumari 2 1 Associate Professor, Dept of CSE, Sri Sai Aditya Institute of
More informationSmart Deployment/Movement of Unmanned Air Vehicle to Improve Connectivity in MANET
Smart Deployment/Movement of Unmanned Air Vehicle to Improve Connectivity in MANET Zhu Han, A. Lee Swindlehurst, and K. J. Ray Liu Electrical and Computer Engineering Department, University of Maryland,
More informationLCRT: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment
: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment Lei Jiao, Frank Y. Li Dept. of Information and Communication Technology University of Agder (UiA) N-4898 Grimstad, rway Email: {lei.jiao;
More informationEffects of Beamforming on the Connectivity of Ad Hoc Networks
Effects of Beamforming on the Connectivity of Ad Hoc Networks Xiangyun Zhou, Haley M. Jones, Salman Durrani and Adele Scott Department of Engineering, CECS The Australian National University Canberra ACT,
More informationA novel, broadcasting-based algorithm for vehicle speed estimation in Intelligent Transportation Systems using ad-hoc networks
A novel, broadcasting-based algorithm for vehicle speed estimation in Intelligent Transportation Systems using ad-hoc networks Boyan Petrov 1, Dr Evtim Peytchev 2 1 Faculty of Computer Systems and Control,
More informationOptimal Power Control Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Optimal Power Control Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks Jatinder Singh Saini 1 Research Scholar, I.K.Gujral Punjab Technical University, Jalandhar, Punajb, India. Balwinder
More informationYour Neighbors Affect Your Ratings: On Geographical Neighborhood Influence to Rating Prediction
Your Neighbors Affect Your Ratings: On Geographical Neighborhood Influence to Rating Prediction Longke Hu Aixin Sun Yong Liu Nanyang Technological University Singapore Outline 1 Introduction 2 Data analysis
More informationS-GPBE: A Power-Efficient Broadcast Routing Algorithm Using Sectored Antenna
S-GPBE: A Power-Efficient Broadcast Routing Algorithm Using Sectored Antenna Intae Kang and Radha Poovendran Department of Electrical Engineering, University of Washington, Seattle, WA. - email: {kangit,radha}@ee.washington.edu
More informationOn the problem of energy efficiency of multi-hop vs one-hop routing in Wireless Sensor Networks
On the problem of energy efficiency of multi-hop vs one-hop routing in Wireless Sensor Networks Symon Fedor and Martin Collier Research Institute for Networks and Communications Engineering (RINCE), Dublin
More informationSENSOR PLACEMENT FOR MAXIMIZING LIFETIME PER UNIT COST IN WIRELESS SENSOR NETWORKS
SENSOR PACEMENT FOR MAXIMIZING IFETIME PER UNIT COST IN WIREESS SENSOR NETWORKS Yunxia Chen, Chen-Nee Chuah, and Qing Zhao Department of Electrical and Computer Engineering University of California, Davis,
More informationDAL: A Distributed Localization in Sensor Networks Using Local Angle Measurement
1 DAL: A Distributed Localization in Sensor Networks Using Local Angle Measurement Bin Tang, Xianjin Zhu, Anandprabhu Subramanian, Jie Gao Abstract We study the localization problem in sensor networks
More informationEnergy-efficient Broadcast Scheduling with Minimum Latency for Low-Duty-Cycle Wireless Sensor Networks
2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems Energy-efficient Broadcast Scheduling with Minimum Latency for Low-Duty-Cycle Wireless Sensor Networks Lijie Xu, Jiannong Cao,
More informationInternational Journal of Advance Engineering and Research Development (IJAERD) Volume 1,Issue 5,May 2014, e-issn: , print-issn:
Modified Route Maintenance in AODV Routing Protocol ChiragBhalodia (M.Tech, Research Scholar) 1, Prof. Amit M. Lathigara 2 Pg Scholar, Computer Engineering Department & R K University, chiragsbhalodia@gmail.com
More informationPhase Transition Phenomena in Wireless Ad Hoc Networks
Phase Transition Phenomena in Wireless Ad Hoc Networks Bhaskar Krishnamachari y, Stephen B. Wicker y, and Rámon Béjar x yschool of Electrical and Computer Engineering xintelligent Information Systems Institute,
More informationT. Yoo, E. Setton, X. Zhu, Pr. Goldsmith and Pr. Girod Department of Electrical Engineering Stanford University
Cross-layer design for video streaming over wireless ad hoc networks T. Yoo, E. Setton, X. Zhu, Pr. Goldsmith and Pr. Girod Department of Electrical Engineering Stanford University Outline Cross-layer
More informationSmart Grid Reconfiguration Using Genetic Algorithm and NSGA-II
Smart Grid Reconfiguration Using Genetic Algorithm and NSGA-II 1 * Sangeeta Jagdish Gurjar, 2 Urvish Mewada, 3 * Parita Vinodbhai Desai 1 Department of Electrical Engineering, AIT, Gujarat Technical University,
More informationGenetic Algorithm-Based Approach to Spectrum Allocation and Power Control with Constraints in Cognitive Radio Networks
Research Journal of Applied Sciences, Engineering and Technology 5(): -7, 23 ISSN: 24-7459; e-issn: 24-7467 Maxwell Scientific Organization, 23 Submitted: March 26, 22 Accepted: April 7, 22 Published:
More informationOptimization of Tile Sets for DNA Self- Assembly
Optimization of Tile Sets for DNA Self- Assembly Joel Gawarecki Department of Computer Science Simpson College Indianola, IA 50125 joel.gawarecki@my.simpson.edu Adam Smith Department of Computer Science
More informationSimple, Optimal, Fast, and Robust Wireless Random Medium Access Control
Simple, Optimal, Fast, and Robust Wireless Random Medium Access Control Jianwei Huang Department of Information Engineering The Chinese University of Hong Kong KAIST-CUHK Workshop July 2009 J. Huang (CUHK)
More informationBandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation
Bandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation Xiliang Liu Joint work with Kaliappa Ravindran and Dmitri Loguinov Department of Computer Science City University of New
More informationComparing the ns 3 Propagation Models
Comparing the ns 3 Propagation Models Mirko Stoffers School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, Georgia, USA Email: stoffers@gatech.edu George Riley School of
More informationLocation Discovery in Sensor Network
Location Discovery in Sensor Network Pin Nie Telecommunications Software and Multimedia Laboratory Helsinki University of Technology niepin@cc.hut.fi Abstract One established trend in electronics is micromation.
More informationDV-HOP LOCALIZATION ALGORITHM IMPROVEMENT OF WIRELESS SENSOR NETWORK
DV-HOP LOCALIZATION ALGORITHM IMPROVEMENT OF WIRELESS SENSOR NETWORK CHUAN CAI, LIANG YUAN School of Information Engineering, Chongqing City Management College, Chongqing, China E-mail: 1 caichuan75@163.com,
More information3432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 10, OCTOBER 2007
3432 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 53, NO 10, OCTOBER 2007 Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution Yingbin Liang, Member, IEEE, Venugopal V Veeravalli, Fellow,
More informationAn Optimisation-based Approach for Wireless Sensor Deployment in Mobile Sensing Environments
An Optimisation-based Approach for Wireless Sensor Deployment in Mobile Sensing Environments Farshid Hassani ijarbooneh, Pierre Flener, Edith C.-H. Ngai, and Justin Pearson Department of Information Technology,
More informationEnergy-aware Task Scheduling in Wireless Sensor Networks based on Cooperative Reinforcement Learning
Energy-aware Task Scheduling in Wireless Sensor Networks based on Cooperative Reinforcement Learning Muhidul Islam Khan, Bernhard Rinner Institute of Networked and Embedded Systems Alpen-Adria Universität
More informationStatic Path Planning for Mobile Beacons to Localize Sensor Networks
Static Path Planning for Mobile Beacons to Localize Sensor Networks Rui Huang and Gergely V. Záruba Computer Science and Engineering Department The University of Texas at Arlington 416 Yates, 3NH, Arlington,
More informationAccess point selection algorithms for maximizing throughputs in wireless LAN environment
Access point selection algorithms for maximizing throughputs in wireless LAN environment Akihiro Fujiwara Yasuhiro Sagara Masahiko Nakamura Department of Computer Science and Electronics Kyushu Institute
More informationOptimal Relay Placement for Cellular Coverage Extension
Optimal elay Placement for Cellular Coverage Extension Gauri Joshi, Abhay Karandikar Department of Electrical Engineering Indian Institute of Technology Bombay Powai, India 400076. Email: gaurijoshi@iitb.ac.in,
More informationAn Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks
Article An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks Prasan Kumar Sahoo 1, Ming-Jer Chiang 2 and Shih-Lin Wu 1,3, * 1 Department of Computer Science and Information
More informationFault-tolerant Coverage in Dense Wireless Sensor Networks
Fault-tolerant Coverage in Dense Wireless Sensor Networks Akshaye Dhawan and Magdalena Parks Department of Mathematics and Computer Science, Ursinus College, 610 E Main Street, Collegeville, PA, USA {adhawan,
More informationToward 5G:A Novel Sleeping Strategy for Green Distributed Base Stations in Small Cell Networks
2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks Toward 5G:A Novel Sleeping Strategy for Green Distributed Base Stations in Small Cell Networks Yiwei Xu, Jin Chen, Ducheng Wu and
More informationComposite Event Detection in Wireless Sensor Networks
Composite Event Detection in Wireless Sensor Networks Chinh T. Vu, Raheem A. Beyah and Yingshu Li Department of Computer Science, Georgia State University Atlanta, Georgia 30303 {chinhvtr, rbeyah, yli}@cs.gsu.edu
More informationA Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu
More informationNon-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks
Non-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks arxiv:1001.0080v1 [cs.it] 31 Dec 2009 Hongyang Chen 1, Kenneth W. K. Lui 2, Zizhuo Wang 3, H. C. So 2,
More informationThe Performance Loss of Unilateral Interference Cancellation
The Performance Loss of Unilateral Interference Cancellation Luis Miguel Cortés-Peña, John R. Barry, and Douglas M. Blough School of Electrical and Computer Engineering Georgia Institute of Technology
More informationMobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks
Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks A. P. Azad and A. Chockalingam Department of ECE, Indian Institute of Science, Bangalore 5612, India Abstract Increasing
More informationCost-Aware Route Selection in Wireless Mesh Networks
Cost-Aware Route Selection in Wireless Mesh Networks Junmo Yang 1, Kazuya Sakai 2, Bonam Kim 1, Hiromi Okada 2, and Min-Te Sun 1 1 Department of Computer Science and Software Engineering, Auburn University,
More informationPW-MMAC: Predictive-Wakeup Multi-Channel MAC Protocol for Wireless Sensor Networks
26 UKSim-AMSS 8th International Conference on Computer Modelling and Simulation : Predictive-Wakeup Multi-Channel MAC Protocol for Wireless Sensor Networks Shagufta Henna Computer Science Department Bahria
More informationLocating in Crowdsourcing-based DataSpace: Wireless Indoor Localization without Special Devices
Noname manuscript No. (will be inserted by the editor) Locating in Crowdsourcing-based DataSpace: Wireless Indoor Localization without Special Devices Yuanfang Chen Lei Shu Antonio M. Ortiz Noel Crespi
More informationTopology identification of complex networks from noisy time series CCCN using 2010 ROC curve 1 / 31ana
Topology identification of complex networks from noisy time series using ROC curve analysis Juan CHEN and Jun-an LU Email: juanchen1220@yahoo.com.cn School of Mathematics and Statistics Wuhan University
More informationEnergy-Efficient Data Management for Sensor Networks
Energy-Efficient Data Management for Sensor Networks Al Demers, Cornell University ademers@cs.cornell.edu Johannes Gehrke, Cornell University Rajmohan Rajaraman, Northeastern University Niki Trigoni, Cornell
More informationModeling Hop Length Distributions for Reactive Routing Protocols in One Dimensional MANETs
This full tet paper was peer reviewed at the direction of IEEE Communications Society subject matter eperts for publication in the ICC 27 proceedings. Modeling Hop Length Distributions for Reactive Routing
More informationStrengthening Barrier-coverage of Static Sensor Network with Mobile Sensor Nodes
Noname manuscript No. (will be inserted by the editor) Strengthening Barrier-coverage of Static Sensor Network with Mobile Sensor Nodes Biaofei Xu Yuqing Zhu Donghyun Kim Deying Li Huaipan Jiang Alade
More informationOpen-Loop and Closed-Loop Uplink Power Control for LTE System
Open-Loop and Closed-Loop Uplink Power Control for LTE System by Huang Jing ID:5100309404 2013/06/22 Abstract-Uplink power control in Long Term Evolution consists of an open-loop scheme handled by the
More informationConsensus Algorithms for Distributed Spectrum Sensing Based on Goodness of Fit Test in Cognitive Radio Networks
Consensus Algorithms for Distributed Spectrum Sensing Based on Goodness of Fit Test in Cognitive Radio Networks Djamel TEGUIG, Bart SCHEERS, Vincent LE NIR Department CISS Royal Military Academy Brussels,
More informationENERGY EFFICIENT SENSOR NODE DESIGN IN WIRELESS SENSOR NETWORKS
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 4, April 2014,
More informationTime Efficient Data Aggregation Scheduling in Cognitive Radio Networks
Time Efficient Data Aggregation Scheduling in Cognitive Radio Networks Mingyuan Yan, Shouling Ji,, and Zhipeng Cai Department of Computer Science, Georgia State University, Atlanta, Georgia 333, USA Email:
More information