• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.32-38
• /
• 2020

The deployment of geographically distributed wireless sensors has greatly elevated the capability of monitoring structural health in social-overhead capital (SOC) public infrastructures. This paper deals with the utilization of a distributed mobility management (DMM) approach for the deployment of wireless sensing devices in a structural health monitoring system (SHM). Then, a wireless sensing mechanism utilizing low-energy adaptive clustering hierarchy (LEACH)-based clustering algorithm for smart sensors has been analyzed to support the seamless data transmission of structural health information which is essentially important to guarantee public safety. The clustering of smart sensors will be able to provide real-time monitoring of structural health and a filtering algorithm to boost the transmission of critical information over heterogeneous wireless and mobile networks.

• ETRI Journal
• /
• v.32 no.2
• /
• pp.292-301
• /
• 2010

Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.500-517
• /
• 2017

In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2376-2394
• /
• 2013

In order to ensure both of the whole system capacity and users QoS requirements in heterogeneous wireless networks, admission control mechanism should be well designed. In this paper, Multi-agent Q-learning based Admission Control Mechanism (MQACM) is proposed to handle new and handoff call access problems appropriately. MQACM obtains the optimal decision policy by using an improved form of single-agent Q-learning method, Multi-agent Q-learning (MQ) method. MQ method is creatively introduced to solve the admission control problem in heterogeneous wireless networks in this paper. In addition, different priorities are allocated to multiple services aiming to make MQACM perform even well in congested network scenarios. It can be observed from both analysis and simulation results that our proposed method not only outperforms existing schemes with enhanced call blocking probability and handoff dropping probability performance, but also has better network universality and stability than other schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4642-4660
• /
• 2016

One major concern of applying Multipath TCP (MPTCP) to data delivery in heterogeneous wireless networks is that the utilization of asymmetric paths with diverse networking-related parameters may cause severe packet reordering and receive buffer blocking (RB²LOC). Although many efforts are devoting to addressing MPTCP's packet reordering problems, their sender-controlled solutions do not consider balancing overhead between an MPTCP sender and receiver, and their fully MPTCP mode cannot make MPTCP achieve a desired performance. This paper proposes a novel receiver-centric buffer blocking-aware data scheduling strategy for MPTCP (dubbed MPTCP-rec) necessitating the following aims: (1) alleviating MPTCP's packet reordering and RB²LOC problems, (2) improving the MPTCP performance, and (3) balancing load between the MPTCP sender and receiver. Simulation results show that the proposed MPTCP-rec solution outperforms the existing MPTCP solutions in terms of data delivery performance in heterogeneous wireless networks.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.619-628
• /
• 2016

This paper describes a theoretical framework for rate allocation to maximize the power efficiency of overall heterogeneous wireless networks whose users are assumed to have multihoming capabilities. Therefore, the paper first presents a power consumption model considering the circuit power and radio transmission power of each wireless network. Using this model, two novel power efficient rate allocation schemes (PERAS) for multihoming services are proposed. In this paper, the convex optimization problem for maximizing the power efficiency over wireless networks is formulated and solved while guaranteeing the required quality of service (QoS). Here, both constant bit rate and variable bit rate services are considered. Furthermore, we extend our theoretical framework by considering the sleep-operation management of wireless networks. The performance results obtained from numerical analysis reveal that the two proposed schemes offer superior performance over the existing rate allocation schemes for multihoming services and guarantee the required QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.993-1003
• /
• 2012

In this paper, we propose a method that wireless mobile nodes can obtain high throughput in heterogeneous wireless networks using multiple connections and it has low packet loses under handover situation. Currently, a mobile node exchanges data with server for one network connection. The proposed method can use high throughput because it doesn't only use one network(WLAN, 3G, etc.) but also use multiple wireless networks. When mobile nodes move to area to use multiple connection, mobile nodes request heterogeneous wireless networks using multiple connections message from the server and the server transmit packets using multiple connections. Also, this method doesn't disconnect previous networks, so packets losses are decreased. Using the NS-2 simulation, we verify that the propose method enhances throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1779-1798
• /
• 2018

Heterogeneous wireless sensor networks (HEWSN) is a kind of wireless sensor networks (WSN), each sensor may has different attributes, HEWSN has been widely used in many aspects. Due to sensors are deployed in unattended environments and its resource constrained feature, the design of security and efficiency balanced authentication scheme for HEWSN becomes a vital challenge. In this paper, we propose a secure and lightweight user authentication and key agreement scheme based on biometric for HEWSN. Firstly, fuzzy extractor is adopted to handle the user's biometric information. Secondly, we achieve mutual authentication and key agreement among three entities, which are user, gateway and cluster head in the four phases. Finally, formal security analysis shows that the proposed scheme defends against various security pitfalls. Additionally, comparison results with other surviving relevant schemes show that our scheme is more efficient in term of computational cost, communication cost and estimated time. Therefore, the proposed scheme is well suitable for practical application in HEWSN.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.73-81
• /
• 2020

The number of mobile devices roaming into a ubiquitous city (u-city) continues to rise as wireless systems have been widely deployed. The number of mobile devices also varies with time, and they tend to frequently change their locations. In addition, the available wireless access networks may belong to different domains, administrations, management, and internet service providers (ISPs). A fusion of overlapping heterogeneous wireless access networks (e.g., WiMax, Wi-Fi, LTE, etc.) serves the u-city in order to reach different coverage. In this context, technical challenges arise in mobility management for heterogeneous networks to realize their potential coverage and capacity benefits. This paper deals with the analysis of a decentralized mobility management support for u-City wireless network infrastructure. This scheme takes advantage of the features of the fully-distributed model of networked-based mobility management protocol to alleviate and realize the ubiquitous requirements of a u-City.