To view this presentation, you'll need to enable Flash.

Show me how

After you enable Flash, refresh this webpage and the presentation should play.

Loading...

PPT – Wireless Ad Hoc / Sensor Networks: Energy Efficiency and Cooperativeness PowerPoint presentation | free to download - id: 18022c-ZDc1Z

The Adobe Flash plugin is needed to view this content

View by Category

Presentations

Products
Sold on our sister site CrystalGraphics.com

About This Presentation

Write a Comment

User Comments (0)

Transcript and Presenter's Notes

Wireless Ad Hoc / Sensor NetworksEnergy

Efficiency and Cooperativeness

- Xiang-Yang Li
- Illinois Institute of Technology

xli_at_cs.iit.edu

Acknowledgment

- Colleagues
- Ophir Frieder, Sanjiv Kapoor, Peng-Jun Wan, Gruia

Calinescu, Ming-Yang Kao, Zheng Sun, Xiaowen

Chu,. - PhD Students
- Yu Wang, WeiZhao Wang, WenZhan Song, Kousha

Moaveninejad, Chih-Wei Yi - Support
- NSF CCR 0311174, 0342259

Organization

- Achievement Summary
- Research on Wireless Networks
- Students Supervising, Supervised
- Services
- Research
- Wireless networks
- Energy efficiency
- Cooperative issues
- Algorithm design and analysis
- Computational geometry
- Algorithm mechanism design
- Conclusion

Research on Wireless Networks

- Published papers (since joined IIT at 2000)
- Journals 31 (20 published, 11 accepted)
- 10 IEEE Transactions, 8 ACM Journals
- Referred Conferences 57
- 2 ACM MobiCom, 4 ACM MobiHoc, 5 IEEE INFOCOM, 1

ACM SODA. - Best paper awards
- COCOON 2001
- IEEE HICSS 35 (2002)
- ACM MobiCom 2005
- one of three best paper candidates other 2 from

MIT - Funding
- NSF for Wireless CDMA assignment (co-PI)
- NSF for workshop on Algorithms in Wireless

Networks

Students

- Students Supervised
- Yu Wang (PhD 2004, Assistant professor at CS,

UNCC) - WenZhan Song (PhD 2005, Assistant professor at

CS, WSU) - Ovidiu Cristea (MS 2004), Mihai Moldovan (MS

2005) - Students Supervising
- Kousha Moaveninejad (PhD expected 2006)
- Weizhao Wang (PhD expected 2006)
- Ashraf Nusairat (PhD, 2004--?)
- Yanwei Wu (PhD, 2005--?)
- QiZhong Hu (MS)
- Thesis Committee
- A number of PhD and MS students

Services

- To the discipline
- Guest editor of ACM MONET, IEEE JSAC
- Editor Ad hoc Sensor Wireless Networks An

International Journal - TPC member of a number of conferences, e.g.,
- ACM MobiHoc 2005, IEEE INFOCOM 2005, IEEE ICCCN

2005, IEEE MASS 2005, IEEE RTSS 2004 - Invited review of
- NSF proposals
- Articles for numerous well-known journals
- Gave more than 15 invited colloquiums worldwide
- HongKong, China, Mexico, USA
- Invited tutorial at ACM MobiHoc

Services

- To the university, department
- Graduate student admission (2000-present)
- Graduate Study Committee (2002-present)
- Undergraduate Study Comm. (2000-2002)
- Undergraduate CAMRAS Award Interviewer
- Sophomore Leadership Retreat

Research

- Main research area
- Wireless networks
- Energy efficiency
- Efficient distributed algorithm design
- Cooperative issues
- Algorithm Design and Analysis
- Algorithm mechanism design
- Computational geometry
- High quality mesh generation

Organization

- Achievement Summary
- Research on Wireless Networks
- Students Supervising, Supervised
- Services
- Research
- Wireless networks
- Energy efficiency
- Cooperative issues
- Algorithm design and analysis
- Computational geometry
- Algorithm mechanism design
- Conclusion

Wireless Ad Hoc Network

- No wired infrastructure
- Self-organized
- All nodes act as routers
- Broadcasted signal
- Powered by battery (majority)
- Mobile (maybe)
- Potential Multi-hop routes

Energy Efficiency at Routing

- Many routing protocols proposed
- Metric Based Routing
- DSR, AODV, .
- Location Based Routing
- GPSR, GFG, AFR,.
- Content Based Routing
- Which links to use
- Shorter links more stable, thus less

retransmission - Save energy possibly

Location Based Routing

- Each node forwards message to best neighbor
- E.g., best ? closest to target

t

s

Greedy Routing?

- Fails to deliver

