• Title/Summary/Keyword: Heterogeneous Wireless Network

Search Result 285, Processing Time 0.024 seconds

The Improved Efficiency Network Life-time in TEEN

  • Lee, WooSuk;Lee, Seong Ro;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.1
    • /
    • pp.59-65
    • /
    • 2016
  • In this paper, we're compared network protocol which is network lifetime longer when using LEACH Protocol, SEP, and TEEN in a heterogeneous Wireless Sensor Network with a Large Sensor Area. Also, we propose a method of divided layer the wide-area sensor filed and transmitting a multi-hop to improve the network lifetime. And we're compared network protocol which is network lifetime more improved apply the proposed method to LEACH Protocol, SEP, and TEEN. We tried to compare results, TEEN showed the best network lifetime. Apply the proposed method to divided the sensor field, L-TEEN (Layered TEEN)'s network lifetime rates of improvement is highest.

An Adaptive Network Scanning Algorithm in Hybrid Wireless Networks (하이브리드 무선 네트워크에서 적응적인 네트워크 스캐닝 알고리즘)

  • Kang, Myung-Kyoo;Joe, In-Whee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1058-1061
    • /
    • 2009
  • CDMA, WiBro, WLAN 네트워크를 포함하는 4세대(4G) 네트워크에서는 MN(Mobile Node)은 다양한 무선네트워크 인터페이스를 지원 해야만 한다. MN은 밧데리 전원에 의존하므로 에너지 효율은 네트워크 스캐닝의 관점에서는 매우 심각한 문제가 있다. 본 논문에서는 에너지효율을 위한 적응적인 네트워크 스캐닝 알고리즘을 제안 한다. 그 알고리즘은 네트워크 이동성과 사용자 트래픽등급을 고려한 두가지 방안으로 되어 있다. 네트워크 스캐닝 주기는 이동속도와 사용자 트래픽등급에 따라 적응적으로 변화 된다. 적응적인 네트워크 스캐닝 주기를 사용하여 MN은 불필요한 스캐닝을 최소화 하여 네트워크를 보다 에너지 효율적으로 스캐닝 할 수 있다. 제안한 네트워크 스캐닝 알고리즘을 위한 OPNET 시뮬레이션 결과들은 제안한 알고리즘이 고정된 스캐닝 주기를 가진 기존의 알고리즘보다 더 에너지 효율적이다는 것을 보여준다.

A Cooperative Spectrum Sensing and Dynamic Spectrum Decision Methods for Heterogeneous Cognitive Radio Network (이종 인지 라디오 네트워크에서 협력 스펙트럼 센싱 및 동적 스펙트럼 결정 방법)

  • Kim, Nam-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.560-568
    • /
    • 2012
  • Spectrum sensing and spectrum decision are the main functions that cognitive radios (CRs) have to perform in order to get the best available spectrum band for the establishment of a wireless communication. These problems are worsened in the presence of users with different demands and spectrum channels with different properties in a heterogeneous network. The primary objective in this work is to design and simulate a new spectrum decision algorithm for heterogeneous cognitive radio system. To this end, first, we consider all cognitive users are separated into different traffic classes according to their Quality of Service (QoS). The cognitive users within one traffic class perform spectrum sensing in centralized group-based cooperative spectrum sensing system and the users of different traffic classes share the sensing results. Second, we propose a novel use of the Analytic Hierarchy Process (AHP) to optimally select available bands according to user requirements and detected spectrum channel characteristics (SCC). In this paper, utility function is used as spectrum decision algorithm. Simulation results demonstrate that the proposed method shows can effectively select the best available spectrum channels with a low complexity.

A Hierarchical Network Architecture and Handoff framework for Integrating CDMA2000, WiBro and WLAN (CDMA2000, WiBro 및 WLAN 연동을 위한 계층적 네트워크 구조와 핸드오프 프레임워크)

  • Kong, Du-Kyung;Cho, Jin-Sung;Kim, Seung-Hee;Kim, Dae-Sik
    • Journal of Internet Computing and Services
    • /
    • v.7 no.5
    • /
    • pp.43-57
    • /
    • 2006
  • Next-generation mobile communication systems evolve in the form of high speed data transmission along with integration of wired-wireless network. Therefore, it needs researches on integrating service to heterogeneous networks to offer high speed data transmission and various services while supporting user mobility. In existing studies, heterogeneous networks are linked to single core network separatively, Since vertical handoff between heterogeneous networks leads to some delay, packets may be lost during vertical handoff. To solve this problem, this paper proposes an hierarchically integrated network architecture considering the characteristics of CDMA2000, WiBro, and WLAN. The hierarchically integrated networks are overlaid according to coverage of each network. Therefore, the proposed architecture can minimize handoff delay and packet loss. In addition, this paper proposes an integrated framework for next generation mobile communication networks.

  • PDF

