• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.218-225
• /
• 2007

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.637-646
• /
• 2012

Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.4
• /
• pp.237-244
• /
• 2007

In this paper we investigate the benefits of a data aggregation to prolong the lifetime of wireless sensor networks. To reduce the overload of messages from source node to sink node, data aggregation technique is generally used at intermediate node in path. The DD-G(Directed Diffusion-Greedy) can diminish the consumption of node energy by establishing energy effective single path from source to destination. In this case, the nodes near sink node have some problems, i) overly concentration of energy consumption, ii) increase of message delay time. To solve these problems, we propose a new data aggregation method which consider distribution of network overload, especially at the nodes close to sink node. The result shows that it can save energy and network delay time.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.765-772
• /
• 2004

Multicast communication is simultaneous transmission of data to multiple receivers and saves considerably sender resources and network bandwidth. It has high risk to attack using group address and inherent complexity of routing packets to a large group of receivers. It is therefore critical to provide source authentication, allowing a receiver to ensure that received data is authentic. In this paper, we propose the multiple chain authentication scheme for secure and efficient multicast stream. To evaluate the performance of our scheme, we compare our technique with two other previously proposed schemes using simulation results. Our scheme provides non-repudiation of origin, low overhead by amortizing the signature operation over multiple packets, and high packet loss resistance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1606-1623
• /
• 2015

Optical switching will be applied in datacenter networks because electronic switching is costly and power-consuming. In this paper, considering the ring-based interconnection using optical switching in the core of a datacenter, we study the home circuit (HC) construction for the labeled optical burst switching with home circuit (LOBS-HC), a new paradigm trying to share wavelengths among the HCs from the same source. In particular, aiming to construct HCs dynamically and properly, a scheme named optimal path matching and symmetric HC matching (OPM-SHM) is proposed. The main idea of OPM-SHM is to dynamically construct HCs by sharing wavelength(s) not only among the same-source HCs but also with symmetric HCs which have different sources other than the original LOBS-HC features. The simulation results demonstrate that OPM-SHM achieves better performance than some other methods in terms of burst loss rate and wavelength utilization of physical links. More specially, it maintains good load balancing for the datacenter network using an LOBS-HC ring. In addition, due to the symmetric feature of SHM, the proposed scheme can decrease the upper bound of the average hop count of the routing paths to half of the ring size.

• Journal of IKEEE
• /
• v.13 no.1
• /
• pp.71-76
• /
• 2009

As one of the most important requirements for wireless sensor networks, prolonging network lifetime can be realized by minimizing energy consumption in cluster heads as well as sensor nodes. While most of the previous researches have focused on the energy of sensor nodes, we devote our attention to cluster heads because they are most dominant source of power consumption in the cluster-based sensor networks. Therefore, we seek to minimize energy consumption by minimizing the maximum(MINMAX) energy dissipation at each cluster heads. This work requires energy-efficient clustering of the sensor nodes while satisfying given energy constraints. In this paper, we present a constraint satisfaction modeling of cluster-based routing in a heterogeneous sensor networks because mixed integer programming cannot provide solutions to this MINMAX problem. Computational experiments show that substantial energy savings can be obtained with the MINMAX algorithm in comparison with a minimum total energy(MTE) strategy.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.37-44
• /
• 2017

Wireless sensor networks are composed of many wireless sensor nodes that are sensing the environments. These networks have many constraints that are resource constraints, wireless communication, self-construction, etc. But they have many applications that are monitoring environment, tracking the object, etc. In this paper, a mechanism of finding QoS Satisfied multi-path is proposed in wireless sensor networks. In order to satisfy the QoS requirement, the proposed mechanism extends the AODV protocol to find multiple paths from a source node to a destination node by using the additional AODV message types that are proposed. This mechanism will be used to support many QoS applications such as minimum delay time, the better reliability and the better throughput by using the QoS satisfied multi-path. Overheads of the proposed mechanism are evaluated using simulation, and it is showed that QoS satisfied multiple paths are found with a little more overhead than the AODV mechanism.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.3
• /
• pp.107-115
• /
• 2009

Traditionally, simulation method is used to test and evaluate the performance of communication protocol or functional elements for mobile communication service. In this paper, wireless network simulator is implemented using the C++ object-oriented programming language. This simulator can simulate wireless data services, like as ad-hoc networks, by considering the user's mobility. In this paper, the simulator includes network traffic model to reflect wireless data service and traffic source model to represent a user's mobility similar to real service environment and traffic characteristics can be reflected on the simulation, and also more accurate simulation results can be got through that. In addition, by using object-oriented techniques, new service feature or environment can be easily added or changed so that the developed mobile communication simulator can reflect the real service environment all the time. This simulator can be used in adjusting the characteristics of wireless data hosts following the mobility of the user, and also can be used in building new wireless ad-hoc network routing protocols.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.