t

?

w

s

What should node w do?

Get out of local minimum

- Find a planar graph
- Gabriel Graph, for example
- Face Routing or Right Hand Rule

t

?

w

s

Topology Control

- Topology control is to select some nodes and/or

some available links as candidates for routing - Backbone based structures select some nodes
- Mainly used for broadcast, multicast
- Typically assume that nodes power fixed
- thus minimize the number of backbone nodes

(MCDS) - Flat structures select some links, e.g., GG,LMST
- Used for unicast, or broadcast
- Typically assume that nodes power adjustable
- ---thus minimize the total power (so called

low-weight), or power to connect any pair of

devices (so called spanner)

Backbone Structure

- Select some nodes
- Form a backbone (Connected Dominating Set)
- each other node is connected to some node in

backbone - Backbone needs to be connected
- Our efficient distributed methods
- Using only O(n) total messages, find a backbone

at most 12 times optimum - Proved to be power spanner (fixed or adjustable)
- Published at IEEE ICDCS02, then IEEE TPDS03

Flat What we want to achieve?

- Build a single structure efficiently with a

number of nice properties - Power efficient Unicast (majority operations)
- Power efficient broadcast (widely used in WSN)
- Bounded node degree (logical, physical)
- Planar structure (support greedy routing)
- Separated neighbors (directional antenna, reduce

signal interference) - All these properties are achieved in a single

structure - After a sequence of results

What do we mean by efficiently?

- Best scenario
- Localized method (run in constant rounds) to

build such structure - Each node u quickly determines which links uv to

keep locally - Our achievement
- A semi-localized method with total communication

cost O(n log n) bits with wireless broadcast

model - Worst case still O(n) rounds

Our Network Model

- A set V of n wireless nodes in 2D region
- All nodes with same transmission power (fixed

power) - Ideal case, ?
- It induces a unit disk graph UDG
- Two nodes are connected directly if distance at

most one unit - Each node knows the position of its one-hop

neighbors - Localization techniques assumed already in place

Adjustable Power Model

- Power needed to support a link uv is proportional

to - This model
- Only accounts for emission power
- Good only if long range communication, or

techniques are used to reduce the receiving power

Priory Arts Some Structures

RNG

GG

MST

Yao

Priori Arts

published Topology Planar Unicast Spanner Low weight Degree Bound Comm. Cost

INFOCOM 01 YAOGG Yes Yes NO NO O(n)

PODC 01 CBTC No Yes No Yes O(n)

MobiHoc 01 RDG Yes Yes No No O(n2)

ICCCN 02 Yao No Yes No No O(n)

INFOCOM 03, LMST Yes No No 6 n

MobiCom 04 FLSS No Yes No No O(n)

Not completed here, due to space limit

Our Results

published Topology Planar Unicast Spanner Low weight Degree Bound Comm. Cost

ICCCN 01 RNG Yes No No No n

ICCCN 01 GG Yes Yes No No n

ICCCN 01 Yao No Yes No 7 (2K1)n

INFOCOM 02, TPDS LDel Yes Yes No No 60n

INFOCOM 04, TPDS LMST2 Yes No Yes 6 700 n

MONET IMRG Yes No Yes 6 7n

DialM 03, MONET BPS Yes Yes No 27 700n

MobiHoc 04, MONET OrdYaoGG Yes Yes No 12 24n

MobiHoc 04, MONET SYaoGG Yes Yes No 9 3n

MobiCom 05, LSQGG Yes Yes Yes 9 12 n

Not completed here, due to space limit

Power Efficient Unicast Structure

- Assume GG has been constructed. All nodes marked

unprocessed initially. - Once a node u has smallest ID among unprocessed

neighbors, then - If it has processed neighbors, then it keeps the

nearest processed neighbor and delete other links

conflicted with this - Otherwise, it selects the nearest unprocessed

neighbor and delete the conflicted links and

repeat till all nodes are processed - Let SqGG be the final structure

w

Q-region

Structure Illustration

e

d

c

f

b

g

h

a

i

u

j

r

k

l

q

p

m

n

o

Properties

- We can prove that the resulting topology is
- Planar
- Power efficient for unicast
- Bounded logical node degree
- Neighbor q-separation
- What we miss is (counter example omitted)
- Power efficient for broadcast (low weight)

Energy Efficient Broadcast

Any broadcast can be viewed as an arborescence

rooted at s

s

Priori Arts On Efficient Broadcast

- Several Structures Proposed
- MST, BIP, SPT, RNG, etc.,
- Theoretically Good INFOCOM, WINET
- MST, BIP within constant of optimum
- But,
- not localized, or even not efficient in a

