• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.424-434
• /
• 2017

In industrial wireless sensor networks, many applications require integrated QoS supporting. This paper proposes a reliable protocol for real-time monitoring in industrial wireless sensor networks. Retransmission is well-known to recover the transmission failure, however, this might cause the time delay to violate the real-time requirement. The proposed protocol exploits broadcasting feature of wireless networks and the temporal opportunity concept. The opportunities to relay the data packets are shared by the broadcasting feature and the temporal opportunity concept maximize the number of candidates in communication. Simulation results show that the proposed protocol is superior to the existing real-time protocols in term of real-time service and reliability.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2017

With the Development of Wireless Network Technology and Wireless Link Technology, Wireless Mesh Network (WMN) is Attracting Attention as a Key Technology to Construct the Wireless Transit Network. The WMN has been Studied for a Long Time in Various Fields, however there are still many Problems that have not been solved yet. One of them is the Routing Problem to find an Optimal path in a Multi-hop Network Composed of Wireless Links. In the Hybrid-WMN, which is one of the Three Types of WMN, Optimal Path Selection Requires Research on Path Search Protocols that Effectively use the Infrastructure Mesh as a Transit Network, Together with Research for a Routing Metric with Excellent Performance. Therefore, this Paper Proposes a Dual Mode-AODV(Ad hoc On-demand Distance Vector) for Hybrid-WMN. Simulation result shows that the Path Selection Delay was Reduced by 52% than AODV when the Proposed Dual Mode-AODV was applied.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.141-150
• /
• 2005

Wireless Sensor Networks have been rapidly developed due to the advances of sensor technology and are expected to be applied to various applications in many fields. In Wireless Sensor Networks, schemes for managing the network energy-efficiently are most important. For this purpose, there have been a variety of researches to suggest routing protocols. However, existing researches have ideal assumption that all sensor nodes have sensing data to transmit. In this paper, we designed and implemented a sensing-aware cluster selection algorithm based on LEACH-C for the sensor network in which part of sensors have sensing data. We also simulated proposed algorithm on several network situation and analyzed which situation is suitable for the algorithm. By the simulation result, selecting cluster head among the sensing nodes is most energy-efficient and the result shows application of sensing-awareness in cluster head selection when not all sensors have sensing data.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.31-41
• /
• 2014

This paper proposes a virtual mobile ad-hoc network (VMANET) model that automatically divides heterogeneous mobile devices of a MANET into a number of network groups depending on the communication capacity(data rate) of different network operational models such as IEEE 802.11g, IEEE 802.11b, and Frequency Hopping. In addition, it supports a distinct routing protocol for each network group of VMANETs, resulting in running multiple routing protocols concurrently on different groups of VMANETs. To reduce the network congestion and improve the network load balance, a default MANET gateway is configured in each VMANET and these gateways are responsible for integrating the MANET and IP networks. Experiment results show that the proposed model outperforms the conventional IMANET by significantly increasing throughput and reducing network congestion and network delay.

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

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.571-576
• /
• 2013

Despite the development of the Internet, both in terms of technology and coverage, there are still remote areas and scenarios where connectivity is very difficult to achieve. Pocket Switched Network is a network paradigm that takes the advantage of human mobility to disseminate data. Factors such as mobility of nodes, link failures, discharged batteries, are among the challenges that may compromise connectivity in these networks. This paper presents a performance analysis of existing routing schemes for PSN in terms of delivery probability, overhead ratio, average latency and average residual energy when the number of nodes is increased. We seek to identify a scheme that maximizes data delivery while minimizing communication overhead and thus extending the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1722-1727
• /
• 2011

The Korea Army are developing the TICN(Tactical Information Communication Network) which is the next army tactical communication system. The TICN tactical backbone's ability is very important. So analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, previous paper analysed routing protocol efficiency index and compared to superiority of the OSPF and IS-IS protocols in the tactical environment and conclusively IS-IS protocol was more suitable for TICN backbone routing protocol. And We got the result that It could improve the performance of IS-IS protocol as a TICN tactical backbone protocol under the tactical environments by adjusting some time parameters of IS-IS protocol. This paper modified and designed the IS-IS protocol in order to support the QoS strategies of TICN and analyzed it's adaptability through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.801-808
• /
• 2011

We propose MBAP(Multi-rate Broadcast Active Probing) technique to get the right measurements for link quality in Wireless Mesh Network (WMN). Most routing protocols for WMN make use of link quality-aware routing metrics, such as ETX(Expected Transmission Count) and ETT(Expected Transmission Time), while the hop count is usually used in MANET (Mobile Ad-hoc NETwork). A broadcast based active proving technique is adopted in the previous studies to get the ETX or ETT of a link. However this technique does not reflect the multi-rate feature of WLAN because it uses a single fixed transmission rate for broadcast which usually differs from the actual rate used in data transmissions. MBAP overcomes this shortage by exploiting various rate broadcast frames for probing. We implement MBAP on linux system by modifying WLAN driver and related kernel sub-systems. Experimental results show that MBAP can capture link quality more accurately than the existing techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.144-153
• /
• 2010

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.