Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong.

Slides:



Advertisements
Similar presentations
Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Secrecy Capacity Scaling of Large-Scale Cognitive Networks Yitao Chen 1, Jinbei Zhang 1, Xinbing Wang 1, Xiaohua Tian 1, Weijie Wu 1, Fan Fu 2, Chee Wei.
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks Xiao Wang, Xinbing Wang, Jun Zhao Department of Electronic.
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,
The Capacity of Wireless Ad Hoc Networks
MotionCast: On the Capacity and Delay Tradeoffs Chenhui Hu 1, Xinbing Wang 1, Feng Wu 2 1 Institute of Wireless Communication Technology (IWCT) Shanghai.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Peering in Infrastructure Ad hoc Networks Mentor : Linhai He Group : Matulya Bansal Sanjeev Kohli EE 228a Course Project.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Mobile Ad hoc Networks COE 549 Delay and Capacity Tradeoffs II Tarek Sheltami KFUPM CCSE COE 8/6/20151.
Critical Transmission Range for Mobile Clustered Wireless Networks Qi Wang, Liang Liu, Xinbing Wang Department of Electronic Engineering Shanghai Jiao.
Optimal Multicast Capacity and Delay Tradeoffs in MANETs: A Global Perspective Yun Wang, Xiaoyu Chu, Xinbing Wang Department of Electronic Engineering.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Mobility Weakens the Distinction between Multicast and Unicast Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University Shanghai, China.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
Maximizing Lifetime of Ad Hoc Networks/WSNs Using Dynamic Broadcast Scheme Guofeng Deng.
Energy-Efficient Protocol for Cooperative Networks IEEE/ACM Transactions on Networking, Apr Mohamed Elhawary, Zygmunt J. Haas Yong Zhou
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Wireless Networks Spring 2005 Capacity of Ad Hoc Networks.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Convergecast with MIMO Luoyi Fu, Yi Qin, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Xue Liu Department of Computer.
Optimal Selection of Power Saving Classes in IEEE e Lei Kong, Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University.
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks Authors Sarma Upadhyayula, Valliappan Annamalai, Sandeep Gupta.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.
1 G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science and.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Capacity of Large Scale Wireless Networks with Directional Antenna and Delay Constraint Guanglin Zhang IWCT, SJTU 26 Sept, 2012 INC, CUHK 1.
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
S. K. S. Gupta, Arizona State Univ On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science.
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
Bin Wang, Arizona State Univ S-REMiT: A Distributed Algorithm for Source-based Energy Efficient Multicasting in Wireless Ad Hoc Networks Bin Wang and Sandeep.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Group Multicast Capacity in Large Scale Wireless Networks
Effectiveness of the 2-hop Routing Strategy in MANETS
Capacity of Ad Hoc Networks
Gaurav Sharma,Ravi Mazumdar,Ness Shroff
Presentation transcript:

Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Xiaojun Lin Department of Electrical and Computer Engineering Purdue University, USA

Mobility Increases the Connectivity of K-hop Clustered Wireless Networks 2 Outline  Introduction  Background  Motivations  Objectives  K-hop Clustered Network Models  Main Results and Intuitions  The Impact of Mobility  Concluding Remarks

3 Background – I/II  Connectivity is a basic concern in designing and implementing wireless networks.  Three main schemes of connecting strategies are proposed in the literature.  Distance-based strategy  Number-of-neighbor-based strategy  Sector-based strategy Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

4 Background – II/II  The connectivity of networks under the distance-based connecting strategy is widely studied:  The critical value of, overall connectivity can be established with probability approaching one as if and only if [1] [2]. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks [1] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks”, [2] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree”, 1997.

5 Motivation  The network models studied in these prior works are non-clustered (or flat) and stationary networks.  Clustering and mobility have been found to improve various aspects of network performance.  Studies on the connectivity of mobile and clustered networks are quite limited. --- We don’t even know the definition of the connectivity under such circumstances. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

6 Objective – I/II  Open question:  What is the impact of mobility on connectivity of clustered networks subject to delay constraints?  We study  The critical transmission range for connectivity  K-hop mobile clustered networks (delay guarantee)  Random walk mobility model with non-trivial velocity  i.i.d. mobility model (fast mobility).

Mobility Increases the Connectivity of K-hop Clustered Wireless Networks 7 Objective – II/II  We compare with the critical transmission range for connectivity in stationary k-hop clustered networks.  Implications on  the power-delay trade-off  the energy efficiency  Our results show that: Mobility does improve connectivity in k-hop clustered networks, and it also significantly decreases the energy consumption and the power-delay trade-off. Mobility does improve connectivity in k-hop clustered networks, and it also significantly decreases the energy consumption and the power-delay trade-off.

