• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.18-25
• /
• 2007

In sensor networks, sensor nodes have limited computational capacity, power and memory. Thus energy efficiency is one of the most important requirements. How to extend the lifetime of wireless sensor networks has been widely discussed in recent years. However, one of the most effective approaches to cope with power conservation, network scalability, and load balancing is clustering technique. The function of a cluster head is to collect and route messages of all the nodes within its cluster. Cluster heads must be changed periodically for low energy consumption and load distribution. In this paper, we propose an energy-aware cluster head selection algorithm and Distance Estimation-based distributed Clustering Algorithm (DECA) in wireless sensor networks, which exchanges cluster heads for less energy consumption by distance estimation. Our simulation result shows that DECA can improve the system lifetime of sensor networks up to three times compared to the conventional scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.84-97
• /
• 2012

In wireless sensor networks, cluster structure brings on many advantages such as load balancing, energy saving, and distributed key management, and so on. To transform a physical network into the cluster structure, sensor nodes should invoke a cluster formation protocol. During the protocol operation, if some nodes are compromised and they do not conform to the protocol, an inconsistency of membership in a cluster happen. This splits the cluster and consequently increases the number of clusters and decreases the number of members in the cluster. In this paper, we propose a scheme which well copes with such a problem. First, our scheme generates two hop clusters where hop distance between any two nodes is at most two. Besides, our scheme employs verification of two hop distant nodes to prevent the cluster split induced by compromised nodes. Last, our scheme mainly employs broadcast transmissions to reduce energy consumption of nodes. Simulation results have proven that our scheme reduces the number of clusters and more secure and energy-efficient than other scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.215-221
• /
• 2012

To address the bottleneck problem in data center networks, there have been several proposals for network architectures providing high path-diversity. In devising new schemes to utilize multiple paths, one must consider the effects on TCP performance because packet reordering can make TCP perform poorly. Therefore most schemes prevent packet reordering by sending packets through one of multiple available paths. In this study we show that packet reordering does not occur severely enough to have a significant impact on TCP performance when scattering packets through all available paths between a pair of hosts in Fat-Tree. Simulation results imply that it is possible to find a low-cost solution to the TCP performance problem for Fat-Tree-like topologies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.53-58
• /
• 2011

In this paper, we firstly propose a novel cooperative transmission protocol, which utilizes the advantages of mid-notes in the route from the source to the destination. Taking benefits from balancing between the received packet from the source and acknowledge message from the destination, the mid-node between the source and the destination is firstly considered to be the broadcaster. If its signal is successfully received from the source, it leads to consider the next nodes, which has closer distance to the destination than it. If one of these nodes correctly receives the signal, it performs broadcasting the signal to the destination instead of mid-node. Otherwise, the mid-node directs attention to these nodes being near to the destination. As the result, some nodes are unnecessary to be considered and passed over time. After that, we analyze some published selection relaying schemes based on geographic information to choose the best nodes instead of the instantaneous SNR as before. Finally, simulation results are given to demonstrate the correctness of the performance analyses and show the significant improvement of the selection relaying schemes based geographic information compared to the other ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.217-224
• /
• 2010

In this paper, we propose a hard handover algorithm for a base station's self-optimization, one of the automatic operational technologies for the 3GPP LTE systems. The proposed algorithm simultaneously considers a mixed target sell selection method for optimal selection and a multiple parameter based active hysteresis method with the received signal strength from adjacent cells and the cell load information of the candidate target cells from information exchanges between eNBs through X2 interface. The active hysteresis method chooses optimal handover hysteresis value considering the costs of the various environmental parameters effect to handover performance. The algorithm works on the optimal target cell and the hysteresis value selections for a base station's automatic operational optimization of the LTE system with the gathered informaton effects to the handover performance. The simulation results show distinguished handover performances in terms of the most important performance indexes of handover, handover failure rate and load balancing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3066-3079
• /
• 2016

Recent years have witnessed a dramatic increase in topology research of wireless sensor networks (WSNs) where both energy consumption and survivability need careful consideration. To balance energy consumption and ensure survivability against both random failures and deliberate attacks, we resort to complex network theory and propose an energy-aware preferential attachment (EPA) model to generate a robust topology for WSNs. In the proposed model, by taking the transmission range and energy consumption of the sensor nodes into account, we combine the characters of Erdős -Rényi (ER) model and Barabasi-Albert (BA) model in this new model and introduce tunable coefficients for balancing connectivity, energy consumption, and survivability. The correctness of our theoretic analysis is verified by simulation results. We find that the topology of WSNs built by EPA model is asymptotically power-law and can have different characters in connectivity, energy consumption, and survivability by using different coefficients. This model can significantly improve energy efficiency as well as enhance network survivability by changing coefficients according to the requirement of the real environment where WSNs deployed and therefore lead to a crucial improvement of network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.