• Title/Summary/Keyword: Wireless base station

Search Result 575, Processing Time 0.024 seconds

Analysis of Near Field for Base Station Panel Antenna(4 X 2 Dipole Array) (기지국용 판넬 안테나(4 X 2 Dipole Array)의 근역장 분석)

  • Lee, Dugro;Park, Ju-Derk;Choi, Jae-Ic;Kim, Nam
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.5
    • /
    • pp.473-479
    • /
    • 2004
  • In this paper, power density in near field is calculated about analytic object which has comparatively large volume in considering used wavelength such as cellular base station antenna. Panel sector antenna which is used widespreadly in domestic cellular wireless communication system is modeled and electromagnetic field distribution in reactive near field region is calculated by FDTD (Finite Difference Time Domain) method. After that, antenna gain in far field region is obtain by near to far transformation. Power spectral density in radiated near field is calculated in applying to gain-based model with antenna gain in far field. Finally, compliance distance is obtained in considering the result from radiated near field calculation and basic restrictions on occupational and general public exposure limits in ICNIRP guideline. In the center of main radiating position, the result from gain-based model is -14.55 ㏈m and the result from surface scanning method is -15.75 ㏈m. When the losses from cables and connectors used in measurement are considered, the results from gain-based model and surface scanning method are nearly coincident.

Key Re-distribution Scheme of Dynamic Filtering Utilizing Attack Information for Improving Energy Efficiency in WSNs (무선 센서 네트워크에서 에너지 효율성 향상을 위해 공격정보를 활용한 동적 여과 기법의 키 재분배 기법)

  • Park, Dong-Jin;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.2
    • /
    • pp.113-119
    • /
    • 2016
  • Wireless sensor networks are vulnerable to an adversary due to scarce resources and wireless communication. An adversary can compromise a sensor node and launch a variety of attacks such as false report injection attacks. This attack may cause monetary damage resulting in energy drain by forwarding the false reports and false alarms at the base station. In order to address this problem, a number of en-route filtering schemes has been proposed. Notably, a dynamic en-route filtering scheme can save energy by filtering of the false report. In the key dissemination phase of the existing scheme, the nodes closer to the source node may not have matching keys to detect the false report. Therefore, continuous attacks may result in unnecessary energy wastage. In this paper, we propose a key re-distribution scheme to solve this issue. The proposed scheme early detects the false report injection attacks using initially assigned secret keys in the phase of the key pre-distribution. The experimental results demonstrate the validity of our scheme with energy efficiency of up to 26.63% and filtering capacity up to 15.92% as compared to the existing scheme.

