• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2764-2782
• /
• 2021

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.91-96
• /
• 2019

For a wireless sensor network in general, efficient routing decision is important because wireless connections are not stable, sensitive to external interference, and topology changes dynamically. RPL standard of IETF is not flexible to various environmental changes and causes packet loss and delay due to topological imbalance. Sending packets through multipath can partially remedy this problem. The multipath routing, however, can introduce significant delay overhead by allocating unnecessary timeslots. This paper proposes an RPL using multipath adaptively according to network conditions. We show by simulations that the proposed algorithm is more efficient than the basic RPL and the multipath RPL.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.1-11
• /
• 2005

Internet has become an essential part of our daily lives. Many of the day to day activities can already be carried out over Internet, and its convenience has greatly increased the number of Internet users. Hut as Internet gains its popularity, the illicit incidents over Internet has also proliferated. The intruder trace-back technology is the one that enables real time tracking the position of the hacker who attempts to invade the system through the various bypass routes. In this paper, the RTS algorithm which is the TCP connection trace-back system using the watermarking technology on Internet is proposed. Furthermore, the trace-bark elements are modeled by analyzing the Proposed trace-back algorithm, and the results of the simulation under the virtual topology network using ns-2, the network simulation tool are presented.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.3
• /
• pp.537-543
• /
• 2012

Smart home System is shirt-sleeve, the automatic control systems, computer network system and network communication technology in the integration of network intelligent home control system. Intelligent household will let users have a more convenient means to management of domestic equipment, for example, through the house, wireless remote control, touch screen phone and Internet or speech recognition control household devices, more can perform scene operation, make more equipment form linkage. In this paper, we propose the intelligent household various kinds of equipment within each other can communication, do not need to user command according to different state interactive operation, thus to bring the greatest degree of user efficient and convenient, comfortable and safe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.984-993
• /
• 2011

In this paper, we present a new method for efficient mobility management in infrastructure-based ad hoc networks. This type of network inherently takes the tree topology model in which an Internet gateway (IG) becomes a root. Accordingly, the nodes near the IG process get much more number of messages, thereby causing a bottleneck phenomenon that degrades network performance. This problem is known as a funneling effect. We present a method to maximize message aggregation in which the nodes in the networks form tree topology and perform skewed time synchronization according to the depths of the nodes during the tree construction process. We proved by resorting to simulation that the funneling effect is alleviated and network performance is improved greatly.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.5
• /
• pp.654-666
• /
• 2019

The tactical network has several different characteristics compared with commercial internet network such as hierarchical topology, dynamic topology changing and wireless link based connectivity. For considering IP mobility management in the tactical network, current mobility management using Mobile IP(MIP) is not suitable with some reasons such as non-optimal routing paths and single point of failure. Proxy Mobile IP(PMIP) which supporting network-based mobility in hierarchical manner can provide optimal routing path in the tactical network environment, but centralized anchor is still remained a threat to the stability of the tactical network which changes its topology dynamically. In this paper, we propose PMIP-based distributed mobility management for the tactical network environment. From our design, routing paths are always configured in optimized way, as well as path is recovered quickly when the mobility anchor of user is failed. From numerical analysis, comparing to other mobility scheme, result shows that the proposed scheme can reduce packet transmission cost and latency in tactical network model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.239-250
• /
• 2022

LoRa is a physical layer technology designed to secure highly reliable long-range communication with introducing loco parentis tree network and chirp spreading spectrum. Since since a leaf can send message to more than one parents simultaneously with a single transmission in a region, packet delivery ratio increases logarithmically as the number of gateways increases. The delivery ratio, however, dramatically collapses even under loco parentis tree topology due to the limitations of ALOHA-like primitive MAC, . The proposed method is intended to exploit SDMA approach to reuse frequency in an area. With the view, TxPower of each sender for each message in a concurrent transmission is elaborately controlled to survive the collision at different gateway. Thus, the gain from the capture effect improves the capacity of resource-hungry Low Power and Wide Area Networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.194-198
• /
• 2021

LoRa is a physical layer technology that is designed to provide a reliable long-range communication with introducing CSS and with introducing a loco parentis tree network. Since a leaf can utilize multiple parents at the same time with a single transmission, PDR increases logarithmically as the number of gateways increases. Because of the ALOHA-like MAC of LoRa, however, the PDR degrades even under the loco parentis tree topology similarly to the single-gateway environment. Our proposed method is aimed to achieve SDMA approach to reuse the same frequency in different areas. For that purpose, it elaborately controls each TxPower of the senders for each message in concurrent transmission to survive the collision at each different gateway. The gain from this so-called capture effect increases the capacity of resource-hungry LPWAN. Compared to a typical collision-free controlled-access scheme, our method outperforms by 10-35% from the perspective of the total count of the consumed time slots. Also, due to the power control mechanism in our method, the energy consumption reduced by 20-40%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).