1 / 34

The 16 th Asia- Pasific Conference on Communication - APCC2010

The 16 th Asia- Pasific Conference on Communication - APCC2010 Fair Data Flows Scheduling Schema for Multihop Wireless Ad Hoc Networks By: HamidReza Salarian Dr. Pejman Khadivi October 2010. Outlines. Problem formulation Related works HBPQ Algorithm Simulation results

aminia
Download Presentation

The 16 th Asia- Pasific Conference on Communication - APCC2010

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. The 16th Asia-Pasific Conference on Communication - APCC2010 Fair Data Flows Scheduling Schema for Multihop Wireless Ad Hoc Networks By: HamidRezaSalarian Dr. PejmanKhadivi October 2010

  2. Outlines • Problem formulation • Related works • HBPQ Algorithm • Simulation results • Conclusion & Future works

  3. Problem formulation

  4. Problem formulation (con.) • B : maximum medium bandwidth • G : M1 and M2 originate traffic at the same offered rate • B12 and B23: bandwidths of the links from M1 to M2 and from M2 to M3, respectively. • QFlow1:QFlow2: proportion of M2’s buffer allocation to Flow1 and Flow2 • Th(Flow1) and Th(Flow2): Flow1’s throughput and Flow2’s throughput

  5. Problem formulation (con.) G < B/3

  6. Problem formulation (con.)

  7. Satisfactions Function • A user with few hop number between source and destination, expects higher throughput than the user with large hop numbers between source and destination. • A function must calculates the satisfaction of each network’s user • Compare Scheduling: • guarantee minimum throughput for every active flows • bring near user's satisfactions

  8. Related works Jun, J., Sichitiu, M.L., “Fairness and QoS in multihop wireless networks”, in Proc. of the IEEE Vehicular Technology Conference (VTC 2003), (Orlando, FL), Oct. 6-9 2003. • Starvation for relayed traffic

  9. Related works (con.) Two queue (TQ) Throughputs for nodes 1-4 = SF(1-4)=

  10. Related works (con.) Weighted Two Queue (WTQ) Throughputs for nodes 1-4 = SF(1-4)=

  11. Related works (con.) Round Robin (RR) SF(1-4)=

  12. Related works (con.) Atoche, G., Hayasaka, M., Tomitsuka, S., Manodham, T., Miki, T., “Weighted hop priority control scheme for multihop wireless ad hoc networks”. Asia-Pacific Conf. on Commun, pp. 48–52, 2005

  13. Related works (con.) WHP Ci-Ij : flow packets coming from source node i per time unit hi-Ij : number of completed hops by flow from source node I CIj-k: packet flow going to destination node k per time unit; hIj-k: number of leftover hops per flow to destination node k.

  14. Related works (con.) WHP

  15. Related works (con.) WHP

  16. HBPQ Goals: • guarantee minimum throughput for every active flows • Fair resource allocation • bring near user's satisfactions • Assign weight to each flow • separate flows packets in relay nodes • link list • Attend path traffic

  17. HBPQ Add history_Delay Field

  18. Pk_Source_addr Pk_Delay Pk_Position Record_pointer HBPQ • Packet with higher history_delay must select for service • Starvation prevention Increase the history_delay of other flows • Max Heap tree • Assign a record for each incoming packet

  19. 3 5 1 4 2 3 2 3 3 5 1 4 HBPQ flow1 input First flow packet flow2 flow3 Heap Tree

  20. 2 3 3 5 3 5 1 4 2 3 1 4 1 4 3 4 HBPQ flow1 input flow2 Heap Tree flow3 History_delay(flow1)<history_delay(flow2)

  21. 3 5 3 4 2 3 3 5 3 5 2 3 1 4 1 4 1 4 HBPQ flow1 input flow2 Heap Tree flow3 output

  22. 3 5 2 3 3 5 1 4 1 4 2 3 2 4 1 4 1 5 HBPQ flow1 input flow2 Heap Tree flow3 output

  23. HBPQ Complexity: m = Flow number in node Packets arrive: O(1) + O( log( m)) Packets exit : O( log (m)) + O ( M) O( m) Packet insertion time into queue Packet insertion time into Heap tree (If it is the first packet of it’s flow) Packet insertion time into Heap tree or Heap rearrange Add ε other flow’s records in Heap tree

  24. Simulation Node Specification: Mac : IEEE 802.11 DCF CSMA/CA Packet generation process:

  25. Simulation Flow throughput : Number of packets which arrive to destination. Flow delay: Average packet delay. Network throughput: sum of flows throughput. Algorithms were compared: • SQ • TQ • WTQ • WHP • HBPQ • RR

  26. Simulation Network with 30 nodes. 5 destination nodes . Area 1000 m * 1000 m Queue length 10000 packets. Run time : 10000 S Simulation runs 10 times for each algorithm. 4-8-12-16-24-28 5-10-15-20-25-30 2-10-14-17-22-26 3-6-9-18-21-27 1-11-13-19-23-29

  27. Simulation

  28. Simulation

  29. Simulation

  30. Simulation

  31. Simulation

  32. Conclusion HBPQ :New flow Scheduling model for multi-hop wireless ad-hoc networks • Fairness – achieving fairness among competing flows • guarantee minimum throughput for every active flows • bring near user's satisfactions • Compatibility with any routing algorithm • High network throughput • Acceptable network delay • Large run time • Hard implementation

  33. Future work • A model distributes flows between relay nodes • Each flow experiences the same path traffic • bring near user's satisfactions • Distributed nation of MANet • Coordination node • trade off between Throughput & hop_numbers

  34. Thank you!hs528@uowmail.edu.au

More Related