• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2992-3007
• /
• 2012

Recently there has been an increasing interest in exploring the radio irregularity research problem in Wireless Sensor Networks (WSNs). Measurements on real test-beds provide insights and fundamental information for a radio irregularity model. In our previous work "LMAT", we solved the path planning problem of the mobile anchor node without taking into account the radio irregularity model. This paper further studies how the localization performance is affected by radio irregularity. There is high probability that unknown nodes cannot receive sufficient location messages under the radio irregularity model. Therefore, we dynamically adjust the anchor node's radio range to guarantee that all the unknown nodes can receive sufficient localization information. In order to improve localization accuracy, we propose a new 2-hop localization scheme. Furthermore, we point out the relationship between degree of irregularity (DOI) and communication distance, and the impact of radio irregularity on message receiving probability. Finally, simulations show that, compared with 1-hop localization scheme, the 2-hop localization scheme with the radio irregularity model reduces the average localization error by about 20.51%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.3 no.3
• /
• pp.188-194
• /
• 2008

In this paper, we propose for improving QoS in Hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP and propose for performance of realtime and non-real time handoff service using Handoff state machine Paging Route Cache. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and moat of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.1 no.2
• /
• pp.120-126
• /
• 2006

In this paper, we propose for improving QoS in hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and most of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.23-29
• /
• 2011

In some applications of wireless sensor networks, requirements such as energy efficiency, real-time, and reliable delivery need to be considered. In this paper, we propose a novel routing algorithm for wireless sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In the proposed algorithm, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that the proposed algorithm is suitable for providing energy efficient, real-time, reliable communications.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3335-3356
• /
• 2015

In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.658-675
• /
• 2022

This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1706-1727
• /
• 2023

Under Water Sensor Networks (UWSN) has gained attraction among various communities for its potential applications like acoustic monitoring, 3D mapping, tsunami detection, oil spill monitoring, and target tracking. Unlike terrestrial sensor networks, it performs an acoustic mode of communication to carry out collaborative tasks. Typically, surface sink nodes are deployed for aggregating acoustic phenomena collected from the underwater sensors through the multi-hop path. In this context, UWSN is constrained by factors such as lower bandwidth, high propagation delay, and limited battery power. Also, the vulnerabilities to compromise the aquatic environment are in growing numbers. The paper proposes an Energy-Efficient standalone Intrusion Detection System (EEIDS) to entail the acoustic environment against malicious attacks and improve the network lifetime. In EEIDS, attributes such as node ID, residual energy, and depth value are verified for forwarding the data packets in a secured path and stabilizing the nodes' energy levels. Initially, for each node, three agents are modeled to perform the assigned responsibilities. For instance, ID agent verifies the node's authentication of the node, EN agent checks for the residual energy of the node, and D agent substantiates the depth value of each node. Next, the classification of normal and malevolent nodes is performed by determining the score for each node. Furthermore, the proposed system utilizes the sheep-flock heredity algorithm to validate the input attributes using the optimized probability values stored in the training dataset. This assists in finding out the best-fit motes in the UWSN. Significantly, the proposed system detects and isolates the malicious nodes with tampered credentials and nodes with lower residual energy in minimal time. The parameters such as the time taken for malicious node detection, network lifetime, energy consumption, and delivery ratio are investigated using simulation tools. Comparison results show that the proposed EEIDS outperforms the existing acoustic security systems.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.554-563
• /
• 2014

The burgeoning growth of real-time applications, such as interactive video and VoIP, places a heavy demand for a high data rate and guarantee of QoS from a network. This is being addressed by fourth generation networks such as Long-Term Evolution (LTE). But, the mobility of user equipment that needs to be handed over to a new evolved node base-station (eNB) while maintaining connectivity with high data rates poses a significant challenge that needs to be addressed. Handover (HO) normally takes place at cell borders, which normally suffers high interference. This inter-cell interference (ICI) can affect HO procedures, as well as reduce throughput. In this paper, soft frequency reuse (SFR) and multiple preparations (MP), so-called SFRAMP, are proposed to provide a seamless and fast handover with high throughput by keeping the ICI low. Simulation results using LTE-Sim show that the outage probability and delay are reduced by 24.4% and 11.9%, respectively, over the hard handover method - quite a significant result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.63-73
• /
• 1988

In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.