• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.261-270
• /
• 2009

We propose a tree-based integration of infrastructure networks and MANETs (TUM) to efficiently extend the scope of mobile Internet protocol to mobile ad hoc networks and devise a tree-based routing protocol (TBRP) that is suitable for the TUM architecture. Infrastructure networks have a number of fixed Internet Gateways that connect two heterogeneous networks. Mobile nodes form a number of small trees named pMANETs, each of them growing from anchor node which can communicate directly with an Internet Gateway. A new node registers with foreign agent and home agent along the tree path without resorting to an inefficient flooding. Furthermore, the TBRP sets up a routing path efficiently by exploiting the tree information without relying on flooding. We show by resorting to simulation that our approach is competitive against the conventional AODV based approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.24-35
• /
• 2008

We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1436-1442
• /
• 2004

A shared-based tree established by the Core Based Tree multicast routing protocol (CBT), the Protocol Independent Multicast Sparse-Mode(PIM-SM), or the Core-Manager based Multicast Routing(CMMR) is rooted at a center node called core or Rendezvous Point(RP). The routes from the core (or RP) to the members of the multicast group are shortest paths. The costs of the trees constructed based on the core and the packet delays are dependent on the location of the core. The location of the core may affect the cost and performance of the shared-based tree. In this paper, we propose three methods for selecting the set of candidate cores. The three proposed methods, namely, k-minimum average cost, k-maximum degree, k-maximum weight are compared with a method which select the candidate cores randomly. Three performance measures, namely, tree cost, mean packet delay, and maximum packet delay are considered. Our simulation results show that the three proposed methods produce lower tree cost, significantly lower mean packet delay and maximum packet delay than the method which selects the candidate cores randomly.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.209-214
• /
• 2007

In this paper, we proposed a new MANET (Mobile Ad hoc Networks) technology of routing protocol. The MANET has a mobility formation of mobile nodes in the wireless networks. Wireless network have two types architecture: the Tree based multicast and shared tree based. The two kind's architecture of general wireless networks have difficult to solve the problems existing in the network, such as connectivity, safety, and reliability. For this purpose, as using that ADDMRP (Ad hoc network Doppler effect-based for Dynamic Multicast Routing Protocol), this study gives the following suggestion for new topology through network durability and Omni-directional information. The proposed architectures have considered the mobility location, mobility time, density, velocity and simultaneous using node by Doppler effects and improved the performance.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.905-912
• /
• 2006

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.4
• /
• pp.1223-1247
• /
• 2012

The need for securing Wireless Sensor Networks (WSNs) is essential especially in mission critical fields such as military and medical applications. Security techniques that are used to secure any network depend on the security requirements that should be achieved to protect the network from different types of attacks. Furthermore, the characteristics of wireless networks should be taken into consideration when applying security techniques to these networks. In this paper, energy efficient Security Model for Tree-based Routing protocols (SMTR) is proposed. In SMTR, different attacks that could face any tree-based routing protocol in WSNs are studied to design a security reference model that achieves authentication and data integrity using either Message Authentication Code (MAC) or Digital Signature (DS) techniques. The SMTR communication and processing costs are mathematically analyzed. Moreover, SMTR evaluation is performed by firstly, evaluating several MAC and DS techniques by applying them to tree-based routing protocol and assess their efficiency in terms of their power requirements. Secondly, the results of this assessment are utilized to evaluate SMTR phases in terms of energy saving, packet delivery success ratio and network life time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.1-9
• /
• 2004

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.133-136
• /
• 2003

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IP based mobile networks. The proposed multicast routing protocol is a hybrid method employing the merits of the bi-directional tunneling and the remote subscription by considering the mobility of mobile hosts. The proposed protocol satisfies the bound of end-to-end delay and supports the seamless handoff. The simulation results show that the proposed protocol has better performance in the number of multicast tree reconstruction and tunneling length and packet loss time than the previous protocols.