distributed way - Not efficient for unicast

Broadcast Low-weight Optimal

A structure is called low-weighted if its total

link length is within O(1) of MST

Proved previously (INFOCOM03, TPDS04) Given

any low-weighted structure H, the total power

consumption for broadcast is asymptotically best

among all locally constructed structures

Proposed several localized methods with O(n)

messages that construct a low-weighted structure

----(TPDS04, WINET05)

Add Low-Weight Property

- Our previous approach
- Given a structure, such as RNG, LMST

v

u

y

x

Any node x removes the longest link of any

quadrilateral xyvu

Not Efficient for Unicast Anymore

May break connectivity for graph SQGG constructed

previously

Our New Unified Structure

- Build SqGG graph
- Each node x collects 2-hop links E(x) in SqGG
- Node x picks an incident link xy
- with smallest ID (xy, maxID(x,y), minID(x,y))
- If exits uv such that xygtmax(uv,3ux,3vy)
- removes link xy from E(x)
- Otherwise
- keeps link xy forever
- Let LSqGG be the final structure

Properties

- We can prove that the resulting topology
- Planar
- Power efficient for unicast
- Bounded logical node degree
- Neighbor q-separation
- Power efficient for broadcast (low weight)
- Can be constructed efficiently using O(n) messages

Expected Interference

- Interference
- The physical degree of node u

I(u)7

Random Deployment

- When nodes are of Poisson distribution
- The maximum node interference is at least O(log

n) for any connected structure almost surely - Proof omitted
- Thus our structures also are bad in terms of the

maximum node interference

Random Deployment

- When nodes are of Poisson distribution
- The average node interference is only O(1) for

the following structures - RNG, GG, LMST, SqGG, LSqGG,..,

See our ACM MobiCom 2005 paper for more details

about these structures and proofs

Other Results

- Determine Transmission Range (MobiHoc03)
- So the induced graph has some properties almost

surely for certain random distribution - The critical range for connectivity and

k-connectivity - OVSF/CDMA Code Assignment (DialM03, COCOON05)
- PTAS for IS, VC in some graphs
- To maximize the bottleneck and throughput
- Build CDS Efficiently (ICDCS02, TPDS03)
- Linear messages, 12-approximation
- Some Geometry Results
- New structure Local Delaunay Graph (INFOCOM02,

WADS04) - Spanning ratios of Beta-Skeleton (CCCG)
- High Quality mesh generation (STOC00, SODA01)

Organization

- Achievement Summary
- Research on Wireless Networks
- Students Supervising, Supervised
- Services
- Research
- Wireless networks
- Energy efficiency
- Cooperative issues
- Algorithm design and analysis
- Computational geometry
- Algorithm mechanism design
- Conclusion

New Dimension

- Previously, Efficient topology control
- Time, space, communication efficiency
- Assumption
- Participants act as instructed
- Not always true
- Faulty ones ? Fault-tolerant computing
- Malicious ones ? Security, and Trusted computing
- Selfish ones ? Truthful computing

How to deal with selfish nodes?

- Reputation based methods
- Nodes are rated by peers
- Detecting/punishing/avoiding
- Pay each node its declared cost
- Node will manipulate its declared cost to

increase its profit - May reach a stable point no node will

unilaterally change its declared cost---Nash

Equilibrium - Pay each node some payment
- Node maximizes its profit when it reports cost

truthfully--- Dominant Strategy - So relieve nodes from manipulating declared cost

Non-Cooperative Networks

SP 1

3

4

4.5

4.8

4.9

6

SP 2

5

7

SP 3

Non-Cooperative Networks

- Network Agent
- Selfish Only interested in its own benefit

instead of system performance - Rational Do what will maximize its own benefit
- Non-Cooperative Networks
- A set of n agents which are selfish and rational
- For each agent, it has a set of strategies
- Algorithm mechanism design
- Mechanism M(O,P)
- O determines who to be selected
- P determines how much to pay the agents

Unicast

- Node vk costs ck to relay (private knowledge)
- Each node vk is asked to report a cost dk
- Find the least cost path from node v0 to node v9

based on reported costs d - Compute a payment pk for node vk based on d

8

7

6

7

9

5

1

7

- Objective Find a payment pk(d) so node

maximizes utility when dk ck

Truthful Unicast Scheme

- Output O
- Least cost path from s to t, by LCP(s, t, G)
- Payment to a relay node vk (VCG mechanism 2nd

price auction) - Remove it and its incident links
- Compute the shortest path from s to t
- The payment to vk is
- Otherwise the payment is 0
- Present a centralized method with time O(mn log

n) to compute payment to all nodes - Clearly asymptotically optimum
- IEEE Transaction on Mobile Computing, 2005

