Motivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control
|
|
- Dominick Ford
- 5 years ago
- Views:
Transcription
1 Topology Control Andreas Wolf ( )
2 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity
3 Options for topology control Reduce active nodes Reduce active links Order nodes hierarchically
4 Figure: Dense network Figure: Sparse topology Figure: Using a Backbone Figure: Using Clusters
5 Aspects of topology-control algorithms Connectivity Stretch factors Graph metrics Throughput Robustness to mobility Algorithm overhead
6 Connectivity Example 5000 nodes 5000 Maximum component size Probability of connectivity 1 Area of 1000 x 1000 m Transmission range r m known as disc graph model if r = 1 unit disc graph Average size of the target component ,8 0,6 0,4 0, Maximum transmission range
7 Stretch factors Definition hop stretch factor = max u,v V (u,v) T (u,v) G Definition energy stretch factor = max u,v V E T (u,v) E G (u,v)
8 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity
9 For description of power control problems, a four-tuple (M, P, O, I) is used: Definition M {dir, undir} Graph is either directed or undirected P a property to be guaranteed, such as strongly connected k-node connected (k-nc) k-edge connected (k-ec) O the objective function to be minimized I additional Information, topology control can use
10 Basic complexity results (undir, 1-NC, total P, -) is NP-hard There exists an approximation algorithm with a performance guarantee of 2. (undir, 1-NC, max P, -) are solvable in polynomial time.
11 Are there magic numbers? Asumption: A large number of nodes is placed randomly within a given area Questions: how many nodes are required to guarantee n-connectivity when transmission range is limited? Problem is NP-hard, additional heuristics achieve O(k) approximation is there a magic number of minimum neighbours? neighbours < log V asymptotically disconnected neighbours > log V asymptotically connected
12 Relative Neigborhood Graph Definition RNG T of graph G = (V, E) is T = (V, E ) u, v V : (u, v) E iff w V : max {d (u, w), d (v, w)} < d (u, v)
13 Relative Neigborhood Graph Definition RNG T of graph G = (V, E) is T = (V, E ) u, v V : (u, v) E iff w V : max {d (u, w), d (v, w)} < d (u, v) w u v
14 Algorithm of the RNG for all v N do for all w N do if w == v then continue else if d(u, v) > max[d(u, w), d(v, w)] then eliminate edge (u,v) break end if end for end for
15 Properties of the RNG always connected if G was connected worst-case spanning ratio is Ω ( V ) energy stretch is polynomal average degree is 2.6
16 Gabriel Graph Definition GG T of graph G = (V, E) is T = (V, E ) u, v V : (u, v) E iff w V : d 2 (u, w), d 2 (v, w) < d 2 (u, v)
17 Gabriel Graph Definition GG T of graph G = (V, E) is T = (V, E ) u, v V : (u, v) E iff w V : d 2 (u, w), d 2 (v, w) < d 2 (u, v) w u v
18 Algorithm of the GG m = midpoint of uv for all v N do for all w N do if w == v then continue else if d(m, w) < d(u, m) then eliminate edge (u,v) break end if end for end for
19 Properties of the GG always connected if G was connected ( V ) worst-case spanning ratio is Ω energy stretch is O(1) depending on energy-consumption model worst case degree is Ω ( V )
20 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity
21 Motivation and definition Building hierarchical structures to reduce connections simplify routing Using a dominating set as backbone network, which should be minimal: minimum nodes minimum connections Minimum Connected Dominating Set (MCDS)
22 Centralized algorithms a naïve approach initialize all nodes color to white pick an arbitrary node and color it gray while (there are white nodes) { pick a gray node v that has white neighbors color the gray node v black foreach white neighbor u of v { color u gray add (v,u) to tree T } }
23 needs not to be small or even minimal
24 Greedy heuristic Picking the next node to turn gray which would turn the most white nodes gray (maximize the yield) seems to enhance the naive algorithm. u d... v
25 Greedy heuristic Picking the next node to turn gray which would turn the most white nodes gray (maximize the yield) seems to enhance the naive algorithm. u d... v
26 Greedy heuristic Picking the next node to turn gray which would turn the most white nodes gray (maximize the yield) seems to enhance the naive algorithm. u d... v
27 Greedy heuristic Picking the next node to turn gray which would turn the most white nodes gray (maximize the yield) seems to enhance the naive algorithm. u d... v
28 The shortsightedness can be overcome by allowing the algorithm to look ahead one step. u d... v
29 The shortsightedness can be overcome by allowing the algorithm to look ahead one step. u d... v
30 The shortsightedness can be overcome by allowing the algorithm to look ahead one step. u d... v
31 The shortsightedness can be overcome by allowing the algorithm to look ahead one step. u d... v
32 The shortsightedness can be overcome by allowing the algorithm to look ahead one step. u d... v
33 Distributed algorithms Centralized algorithms can be adapted Another idea is to first look for connected, possibly large dominating sets and reduce them in size afterwards
34 Nonoptimal dominating set construction All nodes are initially unmarked each node exchanges neighbor sets with its neighbors Mark any node if it has two neighbors that are not directly connected
35 Nonoptimal dominating set construction All nodes are initially unmarked each node exchanges neighbor sets with its neighbors Mark any node if it has two neighbors that are not directly connected This leads to the following properties If the original graph is connected, the resulting set of marked nodes is a dominating set The resulting set of marked nodes is connected The shortest path between any two nodes does not include any nonmarked nodes The dominating set is not minimal
36 Pruning heuristics After constructing a nonminimal dominating set, it can be easily reduced Definition Unmark a node v if its neighborhood is included in the neighborhoods of two marked neighbors u and w and v has the smallest identifier
37 Pruning heuristics After constructing a nonminimal dominating set, it can be easily reduced Definition Unmark a node v if its neighborhood is included in the neighborhoods of two marked neighbors u and w and v has the smallest identifier u v w a b c d
38 Performance of distributed algorithm The Algorithm only requires O( 2 ) time to exchange neighborhood sets and constant time to reduce the set.
39 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity
40 Definition Locally mark nodes to have a special role. forming of clusters Clusterheads control neighbor nodes emphasis on local resource arbitration shielding higher layers of dynamics aggregate and compress traffic
41 Definition Locally mark nodes to have a special role. forming of clusters Clusterheads control neighbor nodes emphasis on local resource arbitration shielding higher layers of dynamics aggregate and compress traffic
42 Properties of clusters Clusterheads may be neighbors, but often its better to have them separated If Clusters may not overlap, some decision rules are needed to assign nodes also, Gateway nodes are needed for communication
43 Properties of clusters Clusterheads may be neighbors, but often its better to have them separated If Clusters may not overlap, some decision rules are needed to assign nodes also, Gateway nodes are needed for communication
44 Properties of clusters If Clusterheads are separated by two nodes, the two nodes can act as distributed gateway Clusters can be k-connected Gateways and clusters form a dominating set Clusters can have variable diameter Clusters can be nested
45 Properties of clusters If Clusterheads are separated by two nodes, the two nodes can act as distributed gateway Clusters can be k-connected Gateways and clusters form a dominating set Clusters can have variable diameter Clusters can be nested
46 A basic idea to construct independent sets Use a property that can be locally determined that can be easily exchanged to rank nodes
47 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors
48 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors 2 A node can become clusterhead if it has the highest (or lowest) rank among all its undecided neighbors
49 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors 2 A node can become clusterhead if it has the highest (or lowest) rank among all its undecided neighbors 3 It changes its state and announces it to all of its neighbors
50 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors 2 A node can become clusterhead if it has the highest (or lowest) rank among all its undecided neighbors 3 It changes its state and announces it to all of its neighbors 4 Nodes that hear about a clusterhead next to them switch to cluster member and announce this to their neighbors
51 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors 2 A node can become clusterhead if it has the highest (or lowest) rank among all its undecided neighbors 3 It changes its state and announces it to all of its neighbors 4 Nodes that hear about a clusterhead next to them switch to cluster member and announce this to their neighbors
52 a basic idea to construct independent sets For example use a unique node identifier 1 Each node determines its local ranking property and exchanges it with its neighbors 2 A node can become clusterhead if it has the highest (or lowest) rank among all its undecided neighbors 3 It changes its state and announces it to all of its neighbors 4 Nodes that hear about a clusterhead next to them switch to cluster member and announce this to their neighbors
53 Connecting cluster heads As clusterheads are separated by at most three hops, they can connect to all of them, resulting in a backbone network. This may result in more connections than necessary.
54 Rotation of Clusterheads Clusterheads may have additional tasks and a higher communication amount, resulting in a higher power consumption. The task of being Clusterhead should therefore change over nodes. This could be done by: use of a queue of virtual identifiers consider remaining battery power
55 A weighted clustering algorithm Definition W v = w 1 d v δ + w 2 u N(v) dist (u, v) + w 3 S (v) + w 4 T (v) w i are the nonnegative weighting factors N (v) are the neighbors of v at maximum power S (v) is the average speed of node v T (v) is the time node v has already served as clusterhead
56 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity
57 Adaptive node activity Nodes can be turned off if they are not active regarding tasks or communication. This may be the case if nodes are redundant, for example in sensor networks.
58 Geographic Adaptive Fidelity (GAF) Nodes can be turned off if there exists another node which can be uses instead for communication and if they are neither data source nor sink. In the GAF, the area is divided into rectangles small enough to allow each node to communicate with each node of its neighboring rectangles (only at the borders).
59 Geographic Adaptive Fidelity (GAF) Nodes can be turned off if there exists another node which can be uses instead for communication and if they are neither data source nor sink. In the GAF, the area is divided into rectangles small enough to allow each node to communicate with each node of its neighboring rectangles (only at the borders). r R r
60 Properties of GAF r R r The node positions needs to be known The distance between critical nodes is It follows that r should fulfill r < R/ 5 r 2 + (2r) 2
61 The End Bibliography The End Thank you, for your attention!
62 The End Bibliography Holger Karl and Andreas Willig. Protocols and Architectures for Wireless Sensor Networks. Jon Wiley & Sons, 2005 (reprint July 2006). B. Karp and H. T. Kung. Greedy perimeter stateless routing for wireless networks. Proceedings of the 6th International Conference on Mobile Computing and Networking (ACM Mobicom), 2000.
Ad hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More informationAd hoc and Sensor Networks Chapter 10: Topology control
Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity
More informationWireless Sensor Networks 22nd Lecture
Wireless Sensor Networks 22nd Lecture 24.01.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Options for topology control Topology control Control node activity deliberately turn on/off
More informationExtended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication Jie Wu, Mihaela Cardei, Fei Dai, and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic
More informationDesign and Analysis of Connected Dominating Set Formation for Topology Control in Wireless Ad Hoc Networks
Design and Analysis of Connected Dominating Set Formation for Topology Control in Wireless Ad Hoc Networks Bo Han and Weijia Jia Department of Computer Science, City University of Hong Kong 3 Tat Chee
More informationAd hoc and Sensor Networks Topology Control
Ad hoc and Sensor Networks Topology Control Slides taken from Holger Karl (Protocols and Architectures for Wireless Sensor Networks) Goals Networks can be too dense too many nodes in close (radio) vicinity
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationChapter 8 DOMINATING SETS
Chapter 8 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationData Communication. Guaranteed Delivery Based on Memorization
Data Communication Guaranteed Delivery Based on Memorization Motivation Many greedy routing schemes perform well in dense networks Greedy routing has a small communication overhead Desirable to run Greedy
More informationChapter 8 DOMINATING SETS
Distributed Computing Group Chapter 8 DOMINATING SETS Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationChallenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast
More informationChapter 7 TOPOLOGY CONTROL
Chapter 7 TOPOLOGY CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Topology Control Gabriel Graph et al. XTC Interference SINR & Scheduling Complexity Distributed Computing
More informationThe Impact of Clustering on the Average Path Length in Wireless Sensor Networks
The Impact of Clustering on the Average Path Length in Wireless Sensor Networks Azrina Abd Aziz Y. Ahmet Şekercioğlu Department of Electrical and Computer Systems Engineering, Monash University, Australia
More informationEnergy-Efficient Communication Protocol for Wireless Micro-sensor Networks
Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Paper by: Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Outline Brief Introduction on Wireless Sensor
More informationCommunication Networks I December 4, 2001 Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page 1
Communication Networks I December, Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page Communication Networks I December, Notation G = (V,E) denotes a
More informationGeographic Routing in Simulation: GPSR
Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops
More informationGeographical routing 1
Geographical routing 1 Routing in ad hoc networks Obtain route information between pairs of nodes wishing to communicate. Proactive protocols: maintain routing tables at each node that is updated as changes
More informationChapter 6 DOMINATING SETS
Chapter 6 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2003 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationRouting and Topology Control in Ad Hoc & Wireless Sensor Networks
Routing and Topology Control in Ad Hoc & Wireless Sensor Networks Marcin Brzozowski IHP Im Technologiepark 25 15236 Frankfurt (Oder) Germany 2007 - All rights reserved Overview 1. Basics of routing Network
More informationDistributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks Peng-Jun Wan Khaled M. Alzoubi Ophir Frieder Abstract Connected dominating set (CDS) has been proposed as virtual backbone
More informationWeakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks Khaled M. Alzoubi Peng-Jun Wan Ophir Frieder Department of Computer Science Illinois Institute of Technology Chicago, IL
More informationGeometric Spanners for Routing in Mobile Networks
1 Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas J Guibas, John Hershberger, Li Zhang, An Zhu Abstract We propose a new routing graph, the Restricted Delaunay Graph (RDG), for mobile
More informationCluster Head Selection using Vertex Cover Algorithm
Cluster Head Selection using Vertex Cover Algorithm Shwetha Kumari V M.Tech Scholar (Computer Network Engineering), Dept. of Information Science & Engineering, NMAMIT, Nitte Vasudeva Pai Assistant Professor,
More informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More informationROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric
More informationConnected Dominating Set in Sensor Networks and MANETs
Handbook of Combinatorial Optimization D.-Z. Du and P. Pardalos (Eds.) pp. 329-369 c 2004 Kluwer Academic Publishers Connected Dominating Set in Sensor Networks and MANETs Jeremy Blum Min Ding Andrew Thaeler
More informationBroadcasting with Hard Deadlines in Wireless Multi-hop Networks Using Network Coding
WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 0000; 00: 6 Broadcasting with Hard Deadlines in Wireless Multi-hop Networks Using Network Coding Pouya Ostovari, Abdallah Khreishah,
More informationGeographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing
309 Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing Sinchan Roychowdhury Instrumentation Control Engineering Calcutta Institute of Engineering & Management Kolkata, India
More informationAn Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu
More informationGenetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks
Genetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks Jing He, Shouling Ji, Mingyuan Yan, Yi Pan, and Yingshu Li Department of Computer Science Georgia State University,
More informationRouting in Sensor Networks
Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing
More informationChapter 11 Chapter 6
Routing Protocols References H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationReferences. Forwarding. Introduction...
References Routing Protocols H. Karl and A. Willing. Protocols and Architectures for Wireless Sensor Networks. John Wiley & Sons, 005. (Chapter 11) K. Sohraby, D. Minoli, and T. Znati. Wireless Sensor
More informationAN AD HOC network consists of a collection of mobile
174 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 23, NO. 1, JANUARY 2005 Geometric Spanners for Routing in Mobile Networks Jie Gao, Member, IEEE, Leonidas J. Guibas, John Hershberger, Li Zhang,
More informationOverview of Sensor Network Routing Protocols. WeeSan Lee 11/1/04
Overview of Sensor Network Routing Protocols WeeSan Lee weesan@cs.ucr.edu 11/1/04 Outline Background Data-centric Protocols Flooding & Gossiping SPIN Directed Diffusion Rumor Routing Hierarchical Protocols
More informationNetworking Sensors, II
Networking Sensors, II Sensing Networking Leonidas Guibas Stanford University Computation CS321 ZG Book, Ch. 3 1 Class Administration Paper presentation preferences due today, by class time Project info
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationAlgorithms for A Connected Dominating Set in Wireless Networks
Algorithms for A Connected Dominating Set in Wireless Networks Thesis submitted in Partial Fulfillment of the Requirements for the Award of the Degree of Master of Technology In Computer Science and Engineering
More informationA DISTRIBUTED TOPOLOGY CONTROL ALGORITHM FOR MANETS
A DISTRIBUTED TOPOLOGY CONTROL ALGORITHM FOR MANETS S. Venkatesan Department of Computer Science University of Texas at Dallas Richardson, TX 75083-0688 venky@utdallas.edu C. David Young Rockwell Collins,
More informationTOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS
TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS Mathias Becquaert, Bart Scheers, Ben Lauwens Royal Military Academy Department CISS Renaissancelaan 30 B1000 Brussels, Belgium E-mail: mathias.becquaert@mil.be,
More informationEFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
Discrete Mathematics, Algorithms and Applications Vol. 1, No. 4 (2009) 437 461 c World Scientific Publishing Company EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
More informationLink Estimation and Tree Routing
Network Embedded Systems Sensor Networks Link Estimation and Tree Routing 1 Marcus Chang, mchang@cs.jhu.edu Slides: Andreas Terzis Outline Link quality estimation Examples of link metrics Four-Bit Wireless
More informationRandomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks Akshaye Dhawan, Michelle Tanco, Aaron Yeiser Department of Mathematics and Computer Science Ursinus College
More informationTOPOLOGY CONTROL IN WIRELESS NETWORKS BASED ON CLUSTERING SCHEME
International Journal of Wireless Communications and Networking 3(1), 2011, pp. 89-93 TOPOLOGY CONTROL IN WIRELESS NETWORKS BASED ON CLUSTERING SCHEME A. Wims Magdalene Mary 1 and S. Smys 2 1 PG Scholar,
More informationEfficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks Shuhui Yang, Jie Wu, and Fei Dai Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180 Department
More informationOpportunistic Transmission Based QoS Topology Control. QoS; Wireless Sensor Networks
Opportunistic Transmission Based QoS Topology Control in Wireless Sensor Networks Jian Ma, Chen Qian, Qian Zhang, and Lionel M. Ni Hong Kong University of Science and Technology {majian, cqian, qianzh,
More informationConstructing Connected Dominating Sets with Bounded Diameters in Wireless Networks
Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Yingshu Li Department of Computer Science Georgia State University Atlanta, GA 30303 yli@cs.gsu.edu Donghyun Kim Feng
More informationAn efficient implementation of the greedy forwarding strategy
An efficient implementation of the greedy forwarding strategy Hannes Stratil Embedded Computing Systems Group E182/2 Technische Universität Wien Treitlstraße 3 A-1040 Vienna Email: hannes@ecs.tuwien.ac.at
More informationBGR: Blind Geographic Routing for Sensor Networks
BGR: Blind Geographic Routing for Sensor Networks Matthias Witt 1 and Volker Turau 1 1 Department of Telematics, Hamburg University of Technology, Hamburg, Germany {matthias.witt,turau}@tuhh.de Abstract
More informationEnergy-Efficient Self-Organization for Wireless Sensor Networks
Energy-Efficient Self-Organization for Wireless Sensor Networks Thomas Watteyne CTTC, 22nd May 2007 Thomas Watteyne, PhD. candidate CITI Laboratory INRIA / INSA de Lyon France Telecom R&D Grenoble Advisor:
More informationAd hoc and Sensor Networks Chapter 11: Routing Protocols. Holger Karl
Ad hoc and Sensor Networks Chapter 11: Routing Protocols Holger Karl Goals of this Chapter In any network of diameter > 1, the routing & forwarding problem appears We will discuss mechanisms for constructing
More informationBroadcasting and topology control in wireless ad hoc networks
Broadcasting and topology control in wireless ad hoc networks Xiang-Yang Li Ivan Stojmenovic September 25, 2003 Abstract Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control
More informationOn minimum m-connected k-dominating set problem in unit disc graphs
J Comb Optim (2008) 16: 99 106 DOI 10.1007/s10878-007-9124-y On minimum m-connected k-dominating set problem in unit disc graphs Weiping Shang Frances Yao Pengjun Wan Xiaodong Hu Published online: 5 December
More informationGeographic and Diversity Routing in Mesh Networks
Geographic and Diversity Routing in Mesh Networks COS 463: Wireless Networks Lecture 7 Kyle Jamieson [Parts adapted from B. Karp, S. Biswas, S. Katti] Course Contents 1. Wireless From the Transport Layer
More informationRedes de Computadores. Shortest Paths in Networks
Redes de Computadores Shortest Paths in Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto » What is a graph?» What is a spanning tree?» What is a shortest path tree?» How are
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationDesign and Development of a
Chapter 6 Design and Development of a Clustered Network 6.1 Introduction In ad hoc networks, nodes are distributed randomly and they are identified by their unique IDs. In such a network, the execution
More informationSummary of Coverage Problems in Wireless Ad-hoc Sensor Networks
Summary of Coverage Problems in Wireless Ad-hoc Sensor Networks Laura Kneckt 21th of March, 2005 Abstract This paper presents a brief summary of the article about Coverage Problems in Wireless Ad-hoc Sensor
More informationGraph Algorithms. Chapter 22. CPTR 430 Algorithms Graph Algorithms 1
Graph Algorithms Chapter 22 CPTR 430 Algorithms Graph Algorithms Why Study Graph Algorithms? Mathematical graphs seem to be relatively specialized and abstract Why spend so much time and effort on algorithms
More informationALL ABOUT DATA AGGREGATION IN WIRELESS SENSOR NETWORKS
e-issn 2455 1392 Volume 1 Issue 1, November 2015 pp. 1-7 http://www.ijcter.com ALL ABOUT DATA AGGREGATION IN WIRELESS SENSOR NETWORKS Komal Shah 1, Heena Sheth 2 1,2 M. S. University, Baroda Abstract--
More informationDistributed Indexing and Data Dissemination in Large Scale Wireless Sensor Networks
Distributed Indexing and Data Dissemination in Large Scale Wireless Sensor Networks Yiwei Wu Department of Computer Science Georgia State University Email: wyw@cs.gsu.edu Yingshu Li Department of Computer
More informationOutline. Wireless Ad Hoc & Sensor Networks (Wireless Sensor Networks III) Localisation and Positioning. Localisation and Positioning properties
Wireless Ad Hoc & Sensor Networks (Wireless Sensor Networks III) Outline Localisation and Positioning Topology Control Routing Summary WS 2009/2010 Prof. Dr. Dieter Hogrefe/Prof. Dr. Xiaoming Fu Dr. Omar
More informationPATM: Priority-based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
PATM: Priority-based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks Haixia Tan, Weilin Zeng and Lichun Bao Donald Bren School of Information and Computer Sciences University of California,
More informationDistributed Algorithms 6.046J, Spring, Nancy Lynch
Distributed Algorithms 6.046J, Spring, 205 Nancy Lynch What are Distributed Algorithms? Algorithms that run on networked processors, or on multiprocessors that share memory. They solve many kinds of problems:
More informationarxiv: v2 [cs.ds] 25 Jan 2017
d-hop Dominating Set for Directed Graph with in-degree Bounded by One arxiv:1404.6890v2 [cs.ds] 25 Jan 2017 Joydeep Banerjee, Arun Das, and Arunabha Sen School of Computing, Informatics and Decision System
More informationCHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.
More informationMulti-Tier Mobile Ad Hoc Routing
Multi-Tier Mobile Ad Hoc Routing Bo Ryu Tim Andersen Tamer Elbatt Network Analysis and Systems Dept. HRL Laboratories, LLC. Malibu, CA, USA. {ryu,cellotim,telbatt}@wins.hrl.com Abstract We present a new
More informationA Comparative Analysis between Forwarding and Network Coding Techniques for Multihop Wireless Networks
A Comparative Analysis between Forwarding and Network Coding Techniques for Multihop Wireless Networks Suranjit Paul spaul2@connect.carleton.ca Broadband Network Lab, Carleton University Acknowledgements
More informationAlgorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science 381 (2007) 241 247 www.elsevier.com/locate/tcs Algorithms for minimum m-connected k-tuple dominating set problem Weiping Shang a,c,, Pengjun Wan b, Frances Yao c, Xiaodong
More informationGeo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer
Geo-Routing Chapter 2 Ad Hoc and Sensor Networks Roger Wattenhofer 2/1 Application of the Week: Mesh Networking (Roofnet) Sharing Internet access Cheaper for everybody Several gateways fault-tolerance
More informationContext-aware Geographic Routing for Sensor Networks with Routing Holes
Context-aware Geographic Routing for Sensor Networks with Routing Holes Jiaxi You, ominik Lieckfeldt, Frank Reichenbach, and irk Timmermann University of Rostock, Germany {jiaxi.you, dominik.lieckfeldt,
More informationGraph Representations and Traversal
COMPSCI 330: Design and Analysis of Algorithms 02/08/2017-02/20/2017 Graph Representations and Traversal Lecturer: Debmalya Panigrahi Scribe: Tianqi Song, Fred Zhang, Tianyu Wang 1 Overview This lecture
More informationReceiver Based Multicasting Protocol for Wireless Sensor Networks
Receiver Based Multicasting Protocol for Wireless Sensor Networks Madesha M Assistant Professor, Department of CSE Sahyadri College of Engineering and Management Chaya D Lecturer, Department of CSE H.M.S
More informationRouting. Information Networks p.1/35
Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual
More information408 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 14, NO. 4, APRIL Geometric Spanners for Wireless Ad Hoc Networks
408 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 14, NO. 4, APRIL 2003 Geometric Spanners for Wireless Ad Hoc Networks Khaled Alzoubi, Xiang-Yang Li, Member, IEEE, Yu Wang, Member, IEEE,
More informationANALYZE AND EVALUATE THE IMPLEMENTATION OF CDS ALGORITHMS USING THE MOBILE AGENT.. 1 RAFAT AHMED ALHANANI, 2 JAAFAR ABOUCHABAKA, 3 RAFALIA NAJAT
ANALYZE AND EVALUATE THE IMPLEMENTATION OF CDS ALGORITHMS USING THE MOBILE AGENT.. 1 RAFAT AHMED ALHANANI, 2 JAAFAR ABOUCHABAKA, 3 RAFALIA NAJAT 1 2 3 Department of Computer Science, IBN Tofail University,
More informationMobile Advanced Networks. Position-based routing geometric, geographic, location-based. Navid Nikaein Mobile Communication Department
Mobile Advanced Networks Position-based routing geometric, geographic, location-based Navid Nikaein Mobile Communication Department Navid Nikaein 2010 1 Reminder In topology-based routing, each node has
More informationEnergy Efficiency and Latency Improving In Wireless Sensor Networks
Energy Efficiency and Latency Improving In Wireless Sensor Networks Vivekchandran K. C 1, Nikesh Narayan.P 2 1 PG Scholar, Department of Computer Science & Engineering, Malabar Institute of Technology,
More informationA LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK
Clemson University TigerPrints All Theses Theses 8-2014 A LOAD-BASED APPROACH TO FORMING A CONNECTED DOMINATING SET FOR AN AD HOC NETWORK Raihan Hazarika Clemson University, rhazari@g.clemson.edu Follow
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationModule 6 P, NP, NP-Complete Problems and Approximation Algorithms
Module 6 P, NP, NP-Complete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu
More informationAnnouncements. HW3 is graded. Average is 81%
CSC263 Week 9 Announcements HW3 is graded. Average is 81% Announcements Problem Set 4 is due this Tuesday! Due Tuesday (Nov 17) Recap The Graph ADT definition and data structures BFS gives us single-source
More informationSelf-Organization in Autonomous Sensor/Actuator Networks [SelfOrg]
Self-Organization in Autonomous Sensor/Actuator Networks [SelfOrg] PD Dr.-Ing. Falko Dressler Computer Networks and Communication Systems Department of Computer Science University of Erlangen http://www7.informatik.uni-erlangen.de/~dressler/
More informationLecture Note: Computation problems in social. network analysis
Lecture Note: Computation problems in social network analysis Bang Ye Wu CSIE, Chung Cheng University, Taiwan September 29, 2008 In this lecture note, several computational problems are listed, including
More informationDBSCAN APLLY In Weighted Clustering Algorithm
DBSCAN APLLY In Weighted Clustering Algorithm for MANET Manju Vishwakarma Research Scholar, Department of Computer Science and Engineering, Bhilai Institute of Technology, Durg, India. Partha Roy Associate
More informationAn Enhanced Algorithm to Find Dominating Set Nodes in Ad Hoc Wireless Networks
Georgia State University ScholarWorks @ Georgia State University Computer Science Theses Department of Computer Science 12-4-2006 An Enhanced Algorithm to Find Dominating Set Nodes in Ad Hoc Wireless Networks
More informationCS521 \ Notes for the Final Exam
CS521 \ Notes for final exam 1 Ariel Stolerman Asymptotic Notations: CS521 \ Notes for the Final Exam Notation Definition Limit Big-O ( ) Small-o ( ) Big- ( ) Small- ( ) Big- ( ) Notes: ( ) ( ) ( ) ( )
More informationETSF10 Internet Protocols Routing on the Internet
ETSF10 Internet Protocols Routing on the Internet 2012, Part 2, Lecture 1.2 Kaan Bür, Jens Andersson Routing on the Internet Unicast routing protocols (part 2) [ed.4 ch.22.4] [ed.5 ch.20.3] Forwarding
More informationReferences. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but
References Content-based Networking H. Karl and A. Willing. Protocols and Architectures t for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 12) P. Th. Eugster, P. A. Felber, R. Guerraoui,
More informationTable of Contents. 1. Introduction. 2. Geographic Routing. 2.1 Routing Mechanisms. 2.2 Destination Location. 2.3 Location Inaccuracy. 3.
Geographic Protocols in Sensor Networks Karim Seada, Ahmed Helmy Electrical Engineering Department, University of Southern California {seada, helmy}@usc.edu Table of Contents 1. Introduction 2. Geographic
More informationA Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks Jie Wu and Fei Dai Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Email:fjie,fdaig@cse.fau.edu
More informationEfficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme
Efficient Broadcast s To Reduce number of transmission Based on Probability Scheme S.Tharani, R.Santhosh Abstract Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic.
More informationEBRP: Energy Band based Routing Protocol for Wireless Sensor Networks
EBRP: Energy Band based Routing Protocol for Wireless Sensor Networks Sasanka Madiraju Cariappa Mallanda #Rajgopal Kannan Arjan Durresi S.S.Iyengar {madiraju, Cariappa, rkannan, Durresi, iyengar}@csc.lsu.edu
More informationA3: A Topology Construction Algorithm for Wireless Sensor Networks
A3: A Topology Construction Algorithm for Wireless Sensor Networks Pedro M. Wightman 1 and Miguel A. Labrador Department of Computer Science and Engineering University of South Florida Tampa, Florida 33620
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationChapter 8: Energy Conservation. MANETs. Prof. Yuh-Shyan Chen Department t of Computer Science and Information Engineering
Chapter 8: Energy Conservation for Broadcast Routing in MANETs Prof. Yuh-Shyan Chen Department t of Computer Science and Information Engineering National Taipei University 1 Outline Introduction Energy-Efficient
More informationAN ad hoc wireless network is a special type of wireless
866 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 9, SEPTEMBER 2002 Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links Jie Wu, Senior Member,
More informationETSF10 Internet Protocols Routing on the Internet
ETSF10 Internet Protocols Routing on the Internet 2013, Part 2, Lecture 1.2 Jens Andersson (Kaan Bür) Routing on the Internet Unicast routing protocols (part 2) [ed.5 ch.20.3] Multicast routing, IGMP [ed.5
More informationAn Optimized Lifetime Model using Energy Holes Reduction near Sink's Locality of WSN s
2009 International Conference on Machine Learning and Computing IPCSI vol.3 (2011) (2011) IACSI Press, Singapore An Optimized Lifetime Model using Energy Holes Reduction near Sink's Locality of WSN s Atiq
More information