On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic Sundar Subramanian, Sanjay Shakkottai and Piyush Gupta INFOCOM 2007.

Slides:



Advertisements
Similar presentations
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
A Presentation by: Noman Shahreyar
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
Good afternoon everyone.
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks ACM Wireless Networks Journal, 2002 BENJIE CHEN,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
The Capacity of Wireless Ad Hoc Networks
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
EE 4272Spring, 2003 Chapter 10 Packet Switching Packet Switching Principles  Switching Techniques  Packet Size  Comparison of Circuit Switching & Packet.
Reducing Congestion Effects in Wireless Networks by Multipath Routing Presented by Dian Zhang Lucian Popa, Costin Raiciu, University of California, Berkeley.
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.
Avoiding Energy Holes in Wireless Sensor Network with Nonuniform Node Distribution Xiaobing Wu, Guihai Chen and Sajal K. Das Parallel and Distributed Systems.
Ad Hoc Networking Course Instructor: Carlos Pomalaza-Ráez Geographical Routing Using Partial Information for Wireless Ad Hoc Networks Rahul Jain, Anuj.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York, Stony Brook.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Vikramaditya. What is a Sensor Network?  Sensor networks mainly constitute of inexpensive sensors densely deployed for data collection from the field.
Distributed Asynchronous Bellman-Ford Algorithm
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Multihop wireless networks Geographical Routing Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, in MobiCom Using.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
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.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Xiaobing Wu, Guihai Chen
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
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.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
Network Coding Data Collecting Mechanism based on Prioritized Degree Distribution in Wireless Sensor Network Wei Zhang, Xianghua Xu, Qinchao Zhang, Jian.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Structure-Free Data Aggregation in Sensor Networks.
ProgessFace: An Algorithm to Improve Routing Efficiency of GPSR-like Routing Protocols in Wireless Ad Hoc Networks Chia-Hung Lin, Shiao-An Yuan, Shih-Wei.
1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
IMPROVING OF WIRELESS MESH NETWORKS.
Xiaobing Wu, Guihai Chen and Sajal K. Das
GPSR Greedy Perimeter Stateless Routing
Zhen Jiang Comp. Sci. Dept. West Chester University
Shape Segmentation and Applications in Sensor Networks
Presentation transcript:

On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic Sundar Subramanian, Sanjay Shakkottai and Piyush Gupta INFOCOM 2007

Outline Introduction Network Model Randomway Algorithm Routing for non-uniform traffic patterns Extending non uniform traffic to networks with Holes Conclusion

Introduction Geographic forwarding based techniques have been widely suggested as an efficient routing method for wireless and sensor networks not required to maintain extensive routing tables make simple routing decisions based on the local geographic position

Introduction The geographic forwarding strategies in non-uniform networks may fail due to a forwarding node does not have any neighboring nodes that are closer to the destination may get stuck in routing “ holes ” or local minima

Introduction

X

switching to a boundary tracing scheme

Introduction

Currently known schemes only allow for small variations (within Θ(1/√n)) in node data rates (The capacity of wireless networks) Wireless networks may demand widely varying data rates mixture of video flows short messaging

Introduction -GOAL Randomized geographic routing scheme that can achieve a throughput capacity Construct a geographic forwarding based routing scheme that can support wide variations in the traffic requirements

Network Model nodes are uniformly and randomly distributed over a unit toroidal region Nodes have a uniform circular transmission range

Network Model To model the effect of network “ holes ” due to various factors physical obstacles clusters of failed nodes

Network Model X

X X X

X

Assume n/2 random source nodes and randomly choose destination nodes for each traffic source node uniformly and independently The throughput capacity T(n) of a network is defined as the maximum data-rate

Randomway (n,K) Algorithm To have a few extra fields

Randomway (n,K) Algorithm (1) The source node for every traffic flow creates Rlog(n) copies of its packet to send It chooses Rlog(n) independent and uniformly distributed points To sets the NEXT-DEST field to the randomly generated location in each of these copies WAYPOINT-NUM is set to 4K + 1

Randomway (n,K) Algorithm (2) The Rlog(n) packets are routed from the source in a Greedy geographic manner to the location in NEXTDEST.

Randomway (n,K) Algorithm (3) If it is not the NEXT-DEST location it searches within its neighboring nodes is closest to the NEXT-DEST location if none of its neighbor nodes are closer to the NEXT-DEST drop the packet

Randomway (n,K) Algorithm (4) If it is the NEXT-DEST location If WAYPOINT-NUM > 1 sets WAYPOINTNUM = WAYPOINT-NUM – 1 Repeat the first step If WAYPOINT-NUM = 1, sets NEXT-DEST = FINAL-DEST WAYPOINT-NUM = 0 If WAYPOINT-NUM = 0, the packet is received at the destination

Randomway (n,K) Algorithm

For general Geographic forwarding based X

Randomway (n,K) Algorithm For general Geographic forwarding based

Randomway (n,K) Algorithm X X

X

X

H(j) be the number of source-destination pairs that generate a line that touches tile j 2(Rlog(n)) 4K+1 √n The number of paths passing though any tile j is at most H(j) ∗ (Rlog(n)) 4K+1 = √n(Rlog(n)) 8K+2

Randomway (n,K) Algorithm The number of packet routes is no more than√n(Rlog(n)) 8K+2 T(n) = Θ( 1 /√n(log n) P ) P <∞ is achievable

Routing for non-uniform traffic patterns In many scenarios the traffic demands could be non-uniform Video flows, short messaging To provide a constructive scheme (RANDOMSPREAD) to distribute the traffic flows uniformly over the region

Routing for non-uniform traffic patterns Create √n routes simultaneously to the destination Using a three meta-hop path

Routing for non-uniform traffic patterns

Partition the packet-routes in the network into 4 disjoint classes T1: Packet routes generated by type-a source nodes to their corresponding destinations. T2: Outward lines radiating from source nodes to their first intermediate way-point T3: Inward lines radiating into destination nodes from their last intermediate way-points T4: The rest of the packet routes generated between the first and the last intermediate way- points Type-a traffic requirement: Θ( 1 /√n) Type-b traffic requirement: Θ(1)

Extending non uniform traffic to networks with holes The modification to the RANDOMWAY(n,K) is only at the source nodes If a source is a type-b node with Θ(1) traffic requirement transmits √n / (R log(n)) P packets simultaneously 4K+2 way points

Conclusion Presented algorithms for throughput optimal routing in networks with holes and non-uniform traffic preserve the inherent advantages of geographic scalability and fast convergence

Thank you!!