Multicast

- K receiving nodes R and a source
- Node vk costs ck to relay (private knowledge)
- Each node vk is asked to report a cost dk
- Find the minimum cost tree spanning all receivers

and source node based on reported costs d - Compute a payment pk for node vk based on d

- Objective Find a payment pk(d) so node

maximizes utility when dk ck

LCPT Based Mechanism

- Structure (node or link or both)
- Calculate all shortest paths from source node to

receivers - Combine these shortest paths
- The structure is a tree called Least Cost Path

Tree (LCPT) - Payment Scheme
- Calculate the payment for node vk based on every

LCP containing vk - Choosing the maximum of these payments as the

final payment

4

3

7

3

2

Other Structures

- VCG Mechanism generally does not work
- Since finding minimum cost spanning tree is

NP-hard. - Virtual Minimum Spanning tree
- Construct the virtual complete graph K(G)

- Nodes are receivers, plus source node
- Edges are LCP between two end-points

- Find the MST on K(G), say VMST(G)
- All agents on VMST(G) are selected
- General link weighted Steiner Tree
- NP-Hard, constant approximation methods exist
- Efficient computing of payments
- General Node weighted Steiner Tree
- NP-Hard, best approximation ratio O(ln k)
- Efficient computing of payments

See our ACM MobiCom 2004 paper for more details

Multicast Cost/Payment Sharing--- cooperative

games

General Cost Sharing

- Given a set of players N
- The cost of C(S) for every is known
- The cost is cohesive C(ST)lt C(S)C(T)
- Fair Cost Sharing
- For all players
- Budget balance
- For every subset of players S
- Core
- Cross-monotone

Multicast Cost Sharing(fixed tree)

- Given a structure for multicast
- The cost of each relay agent is known
- A fixed tree from the source to all receivers
- Share the cost among receivers
- Budget balance, core, Cross-monotone
- Methods
- Equally share for downstream receivers (ELDS)

Alice

Digital Classic 20

Comcast

Bob

Cost Sharing (no fixed tree)

- All receivers must get the data
- Find an efficient tree as output
- Share the cost of tree among receivers fairly?
- Various concepts of fair core, etc
- ?-Core
- ?-Budget balance
- core
- Tight bound
- No core allocation can recover more than

fraction of cost - Conjecture A core allocation can recover

fraction of cost

See STACS05 for more details

Cost Sharing (no fixed tree)

- Cross monotonic ?-Core
- ?-Budget balance
- Core
- Cross monotone
- Tight bound
- No CM ?-Core allocation can recover more than

fraction of cost - of Shapley value on LCPT can recover

fraction of cost and being a CM ?-Core!

See STACS05, INFOCOM05 for more details

Multicast Payment Sharing

- Multicast payment sharing (IEEE INFOCOM 2005)
- Given a mechanism M(O,P)
- Example Truthful Payment for LCPT
- How much each receiver should pay?
- Fair Payment Sharing Scheme
- Budget balance the payment is all agents is

recovered - Cross-monotonic more receivers, less sharing
- No negative transfer The sharing is positive
- No free rider sharing of each receiver is within

some bound of what it has to pay in its unicast

Recall LCPT Payment

- Payment for agent vk is maxqi PkUNI(s,qi).

vk

Payment vk to is p3

Simple Sharing Not Works

- Fair Sharing ELSD?

Digital Classic 20

Alice

Digital Classic HBO 60

Digital classic with HBO 60

Comcast

Bob

Illustration of Fair Sharing

Digital Classic with HBO 60

Digital Classic 20

Alice

Comcast

Bob

Digital Classic HBO 60

Sharing LCPT Payment

- Payment for agent ek is maxqi PkUNI(s,qi).

vk

q1

q2

q3

Properties

- No negative transfer
- Budget balance
- Cross-monotonic
- No-free rider
- Dummy
- sharing is its cost if marginal payment payment

of unicast - Symmetry
- shared payments are same if two are

interchangeable

Other Results

- Algorithm mechanism design
- General framework for binary demand games (ACM

EC05) - AMD and cost sharing for set cover games

(STACS05, TCS05) - Sets or elements are agents
- DiffServ Multicast (AAIM05, COCOON05)
- AMD design and payment sharing
- Nash equilibrium
- Nash equilibrium and AMD for unicast and

multicast (ISAAC05)

Questions and Comments

About PowerShow.com

PowerShow.com is a leading presentation/slideshow sharing website. Whether your application is business, how-to, education, medicine, school, church, sales, marketing, online training or just for fun, PowerShow.com is a great resource. And, best of all, most of its cool features are free and easy to use.

