• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2534-2553
• /
• 2018

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.33-41
• /
• 2010

The battery consumption and the wireless communication pattern were analyzed for the low power and the improvement of channel interferences between of Zigbee networks and WPAN(Wireless Personal Area Network). The communication patterns considering end device's battery saving during channel searching period were analyzed for low power consumption topology of Zigbee dynamic ad-hoc characteristics. And, the communication patterns were analyzed due to channel interferences between WLAN and Random Back off of Zigbee, too. As a result, the communication patterns of Zigbee's coordinator and end devices is alleviated for the longer battery life time of Zigbee's end device due to Zigbee's end device setting techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2561-2576
• /
• 2013

The ship ad-hoc network (SANET) extends the coverage of the high data-rate terrestrial communications to the ships with the reduced cost in maritime communications. Cognitive radio (CR) has the ability of sensing the radio environment and dynamically reconfiguring the operating parameters, which can make SANET utilize the spectrum efficiently. However, due to the dynamic topology nature and no central entity for data fusion in SANET, the interference brought into the primary network caused by the hidden primary user requires to be carefully managed by a sort of decentralized cooperative spectrum sensing schemes. In this paper, we propose a self-weighted decentralized cooperative spectrum sensing (SWDCSS) scheme to solve such a problem. The analytical and simulation results show that the proposed SWDCSS scheme is reliable to detect the primary user in SANET. As a result, secondary network can efficiently utilize the spectrum band of primary network with little interference to primary network. Referring the complementary receiver operating characteristic (ROC) curves, we observe that with a given false alarm probability, our proposed algorithm reduces the missing probability by 27% than the traditional embedded spectrally agile radio protocol for evacuation (ESCAPE) algorithm in the best condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.183-200
• /
• 2020

This paper presents an efficient interactive framework for perspective scene completion and editing tasks, which are available largely in the real world but rarely studied in the field of image completion. Considering that it is quite hard to extract perspective information from a single image, this work starts from a friendly and portable interactive platform to obtain the basic perspective data. Then, in order to make this interface less sensitive, easier and more flexible, a perspective-rectification based correction mechanism is proposed to iteratively update the locations of the initial points selected by users. At last, a complanate mesh is generated by the geometry calculations from these corrected initial positions. This mesh must approximate the perspective direction and the structure topology as much as possible so that the filling process can be conducted under the constraint of the perspective effects of the original image. Our experiments show the results with good qualities and performances, and also demonstrate the validity of our approaches by various perspective scenes and images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1437-1459
• /
• 2020

Wireless Sensor Networks (WSN) is a distributed Sensor network whose terminals are sensors that can sense and check the environment. Sensors are typically battery-powered and deployed in where the batteries are difficult to replace. Therefore, maximize the consumption of node energy and extend the network's life cycle are the problems that must to face. Low-energy adaptive clustering hierarchy (LEACH) protocol is an adaptive clustering topology algorithm, which can make the nodes in the network consume energy in a relatively balanced way and prolong the network lifetime. In this paper, the novel multi-objective LEACH protocol is proposed, in order to solve the proposed protocol, we design a multi-objective coupling algorithm based on bat algorithm (BA), glowworm swarm optimization algorithm (GSO) and bacterial foraging optimization algorithm (BFO). The advantages of BA, GSO and BFO are inherited in the multi-objective coupling algorithm (MBGF), which is tested on ZDT and SCH benchmarks, the results are shown the MBGF is superior. Then the multi-objective coupling algorithm is applied in the multi-objective LEACH protocol, experimental results show that the multi-objective LEACH protocol can greatly reduce the energy consumption of the node and prolong the network life cycle.

• Journal of Multimedia Information System
• /
• v.5 no.1
• /
• pp.27-34
• /
• 2018

In recent years, with the blooming of Internet of Things (IoT) and Cloud Computing (CC), researchers have begun to discover new methods of technological support in all areas (e.g. health, transport, education, etc.). In this paper, in order to achieve a type of network that will provide more intelligent media-data transfer new technologies were studied. Additionally, we have been studied the use of various open source tools, such as CC analyzers and simulators. These tools are useful for studying the collection, the storage, the management, the processing, and the analysis of large volumes of data. The simulation platform which have been used for our research is CloudSim, which runs on Eclipse software. Thus, after measuring the network performance with CloudSim, we also use the Cooja emulator of the Contiki OS, with the aim to confirm and access more metrics and options. More specifically, we have implemented a network topology from a small section of the script of CloudSim with Cooja, so that we can test a single network segment. The results of our experimental procedure show that there are not duplicated packets received during the procedure. This research could be a start point for better and more efficient media data transmission.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.241-252
• /
• 2006

Traditional service-level agreements (SLAs), defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service availability to quantify the performance of Internet protocol (IP) backbone networks and capture the impact of routing dynamics on packet forwarding. Given a network topology and its link weights, we propose a novel technique to compute the associated service availability by taking into account transient routing dynamics and operational conditions, such as border gateway protocol (BGP) table size and traffic distributions. Even though there are numerous models for characterizing topologies, none of them provide insights on the expected performance perceived by end customers. Our simulations show that the amount of service disruption experienced by similar networks (i.e., with similar intrinsic properties such as average out-degree or network diameter) could be significantly different, making it imperative to use new metrics for characterizing networks. In the second part of the paper, we derive goodness factors based on service availability viewed from three perspectives: Ingress node (from one node to many destinations), link (traffic traversing a link), and network-wide (across all source-destination pairs). We show how goodness factors can be used in various applications and describe our numerical results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.201-208
• /
• 2010

Mobile Ad Hoc Network(MANET) has highly dynamic topology, hence presents a great challenge on the network performance evaluation and network protocol design. We proposed total path break up time, $\sum_{i}T_i$, as a metric to measure the performance of the total system as well as an individual connection. In this paper, we evaluate and analyze the performance of three mobility models(Random Waypoint, Manhattan, Blocked Manhattan) by applying the total path break up metric, investigate why network parameters such as packet delivery ratio, end-to-end delay, etc. vary by mobility models. We also present analysis result how much AODV Buffer improve packet delivery ratio and increase the end-to-end delay in spite of the path break up.