A Study on the Energy Efficient Data Aggregation Method for the Customized Application of Underwater Wireless Sensor Networks (특정 응용을 위한 수중센서네트워크에서 에너지 효율적인 데이터통합 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong;Yu, Hyung-Cik
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1438-1449
    • /
    • 2011
  • UWSNs(Underwater Wireless Sensor Networks) need effective modeling fitted to the customized type of application and its covering area. In particular it requires an energy efficient data aggregation method for such customized application. In this paper, we envisage the application oriented model for monitoring the pollution or intrusion detection over a given underwater area. The suggested model is based on the honeycomb array of hexagonal prisms. In this model, the purpose of data aggregation is that the head node of each layer(cluster) receives just one event data arrived firstly and transfer this and its position data to the base station effectively in the manner of energy efficiency and simplicity without duplication. Here if we apply the existent data aggregation methods to this kind of application, the result is far from energy efficiency due to the complexity of the data aggregation process based on the shortest path or multicast tree. In this paper we propose three energy efficient and simple data aggregation methods in the domain of cluster and three in the domain of inter-cluster respectively. Based on the comparative performance analysis of the possible combination pairs in the two domains, we derive the best energy efficient data aggregation method for the suggested application.

A Mesh Router Placement Scheme for Minimizing Interference in Indoor Wireless Mesh Networks (실내 무선 메쉬 네트워크에서의 간섭 최소화를 위한 메쉬 라우터 배치 기법)

  • Lee, Sang-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.4
    • /
    • pp.421-426
    • /
    • 2010
  • Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

Dynamic States Consideration for Next Hop Nodes Selection Method to Improve Energy Efficiency in LEAP based Wireless Sensor Networks (LEAP기반의 무선 센서 네트워크에서 가변적 상태를 고려한 에너지 효율적 다음 홉 노드 선택 기법)

  • Nam, Su-Man;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.558-564
    • /
    • 2013
  • Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

Dynamic Threshold Determination Method for Energy Efficient SEF using Fuzzy Logic in Wireless Sensor Networks (무선 센서 네트워크에서 통계적 여과 기법의 에너지 효율 향상을 위한 퍼지논리를 적용한 동적 경계값 결정 기법)

  • Choi, Hyeon-Myeong;Lee, Sun-Ho;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.53-61
    • /
    • 2010
  • In wireless sensor networks(WSNs) individual sensor nodes are subject to security compromises. An adversary can physically capture sensor nodes and obtain the security information. And the adversary injects false reports into the network using compromised nodes. If undetected, these false reports are forwarded to the base station. False reports injection attacks can not only result in false alarms but also depletion of the limited amount of energy in battery powered sensor nodes. To combat these false reports injection attacks, several filtering schemes have been proposed. The statistical en-routing filtering(SEF) scheme can detect and drop false reports during the forwarding process. In SEF, The number of the message authentication codes(threshold) is important for detecting false reports and saving energy. In this paper, we propose a dynamic threshold determination method for energy efficient SEF using fuzzy-logic in wireless sensor networks. The proposed method consider false reports rate and the number of compromised partitions. If low rate of false reports in the networks, the threshold should low. If high rate of false reports in networks, the threshold should high. We evaluated the proposed method’s performance via simulation.

Reverse link rate control for high-speed wireless systems based on traffic load prediction (고속 무선통신 시스템에서 트래픽 부하 예측에 의한 역방향 전송속도 제어)

  • Yeo, Woon-Young
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.15-22
    • /
    • 2008
  • The cdma2000 1xEV-DO system controls the data rates of mobile terminals based on a binary overload indicator from the base station and a simple probabilistic model. However, this control scheme has difficulty in predicting the future behavior of mobile terminals due to a probabilistic uncertainty and has no reliable means of suppressing the traffic overload, which may result in performance degradation of CDMA systems that have interference-limited capacity. This Paper proposes a new traffic control scheme that controls the data rates of mobile terminals effectively by predicting the future traffic load and adjusting the forward-link control channel. The proposed scheme is analyzed by modeling it as a multi-dimensional Markov process and compared with conventional schemes. The numerical results show that the maximum cell throughput of the proposed scheme is much higher than those of the conventional schemes.

Joint Uplink and Downlink Resource Allocation in Data and Energy Integrated Communication Networks

  • Yu, Qin;Lv, Kesi;Hu, Jie;Yang, Kun;Hong, Xuemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.3012-3028
    • /
    • 2017
  • In this paper, we propose a joint power control strategy for both the uplink and downlink transmission by considering the energy requirements of the user equipments' uplink data transmissions in data and energy integrated communication networks (DEINs). In DEINs, the base station (BS) adopts the power splitting (PS) aided simultaneous wireless information and power transfer (SWIPT) technique in the downlink (DL) transmissions, while the user equipments (UEs) carry out their own uplink (UL) transmissions by exploiting the energy harvested during the BS's DL transmissions. In our DEIN model, there are M UEs served by the BS in order to fulfil both of their DL and UL transmissions. The orthogonal frequency division multiple access (OFDMA) technique is adopted for supporting the simultaneous transmissions of multiple UEs. Furthermore, a transmission frame is divided into N time slots in the medium access control (MAC) layer. The mathematical model is established for maximizing the sum-throughput of the UEs' DL transmissions and for ensuring their fairness during a single transmission frame T, respectively. In order to achieve these goals, in each transmission frame T, we optimally allocate the BS's power for each subcarrier and the PS factor for each UE during a specific time slot. The original optimisation problems are transformed into convex forms, which can be perfectly solved by convex optimisation theories. Our numerical results compare the optimal results by conceiving the objective of maximising the sum-throughput and those by conceiving the objective of maximising the fair-throughput. Furthermore, our numerical results also reveal the inherent tradeoff between the DL and the UL transmissions.

Improving Hot Spot Problem in Layer of DL-LEACH

  • LEE, WooSuk;Jin, Seung Yeon;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.64-69
    • /
    • 2017
  • The abstract should summarize the contents of the paper and written below the author information. Use th In Wide-area Wireless Sensor Networks, network lifetime is short due to energy consumption due to transmission distance. To improve this, we divide the sensor field into layers and reduce transmission distance through multi-hop transmission. However, there is a problem in that the transmission rate drops because there is no Cluster Head in the layer, or the transmission distance increases due to the layer, and energy is wasted. There are DL-LEACH and EDL-LEACH as Protocols to improve this. DL-LEACH uses either single-hop transmission or multi-hop transmission depending on the situation. As a result, the transmission distance is optimized, thereby reducing energy consumption. In case of EDL-LEACH, it is proposed to improve the data rate in DL-LEACH. It is the same as DL-LEACH, but the Cluster Head is mandatory for all layers to improve the transmission rate. Although there is no Cluster Head for each layer, the transmission rate is improved, but the network life is shortened. In this paper, we try to improve the network lifetime while maintaining the EDL-LEACH transmission rate. The shortened network lifetime is due to Cluster Head overload near the base station. To improve this, the Cluster Head distribution method is improved and the network lifetime is improved.

An Adaptive Flooding Scheme using N-hop Look-ahead in MANET (MANET에서 N-hop 사전조사를 이용한 적응적인 플러딩 기법)

  • Jong, Jong-Hyeok;Oh, Im-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.32-39
    • /
    • 2006
  • MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

  • PDF