• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.269-294
• /
• 2010

The interconnection of mobile devices in urban environments can open up a lot of vistas for collaboration and content-based services. This will require setting up of a network in an urban environment which not only provides the necessary services to the user but also ensures that the network is secure and energy efficient. In this paper, we propose a secure, energy efficient dynamic routing protocol for heterogeneous wireless sensor networks in urban environments. A decision is made by every node based on various parameters like longevity, distance, battery power which measure the node and link quality to decide the next hop in the route. This ensures that the total load is distributed evenly while conserving the energy of battery-constrained nodes. The protocol also maintains a trusted population for each node through Dynamic Trust Factor (DTF) which ensures secure communication in the environment by gradually isolating the malicious nodes. The results obtained show that the proposed protocol when compared with another energy efficient protocol (MMBCR) and a widely accepted protocol (DSR) gives far better results in terms of energy efficiency. Similarly, it also outdoes a secure protocol (QDV) when it comes to detecting malicious nodes in the network.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.47-56
• /
• 2012

In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.219-228
• /
• 2007

End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.59-70
• /
• 2014

This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.33-41
• /
• 2007

The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.225-229
• /
• 2007

Recently, wireless sensor networks are deployed in various applications range from simple environment monitoring systems to complex systems, which generate large amount of information, like motion monitoring, military, and telematics systems. Although wireless sensor network nodes are operated with low-power 8bit processor to execute simple tasks like environment monitoring, the nodes in these complex systems have to execute more difficult tasks. Generally, MAC protocols for wireless sensor networks attempt to reduce the energy consumption using duty cycling mechanism which means the nodes periodically sleep and wake. However, in the duty cycling mechanism. a node should wait until the target node wakes and the sleep latency increases as the number of hops increases. This sleep latency can be serious problem in complex and sensitive systems which require high speed data transfer like military, wing of airplane, and telematics. In this paper, we propose a solution for reducing transmission latency through distributed duty cycling (DDC) in wireless sensor networks. The proposed algorithm is evaluated with real-deployment experiments using CC2420DBK and the experiment results show that the DDC algorithm reduces the transmission latency significantly and reduces also the energy consumption.

• Convergence Security Journal
• /
• v.15 no.2
• /
• pp.63-68
• /
• 2015

Current ICT(Information & Communication Technology) infrastructures (Internet and server/client communication) are struggling for a wide variety of devices, services, and business and technology evolution. Cloud computing originated simply to request and execute the desired operation from the network of clouds. It means that an IT resource that provides a service using the Internet technology. It is getting the most attention in today's IT trends. In the distributed cloud environments, management costs for the network and computing resources are solved fundamentally through the integrated management system. It can increase the cost savings to solve the traffic explosion problem of core network via a distributed Micro DC. However, traditional flooding methods may cause a lot of traffic due to transfer to all the neighbor DCs. Restricted Path Flooding algorithms have been proposed for this purpose. In large networks, there is still the disadvantage that may occur traffic. In this paper, we developed Lightweight Path Flooding algorithm to improve existing flooding algorithm using hop count restriction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1689-1700
• /
• 1993

WDM(Wavelength Division Multiplexing) based-on fixed wavelengths is a new means of utilizing the bandwidth of optical fibers. In this Paper, an improved virtual topology called "(a, $\beta$,${\gamma}$) ShuffleNet " is introdced for designing large-scale WDM switches. The proposed one is an architecture created by vertically stacking x planes of a ($\beta$,${\gamma}$) ShuffleNet in parallel via $\beta$r nodes called "bridge nodes" so that N-by-N(N=(x*$\beta$${\gamma}$*${\gamma}$) switching is achieved based on the self-routing algorithm for each ($\beta$,${\gamma}$) ShuffleNet. With the topological parallelism, in contrast to the conventional virtual topologies, the diameter of 2${\gamma}$ hops can be fixed and high utilization and performance are provided while N increases. Such a scalability characteristic allows to design a growable broadband switch. As for the delay, we show that the traffic locality, due to the topological feature. result in low delay characteristics.lay characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.