8 Outline Introduction K-hop Clustered Network Models  An overview of flat networks  K-hop clustered network models Main Results and Intuitions The Impact of Mobility Concluding Remarks Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

9 An Overview of Flat Networks  Defining Connectivity in Flat Networks  Let A denote a unit area in R 2, and G (n) be the graph formed when n nodes are placed uniformly and independently in A.  An edge e ij exists between two nodes i and j, if the distance between them is less than r(n ) under the distance-based strategy. Flat networks under the distance-based connecting strategy Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

10 K-hop Clustered Network Models  Clustered networks  n normal nodes and n d cluster-head nodes  Static or mobile  Mobility Model  Random Walk Mobility Model with Non-Trivial Velocity –Uniformly chosen direction –Constant velocity (continuous path)  I.I.D. Mobility Model –Independently and uniformly reshuffled –Static within a single time slot Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

11 Mobile Networks: Transmission Scheme  TTL (time to live): the number of hops that the packet has been forwarded.  SYN (synchronize): preamble for data-flows synchroni- zation Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

12 Mobile Networks: Routing Strategy  Direct delivery to the cluster head without relay Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

13 Clustered Network Models  For stationary k-hop clustered networks, we say that a cluster member is connected if it can reach a cluster head within k hops.  For mobile clustered networks, a cluster member is connected if it can reach a cluster head within k slots.  If all the cluster members in a network are connected, we define that the network has full connectivity. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

14 Outline Introduction K-hop Clustered Network Models Main Results and Intuitions  Definition of critical transmission range  Main results  Intuitive explanations The Impact of Mobility Concluding Remarks Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

15 Critical Transmission Range  Definition: For stationary or mobile k-hop clustered networks, r(n) is the critical transmission range if E: the event that all cluster members are connected E: the event that all cluster members are connected Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

16 Main Results  Under the random walk mobility pattern, the critical transmission range is, where d is the cluster head exponent, 0 < d ≤ 1, and v is the velocity of all member nodes.  Under the i.i.d. mobility pattern, the critical transmission range is, where 1/k < d ≤ 1.  For stationary k-hop clustered networks, the critical transmission range is, where 0 < d < 1. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

17 Intuitive Explanations – I/II  Suppose there are n cluster members and n d cluster heads uniformly distributed in a unit square. Thus, roughly speaking, there is one cluster head within an area of 1/n d.  Area argument for random walk mobility: Mobility Increases the Connectivity of K-hop Clustered Wireless Networks k·vk·v r(n)

18 Intuitive Explanations – I/II  Area argument for i.i.d mobility: Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

19 Intuitive Explanations – II/II  Area argument for static case: Mobility Increases the Connectivity of K-hop Clustered Wireless Networks … k · r(n)

20 Outline Introduction K-hop Clustered Network Models Main Results and Intuitions The Impact of Mobility  Transmission power  Energy consumption per flow  Discussion Concluding Remarks Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

21 Transmission Power – I/II  We assume the free space propagation model, i.e., P t = transmission power of an isotropic source, G t = transmitting antenna gain, G r = receiving antenna gain, l = propagation distance between antennas, λ = carrier wavelength. λ = carrier wavelength.  Replace Pr with Pr th and replace the propagation distance l by the transmission range r. We then have Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

22 Energy Consumption  Let Ē denote the energy consumption per flow. where is the average number of hops per flow.  P t affects a single node in energy-constrained networks like wireless sensor networks.  Ē provides a picture of the life-time expectation both of each single node and of the entire network. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

23 Discussion – I/VI  Note that in these calculations, we have ignored the energy consumption due to mobility. Hence, these results should not be interpreted as a reason to introduce mobility to an otherwise static network, but rather represent an inherent advantage of having mobility in the system.  Similarly, the comparison with the flat network is not entirely fair, since in a clustered network, a packet only needs to reach a cluster head. Hence, our following results should be viewed as an inherent advantage of clustered network due to the availability of infrastructure support. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

24 Discussion – II/VI  Using the previous results of the critical transmission range r(n), we can compute the order of P t and Ē. All the results in this paper are reported in the following table. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

25 Discussion – III/VI  We have 3   random walk mobility with clustering can increase the number of transmission that a node can undertake and extend the life-time both of each single node and of the entire network. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks 3 Note: By the implication from [27], we know that when d 1/2 in our following discussion. [27] S. Toumpis, “Capacity Bounds for Three Classes of Wireless Networks: Asymmetric, Cluster, and Hybrid”, 2004.

