• Title/Summary/Keyword: Access Network Selection

Search Result 139, Processing Time 0.024 seconds

AP Selection Criteria for UAV High-precision Indoor Positioning based on IEEE 802.11 RSSI Measurement (IEEE 802.11 RSSI 기반 무인비행로봇 실내측위를 위한 AP 선택 기법)

  • Hwang, Jun Gyu;Park, Joon Goo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.12
    • /
    • pp.1204-1208
    • /
    • 2014
  • As required performance of UAV (Unmanned Aerial Vehicle) becomes more complex and complicated, required positioning accuracy is becoming more and more higher. GPS is a reliable world wide positioning providing system. Therefore, UAV generally acquires position information from GPS. But when GPS is not available such as too weak signal or too less GPS satellites environments, UAV needs alternative positioning system such as network positioning system. RSSI (Received Signal Strength Indicator) based positioning, which is one method of network positioning technologies, determines its position using RSSI measurements containing distance information from AP (Access Point)s. In that method, a selected AP's configuration has strong and tight relationship with its positioning errors. In this paper, for, we additionally account AP's configuration information by adopting DOP (Dilution of Precision) into AP selection procedures and provide more accurate RSSI based positioning results.

A Study of an Association Admission Method for Public Wireless LAN Systems (고속 공중 무선랜 시스템을 위한 효율적인 연결 수락 제어방법의 연구)

  • Lee, Hyun-Woo;Yoon, Hong;Yoon, Chong-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.2
    • /
    • pp.149-155
    • /
    • 2003
  • This paper generally relates to the field of wireless local area networks(WLANs), and more particularly, to AP selection and association methods for the performance of a station. In these days, IEEE 802.11 Wireless LAN network is widely deployed and used as an emerging service to connect high-speed Internet in the public wireless environment. But, if there are many users in hot spot area, they suffer a severe decrease of performance. Thus it needs an association and access control mechanism especially when it is used in the public environment. In this paper, we suggest a selection and association method using Beacon or Probe Response frames based IEEE 802.11. Station selects AP using the information of the capacity area in a Beacon or a Probe Response frame. According to the present paper, an association method for a public WLAN service, which includes a WLAN user terminal and an AP for relaying WLAN communications to and from the user terminal, includes the steps of the user terminal asking the AP's states for access to a radio channel; and the station selects and associates with the AP. According to the above-described selection in a high speed wireless Internet service based on public WLAN technologies that are currently in operations. Further, it is possible to improve the efficiency of network management.

  • PDF

Throughput maximization for underlay CR multicarrier NOMA network with cooperative communication

  • Manimekalai, Thirunavukkarasu;Joan, Sparjan Romera;Laxmikandan, Thangavelu
    • ETRI Journal
    • /
    • v.42 no.6
    • /
    • pp.846-858
    • /
    • 2020
  • The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

Energy Efficient Access Point Selection Method for IEEE802.11 Wireless LANs (IEEE802.11 무선망을 위한 에너지 효율적인 AP 선택 기법)

  • Heo, Ung;Peng, Yu-Yang;You, Kang-Soo;Choi, Jae-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.12
    • /
    • pp.578-585
    • /
    • 2011
  • Nowadays, wireless local area networks are widely deployed so that stations can potentially associate with an access point. The AP selection strategy is one of the significant research areas for wireless local area networks. The selection strategy solves the relevant problem is which AP can be selected and associated with a station so that the efficient resource utilization can be obtained. Rather than merely choosing the AP with the strongest received signal strength, however, we calculate effective throughput for each neighboring AP and use it as a basis for AP selection. Referencing the throughput is better than referencing the signal strength only because the network may contain a severe load imbalance. We have performed computer simulations using OPNET modeler in order to verify the performance of the proposed scheme. The results show us that the proposed selection method outperforms that of the conventional one in terms of throughput and delay.

CRP-CMAC: A Priority-Differentiated Cooperative MAC Protocol with Contention Resolution for Multihop Wireless Networks

  • Li, Yayan;Liu, Kai;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2636-2656
    • /
    • 2013
  • To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

Optimal Opportunistic Spectrum Access with Unknown and Heterogeneous Channel Dynamics in Cognitive Radio Networks

  • Zhang, Yuli;Xu, Yuhua;Wu, Qihui;Anpalagan, Alagan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2675-2690
    • /
    • 2014
  • We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

MIPv4/MIPv6 Mobility Simulation Model of the Multihomed Node (멀티홈드 노드의 MIPv4/MIPv6 이동성 시뮬레이션 모델)

  • Zhang, Xiaolei;Wang, Ye;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.179-186
    • /
    • 2012
  • Nowadays, the multihomed host equipped with multiple network interfaces has been interested research in next generation wireless network, because the mobile users expect that they can be able to access services not only anywhere, at any time and from any network but also simultaneously. This paper addresses the mobility simulation model of the multihomed node for supporting MIPv4 and MIPv6 function in an interworking of Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 WLAN. The multihomed node with two air interfaces has been developed based on WiMAX and WLAN workstation node model in simulation software. The main point of the developed model is to support both MIPv4 and MIPv6 function, and provide network selection policy for the multihomed node between WiMAX and WLAN network. Based on the received Router Advertisement along with the interface number, we can manage the access interfaces in ordered list to make handover decision while the multihomed node is moving. In the end of this paper, the simulation scenarios and results are shown for testing MIPv4 and MIPv6 function.

Packet Scheduling for Cellular Relay Networks by Considering Relay Selection, Channel Quality, and Packet Utility

  • Zhou, Rui;Nguyen, Hoang Nam;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.464-472
    • /
    • 2009
  • In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

Optimal Cluster Head Selection Method for Sectorized Wireless Powered Sensor Networks (섹터기반 무선전력 센서 네트워크를 위한 최적 클러스터 헤드 선택 방법)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.176-179
    • /
    • 2022
  • In this paper, we consider a sectorized wireless powered sensor network (WPSN), wherein sensor nodes are clustered based on sectors and transmit data to the cluster head (CH) using energy harvested from a hybrid access point. We construct a system model for this sectorized WPSN and find optimal coordinates of CH that maximize the achievable transmission rate of sensing data. To obtain the optimal CH with low overhead, we perform an asymptotic geometric analysis (GA). Simulation results show that the proposed GA-based CH selection method is close to the optimal performance exhibited by exhaustive search with a low feedback overhead.

Cooperative Relaying with Interference Cancellation for Secondary Spectrum Access

  • Dai, Zeyang;Liu, Jian;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2455-2472
    • /
    • 2012
  • Although underlay spectrum sharing has been shown as a promising technique to promote the spectrum utilization in cognitive radio networks (CRNs), it may suffer bad secondary performance due to the strict power constraints imposed at secondary systems and the interference from primary systems. In this paper, we propose a two-phase based cooperative transmission protocol with the interference cancellation (IC) and best-relay selection to improve the secondary performance in underlay models under stringent power constraints while ensuring the primary quality-of-service (QoS). In the proposed protocol, IC is employed at both the secondary relays and the secondary destination, where the IC-based best-relay selection and cooperative relaying schemes are well developed to reduce the interference from primary systems. The closed-form expression of secondary outage probability is derived for the proposed protocol over Rayleigh fading channels. Simulation results show that, with a guaranteed primary outage probability, the proposed protocol can achieve not only lower secondary outage probability but also higher secondary diversity order than the traditional underlay case.