1 / 23

Cost-Function-Based Network Selection Strategy in Integrated Wireless and Mobile Networks

Cost-Function-Based Network Selection Strategy in Integrated Wireless and Mobile Networks. Wei Shen, Member, IEEE, and Qing-An Zeng, Senior Member, IEEE. 報告人：倪丞頤. Agenda. System Model Network Selection Strategy Theoretical Analysis Numerical Results and Discussions Conclusion & Future.

magda
Download Presentation

Cost-Function-Based Network Selection Strategy in Integrated Wireless and Mobile Networks

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. Cost-Function-Based Network Selection Strategy in Integrated Wireless and Mobile Networks Wei Shen, Member, IEEE, and Qing-An Zeng, Senior Member, IEEE 報告人：倪丞頤 Distributed System Lab.

  2. Agenda • System Model • Network Selection Strategy • Theoretical Analysis • Numerical Results and Discussions • Conclusion & Future Distributed System Lab.

  3. Outline • Propose a cost-function-based network selection (CFNS) strategy in an integrated wireless and mobile network • Analyze the system performance of the proposed strategy by using a theoretical model and extensive simulations Distributed System Lab.

  4. System Model • Coverage of different types of networks Distributed System Lab.

  5. System Model • M different types of networks • Service area covered by Network N1 that consists of many homogeneous cell • Network Ni (2 ≤ i≤ M) randomly distributed in the service area • Define the area that is covered by network Ni (1 ≤ i≤ M) as area Ai with radius Ri and Bi bandwidth units • The area only covered by N1 is as area As Distributed System Lab.

  6. System Model • Moving speed of a mobile user is E[V] • Three types of calls • Originating calls • Horizontal handoff calls (Ni -> Nj, i=j) • Vertical handoff calls (Ni->Nj, i≠j) Distributed System Lab.

  7. Network Selection Strategy Distributed System Lab.

  8. Network Selection Strategy • Wg=1 • Traffic balanced-based network-selection (TBNS) • Wg=0 • Received signal strength-based network-selection (RSNS) • Ci=wg*Gi + ws*Si + w0*Oi • Oi = 1-Oi/Omax • Wg+ws+wo=1 Distributed System Lab.

  9. Theoretical Analysis • Area Ai and Aj do not overlap with each other • Area Ai does not intersect with the boundary of the marked cell Distributed System Lab.

  10. The Average Outgoing Rate The average outgoing rate of area As Outgoing rate which user are out of the marked cell + Outgoing rate which user are moving into other areas Ai Distributed System Lab.

  11. The Dwell Time • Mean value of dwell time that user stays in area As before moving out • Mean value of dwell time that user stays in area As before moving into Ai • Mean value of dwell time that user stays in area Ai before moving out Distributed System Lab.

  12. The Arrival Rates of Calls • Assume the average arrival rate of originating calls in network N1 is λO • The average arrival rate of originating calls at As • The average arrival rate of originating calls at Ai Distributed System Lab.

  13. The Arrival Rates of Calls • Define the average number of active users in area As as • Define the average number of active users of network Ni as • The average arrival rate of horizontal handoff calls to the marked cell • The average arrival rate of vertical handoff to network Ni (2 ≤ i≤ M) • The average arrival rate of vertical handoff to network N1 Distributed System Lab.

  14. Channel Holding Time • The call holding time Tc is assumed to • Channel-holding time of network Ni (2 ≤ i≤ M) • Channel-holding time in Area As Distributed System Lab.

  15. System States and Events • The number of the occupied bandwidth units of N1 in As: • The number of the occupied bandwidth units of N1 in Ai : • The number of the occupied bandwidth units of Ni : • Permissible state space is given by Distributed System Lab.

  16. System States and Events Distributed System Lab.

  17. Performance Analysis • The blocking probability of originating calls Distributed System Lab.

  18. Performance Analysis (Signal) • The average received signal strength of originating calls form network Ni (2 ≤ i≤ M) Distributed System Lab.

  19. Performance Analysis (Signal) • The average received signal strength form network Ni (2 ≤ i≤ M): • The sum of the received signal strength form network Ni (2 ≤ i≤ M) • The average received signal strength form network Ni (2 ≤ i≤ M) Distributed System Lab.

  20. Numerical Results and Discussions Distributed System Lab.

  21. Numerical Results and Discussions Distributed System Lab.

  22. Numerical Results and Discussions Distributed System Lab.

  23. Conclusion & Future • To propose a CFNS strategy to combine the traffic balance • To include a cost-function-based vertical handoff decision with theoretical analysis in future work Distributed System Lab.

More Related