1 / 16

A reconfiguration algorithm with qos guaranteed in mobile ad-hoc network

A reconfiguration algorithm with qos guaranteed in mobile ad-hoc network. Yingyou Wen, Yongxin Feng, Yueqiu Jiang, Guanxing Wang Research Center for Network & Communication, Northeastern University, Shenyang, Chnia Internet Laboratory 2 nd Semester Heo Nam Ho. Contents. Introduction

elden
Télécharger la présentation

A reconfiguration algorithm with qos guaranteed in mobile ad-hoc network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A reconfiguration algorithm with qos guaranteed in mobile ad-hoc network Yingyou Wen, Yongxin Feng, Yueqiu Jiang, Guanxing Wang Research Center for Network & Communication, Northeastern University, Shenyang, Chnia Internet Laboratory 2nd Semester Heo Nam Ho

  2. Contents • Introduction • Original Algorithm • Algorithm with QoS Guaranteed • Analysis and evaluation • Conclusion

  3. Introduction • Reconfiguration • Handle the failure of link or device dynamically • Change flow distribution in network

  4. Original Algorithm • Used in small-scaled military ad-hoc network • High performance communication with high reliability, availability • Network reconfiguration • Link reconnect • Structure rebuild

  5. Original Algorithm • Link reconnect • Link deactivation • A  C1 • sol • Restore link l1 • B2 or B3 be relay node

  6. Original Algorithm • Structure rebuild • B1 is failed • All son-nodes(C1, C2) reassigned to node A as surpass-nodes of A. • All son-nodes(C1,C2) reassigned to other nodeas roam-nodes.

  7. Original Algorithm • Reconfiguration strategy • Backup-restore • Restoring the communication • Relay-restore • Choose best relay node • Shuffle-restore • Relay-restore failed • Invalid destination node eliminated

  8. Original Algorithm • Evaluation • Attribute • Best-suited node

  9. Algorithm with QoS Guaranteed • Description • V={N1, ….. Nm} • m=|V| number of nodes • {NiP, NiX, NiY, NiZ, NiF, Nig} • NiX, NiY, NiZ son-node, surpass-node,roam-node • Data Stream DATAA={a1,a2,….a6}

  10. Algorithm with QoS Guaranteed • Relay_config • Rebuild all potential link • Do_class, QoS_oper • Describing the QoS requirement • Classifying data stream

  11. Algorithm with QoS Guaranteed • Do_Rsvp • Application layer • Each relay node evaluate its resources • makes a decision if they will accept the reserve request with given QoS • Send status of resources back to source node • Source node add path • No path  give up relay-restore • Relay_comm • Restore link source destination

  12. Algorithm with QoS Guaranteed • Evaluation • time consumed by selection of relay node • t(V’) • Time consumed during the process of establishment of relay path through Nnh • t(Ni,Nnh)+t(Nnh,Nj) • Time consumed by description of QoS for user application • t’(Ni)+t’’(Ni)

  13. Algorithm with QoS Guaranteed • Evaluation • Original algorithm • QoS Guaranteed

  14. Algorithm with QoS Guaranteed • Process of reconfiguration

  15. Algorithm with QoS Guaranteed • Simulation • t1 = original algorithm • t2 = QoS Guaranteed

  16. Conclusion • Enhancement • During relay-restore performance • More robust • QoS considered • Stronger adaptability • Reference • A Refonfiguration Algorithm with QoS Guranteed in Mobile Ad-hoc Network Yingyou Wen, Yongxin Feng, Yueqiu Jiang, Guanxing Wang Research Center for Network & Communication, Northeastern University, Shenyang, Chnia ICCT2003

More Related