• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.115-123
• /
• 2017

The mutual cooperation among nodes is very important because mobile nodes participating in MANET communicate with limited resources and wireless environment. This characteristic is important especially in environment that supports group communication. In order to support the secure multicast environment, it is important enough to affect performance to provide accurate authentication method for multicast group members and increase the integrity of transmitted data. Therefore, we propose a technique to provide the multicast secure communication by providing efficient authentication and group key management for multicast member nodes in this paper. The cluster structure is used for authentication of nodes in the proposed technique. In order to efficient authentication of nodes, the reliability is measured using a combination of local trust information and global trust information measured by neighboring nodes. And issuing process of the group key has two steps. The issued security group key increases the integrity of the transmitted data. The superiority of the proposed technique was confirmed by comparative experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.97-104
• /
• 2006

For successfully deploying many multicast service in the mobile environment, security infrastructures must be developed that manage the keys needed to provide access control to content. In this paper, we propose two methods for designing the key management scheme for the mobile multicast environment. The proposed schemes match the key management tree to the mobile multicast environment for localizing the delivery of he rekeying messages, reducing the communication costs, and solving the handoff problem in wireless region.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.263-277
• /
• 2005

In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.149-156
• /
• 2011

In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.197-203
• /
• 2002

This paper proposes a new agent based mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for an Internet Group Management Protocol (IGMP) of Mobile Nodes (MNs) at each Base Station (BS) and keeps information for members of multicast groups in a cell. When an MN moves to a next cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. The mechanism was evaluated through simulation and analysis and compared with the IGMPv2 for micro-mobility and the IGMP traffic. Simulation results show that handoff latency for micro-mobility can be largely reduced and the IGMP control traffic on the wireless links during the duration of membership can be eliminated. Thus, this mechanism is superior to the existing mechanism in both micro-mobility and battery duration, as the need not to reply to a query conserves battery power.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.109-112
• /
• 2005

As the degree of use of network is increasing the need for building the basic of the stable network service is being needed a lot. Also the engineers require the traffic control for the best application and management and bandwidth management urgently. To solve these problems, there were no other ways of increasing the bandwidth of lines until now. However, this solution has the limit that the cost is too high and the traffic problem is growing continuously. On this study, it is suggested that through the planning the wired /wireless combination network design offering the service of QoS, Multicast, Mobile, realtime multimedia traffic delay without packet loss will be dealth with.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4864-4882
• /
• 2016

In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.159-167
• /
• 2005

Through the increment of group oriented application services, the multicast communication in wire/wireless network has become a widely discussed researching topic. However solution for security, efnciency and scaleability of a multicast communications are not enough to be satisfactory. Tn this paper, we Propose a new secure, efficient and scalable multicasting protocols to provide a integrated multicast service. Our protocol is an authenticated key establishment protocol which has been designed specifically for use with low powered computationally weak equipment such as Cellular phone and PDA(Personal Digital Assistant).