Chapter 5 To T pology C o C ntrol
|
|
- Maria Hill
- 5 years ago
- Views:
Transcription
1 Chapter 5 Topology Control
2 Outline 5.1. Motivations and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
3 Outline 5.1. Motivations and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
4 Motivations A typical characteristic of wireless sensor networks deploying many nodes in a small area ensure sufficient coverage of an area, or protect against node failures Networks can be too dense too many nodes in close Networks can be too dense too many nodes in close (radio) vicinity
5 Motivations In a very dense networks, too many nodes Too many collisions Too complex operation for a MAC protocol, Too many paths to be chosen from for a routing protocol,
6 Goals This chapter looks at methods to deal with such networks by Reducing/controlling transmission power Deciding which links to use Turning some nodes off
7 Topology Control Topology control: Make topology less complex Topology: Which node is able/allowed to communicate with which other nodes Topology control needs to maintain invariants, e.g., connectivity
8 Options for topology control Topology control Flat network All nodes have essentially same role Hierarchical network Assign different roles to nodes and then control node/link activity Power control Hybrid Tree Clustering Dominating sets Adaptive node activity
9 Outline 5.1. Motivation and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
10 Introduction of Power Control Power control The transmitter s power can be adjusted dynamically over a wide range Typical radio adjusts their transmitter s power based on received signal strength Connected Disconnected B C D A Controls the transmitted power Topology control for desired connectivity Compensate topology changes incurred by mobility and dead nodes Controls a node s neighborhood
11 Introduction of Power Control Interactions Power control Large Battery makes Longer Lifetime Battery drain
12 Introduction of Power Control Interactions C B Interference D Destination A Source Large Power makes Performance Degradation Power control Large Battery makes Longer Lifetime Battery drain
13 Introduction of Power Control Interactions C B Interference D Destination A Source B C D Large Power makes Performance Degradation Different Power makes Load Unbalancing Destination Power control Large Battery makes Longer Lifetime A Source A consumes Adjusting much power more can power balance than the C power consumption Battery drain
14 Introduction of Power Control Interactions Adjusting C is forbid the power to of A can improve communication the spatial with reuseb B C C B Interference A D E D Destination A Source B C D Large Power makes Performance Degradation Different Power makes Load Unbalancing Destination Power control Large Battery makes Longer Lifetime Small Power creates more Spatial Reuse Opportunities A Source A consumes much more power than C Battery drain
15 Introduction of Power Control Interactions Adjusting the power of A can improve the spatial reuse B C C B Interference A D E D Destination A Source Large Power makes Small Power creates more Performance Degradation Spatial Reuse Opportunities Power control B C Different Power makes Load Unbalancing D Destination Large Battery makes Longer Lifetime Small Power causes More Retransmissions Eb/No Error performance A Source A consumes much more power than C Large power, small error rate Battery drain db
16 Introduction of Power Control Targets and Issues Improve network throughput Improve transmission range Improve fairness Improve connectivity Neighbor discover Reduce overall energy consumption Reduce packet latency Power control helps in scheduling Reduce the interference and energy consumption Partial combination of above targets Etc.
17 Power Control and Energy Conservation Topology Control of Multihop Wireless Networks using Transmit Power Adjustment R. Ramanathan and R. Rosales-Hain IEEE INFOCOM 2000
18 Introduction Topology The set of communication links between node pairs used by routing mechanism Uncontrollable factor: Mobility, Weather, Interference, Noise Controllable factor: Transmitted power, Antenna direction
19 Introduction A graph is called connected if every pair of distinct vertices in the graph can be connected through some path Connected A bi-connected graph is a connected graph that is not broken into disconnected pieces by deleting any single vertex (and its incident edges) bi-connected
20 Motivation Drawbacks of Wrong Topology Reduce capacity Increase interference Increase end-to-end packet delay Sparse network A danger of network partitioning High end to end delays High end to end delays Dense network Many nodes interfere with each other
21 Goals Consider transmitted power adjustment problem in a multi-hop wireless network to create a desired topology
22 Static Networks: Min-Max Power Algorithm Static Networks: Min-Max Power Algorithm
23 Min-Max Power Algorithm Connected Networks Goal Find a per-node minimal assignment of transmitted power p such that (1) the induced graph is connected (2) max p is minimum
24 Min-Max Power Algorithm Connected Networks Phase I: CONNECTION Construct a Minimum cost spanning tree 3 3 E 4 F C 2 D A 2 B 12 Successful transmit power between i and j p = γ ( d( l, l )) + s ij i j s : the receiver sensitivity γ ( d( l, l )) i j : path loss between i and j l i : the location of node i
25 Min-Max Power Algorithm Connected Networks Phase II : Per Node Minimizing Power 3 3 E 4 F side-effect-edge : The edge of (C, D) is automatically connected C 2 D BA has a path to AB via DC with smaller power B A adjusts the transmitted power from 2 to A 2 B 12 1 The edge (A, B) can be disconnected to save more energy
26 Min-Max Power Algorithm Bi-Connectivity Augmentation Goal Find a per-node minimal assignment of transmit powers p such that (1) the induced graph is bi-connected (2) max p is minimum
27 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase I: BICONN-AUGMENT Construct a Connected Minimum cost spanning tree 3 3 Successful transmit power E 4 F between i and j 13 C 2 D A B 12 p = γ ( d( l, l )) + s ij i j s : the receiver sensitivity γ ( d( l, l )) i j : path loss between i and j l i : the location of node i
28 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase I: BICONN-AUGMENT Add (u, v) to graph G until the network is bi-connected Bi-Connected Bi-Connected component of C component of D 3 3 E 4 F E F C D A 13 C D 31 C D A 2 B 12 Bi-Conn. Comp. of C Bi-Conn. Comp. of D => Add (C, D) B
29 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase I: BICONN-AUGMENT Add (u, v) to graph G until the network is bi-connected Bi-Connected component of E 3 3 E 4 F E Bi-Connected component of F F C 2 D 31 C D A 2 B 12 Bi-Conn. Comp. of E Bi-Conn. Comp. of F => Add (E, F)
30 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase II: Per Node Minimizing Power No side-effect-edge Finish 3 3 E 4 F C 2 D A 2 B 12
31 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase II: Per Node Minimizing Power An other example has side-effect-edge A 1 B side-effect-edge : The edge of (A, D) is automatically connected C 2 D 23 3 Disconnect the edge (A, B) and still Bi-Connectivity C adjusts the transmitted power from 3 to 2
32 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase II: Per Node Minimizing Power An other example has side-effect-edge Disconnect the edge (B, D) and still Bi-Connectivity A 1 B B adjusts the transmitted power from 3 to C 2 D 2 3
33 Min-Max Power Algorithm Bi-Connectivity Augmentation Phase II: Per Node Minimizing Power Finish A 1 B C 2 D 2 3
34 Mobile Networks: Distributed Heuristic Algorithms Mobile Networks: Distributed Heuristic Algorithms
35 Mobile Networks: Distributed Heuristic Algorithms In a mobile wireless network, the topology is constantly changing Continually re-adjust the transmitted powers of nodes to maintain the desired topology Only local information since updating global information such as positions of all nodes requires prohibitive control overhead Distributed Heuristic Algorithms LINT (Local Information No Topology) LILT (Local Information Link-state Topology)
36 LINT (Local Information No Topology) Goal LINT uses locally available neighbor information collected by a routing protocol, and attempts to keep the degree (number of neighbors) of each node bounded
37 LINT (Local Information No Topology) Periodically, the node checks the number of active neighbors (degree) Attempt to keep degree of each node bounded Low threshold d l Desired node degree High threshold d h Assume : d l =2, d h =4 Degree = 31 5 < > d lh A C Nodes B and C move out the communication range of node A If degree of node A < d l Node A increases transmit power E B D Nodes D and E move in the communication range of node A If degree of node A > d h Node A decreases transmit power How node A adjusts its power?
38 LINT (Local Information No Topology) Node A calculates the new power periodically d = D π r c d = D π r d 2 c 2 d Path loss rc pc ( γ ( rthr ) + 10 ε log( )) = T rthr rd pd ( γ ( rthr ) + 10 ε log( )) = T r New power dd pd = pc 5 ε log( ) d r c c = thr dc dd, rd = D π D π Sign d c d d D r c r d P c P d T Current degree Desired degree Meaning Network density The communication rang with power p c The communication rang with power p d Current successful transmitted power Desired successful transmitted power The receiver sensitivity
39 LINT (Local Information No Topology) Disadvantages of LINT Unaware of network connectivity Danger of a network partitioning
40 LINT (Local Information No Topology) Disadvantage of LINT: Danger of a network partitioning Assume threshold bounds: d l =2, Low threshold d l Desired node degree High threshold d h d h =4 Degree = 3 Degree = 3 Network partitioning Since each group satisfies the condition of threshold bounds, LINT do nothing even the network is partitioned
41 LINT (Local Information No Topology) Disadvantage of LINT: unaware of network partitioning Example: Assume threshold bounds: d l =2, d h =4 Node A periodically checks the number of active neighbors (degree) d l d h = 2 d h Degree of A is 2 Disconnected B => No action Nodes B and C move randomly A C Disconnected Network topology change: Degree of A is 2, satisfying the threshold bounds. Network partitioning, but no action of LINT
42 LILT (Local Information Link-state Topology) Goal To overcome the shortcoming of LINT To exploit global connectivity information gained from routing protocols based on the link-state approach for recognizing and repairing network partitions
43 LILT (Local Information Link-state Topology) Aims to improve the disadvantages of LINT LILT consists of two main parts Neighbor reduction protocol (NRP) LINT mechanism Neighbor addition protocol (NAP) Triggered whenever an event driven or periodic link-state updates arrives NRP:LILT utilizes LINT mechanism to keep the desired degree of each node. NAP:For recognizing and repairing network partitions.
44 LILT- Neighbor Addition Protocol (NAP) Current topology state Disconnected The node uses its largest transmitted power Connected but not Bi-connected If is still not Bi-connected after time t, the node uses its largest transmitted power
45 LILT- Neighbor Addition Protocol (NAP) Current topology state Disconnected The node uses its largest transmitted power Connected but not Bi-connected If is still not Bi-connected after time t, the node uses its largest transmitted power Node B and C move randomly Disconnected B A C Connected Disconnected Node A uses its largest transmitted power
46 LILT- Neighbor Addition Protocol (NAP) Current topology state Disconnected The node uses its largest transmitted power Node B and C move randomly Connected but not Bi-connected If A is still not Bi-connected after time t, the node uses its largest transmitted power Node B and C move randomly Disconnected B Not Bi-connected B A Connected C A C Connected Disconnected Node A uses its largest transmitted power Node A waiting for a time period. If still not Bi-connected, node A uses its largest transmitted power
47 Conclusions The paper considered the problem of adjusting the powers of nodes in a multi-hop wireless network to create a desired topology Propose power control mechanism for static networks to maintain Connected Bi-connected Propose two mechanisms for mobile networks: LINT and LILT.
48 Outline 5.1. Motivation and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
49 Introduction of Tree Topology Control Example: MPR (Multi-Point Relay) election Retransmission node (a) (b) is better Retransmission node (b)
50 Introduction of Tree Topology Control Example: a a b c b c d e f d e f g h g h (a) a to d needs 2 hops (b) a to d needs 7 hops (a) is better
51 Tree Topology Design and Analysis of an MST-Based Topology Control Algorithm N. Li, J. C. Hou, and L. Sha IEEE INFOCOM 2003
52 Motivation The advantage of Topology Control Minimize the overhearing and then optimize the network spatial reuse. Maintain a connected topology by minimal power Power-efficient B B I I C F C F A D G H A D G H E E (1) No Topology Control (2) With Topology Control
53 Goal Determine the transmission power of each node Maintain network connectivity Minimal power consumption
54 LMST - Procedure Local Minimum Spanning Tree Algorithm (LMST) Step 1: Information Collection Step2: Topology Construction Step3: Determination of Transmission Power
55 LMST Step1: Information Collection Information Exchange Each node broadcasts periodically a Hello message using its maximal transmission power. The Hello message includes the ID and Location of the node. Maximal Transmission Power a b u s ID and Location u c d
56 LMST Step1: Information Collection Information Exchange Since Hello message includes the node s ID and Location, after obtaining the Hello message of 1-hop neighbors, node u can construct the local view. a b u c d
57 LMST Step2: Topology Construction Each node uses location information of its neighbor can estimate their distance The weight of edge between the two nodes is based on Euclidean distance. The weight of an edge also denotes the transmission power (or distance) between the two nodes r c : Coefficient c d, r 2 d : distance Decrease the transmission range can conserve the power of squared times 7 a e u 5 6 b c 4 d
58 LMST Step2: Topology Construction Each node applies Prim s algorithm independently to obtain its Local Minimum Spanning Tree. Node u constructs the Local Minimum Spanning Tree using Prim s algorithm according to its local view local view of node u According to the constructed Local Minimum Spanning Tree, node u will use small power to communicate with node a via node b instead of using large power to communicate with node a directly. Small power Creates more Spatial Reuse Opportunities Decreases energy consumption u 7 3 a 5 c b d 10 e
59 LMST Step3: Determination of Transmission Power By measuring the receiving power of Hello message, each node can determine the specific power levels it needs to reach each of its neighbors. Two commonly-used propagation models Free Space P = Two-Ray P 2 PG t tgrλ ( 4πd ) L r 2 PG t tgrh = d L r 2 2 t h 2 r Sign P t P r G t G r λ d L h t h r Transmit power Receive power Meaning Antenna gain of the transmitter Antenna gain of the receiver Wave length Distance between nodes System loss Antenna height of the transmitter Antenna height of the receiver
60 LMST Step3: Determination of Transmission Power In general, the relation between P r and P t is of the following form 2 G G P P G Where G is a function of r = t t r λ 2 ( 4πd ) L
61 LMST Step3: Determination of Transmission Power In general, the relation between P r and P t is of the following form 2 G P P G Where G is a function of r = t t G r λ 2 ( 4πd ) L Example P th is the required power threshold to successfully receive the message P max is the maximal transmission power e Node b will compute: a G = P r / P max b Node b transmits data to u: Pth G = P th P r / P max u c Hello Data d Data with P th G Hello with P max
62 Conclusions Advantages Maintain network connectivity by low energy consumption Reduce the probability of interference Increase the spatial reuse Achieve high throughput
63 Tree Topology On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks J. Wieselthier, G. Nguyen, and A. Ephremides IEEE INFOCOM 2000
64 Introduction The paper studies the problems of broadcasting and multicasting in wireless networks. Previously developed models for multicasting are based on link-based models Do not reflect the properties of the wireless network environment.
65 Goals To form a minimum-energy tree Energy efficiency Maintain network connectivity
66 Network Assumptions The power level of a transmission can be chosen within a given range of values. The availability of a large number of bandwidth resources. Sufficient transceiver resources are available at each of the nodes in the network.
67 Wireless Communications Model Node-based transmission cost evaluation P i,(j,k) = max{p ij, P ik } P ij : Transmission power for node i to transmit packets to node j P ij P ik > P ij j The larger power (P ik ) can cover both of node j and node k The smaller power (P ij ) can only cover node j i P ik k
68 Minimum-Energy Broadcast Tree Construction Minimum-Energy Broadcast Tree Construction
69 Basic Concept P ij = r 2 (r :transmission range) b b Source a Source 3 a Power consumption: Source b: 3 2 = 9 Power consumption: Source b: 3 2 = 9 Minimum cost (Source a b): = 8.5 Minimum cost (Source a b): = 36.04
70 Minimum-Energy Broadcast Tree Construction - Minimum-Energy Broadcasting: 2 Destinations Strategy (a): S D 2 Strategy (b): D 2 r 2 S θ S D 1 D 2 r 2 θ S D 1 θ = 90 θ > 90 r 1 r 12 D 1 D 2 r 1 θ r 12 r 12 D 2 S D 1 (r 2 ) 2 < (r 1 ) 2 +(r 12 ) 2 (r 2 ) 2 < (r 1 ) 2 +(r 12 ) 2 Apply Strategy (a) r 2 r 1 Apply Strategy (a) r 1 > r 2 cosθ θ θ < 90 r 2 r 1 D 2 r 12 S D 1 (r 2 ) 2 < (r 1 ) 2 +(r 12 ) 2 Apply Strategy (a) Otherwise θ r 1 r 2 S D 1 (r 2 ) 2 > (r 1 ) 2 +(r 12 ) 2 D 2 r 12 Apply Strategy (b)
71 Minimum-Energy Broadcast Tree Construction - Minimum-Energy Broadcasting: 2 Destinations Strategy (a): S D 2 Strategy (b): S D 1 D 2 D 2 r 2 r 12 θ S D 1 r 1 Decision: If θ 90 : apply Strategy (a) Otherwise: If r 1 > r 2 cosθ: apply Strategy (a) Otherwise: apply Strategy (b)
72 Minimum-Energy Broadcast Tree Construction - Minimum-Energy Broadcasting: 2 Destinations The complexity of this formulation is high, making it impractical except for small networks. (N D :number of destinations) N D =10, more than 51,000 calls are needed. N D = 13, more than 14 million calls are needed.
73 Broadcast Incremental Power Algorithm Broadcast Incremental Power Algorithm
74 Network Assumptions Rooted at the Source, that reaches all of the desired destinations Initially, the tree consists of only the Source.
75 The Broadcast Incremental Power Algorithm f d e b 0.3 a j c g i h Assume node a is the source node Step 1: Determining the node that the Source can reach with minimum expenditure of power. a 0.3 b a 0.5 c
76 The Broadcast Incremental Power Algorithm f d e b a j g c i h Step 2: Determine which new node can be added to the tree at minimum additional cost. P ac a P 0.3 a a 0.5 b P a P a = = 0.2 Minimum additional cost P bd P b b b P b = 1 0 = 1 P b 1 c d
77 The Broadcast Incremental Power Algorithm f d e 1.2 b a c g j i h Step 2: Determine which new node can be added to the tree at minimum additional cost. P aj a P 0.5 a a 1.3 P a = = 0.8 P cj P c c P c 0.7 c P a c Minimum additional cost P c = = 0.7 j j P bd P b P b b 1 b P b = 1 0 = 1 d
78 The Broadcast Incremental Power Algorithm f d e 1.2 b a c g j Step 2: Determine which new node can be added to the tree at minimum additional cost. 1.3 And so forth: i h c i c h b d b e b f b g
79 The Broadcast Incremental Power Algorithm BIP is similar in principle to Prim s algorithm. One fundamental difference: The inputs to Prim s algorithm are the link cost P ij. BIP must dynamically update the costs at each step.
80 Conclusions Propose a centralized algorithm: The Broadcast Incremental Power(BIP) Algorithm Advantages Improved performance can be obtained when exploiting the properties of the wireless medium Energy-efficient
81 Outline 5.1. Motivation and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
82 Connected Dominating Set Connected dominating set (CDS) - construct a virtual backbone. Communicate through the virtual backbone by dominators. Example: virtual backbone construction Sensor node
83 Connected Dominating Set Connected dominating set (CDS) - construct a virtual backbone. Communicate through the virtual backbone by dominators. Example: virtual backbone construction Sensor node Dominators CDS edge Virtual backbone 1-hop Connected Dominating Set
84 Connected Dominating Set Connected dominating set (CDS) - construct a virtual backbone. Communicate through the virtual backbone by dominators. Example: virtual backbone construction Sensor node Dominators CDS edge Virtual backbone 1-hop Connected Dominating Set 2-hop Connected Dominating Set
85 A hardness result The MDS problem is NP-hard, it is even a hard problem to approximate in general graphs as it not even approximable within c log V for some c > 0. For the case of unit disk graphs, it is possible to find a Polynomial Time Approximation Scheme (PTAS).
86 k-hop Connected Dominating Set On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks Jie Wu, Fei Dai, Ming Gao, and Ivan Stojmenovic Journal of Communications and Networks 2002
87 Introduction Routing based on a connected dominating set is a promising-approach Each gateway host keeps following information: gateway domain membership list and gateway routing table. 3 Receiver Gateway host Non-Gateway host dominated set Gateway domain member list of host Sender destination member list next hop distance 9 (1,2,3,11) (5,6) (6) 7 1 Gateway routing table of host8
88 Introduction Finding a minimum connected dominating set is NP for most graphs Find a simple distributed algorithm that can quickly determine a relatively small connected dominating set is important.
89 Introduction In order to prolong the life span of each node, power consumption should be minimized and balanced among nodes. Unfortunately, nodes in the dominating set consume more energy than nodes outside the set. 5 6 Gateway host Non-Gateway host dominated set Propose a method of calculating power-aware connected dominating set based on a dynamic selection process.
90 Network Initialization Every v exchanges its open neighbor set N(v) with all its neighbors. Each node has two-hop neighbors information. Every v is marked if there exist two unconnected neighbors Become a Gateway host 15 unconnected Gateway host Non-Gateway host
91 Gateways Selection Gateways Selection (Rules 1 and 2)
92 Gateways Selection (by applying Rule 1) Rule 1: Consider two vertices v and u in G. If N[v] N[u]in G and id( v ) < id(u), the marker v is unmarked, i.e., G' is changed to G' - {U}. N(21) N(22) 20 id N(id) 21 22, 23, , 21, 23, 24, 25, 26, Gateway host Non-Gateway host
93 Gateways Selection (by applying Rule 2) Rule 2: Assume that u and w are two marked neighbors of marked vertex v in G. If N(v) N(u) N(w)in G and id(v) = min{id(v),id(u),id( w)},then the marker of v is unmarked. id N(id) 2 1, 3, 4, 5, 6, 7, 8, 9 4 1, 2, 3, 9, 10, , 4, 5, 6, 7, 8, N(2) N(4) N(9) and id(2) = min{id(2), id(4), id(9)} Gateway host Non-Gateway host
94 Extended Rules Extended Rules
95 Extended Rules Several extended approaches for selective removal The node-degree-based approach aims at reducing the size of the connected dominating set The energy-level-based approach tries to prolong the average life span of each node.
96 Node-degree-based approach Approach (Rule 3) Rule 3: Consider two marked vertices v and u in G. The marker v is unmarked if one of the following conditions holds: N[v] N[u] in G and nd(w) < nd(u) N[v] N[u] in G and id(v) < id(u) when nd(v) = nd(u), where nd() returns node degree. id nd(id) N(id) ,23, ,21,23,24,25,26, ,25,26 N(21) N(22) and nd(21)=3 < nd(22)=6 20 N(27) N(22) nd(27)=3 < nd(22)= Gateway host Non-Gateway host
97 Node-degree-based approach Approach (Rule 4) Rule 4: Assume that u and w are two marked neighbors of marked vertex v in G. The marker v is unmarked if one of the following conditions holds: Case 1. N(v) N(u) N(w), but N(u) N(v) N(w) and N(w) N(u) N(v) in G. 13 id N(id) 12 N(18) N(11) N(20) 11 4,12,13,15,16,17,18, ,17,19, ,18,19, N(18) N(11) N(20) but N(11) N(18) N(20) N(20) N(11) N(18) Gateway host Non-Gateway host
98 Node-degree-based approach Approach (Rule 4) Rule 4: Case 2. N(v) N(u) N(w) and N(u) N(v) N(w), but N(w) N(u) N(v) in G; and one of the following conditions holds: (a). nd(v) < nd(u) (b). nd(v) = nd(u) and id(v) < id(u) id nd(id) N(id) 2 8 1, 3, 4, 5, 6, 7, 8, , 2, 3, 9, 10, , 4, 5, 6, 7, 8, N(2) N(4) N(9) N(9) N(2) N(4) but N(4) N(2) N(9) nd(9)=7 < nd(2)=8 8 Gateway host Non-Gateway host
99 Node-degree-based approach Approach (Rule 4) Rule 4: Case 3. N(v) N(u) N(w), N(u) N(v) N(w) and N(w) N(u) N(v) in G; marker v should be unmarked if one of the following conditions holds: (a) nd(v) < nd(u) and nd(v) < nd(w) (b) nd(v) = nd(u) < nd(w) and id(v) < id(u) (c) nd(v) = nd(u) = nd(w) and id(v) = min{id(v), id(u), id(w)} id nd(id) N(id) N(13) N(11) N(15) ,12,13,15,16,17,18,20 N(15) N(11) N(13) but ,12,14,15 N(11) N(13) N(15) ,13,14,16 15 nd(13) = nd(15) = id(13) < id(15) Gateway host 20 Non-Gateway host
100 Energy-level-based approach (Rules ) Energy-level-based rules Let EL denote energy level Rules 5,6 Similar to Rules 1 and 2, the only difference is to compare EL prior to node ID. Rules 7,8 Similar to Rules 3 and 4 The only difference: when nodes v and u have the same EL, they compare ND prior to node ID.
101 Conclusions Advantages Overall energy consumption is balanced A relatively small connected dominating set is generated.
102 k-hop Connected Dominating Set Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris ACM Wireless Networks Journal 2002
103 Introduction A dense sensor network can work with only part of all nodes being active It is possible to prolong the network lifetime while maintain its functionality by carefully choosing the active nodes
104 Goal Reduce the energy consumption in sensor networks It should allows as many nodes as possible to turn their radio off Routing efficiency can be guaranteed
105 The Essential Ideas of SPAN non-coordinator node coordinator node Destination Doesn t relay packets Relay packets Source
106 Coordinator Eligibility Rule If two neighbors of a non-coordinator node cannot reach each other directly or via one or two coordinators, the node should become a coordinator non-coordinator node coordinator node Non-coordinator nodes 1 and 6 cannot reach each other directly or via one or two coordinators Become a coordinator node All of the non-coordinator neighbors of node 4 can reach each other directly or via one or two coordinators Not become a coordinator node
107 Coordinator Contention Initial configuration All the nodes are eligible And try to be a coordinator at the same time 1 Boo 2 3 Boo 4 Boo 5 Announcement Contention 6 7
108 Resolving Announcement Contention - using backoff delay C i : Number of additional pairs among the neighbors that can be connected ( ) P i = N i : Number of neighbor pairs 2 Ci = (( 1 ) + R) Ni T Large additional pairs, P Small delay time R : A random number N i : Number of neighbors for node i T : Time unit i b a d c P d = N 2 d 3 = = 3 2 If node d becomes a coordinator node, the additional pairs are (a,b) and (a, c) f e h g = C d =2 C h =0 delay d = ((1-2/3) + R) 3 T Node d has smaller delay P d N 2 d 3 = = 3 2 If node h becomes a coordinator node, no additional pair (all of the neighbors are already connected) delay h = ((1-0/3) + R) 3 T
109 Resolving Announcement Contention - with Energy concern delay Er Ci = ((1 ) + (1 ) + R) Ni T E P m E r : the amount of energy at a node that still remains E m : the maximum amount of energy available at the same node Large remain energy, Small delay time i
110 Coordinator Withdrawal Rules Every pair of its neighbors can reach other either directly or via some other coordinators Become a non-coordinator node nodes1 and node5:can reach each other via coordinator 2 nodes5 and node7:can reach each other directly nodes1 and node7:can reach each other via coordinator3 and coordinator6
111 Conclusions Advantages Energy-Efficient Prolong the network life time
112 Outline 5.1. Motivation and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
113 What s Adaptive Node Activity? Influence the topology of a graph by Selecting certain nodes to be turned on or Selecting certain nodes to be turned off An operation that of course also fits well into the context of clustering or backbone mechanisms. Nodes that are sources or sinks of data are always kept active
114 Adaptive node activity Geography-Informed Energy Conservation for Ad Hoc Routing Y. Xu, J. Heidemann, and D. Estrin ACM/IEEE MobiCom 2001
115 Introduction Motivation Nodes consume high energy during routing, especially during transmission Reduce the energy consumption in ad hoc wireless networks Increase the network lifetime Goal Identifies equivalent nodes for routing Based on location information Turns off unnecessary nodes Load balancing energy usage Lifetime of all nodes remain as long as possible
116 Geographical Adaptive Fidelity(GAF) Routing Distribute routing duties by electing new local leaders periodically. Leaders (active nodes) handle all routing traffic, allowing other nodes to sleep for extended periods of time and conserve energy.
117 Determining Node Equivalence The physical space is divided into equal size squares. Based on nominal radio range Any two nodes in adjacent squares can communicate with each other. In each grid, one node will stay in active state. 2r Destination R r r r R 5 r r r:the length of each grid R:communication range of sensor node Active node Sleeping node Source r r r
118 GAF State Transitions GAF consists of three states Discovery: Due to mobility, node in this state aims to discover all nodes in the same grid Active: In each grid, one node will stay in active state Sleeping: In a grid, all nodes except the active node will stay in sleeping state Sleeping Discovery After Td After Ta Active
119 GAF State Transitions Initially nodes start in the Discovery state Node turns on its radio and find the other nodes within the same grid. The node finish the discovery duration Td, broadcasts its discovery message (node id, grid id, estimated node active time, and node state) and enters Active state. b Td = random [0 ~ constant] The other node switches its state into Sleeping state after receive the discovery message send by the node which has higher rank value then itself. a 75% 54% d c 92% 23% :sleeping state :discovery state :active state
120 Node Ranking Rule Given any two node i and j Rank i > Rank j, if and only if (enat i > enat j ) enat = estimated node active time duration (enlt = expected node lifetime),when enlt larger than a threshold,when enlt becomes less than a threshold If node s lifetime is less than a threshold, stay active state until energy exhaustion. If node s lifetime is larger than a threshold, balancing the remain energy to avoid frequent switches between active/sleep states.
121 GAF State Transitions A node in the Sleeping state wakes up after an application-dependent sleep time Ts, and switches its state into Discovery state. Avoiding the active node leaving the grid and energy unbalance. Ts = random [enat/2~enat] Larger remain energy, Higher rank Switches to Discovery state after Ts a 75% b 54% d c 70% 92% Energy drain 23% :sleeping state :discovery state :active state
122 GAF State Transitions The active node periodically rebroadcasts its discovery message. The active node leave active state if After the time duration enat. Receiving discovery message send by the other node which has higher rank value then itself. b a 54% c Larger remain energy, Higher rank Broadcasts its discovery message Become the active node 75% d 23% 70% Receiving discovery message Switches to Discovery state :sleeping state :discovery state :active state
123 Conclusions GAF increases the network lifetime without decreases the performance substantially Distribute routing duties by electing new local leaders periodically All nodes remain up for as long as possible
124 Outline 5.1. Motivation and Goals 5.2. Power Control and Energy Conservation 5.3. Tree Topology 5.4. k-hop Connected Dominating Set 5.5. Adaptive node activity 5.6. Conclusions
125 Conclusions Various approaches exist to adjust the topology of a network to a desired shape Most of them produce some non-negligible overhead Some distributed coordination among neighbors require additional information. Constructed structures can turn out to be somewhat brittle and the overhead might be wasted. Benefits have to be carefully weighted against risks for the particular scenario at hand
126 References R. Ramanathan and R. Rosales-Hain. Topology Control of Multihop Wireless Networks using Transmit Power Adjustment. In Proceedings of IEEE Infocom, pages , Tel-Aviv, Israel, March 2000 N. Li, J. C. Hou, and L. Sha. Design and Analysis of an MST-Based Topology Control Algorithm. In Proceedings of IEEE INFOCOM, San Francisco, CA, March 2003 J. Wieselthier, G. Nguyen, and A. Ephremides, On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks, in Proc. IEEE Infocom 2000, Tel Aviv, Israel, pp , 2000 Jie Wu, Fei Dai, Ming Gao, and Ivan Stojmenovic, On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks, Journal of Communications and Networks, vol. 4, No. 1, march 2002 B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris. Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. Wireless Networks, 8(5): , 2002 Y. Xu, J. Heidemann, and D. Estrin. Geography-Informed Energy Conservation for Ad Hoc Routing. In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom), pages 70 84, Rome, Italy, July ACM.)
127
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 informationLow Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks
Low Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks Mihaela Cardei, Jie Wu, and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 {mihaela,jie}@cse.fau.edu,
More informationMulticasting in ad hoc networks: Energy efficient
Multicasting in ad hoc networks: Energy efficient Blerta Bishaj Helsinki University of Technology 1. Introduction...2 2. Sources of power consumption... 3 3. Directional antennas... 3 4. TCP... 3 5. Energy-efficient
More informationAN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS
AN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS Shivakumar A B 1, Rashmi K R 2, Ananda Babu J. 3 1,2 M.Tech (CSE) Scholar, 3 CSE, Assistant Professor,
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 informationJournal of Wireless Sensor Networks. Topology control in Heterogeneous Wireless Sensor Network
JWSN 216, 3, 1-18 Journal of Wireless Sensor Networks ISSN: 21-6417 www.wsn-journal.com Article Topology control in Heterogeneous Wireless Sensor Network Deepak Dandekar 1, *, Prashant Deshmukh 2 1 Electronics
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationAnalysis of Minimum-Energy Path-Preserving Graphs for Ad-hoc Wireless Networks
Analysis of Minimum-Energy Path-Preserving Graphs for Ad-hoc Wireless Networks Mahmuda Ahmed, Mehrab Shariar, Shobnom Zerin and Ashikur Rahman Department of Computer Science and Engineering Bangladesh
More informationAN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS
AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS YINGHUI QIU School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, 102206, China ABSTRACT
More informationEnergy-Efficient Range Assignment in Heterogeneous Wireless Sensor Networks
1 Energy-Efficient Range Assignment in Heterogeneous Wireless Sensor Networks Mihaela Cardei, Mohammad O. Pervaiz, and Ionut Cardei Department of Computer Science and Engineering Florida Atlantic University
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 informationPower Aware Routing using Power Control in Ad Hoc Networks
Power Aware Routing using Power Control in Ad Hoc Networks Eun-Sun Jung and Nitin H. Vaidya Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu, Dept.
More informationDelay Analysis of ML-MAC Algorithm For Wireless Sensor Networks
Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks Madhusmita Nandi School of Electronics Engineering, KIIT University Bhubaneswar-751024, Odisha, India ABSTRACT The present work is to evaluate
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 informationExperiments with Broadcast Routing Algorithms for Energy- Constrained Mobile Adhoc Networks. (Due in class on 7 March 2002)
EE Project Description Winter Experiments with Broadcast Routing Algorithms for Energy- Constrained Mobile Adhoc Networks (Due in class on March ) Abstract In this project, you will experiment with the
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 informationEvaluation of Power Aware Routing Protocols Mohammad Mahmud. Wireless Networks Professor: Dr. Lijun Qian
Evaluation of Power Aware Routing Protocols Mohammad Mahmud Wireless Networks Professor: Dr. Lijun Qian Power Aware Routing In a typical network, the route of a packet will be determined by calculating
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 informationFault-tolerant Power-aware Topology Control for Ad-hoc Wireless Networks
Fault-tolerant Power-aware Topology Control for Ad-hoc Wireless Networks Harichandan Roy, Shuvo Kumar De, Md.Maniruzzaman, and Ashikur Rahman Department of Computer Science and Engineering Bangladesh University
More informationHierarchical Low Power Consumption Technique with Location Information for Sensor Networks
Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks Susumu Matsumae Graduate School of Science and Engineering Saga University Saga 840-8502, Japan Fukuhito Ooshita
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 informationMitigating Superfluous Flooding of Control Packets MANET
Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:
More informationMulti-Rate Interference Sensitive and Conflict Aware Multicast in Wireless Ad hoc Networks
Multi-Rate Interference Sensitive and Conflict Aware Multicast in Wireless Ad hoc Networks Asma Ben Hassouna, Hend Koubaa, Farouk Kamoun CRISTAL Laboratory National School of Computer Science ENSI La Manouba,
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationCSMA based Medium Access Control for Wireless Sensor Network
CSMA based Medium Access Control for Wireless Sensor Network H. Hoang, Halmstad University Abstract Wireless sensor networks bring many challenges on implementation of Medium Access Control protocols because
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 informationSpan: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks AUTHORS: B. CHEN, K.JAMIESON, H. BALAKRISHNAN, R. MORRIS TARGET: A power saving technique 2 Multi-hop
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 informationStudy on Techniques for Cluster Head Formation over Mobile Ad Hoc Networks
Study on Techniques for Cluster Head Formation over Mobile Ad Hoc Networks B.Sindhuja 1, Dr.J.Shanthini 2 PG Scholar, Department of Information Technology, SNS College of Technology, Coimbatore, Tamil
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 informationSENSOR-MAC CASE STUDY
SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle
More informationEnergy Efficient Data Gathering For Throughput Maximization with Multicast Protocol In Wireless Sensor Networks
Energy Efficient Data Gathering For Throughput Maximization with Multicast Protocol In Wireless Sensor Networks S. Gokilarani 1, P. B. Pankajavalli 2 1 Research Scholar, Kongu Arts and Science College,
More informationResearch Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks
Distributed Sensor Networks Volume 2013, Article ID 858765, 6 pages http://dx.doi.org/10.1155/2013/858765 Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless
More informationDistributed STDMA in Ad Hoc Networks
Distributed STDMA in Ad Hoc Networks Jimmi Grönkvist Swedish Defence Research Agency SE-581 11 Linköping, Sweden email: jimgro@foi.se Abstract Spatial reuse TDMA is a collision-free access scheme for ad
More informationTime Synchronization in Wireless Sensor Networks: CCTS
Time Synchronization in Wireless Sensor Networks: CCTS 1 Nerin Thomas, 2 Smita C Thomas 1, 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: A time synchronization algorithm
More informationImproving IEEE Power Saving Mechanism
1 Improving IEEE 82.11 Power Saving Mechanism Eun-Sun Jung 1 and Nitin H. Vaidya 2 1 Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu 2 Dept. of
More informationBattery Power Management Routing Considering Participation Duration for Mobile Ad Hoc Networks
Battery Power Management Routing Considering Participation Duration for Mobile Ad Hoc Networks Masaru Yoshimachi and Yoshifumi Manabe movement of the devices. Thus the routing protocols for MANET need
More informationAn Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol
An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol Hung-Wei Tseng, Shih-Hsien Yang, Po-Yu Chuang,Eric Hsiao-Kuang Wu, and Gen-Huey Chen Dept. of Computer Science and Information Engineering,
More informationCOORDINATED ENERGY CONSERVATION IN AD HOC NETWORKS
COORDINATED ENERGY CONSERVATION IN AD HOC NETWORKS Selma Ikiz, Vinit A. Ogale and Vijay K. Garg {ikiz, ogale, garg }@ece.utexas.edu Dept of Electrical and Computer Engineering The University of Texas at
More informationMotivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control
Topology Control Andreas Wolf (0325330) 17.01.2007 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity Options for topology control
More informationConnected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees Pouya Ostovari Department of Computer and Information Siences Temple University Philadelphia, Pennsylvania, USA Email: ostovari@temple.edu
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 informationIMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS
IMPROVING THE DATA COLLECTION RATE IN WIRELESS SENSOR NETWORKS BY USING THE MOBILE RELAYS 1 K MADHURI, 2 J.KRISHNA, 3 C.SIVABALAJI II M.Tech CSE, AITS, Asst Professor CSE, AITS, Asst Professor CSE, NIST
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 informationSensor Network Protocols
EE360: Lecture 15 Outline Sensor Network Protocols Announcements 2nd paper summary due March 7 Reschedule Wed lecture: 11-12:15? 12-1:15? 5-6:15? Project poster session March 15 5:30pm? Next HW posted
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationDISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK
DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK G.Ratna kumar, Dr.M.Sailaja, Department(E.C.E), JNTU Kakinada,AP, India ratna_kumar43@yahoo.com, sailaja.hece@gmail.com ABSTRACT:
More informationNEW! Updates from previous draft Based on group mailing list discussions Added definition of optimal scalability with examples (captures idea of suffi
IRTF ANS WG Meeting, November 12, 2003 Notes on Scalability of Wireless Ad hoc Networks Onur Arpacioglu, Tara Small and Zygmunt J. Haas , which extends
More informationSensor Deployment, Self- Organization, And Localization. Model of Sensor Nodes. Model of Sensor Nodes. WiSe
Sensor Deployment, Self- Organization, And Localization Material taken from Sensor Network Operations by Shashi Phoa, Thomas La Porta and Christopher Griffin, John Wiley, 2007 5/20/2008 WiSeLab@WMU; www.cs.wmich.edu/wise
More informationExtending the Lifetime of Ad Hoc Wireless Networks
Extending the Lifetime of Ad Hoc Wireless Networks R.I. da Silva 1, J.C.B. Leite 2, and M.P. Fernandez 3 1 Fac. de Tecnologia e Ciências de Conselheiro Lafaiete, Univ. Prof. Antônio Carlos Conselheiro
More informationSubject: Adhoc Networks
ISSUES IN AD HOC WIRELESS NETWORKS The major issues that affect the design, deployment, & performance of an ad hoc wireless network system are: Medium Access Scheme. Transport Layer Protocol. Routing.
More informationResearch Paper FAULT MANAGEMENT USING MODIFIED RAT FOR WIRELESS SENSOR NETWORKS Sathyapriya.L Jawahar A
Research Paper FAULT MANAGEMENT USING MODIFIED RAT FOR WIRELESS SENSOR NETWORKS a b Sathyapriya.L Jawahar A Address for Correspondence b Professor, a Research Scholar, Department of ECE, SSN College of
More informationCOMPARISON OF TIME-BASED AND SMAC PROTOCOLS IN FLAT GRID WIRELESS SENSOR NETWORKS VER VARYING TRAFFIC DENSITY Jobin Varghese 1 and K.
COMPARISON OF TIME-BASED AND SMAC PROTOCOLS IN FLAT GRID WIRELESS SENSOR NETWORKS VER VARYING TRAFFIC DENSITY Jobin Varghese 1 and K. Nisha Menon 2 1 Mar Baselios Christian College of Engineering and Technology,
More informationII. CLASSIFICATION OF ROUTING PROTOCOLS MANET routing protocols are classified into three major categories: proactive, reactive and hybrid.
A COMPLETE STUDY ON POWER AWARE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORK A. Kumaravel 1, Dr. M.Chandrasekaran 2 1 (Electronics and Communication Engineering, Paavai Engineering College,India) 2 (Electronics
More informationAbstract. Figure 1. Typical Mobile Sensor Node IJERTV2IS70270
Base Station Assisted Routing Protocol For Wireless Sensor Network Vaibhav Pratap Singh and Harish Kumar Gurgaon Institute of Technology and Management (GITM), Gurgaon (Haryana), INDIA Abstract A wireless
More informationEnergy Management Issue in Ad Hoc Networks
Wireless Ad Hoc and Sensor Networks - Energy Management Outline Energy Management Issue in ad hoc networks WS 2010/2011 Main Reasons for Energy Management in ad hoc networks Classification of Energy Management
More informationInternational Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.1, January 2012
ENERGY EFFICIENT MAXIMUM LIFETIME ROUTING FOR WIRELESS SENSOR NETWORK Sourabh Jain 1, Praveen Kaushik 1, Jyoti Singhai 2 1 Department of Computer Sciene and Engineering Maulana Azad National Institute
More informationA Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks
A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo 18-858 Japan {yamin, speng}@k.hosei.ac.jp
More informationFigure 1. Clustering in MANET.
Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance
More informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai Department of Electrical and Computer Engineering North Dakota State University Fargo, ND 5805 Email: fdai@ece.ndsu.edu
More informationPerformance and Comparison of Energy Efficient MAC Protocol in Wireless Sensor Network
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 3 March 2015, Page No. 10652-10656 Performance and Comparison of Energy Efficient MAC Protocol in Wireless
More informationEnergy Efficient Routing of Wireless Sensor Networks Using Virtual Backbone and life time Maximization of Nodes
Energy Efficient Routing of Wireless Sensor Networks Using Virtual Backbone and life time Maximization of Nodes Umesh B.N 1, Dr G Vasanth 2 and Dr Siddaraju 3 1 Research Scholar, 2 Professor & Head, Dept
More informationA Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem
2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC) A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationEnergy Management Issue in Ad Hoc Networks
Wireless Ad Hoc and Sensor Networks (Energy Management) Outline Energy Management Issue in ad hoc networks WS 2009/2010 Main Reasons for Energy Management in ad hoc networks Classification of Energy Management
More informationOptimal Multi-sink Positioning and Energy-efficient Routing in Wireless Sensor Networks
Optimal Multi-sink Positioning and Energy-efficient Routing in Wireless Sensor Networks Haeyong Kim, Yongho Seok, Nakjung Choi, Yanghee Choi, and Taekyoung Kwon School of Computer Science and Engineering
More informationAn Energy-Efficient Data-Dissemination Protocol in Wireless Sensor Networks
An Energy-Efficient Data-Dissemination Protocol in Wireless Sensor Networks Zehua Zhou Xiaojing Xiang State University of New York at Buffalo Buffalo, NY, USA {zzhou5, xxiang}@cse.buffalo.edu Xin Wang
More informationZonal Rumor Routing for. Wireless Sensor Networks
Tarun Banka Department of Electrical and Computer Engineering tarunb@engr.colostate.edu Zonal Rumor Routing for. Wireless Sensor Networks Gagan Tandon Department of Computer Science gagan@cs.colostate.edu
More informationAn Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks Fei Dai and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton,
More informationThe Effect of Physical Topology on Wireless Sensor Network Lifetime
1 JOURNAL OF NETWORKS, VOL., NO. 5, SEPTEMBER 7 The Effect of Physical Topology on Wireless Sensor Network Lifetime Debdhanit Yupho Planning Department Aeronautical Radio of Thailand Limited, Bangkok,
More informationGeographical Routing Algorithms In Asynchronous Wireless Sensor Network
Geographical Routing Algorithms In Asynchronous Wireless Sensor Network Vaishali.S.K, N.G.Palan Electronics and telecommunication, Cummins College of engineering for women Karvenagar, Pune, India Abstract-
More informationROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks
ROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks Hogil Kim and Eun Jung Kim Department of Computer Science Texas A&M University College Station,
More informationPerformance of a Novel Energy-Efficient and Energy Awareness Scheme for Long-Lifetime Wireless Sensor Networks
Sensors and Materials, Vol. 27, No. 8 (2015) 697 708 MYU Tokyo S & M 1106 Performance of a Novel Energy-Efficient and Energy Awareness Scheme for Long-Lifetime Wireless Sensor Networks Tan-Hsu Tan 1, Neng-Chung
More informationA Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks
A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks Wei Lou and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343
More informationAn Enhanced General Self-Organized Tree-Based Energy- Balance Routing Protocol (EGSTEB) for Wireless Sensor Network
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 239-7242 Volume 4 Issue 8 Aug 205, Page No. 3640-3643 An Enhanced General Self-Organized Tree-Based Energy- Balance Routing
More informationIntroduction to Mobile Ad hoc Networks (MANETs)
Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device
More informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343 Abstract
More informationReservation Packet Medium Access Control for Wireless Sensor Networks
Reservation Packet Medium Access Control for Wireless Sensor Networks Hengguang Li and Paul D Mitchell Abstract - This paper introduces the Reservation Packet Medium Access Control (RP-MAC) protocol for
More informationThe General Analysis of Proactive Protocols DSDV, FSR and WRP
Volume 116 No. 10 2017, 375-380 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu The General Analysis of Proactive Protocols DSDV, FSR and WRP 1 Dr.
More informationSelective Backbone Construction for Topology Control in Ad Hoc Networks
Selective Backbone Construction for Topology Control in Ad Hoc Networks Haitao Liu and Rajiv Gupta Dept. of Computer Science The University of Arizona Tucson, Arizona 85721 Email: {haitaol,gupta}@cs.arizona.edu
More informationMAC Essentials for Wireless Sensor Networks
MAC Essentials for Wireless Sensor Networks Abdelmalik Bachir, Mischa Dohler, Senior Member, IEEE, Thomas Watteyne, Member, IEEE, and Kin K. Leung, Fellow, IEEE Medium access control Part of the link layer
More informationAn Adaptive Self-Organization Protocol for Wireless Sensor Networks
An Adaptive Self-Organization Protocol for Wireless Sensor Networks Kil-Woong Jang 1 and Byung-Soon Kim 2 1 Dept. of Mathematical and Information Science, Korea Maritime University 1 YeongDo-Gu Dongsam-Dong,
More informationFig. 2: Architecture of sensor node
Volume 4, Issue 11, November 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com To Reduce
More informationEnergy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks
Energy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks Caimu Tang Computer Science Department University of Southern California Los Angeles, CA 90089 Cauligi S.
More informationEnergy-efficient routing algorithms for Wireless Sensor Networks
Energy-efficient routing algorithms for Wireless Sensor Networks Chao Peng Graduate School of Information Science Japan Advanced Institute of Science and Technology March 8, 2007 Presentation Flow Introduction
More informationMultipath Routing Algorithm for Wireless Sensor Networks
Multipath Routing Algorithm for Wireless Sensor Networks by Ye Ming Lu B. Eng., École Ploytechnique de Montréal, 1999 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER
More informationIntra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network
Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network V. Shunmuga Sundari 1, N. Mymoon Zuviria 2 1 Student, 2 Asisstant Professor, Computer Science and Engineering, National College
More informationEffect Of Grouping Cluster Based on Overlapping FOV In Wireless Multimedia Sensor Network
Effect Of Grouping Cluster Based on Overlapping FOV In Wireless Multimedia Sensor Network Shikha Swaroop Department of Information Technology Dehradun Institute of Technology Dehradun, Uttarakhand. er.shikhaswaroop@gmail.com
More informationReducing Inter-cluster TDMA Interference by Adaptive MAC Allocation in Sensor Networks
Reducing Inter-cluster TDMA Interference by Adaptive MAC Allocation in Sensor Networks Abstract Tao Wu and Subir Biswas 1 Dept. of Electrical and Computer Engineering, Michigan State University wutao2@egr.msu.edu,
More informationUAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks
UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks Sung-Hee Lee, Jong-Mu Choi, and Young-Bae Ko College of Information and Communication, Ajou University, South Korea shlee@dmc.ajou.ac.kr,
More informationAN ADAPTIVE ENERGY EFFICIENT MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS
International Journal on Intelligent Electronic Systems, Vol.3, No.2, July 2009 7 Abstract AN ADAPTIVE ENERGY EFFICIENT MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS Lakshmanan M., Noor Mohammed V. 1 E-mail
More informationA NOVEL DISTRIBUTED PROTOCOL FOR RANDOMLY DEPLOYED CLUSTERED BASED WIRELESS SENSOR NETWORK:
A NOVEL DISTRIBUTED PROTOCOL FOR RANDOMLY DEPLOYED CLUSTERED BASED WIRELESS SENSOR NETWORK: 1 SANJAYA KUMAR PADHI, 2 PRASANT KUMAR PATTNAIK 1 Asstt Prof., Department of ComputerSciene and Engineering,
More informationMAC protocols. Lecturer: Dmitri A. Moltchanov
MAC protocols Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2616/ OUTLINE: Problems for MAC to deal with; Design goals; Classification of MAC protocols Contention-based
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 informationConnectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks
Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks Fatiha Djemili Tolba University of Haute Alsace GRTC Colmar, France fatiha.tolba@uha.fr Damien Magoni University
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 informationEnergy-Aware Routing in Wireless Ad-hoc Networks
Energy-Aware Routing in Wireless Ad-hoc Networks Panagiotis C. Kokkinos Christos A. Papageorgiou Emmanouel A. Varvarigos Abstract In this work we study energy efficient routing strategies for wireless
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 informationResearch on Relative Coordinate Localization of Nodes Based on Topology Control
Journal of Information Hiding and Multimedia Signal Processing c 2018 ISSN 2073-4212 Ubiquitous International Volume 9, Number 2, March 2018 Research on Relative Coordinate Localization of Nodes Based
More information