Www.eng.monash.edu Enhanced Gateway Multipoint Relays for Constructing a Small Connected Dominating Set in Wireless Ad Hoc Networks Ou Liang, Ahmet Sekercioglu.

Slides:



Advertisements
Similar presentations
Ou Liang, Ahmet Sekercioglu and Nallasamy Mani
Advertisements

May 21, 2003Wu and Dai, ICDCS A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks Jie Wu and Fei Dai Dept. of Comp. Sci. & Eng. Florida.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
Z-MAC: a Hybrid MAC for Wireless Sensor Networks Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min Dept. of Computer Science, North Carolina State.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
Topic: Routing and Aggregation An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks (Li,Peng,Chu-
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks - Alan Amis, Ravi Prakash, Thai Vuong, Dung Huynh Presenter: Nirav Shah.
1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,
A Low-Cost Flooding Algorithm for Wireless Sensor Networks Department of Electrical and Computer Systems Engineering Monash University,
1 A Distributed and Efficient Flooding Scheme Using 1- Hop Information in Mobile Ad Hoc Networks Department of Computer Science and Information Engineering.
Duplicate address detection and autoconfiguration in OLSR Saadi Boudjit; Cedric Adjih; Anis Laouiti; Paul Muhlethaler Hipercom Project National Institute.
Efficient Flooding in Ad hoc Networks using On-demand (Passive) Cluster Formation ICNS Lab Na Gajin.
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.
Energy-efficient collision-free medium access control for wireless sensor networks Venkatesh Rajendran Katia Obraczka Garcia-Luna-Aceves Department of.
Topology Control and Mobility Management in Mobile Ad Hoc Networks Fei Dai and JIe Wu Department of Electrical and Computer Engineering North Dakota State.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
Design and Analysis of an MST-Based Topology Control Algorithm Ning Li and Jennifer Hou Department of Computer Science University of Illinois at Urbana-Champaign.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Interference-Aware QoS OLSR for Mobile Ad-hoc Network Routing SAWN 2005, May 24 P. Minet & D-Q. Nguyen.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Efficient and Reliable Broadcast in ZigBee Networks Purdue University, Mitsubishi Electric Lab. To appear in SECON 2005.
Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.
Presented by : Joseph Gunawan.  To get the optimal transmission radius for broadcasting using the energy as minimal as possible while it still guarantees.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Tree-Based Double-Covered Broadcast for Wireless Ad Hoc Networks Weisheng Si, Roksana Boreli Anirban Mahanti, Albert Zomaya.
Venkatesh Rajendran, Katia Obraczka, J.J. Garcia-Luna-Aceves
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.
CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.
Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks Paper By: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder Presenter: Ke Gao Instructor:
Carlos Rodrigo Aponte OLSRv2 High Level Overview.
Preserving Area Coverage in Wireless Sensor Networks by using Surface Coverage Relay Dominating Sets Jean Carle, Antoine Gallais and David Simplot-Ryl.
Efficient Backbone Construction Methods in MANETs Using Directional Antennas 1 Shuhui Yang, 1 Jie Wu, 2 Fei Dai 1 Department of Computer Science and Engineering.
Connected Dominating Sets. Motivation for Constructing CDS.
On Reducing Broadcast Redundancy in Wireless Ad Hoc Network Author: Wei Lou, Student Member, IEEE, and Jie Wu, Senior Member, IEEE From IEEE transactions.
A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Efficient Flooding in Ad Hoc Networks: a Comparative Performance Study
Section 7-3 Estimating a Population Mean: σ Known.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.
BROADCASTING TECHNIQUES IN AD-HOC NETWORKS A survey on Shubham Bhat Surendra Shenoy References: 1.“
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks By J. Wu and H. Li Instructor: Dr. Yinghsu Li Presented by: Chinh.
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
A Cluster Based On-demand Multi- Channel MAC Protocol for Wireless Multimedia Sensor Network Cheng Li1, Pu Wang1, Hsiao-Hwa Chen2, and Mohsen Guizani3.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Constructing K-Connected M-Dominating Sets in Wireless Sensor Networks Yiwei Wu, Feng Wang, My T. Thai and Yingshu Li Georgia State University Arizona.
On Multihop Communications For In-Vehicle Internet Access Based On a TDMA MAC Protocol Hassan Aboubakr Omar ∗, Weihua Zhuang ∗, and Li Li† ∗ Department.
Structure-Free Data Aggregation in Sensor Networks.
March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.
1 Optimized Link State Routing Protocol for Ad Hoc Networks Jacquet, p IEEE INMIC Dec park gi won
Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.
Time Synchronization in based MANETs Ten H. Lai Ohio State University.
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Ad Hoc Radio Networks Radio Network is a collection of transmitter-receiver devices (denoted as notes). Each node can transmit data to nodes which exist.
LOAD SENSITIVE CONTENTION RESOLUTION MAC-PROTOCOL
Department of Computer Science University of York
On Constructing k-Connected k-Dominating Set in Wireless Networks
Constructing a m-connected k-Dominating Set in Unit Disc Graphs
Presentation transcript:

Enhanced Gateway Multipoint Relays for Constructing a Small Connected Dominating Set in Wireless Ad Hoc Networks Ou Liang, Ahmet Sekercioglu and Nallasamy Mani Department of Electrical and Computer Systems Engineering Monash University, Australia

2 Sections 1.An overview of Gateway Multipoint Relays (GMPR). 2.A drawback of GMPR. 3.Our enhancement. 4.Conclusion.

3 Gateway Multipoint Relays (GMPR) It’s a combination of clustering and Multipoint Relays methods. Each node can be in one of the four states: Dominator, Dominatee, connector, candidate. Dominators and connectors create a connected dominating set (CDS) in the network. Only nodes in the CDS retransmit broadcast packets. Section 1Section 2Section 3Section 4

4 Connected dominating set (CDS) Section 1Section 2Section 3Section 4 A CDS is a set of nodes where all nodes in the network are either in the CDS or have at least one neighbor node in the CDS. The graph induced by nodes in the CDS is connected. DB F A E C G H I J O P N L K M T The CDS contains: { D, F, H, J, K, P }

5 Operations of GMPR Section 1Section 2Section 3Section 4 1.Select dominators to cover all nodes in the network (Dominators are not connected at this stage). 2.Each dominator performs MPR calculation to select MPRs to cover all its two-hop neighbor nodes. 3.An MPR is a connector if it has been selected by the largest dominator (largest node degree) in its one-hop neighborhood. 4.After establishing connectors, each dominator apply a self- pruning procedure to decide whether it is a silent-dominator.

6 Self-pruning procedure Aim: To remove leaf-dominators. A dominator D is a leaf-dominator if there exists a connector in D’s one-hop neighborhood, which can cover all D’s one-hop neighbors. A leaf-dominator is referred to as the silent-dominator, which still selects MPRs but does not retransmit broadcast packets. Section 1Section 2Section 3Section 4

7 Self-pruning procedure example G A D EHF I B C After selecting connectors Dominators: E, H Connector: F Then Both dominators apply self-pruning procedure, and H becomes a silent-dominator. Section 1Section 2Section 3Section 4

8 A drawback of GMPR Section 1Section 2Section 3Section 4 We found that the self-pruning procedure used in the GMPR algorithm is insufficient in many occasions. F A E D B C Connector Dominator Node E will not change to a silent-dominator Insufficiency of the self-pruning procedure

9 Our enhancement Aim: To enhance the self-pruning procedure to achieve more sufficiency while keeping the algorithm’s computation complexity low. Section 1Section 2Section 3Section 4 F A E D B C Insufficiency of the self-pruning procedure

10 Modify signaling messages Section 1Section 2Section 3Section 4 IDs of MPRsIDs of one-hop neighbors MPR algorithm signaling message O(Δ) StateIDs of MPRsIDs of one-hop neighbors GMPR signaling message O(Δ) 2 bits Dominator Other states StateIDs of one-hop neighbors O(Δ) 2 bits

11 Modify signaling message Section 1Section 2Section 3Section 4 Enhanced GMPR signaling message StateIDs of MPRsIDs of one-hop neighbors O(Δ) 2 bits Dominator Connector & dominatee State O(Δ)2 bits Largest dominator IDs of one-hop neighbors 4bytes Candidate State O(Δ)2 bits IDs of one-hop neighbors

12 A new self-pruning procedure Section 1Section 2Section 3Section 4 Rule: A dominator E is a silent-dominator if all its one-hop neighbors can be covered by a two-hop away dominator A and its connectors, where A has larger node degree than E. F A E D B C F is selected by A, and A is the largest dominator in F’s one-hop neighborhood. Largest dominator is A I am a silent-dominator

13 Simulation studies Section 1Section 2Section 3Section 4 SimulatorOMNeT++ with Mobility Framework MAC protocolAssume a perfect MAC layer (error and collision free). Network area100m x 100m two dimensional area. Topology generating Randomly distribute nodes in the area. Each node is placed within the transmission range of a previously placed node to make sure connectivity. Number of nodes from 20 to 100 with 10 interval Transmission range Two transmission ranges: 25m and 50m Number of runs A sufficient number of runs are conducted to achieve 95% confidence interval within a ±5% margin.

14 Simulation results (CDS size) Section 1Section 2Section 3Section 4 Transmission range R = 25mTransmission range R = 50m

15 Simulation results (signaling message size) Section 1Section 2Section 3Section 4 Transmission range R = 25mTransmission range R = 50m

16 Conclusion We enhanced the Gateway Multipoint Relays algorithm by modifying the signaling message and the self-pruning procedure. Simulation studies show that our enhanced GMPR algorithm can sufficiently remove leaf-dominators while still keeping a low message size. Section 1Section 2Section 3Section 4

17 Questions?

18 Thank you!