A Fast Recovery Backoff Mechanism for Wireless LAN (무선 LAN에서의 고속 복구 백오프 기법)

  • Yoon, Hee-Don;Kim, Tae-Hyun;Cho, Seong-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.307-315
    • /
    • 2010
  • Although a substantial amount of studies have been carried out in order to improve the performance of IEEE 802.11, most of them focused on how to slowly decrease the Contention Window size, instead of resetting it to its initial value. Slow decreasing of the window size reduces the collision probability and increases the channel throughput. Therefore, it is difficult to achieve good results in a heterogeneous network which coexists with the original DCF. For instance, a Gentle DCF(GDCF) has good performance in a homogeneous environment, while it can hardly transmit frames in a heterogeneous environment including the original DCF. It is because the slow decreasing of the window size reduces the transmission probability. In this paper, we propose a Fast Recovery DCF(FRDCF) to solve this problem. In the FRDCF, the reset mechanism of the original DCF is maintained to keep the transmission probability high, while a new counter is used to enhance the performance of the wireless LAN. We prove that, compared with the GDCF, the FRDCF has better performance in a heterogeneous wireless LAN.

A Fairness Guarantee Scheme for Wired and Wireless Heterogeneous Networks (유무선 혼합 네트워크를 위한 TCP Fairness 보장 기법)

  • Kim, Seong-Chul;Cho, Yong-Bum;Moon, Il-Young;Cho, Sung-Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.549-552
    • /
    • 2005
  • Multiple wireless devices in wired and wireless heterogeneous networks communicate with counterparts via a single access point (AP). In this case, the AP becomes a bottleneck of the network, therefore buffer overflows occur frequently and result in TCP performance degradation. In this paper, a new algorithm that prevents buffer overflows at AP and enhances TCP fairness is proposed. Depending on the buffer usage of AP, the new algorithm adaptively controls each TCP senders' transmission rate, prevents buffer overflows and thus guarantees improved TCP fairness. It is proved that the algorithm makes better of TCP throughput and fairness by preventing buffer overflows.

  • PDF

An Analytical Hierarchy Process Combined with Game Theory for Interface Selection in 5G Heterogeneous Networks

  • Chowdhury, Mostafa Zaman;Rahman, Md. Tashikur;Jang, Yeong Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1817-1836
    • /
    • 2020
  • Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

Improving IPTV Forwarding Masechanism in IEEE 802.16j MMR Networks Based on Aggregation

  • Brahmia, Mohamed-El-Amine;Abouaissa, Abdelhafid;Lorenz, Pascal
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.234-244
    • /
    • 2013
  • Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

A Study on the Scheduling Algorithm of Job Allocation in Mobile Grid (모바일 그리드에서의 작업 할당 스케줄링 알고리즘에 관한 연구)

  • Kim, Tae-Kyung;Seo, Hee-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.3
    • /
    • pp.31-37
    • /
    • 2006
  • To achieve the efficient performance within a mobile grid considering the intermittent network connectivity and non-dedicated heterogeneous mobile devices, this paper suggests the scheduling algorithm of job allocation as a viable solution. The suggested scheduling algorithm has two core functions, the prediction of response time for task processing and the identification of the optimal number of mobile devices to process the mobile grid applications. This scheduling algorithm suggests the numerical formulas to calculate the network latency considering the effects of heterogeneous non-dedicated mobile system in wireless network environments. Also we evaluate the performance of mobile grid system using the processing the distributed applications in implemented mobile grid environments.

  • PDF

A Survey of Self-optimization Approaches for HetNets

  • Chai, Xiaomeng;Xu, Xu;Zhang, Zhongshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.1979-1995
    • /
    • 2015
  • Network convergence is regarded as the development tendency of the future wireless networks, for which self-organization paradigms provide a promising solution to alleviate the upgrading capital expenditures (CAPEX) and operating expenditures (OPEX). Self-optimization, as a critical functionality of self-organization, employs a decentralized paradigm to dynamically adapt the varying environmental circumstances while without relying on centralized control or human intervention. In this paper, we present comprehensive surveys of heterogeneous networks (HetNets) and investigate the enhanced self-optimization models. Self-optimization approaches such as dynamic mobile access network selection, spectrum resource allocation and power control for HetNets, etc., are surveyed and compared, with possible methodologies to achieve self-optimization summarized. We hope this survey paper can provide the insight and the roadmap for future research efforts in the self-optimization of convergence networks.