26 Discussion – IV/VI  We have  To identify the contribution of mobility and k-hop clustering on the improvement of network performance, we have Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

27 Discussion – V/VI  We have  From the perspective of energy consumption per flow, clustered networks have an inherent advantage in terms of energy-efficiency due to the availability of infrastructure support.  Mobile k-hop clustered networks under the i.i.d mobility model and stationary clustered networks may have comparable performance and this can be understood intuitively since nodes under the i.i.d. mobility model actually remain static during the time-slot. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

28 Discussion – VI/VI  In conclusion, random walk mobility with non-trivial velocity increases connectivity in k-hop clustered networks, and thus significantly improves the energy efficiency and the power-delay trade-off of the network. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

29 Outline Introduction K-hop Clustered Network Models Main Results and Intuitions The Impact of Mobility Concluding Remarks Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

30 Concluding Remarks – I/II  We have studied the effects of mobility on the critical transmission range for asymptotic connectivity in k-hop clustered networks.  Our contributions are twofold.  developed the critical transmission range for the mobile k-hop clustered network under the random walk mobility model with non- trivial velocity and the i.i.d. mobility model, and for the stationary k- hop clustered network, respectively.  These formulations not only provide an asymptotic description of the critical power needed to maintain the connectivity of the network, but also help to identify the contribution of mobility in the improvement of network performance. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

31 Concluding Remarks – II/II  For future work:  Extend the results for the random walk mobility model to account for the case where each node moves with different speed;  In our current model for random walk, each node changes direction after one time-slot. An interesting extension is to study the case where the change of directions occurs at random times (e.g., a node may move a random distance before it changes direction).  Account for wireless interference in the system.  It would be interesting to study the case where cluster-heads may move as well. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

Thank you !

33 Reference – I/II  [1] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, Boston: Birkhauser,  [2] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” Annals of Applied Probability, vol. 7, pp ,  [8] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on Information Theory, vol. 46, pp , March  [9] P. Gupta, R. Gray, and P.R. Kumar, “An Experimental Scaling Law for Ad Hoc Networks,” Univ. of Illinois at Urbana-Champaign, May  [10] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-efficient Communication Protocol for Wireless Micro Sensor Networks,” in Proc. the 33rd Annual Hawaii International Conference on System Sciences, pp ,  [11] Qiangfeng Jiang and D. Manivannan, “Routing Protocols for Sensor Networks,” in Consumer Communications and Networking Conference (CCNC 2004), pp ,  [19] U. Kozat and L. Tassiulas, “Throughput capacity of random ad hoc networks with infrastructure support,” in Proc. ACM MobiCom 2003, Annapolis, MD, USA, June  [20] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks,” IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp , August Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

34 Reference – II/II  [21] S. Čapkun, J. Hubaux and L. Buttyán, “Mobility Helps Security in Ad Hoc Networks,” in Proc. ACM MobiHoc 2003, June  [27] S. Toumpis, “Capacity Bounds for Three Classes of Wireless Networks: Asymmetric, Cluster, and Hybrid,” in Proc. ACM MobiHoc 2004, pp , Roppongi, Japan, May 24-26, Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

35 Mobility Pattern – II/II  Due to the assumption that v = Θ(1), the mixing time under the r.w. mobility model is on the same order as the mixing time under the i.i.d. mobility model.  However, since under the r.w. mobility model nodes can communicate during the course of movement, they will have a higher chance to connect to the cluster head compared to nodes under the i.i.d. mobility model. 1 1 Note : This advantage will become clear after we define the transmission scheme. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

36 Motivation – II/II  In a clustered network, a packet only needs to reach one of the cluster heads.  In a stationary k-hop clustered network, a packet must reach a cluster head within k hops.  In a mobile k-hop clustered network, a packet must reach a cluster head directly in k time-slots.  Clearly, clustering has an inherent advantage compared to flat networks, and it can alter the energy efficiency and delay of the system.  a different critical transmission range for connectivity  different delay  different energy consumption of the network Mobility Increases the Connectivity of K-hop Clustered Wireless Networks

37 Routing Strategy – II/II  Such an assumption would be valid when  The cluster heads are static and the cluster member has knowledge of its own position and the positions of cluster heads;  The cluster heads broadcast a pilot signal that covers the transmission range of a cluster member.  We do not actually use multi-hop transmissions in mobile k-hop clustered networks because multi-hop transmissions require significantly higher overhead due to the need to discover cluster-heads at a further distance away and to establish multi-hop paths on demand.  We proposed a simplified routing strategy to avoid the technicalities of a more complicated one which may obscure our main target. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks