Ad Hoc Mobility Management With Uniform Quorum Systems Zygmunt J. Haas, Senior Member, IEEE and Ben Liang, Student Member, IEEE Networking, IEEE/ACM Transactions on Volume: 72 April 1999, pp

Sawa Yang Outline Introduction The Mobility Management Scheme over a Virtual Backbone The Network Partitioning The Cost Analysis Conclusion

Sawa Yang Introduction This paper proposed –A distributed mobility management scheme Uniform Quorum Systems (UQS) ad hoc network The framework of this paper –Virtual backbone The goal of this paper –Mobility management

Sawa Yang The Mobility Management Scheme over a Virtual Backbone Backbone node Non-backbone node

Sawa Yang The Mobility Management Scheme over a Virtual Backbone A

Sawa Yang The Mobility Management Scheme over a Virtual Backbone To assume the Quorum is –{{1, 2, 3} {1, 4, 5} {2, 4, 6} {3, 5, 6}} {2, 4, 6} {3, 5, 6} {1, 2, 3} {2, 4, 6} {3, 5, 6} {2, 4, 6}

Sawa Yang The Mobility Management Scheme over a Virtual Backbone There are three ways in which locations are updated in the databases: – Call-origination update: – Location-change update: – Periodic update:

Sawa Yang The Mobility Management Scheme over a Virtual Backbone For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone Node4 multicast to {1, 4, 5} NodeA’s ID nodeA’s location The update time For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone query For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone Node2 multicast to {1, 2, 3} For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone Node1 reply to node2 A belongs to node4 For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone For example

Sawa Yang The Mobility Management Scheme over a Virtual Backbone Backbone node 2 has been disconnected from the network the mobile host B may be chosen to replace the detached node

Sawa Yang The Network Partitioning

Sawa Yang The Network Partitioning belongs to the “square” partitioning For example1:

Sawa Yang The Network Partitioning For example1: Node b2 multicast to {a1, a4, a5}

Sawa Yang The Network Partitioning For example2: query

Sawa Yang The Network Partitioning For example2: Randomly queries a “square” quorum {a1, a2, a3}

Sawa Yang The Network Partitioning For example2: Reply

Sawa Yang The Network Partitioning For example2:

Sawa Yang The Cost Analysis The Effect of Mobility on Cost Optimization

Sawa Yang The Cost Analysis The Effect of Mobility on Cost Optimization

Sawa Yang The Cost Analysis The Effect of Availability on Cost Optimization

Sawa Yang The Cost Analysis The Effect of Availability on Cost Optimization

Sawa Yang The Cost Analysis The Effect of Call-Loss Penalty on Cost Optimization

Sawa Yang Conclusion The virtual backbone is dynamically maintained The system is robust against database failures Since a network may have larger than the optimal number of databases –partitioning the network nodes into groups –The groups can form the optimal quorum system. Future work –Resource sharing