1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University,

Slides:



Advertisements
Similar presentations
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.
Advertisements

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
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,
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
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-
An Efficient IP Address Lookup Algorithm Using a Priority Trie Authors: Hyesook Lim and Ju Hyoung Mun Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: Mar. 11, 2008.
Enhanced Gateway Multipoint Relays for Constructing a Small Connected Dominating Set in Wireless Ad Hoc Networks Ou Liang, Ahmet Sekercioglu.
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
1 A Distributed and Efficient Flooding Scheme Using 1- Hop Information in Mobile Ad Hoc Networks Department of Computer Science and Information Engineering.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Robust Communications for Sensor Networks in Hostile Environments Ossama Younis and Sonia Fahmy Department of Computer Sciences, Purdue University Paolo.
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.
1 On Multiple Point Coverage in Wireless Sensor Networks Shuhui Yangy, Fei Daiz, Mihaela Cardeiy, and Jie Wuy Department of Computer Science and Engineering.
Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.
1 Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs Department of Computer Science and Information Engineering National Cheng.
Efficient Gathering of Correlated Data in Sensor Networks
Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks Paper By: Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder Presenter: Ke Gao Instructor:
Packet Classification Using Multi-Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: COMPSACW, 2013 IEEE 37th Annual (Computer.
Presented by Fei Huang Virginia Tech April 4, 2007.
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
A Cluster-Based Backbone infrastructure for broadcasting in MANETs Student: Pei-Yue Kuo
Ogier - 1 MANET Extension of OSPF Using CDS Flooding draft-ogier-manet-ospf-extension-03.txt Richard Ogier March 2, 2005 IETF Meeting - OSPF WG.
The Chinese Univ. of Hong Kong Dept. of Computer Science & Engineering A Point-Distribution Index and Its Application to Sensor Grouping Problem Y. Zhou.
1 A Dynamical Redirection Approach to Enhancing Mobile IP with Fault Tolerance in Cellular Systems Jenn-Wei Lin, Jichiang Tsai, and Chin-Yu Huang IEEE.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Distributed algorithm for efficient construction and maintenance of connected k-hop dominating sets in mobile ad hoc networks 1.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
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.
On Non-Disjoint Dominating Sets for the Lifetime of Wireless Sensor Networks Akshaye Dhawan.
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.
Bounded relay hop mobile data gathering in wireless sensor networks
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Barrier Coverage With Wireless Sensors
Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.
Resource Allocation in Network Virtualization Jie Wu Computer and Information Sciences Temple University.
BROADCASTING TECHNIQUES IN AD-HOC NETWORKS A survey on Shubham Bhat Surendra Shenoy References: 1.“
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
Backbone Topology Synthesis for Multi- Radio Meshed Wireless LANs Huei-jiun Ju and Izhak Rubin University of California, Los angeles(UCLA) Keon Jang, SA.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Strong Barrier Coverage of Wireless Sensor Networks Benyuan Liu, Olivier Dousse, Jie Wang and Anwar Saipulla University of Massachusetts Lowell and Deutsche.
Constructing K-Connected M-Dominating Sets in Wireless Sensor Networks Yiwei Wu, Feng Wang, My T. Thai and Yingshu Li Georgia State University Arizona.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
LOP_RE: Range Encoding for Low Power Packet Classification Author: Xin He, Jorgen Peddersen and Sri Parameswaran Conference : IEEE 34th Conference on Local.
Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker : Shih-Yun.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.
Hierarchical Hybrid Search Structure for High Performance Packet Classification Authors : O˜guzhan Erdem, Hoang Le, Viktor K. Prasanna Publisher : INFOCOM,
Power-Aware Topology Control for Wireless Ad-Hoc Networks Wonseok Baek and C.-C. Jay Kuo Department of Electrical Engineering University of Southern California.
Topology Control and Its Effects in Wireless Networks
Connected Dominating Sets
MR2RP: The Multi-Rate and Multi-Range Routing Protocol for IEEE 802
Introduction Wireless Ad-Hoc Network
On Constructing k-Connected k-Dominating Set in Wireless Networks
A Hybrid IP Lookup Architecture with Fast Updates
Survey on Coverage Problems in Wireless Sensor Networks
Constructing a m-connected k-Dominating Set in Unit Disc Graphs
Presentation transcript:

1 On Constructing k- Connected k-Dominating Set in Wireless Networks Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C. Authors: Fei Dai and Jie Wu Publisher: Parallel and Distributed Processing Symposium, Proceedings. 19th IEEE International Present: Min-Yuan Tsai ( 蔡旻原 ) Date: March, 11, 2008

2 Outline 1. Introduction 2. Proposed Scheme K-Gossip K-Coverage Condition Color Based K-CDS 3. Simulation 4. Conclusion

3 Introduction Why k-CDS? For fault tolerance and routing flexibility. Dominating Set (DS) : All nodes in the network are either in this set or have a neighbor in this set. k-DS : Every node is either in the set or has k neighbors in the set. Connected Dominating Set (CDS) : The subgraph induced from this dominating set is connected. k-CDS : Its induced subgraph is k-vertex connected. A graph is k-vertex connected if removing any k-1 nodes from it does not cause a partition. Induced subgraph: a subgraph obtained by deleting a set of vertices.

4 Outline 1. Introduction 2. Proposed Scheme k-Gossip k-Coverage Condition Color Based k-CDS 3. Simulation 4. Conclusion

5 Related work Localized algorithm can achieve fast convergence with low maintenance. Localized CDS algorithms are either probabilistic or deterministic. Probabilistic : Gossip. Each node v has a backbone status with probability p. Deterministic : By some rules, but all they are special case of Coverage Condition. Node v has a non-backbone status if for any two neighbors u and w, a replacement path exists that connects u and w via several intermediate nodes (if any) with higher priorities than v.

6 k-Gossip Original Gossip : Each node v has a backbone status with probability p. k-Gossip : Each node v has a backbone status with probability p k. p k depends on k, network size, deploying area size, and transmission range – global information. Pros : Very low overhead at each node, requires no information exchange among neighbors, and very low computation cost. Cons : Need global information, and produce large size backbone. Expected size of backbone is n* p k.

7 k-Coverage Condition Original Coverage Condition : Node v has a non-backbone status if for any two neighbors u and w, a replacement path exists that connects u and w via several intermediate nodes (if any) with higher priorities than v. k-Coverage Condition : Node v has a non-backbone status if for any two neighbors u and w, k node disjoint replacement paths exist that connect u and w via several intermediate nodes (if any) with higher priorities than v. That is, node v has a non-backbone status if all its neighbors are k-connected with each other via higher priority nodes.

8 k-Coverage Condition (contd.) Pros : Depend on local information only (just use hello to collect the k-hop information). Cons : More complex. (compute the k node disjoint replacement paths) Complexity Each node has to test whether there are k-disjoint paths between every pair of its neighbors If 2-hop information is collected, O(k  4 ), where  means the maximal node degree

9 Color Based k-CDS Construction A hybrid algorithm. Construction Step : Each node v selects a random color c v (c v is between 1 and k). Thus the network is divided into k-disjoint subsets. (probabilistic) For each sub-network with color c, construct a CDS that covers the original network. (deterministic) k-CDS is the union of all k CDSs.

10 Color Based k-CDS Construction (cont.) Pros : Use smaller “Hello” messages to collect 2- hop information, lower computation cost, and construct a smaller backbone than probabilistic. Cons : The scheme works well only when the network is sufficient dense.

11 Outline 1. Introduction 2. Proposed Scheme K-Gossip K-Coverage Condition Color Based K-CDS 3. Simulation 4. Conclusion

12 Simulation The simulation focus on success ratio and backbone size. Success ratio :

13 Simulation (contd) The simulation focus on success ratio and backbone size. Backbone size :

14 Outline 1. Introduction 2. Proposed Scheme K-Gossip K-Coverage Condition Color Based K-CDS 3. Simulation 4. Conclusion

15 Conclusion Future work: Conduct extensive simulation study on the performance in k-CDS routing. Try to find a probabilistic approximation ratio of the k-convergence condition.

16 Backup Material CBCC-I : Covers all neighbors regardless of their colors; that is, any two neighbors of a non-backbone node must be connected via a replacement place. Node 3 is a backbone node, because it has two neighbors 2 and 7 that are not connected via a gray replacement path. CBCC-II : Only neighbors with the same color are considered. Node 3 becomes a non-backbone node because it has only one visible neighbor 7. However, the resultant gray backbone {5, 7} is not a CDS of the entire network, and union of all backbone nodes {5, 7, 8} is not 2-dominating. The failure of node 8 will leave node 2 uncovered.