You can use PowerShow.com to find and download example online PowerPoint ppt presentations on just about any topic you can imagine so you can learn how to improve your own slides and presentations for free. Or use it to find and download high-quality how-to PowerPoint ppt presentations with illustrated or animated slides that will teach you how to do something new, also for free. Or use it to upload your own PowerPoint slides so you can share them with your teachers, class, students, bosses, employees, customers, potential investors or the world. Or use it to create really cool photo slideshows - with 2D and 3D transitions, animation, and your choice of music - that you can share with your Facebook friends or Google+ circles. That's all free as well!

For a small fee you can get the industry's best online privacy or publicly promote your presentations and slide shows with top rankings. But aside from that it's free. We'll even convert your presentations and slide shows into the universal Flash format with all their original multimedia glory, including animation, 2D and 3D transition effects, embedded music or other audio, or even video embedded in slides. All for free. Most of the presentations and slideshows on PowerShow.com are free to view, many are even free to download. (You can choose whether to allow people to download your original PowerPoint presentations and photo slideshows for a fee or free or not at all.) Check out PowerShow.com today - for FREE. There is truly something for everyone!

You can use PowerShow.com to find and download example online PowerPoint ppt presentations on just about any topic you can imagine so you can learn how to improve your own slides and presentations for free. Or use it to find and download high-quality how-to PowerPoint ppt presentations with illustrated or animated slides that will teach you how to do something new, also for free. Or use it to upload your own PowerPoint slides so you can share them with your teachers, class, students, bosses, employees, customers, potential investors or the world. Or use it to create really cool photo slideshows - with 2D and 3D transitions, animation, and your choice of music - that you can share with your Facebook friends or Google+ circles. That's all free as well!

For a small fee you can get the industry's best online privacy or publicly promote your presentations and slide shows with top rankings. But aside from that it's free. We'll even convert your presentations and slide shows into the universal Flash format with all their original multimedia glory, including animation, 2D and 3D transition effects, embedded music or other audio, or even video embedded in slides. All for free. Most of the presentations and slideshows on PowerShow.com are free to view, many are even free to download. (You can choose whether to allow people to download your original PowerPoint presentations and photo slideshows for a fee or free or not at all.) Check out PowerShow.com today - for FREE. There is truly something for everyone!

presentations for free. Or use it to find and download high-quality how-to PowerPoint ppt presentations with illustrated or animated slides that will teach you how to do something new, also for free. Or use it to upload your own PowerPoint slides so you can share them with your teachers, class, students, bosses, employees, customers, potential investors or the world. Or use it to create really cool photo slideshows - with 2D and 3D transitions, animation, and your choice of music - that you can share with your Facebook friends or Google+ circles. That's all free as well!

For a small fee you can get the industry's best online privacy or publicly promote your presentations and slide shows with top rankings. But aside from that it's free. We'll even convert your presentations and slide shows into the universal Flash format with all their original multimedia glory, including animation, 2D and 3D transition effects, embedded music or other audio, or even video embedded in slides. All for free. Most of the presentations and slideshows on PowerShow.com are free to view, many are even free to download. (You can choose whether to allow people to download your original PowerPoint presentations and photo slideshows for a fee or free or not at all.) Check out PowerShow.com today - for FREE. There is truly something for everyone!

For a small fee you can get the industry's best online privacy or publicly promote your presentations and slide shows with top rankings. But aside from that it's free. We'll even convert your presentations and slide shows into the universal Flash format with all their original multimedia glory, including animation, 2D and 3D transition effects, embedded music or other audio, or even video embedded in slides. All for free. Most of the presentations and slideshows on PowerShow.com are free to view, many are even free to download. (You can choose whether to allow people to download your original PowerPoint presentations and photo slideshows for a fee or free or not at all.) Check out PowerShow.com today - for FREE. There is truly something for everyone!

Recommended

«

/ »

Page of

«

/ »

Promoted Presentations

Related Presentations

Page of

Home About Us Terms and Conditions Privacy Policy Presentation Removal Request Contact Us Send Us Feedback

Copyright 2018 CrystalGraphics, Inc. — All rights Reserved. PowerShow.com is a trademark of CrystalGraphics, Inc.

Copyright 2018 CrystalGraphics, Inc. — All rights Reserved. PowerShow.com is a trademark of CrystalGraphics, Inc.

The PowerPoint PPT presentation: "Wireless Ad Hoc / Sensor Networks: Energy Efficiency and Cooperativeness" is the property of its rightful owner.

Do you have PowerPoint slides to share? If so, share your PPT presentation slides online with PowerShow.com. It's FREE!