Академический Документы
Профессиональный Документы
Культура Документы
Under the Guidance of: Mr. Chidambara K Professor, Dept. of CSE PESIT, Bangalore
Contents
ZigBee & Properties. Devices, States & Networks ZigBee. System Architecture. Problem Formulation. Algorithm. Properties of Algorithms.
2 /26
Recent advances in wireless communication has strong impact on development of wireless sensor networks. 802.15 Standards Committee Wireless Personal Area Network ( WPAN ).
802.15.4
Unique communication standard designed for LRWPAN. It has extremely low Complexity, Cost, Power consumption. Used in inexpensive, portable, and mobile devices. It requires only about 10% of the software of 1PI11SCS05 | Varun 3 Jan 2012 - Jun 2012 Kumar.I typical Bluetooth or Wireless Internet /26 a
Application/Profiles
Network Topologies:
6 /26
System Architecture.
IEEE 802.15.4 defines the physical layer (PL) and medium access control (MAC) layer for low-rate wireless personal area networks (LR-WPANs). IEEE 802.15.4 defines a super frame structure that begins by transmitting a beacon issued by a PAN coordinator. The process consist of
ACTIVE Period: Coordinator and the devices communicate each other. INACTIVE Period: Enter into Low-Power phase. 1PI11SCS05 | Varun 7
Kumar.I Jan 2012 - Jun 2012 /26
System Architecture.
A beacon is transmitted by the coordinator at slot-0. Followed by CAP, during this period it can transmit non time-critical messages and mac commands. Followed by CFP, during this period Guaranteed time slot -(GTS) is provided 1PI11SCS05 | Varun 8 Jan 2012 Jun 2012 Kumar.I /26 exclusively for transmission.
System Architecture.
The device that require GTS in the next super frame of CFP, they send GTS requests to the coordinator. ZEDs are directly connected to ZC in star topology. In cluster-tree & mesh topology communication is done in multi-hop fashion through ZR. 1PI11SCS05 | Varun 9
Problem Formulation.
Each vertex v V is associated with nonnegative capacity (v)0. Each directed edge (u,v) is associated with an implicit capacity c(u,v) = if (u,v) E c(u,v) = 0 if (u,v) E
Jan 2012 - Jun 2012 10 /26
Problem Formulation.
Let f be the flow in network G as f: VVR, where f(u,v) is the net flow from vertex u to vertex v. A flow network that satisfies the following 3 properties
Capacity Skew Flow
constraint:
symmetry:
conservation:
11 /26
Problem Formulation.
Value of flow f is defined as the total net flow into the sink. uV f(u,t)
Given network G with s snd t, objective is to find maximum flow from s to t in G.
12 /26
Algorithm.
Pull-Push-Relabel (PPR) algorithm is proposed to maximize flow in ZigBee clustertree network. Residual capacity with respect to f:
in in
13 /26
Algorithm.
Total net flow into a vertex v is defined as e(v) = uV f(u,v). A vertex vV {s,t} is said to be over flowing if e(v) > 0. Height function h: V N for f is defined as h(s)=|V|, h(t) = 0 and h(u) h(v) + 1 for every residual edge (u,v) Ef.
14 /26
Algorithm.
PULL
In a PULL(u,v) operation, a lower vertex u pulls the flow of a higher vertex v downward to itself. Conditions to be satisfied: v is overflowing, i.e., e(v) > 0; There is an edge from v to u in G, i.e., c(v,u) = ; The residual capability of u is positive, i.e., f (u) > 0; 1PI11SCS05 | Varun 15 Jan 2012 - Jun 2012 Kumar.I /26 u is lower than v by 1, i.e., h(v) = h(u) + 1.
Algorithm.
PULL
Procedure 1. PULL(u,v) Applicability: e(v) > 0, c(v,u) = , (u) > f 0, and h(v) = h(u) + 1 Action: u pulls = min( e(v), (u)) units of f flow from v 1: f(v,u) f(v, u) + 2: f(u, v) -f(v, u) 3: e(v) e(v) - 4: e(u) e(u) +Jan 2012 - Jun 2012 1PI11SCS05 | Varun 16
Kumar.I /26
Algorithm.
PUSH
In a PUSH(u,v) operation, a higher vertex u pushes the over-pulled flow back to a lower vertex v along the edge (v,u)G. Conditions to be satisfied: u is overflowing, i.e., e(u) > 0; There is no edge from u to v in G, i.e., c(u,v) ; There is a positive net flow on (v,u), i.e., c f (u, v) > 0; 1PI11SCS05 | Varun 17 Jan 2012 - Jun 2012 Kumar.I u is higher than v by one, i.e., h(u) = h(v) /26 +
Algorithm.
PUSH
Procedure 2. PUSH(u,v) Applicability: e(u) > 0, c(u,v) , c (u, v) f > 0, and h(u) = h(v) + 1 Action: u = min ( e(u), c (u,v) ) units of f flow to v 1: f(u,v) f(u,v) + 2: f(v,u) -f(u,v) 3: e(u) e(u) - 4: e(v) e(v) +Jan 2012 - Jun 2012 1PI11SCS05 | Varun 18
Kumar.I
/26
Algorithm.
RELABEL It enables a vertex u to increase its height. Conditions to be satisfied:
u is overflowing, i.e., e(u) > 0; (u, v) Ef implies that h(u) h(v) for all vertices vV.
Procedure 3. RELABEL(u) Applicability: e(u) > 0, and (u, v) E h(u) f h(v), v V 1PI11SCS05 | Varun 19 Jan 2012 - Jun 2012 Action: u increases its height to 1 + min{h(v) |/26 Kumar.I
Algorithm.
PULL-PUSH-RELABEL Procedure 4. PULL-PUSH-RELABEL(u)
1: for all v Adj(u) do 2: PULL(u,v) 3: if u cannot be pulled by any other vertex then 4: for all v Adj(u) do 5: PUSH(u,v) 6: RELABEL(u)
20 /26
Algorithm.
Procedure 5. INIT(u) 1: if u is source s then 2: h(u) |V| 3: for all v Adj(u) do 8: else if u Adj(s) then 4: h(v) 0 9: h(u) 0 10: e(u) 0 5: e(v) (v) 11: for all v 6: f(u,v) Adj(u) do (v) 12: f(u,v) 0 7: f(v,u) - 13: f(v,u) 0 1PI11SCS05 | Varun 21 (v) Jan 2012 - Jun 2012 Kumar.I /26
Algorithm.
Algorithm 1. PPR
1: for all u V do 2: INIT(u) 3: while there exists any overflowing vertex do 4: for all u V do 5: PULL-PUSH-RELABEL(u)
22 /26
Properties of Algorithms
Lemma 1. During the execution of Algorithm PPR, if a vertex u V is overflowing, u performs a push or a relabel operation; otherwise, a pull operation is performed on u. Lemma 2. Whenever a vertex u performs a relabel operation on itself, its height h(u) increases by at least 1. Lemma 3. If h is initialized as a height function, then it remains a height function throughout Algorithm PPR. 1PI11SCS05 | Varun 23 Jan 2012 - Jun 2012
Kumar.I /26
Properties of Algorithms
Lemma 4. Let f be a pre-flow in G and let h be a height function of f. Then, there will not be a path from the source s to the sink t in the residual network Gf . Lemma 5. The vertex-constraint maximum flow problem can be reduced to the traditional maximum flow problem.
24 /26
Properties of Algorithms
Theorem 1 (Optimality of Algorithm PPR). When Algorithm PPR terminates, the preflow f is a maximum flow from the source s to the sink t in G. Theorem 2 (Convergence of Algorithm PPR). Algorithm PPR always terminates within 2|V|2 passes.
25 /26
Thanks