• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.72-83
• /
• 2010

Group communication in a wireless mesh network is complicated due to dynamic intermediate mesh points, access control for communications between different administrative domains, and the absence of a centralized network controller. Especially, many-to-many multicasting in a dynamic mesh network can be modeled by a decentralized framework where several subgroup managers control their members independently and coordinate the inter-subgroup communication. In this study, we propose a topology-matching decentralized group key management scheme that allows service providers to update and deliver their group keys to valid members even if the members are located in other network domains. The group keys of multicast services are delivered in a distributed manner using the identity-based encryption scheme. Identity-based encryption facilitates the dynamic changes of the intermediate relaying nodes as well as the group members efficiently. The analysis result indicates that the proposed scheme has the advantages of low rekeying cost and storage overhead for a member and a data relaying node in many-to-many multicast environment. The proposed scheme is best suited to the settings of a large-scale dynamic mesh network where there is no central network controller and lots of service providers control the access to their group communications independently.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2422-2429
• /
• 2013

WMN is considered as a core methodology to provide mobile wireless network service with multi-hop routing feature. It has a merit that can be easily deployed by utilization of protocols for MANET. However, it has differences in supporting multiple networks and channels, network architecture, and so on. Especially, in case of routing protocols, to apply them intactly to WMN can be a cause of low performance because of do not moving mesh routers. AODV seems like suitable for WMN among the various routing protocols for MANET. However, it has a defect in scalability. In this paper, an enhanced AODV routing method for WMN was proposed. The proposed method was designed to be suitable to the architecture of WMN by use of layering and localizing the broadcasting domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1483-1490
• /
• 2009

Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.118-130
• /
• 2013

With the advent of a new services environment based on high-speed mobile networks and high-performance mobile devices, users in real life require content-centric services that provide personalized information conveniently and efficiently. These services are defined as ambient services. To implement and support sustainable ambient services, there is a critical need to conduct research regarding practicable models and methodologies. This paper proposes an effective model for ambient services based on the personalization of real-life space. The model consists of Public Info-space, Universal Info-space and Private Info-space. We also show a methodology for implementing the model with currently available techniques in order to prove that the model and methodology constitute an applicable solution to developing true ambient services. Finally, a kind of role-playing game which is built on a real university campus is presented to show the model to be available, where the test bed infrastructure consists of wireless mesh networks and real-time location systems (RTLSes).

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.186-194
• /
• 2024

WebRTC (Web Real-Time Communication) is a technology that enables browser-to-browser communication. Therefore, a signalling mechanism must be negotiated to create a connection between peers. The main aim of this paper is to create and implement a WebRTC hybrid signalling mechanism named (WebNSM) for video conferencing based on the Socket.io (API) mechanism. WebNSM was designed over different topologies such as simplex, star and mesh. Therefore it offers several communications at the same time such as one-to-one (unidirectional/bidirectional), one-to-many (unidirectional) and many-to-many (bi-directional) without any downloading or installation. In this paper, WebRTC video conferencing was accomplished via LAN and WAN networks, including the evaluation of resources in WebRTC like bandwidth consumption, CPU performance, memory usage, Quality of Experience (QoE) and maximum links and RTPs calculation. This paper presents a novel signalling mechanism among different users, devices and networks to offer video conferencing using various topologies at the same time, as well as other typical features such as using the same server, determining room initiator, keeping the communication active even if the initiator or another peer leaves, etc. This scenario highlights the limitations of CPU performance, bandwidth consumption and the use of different topologies for WebRTC video conferencing.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.49-58
• /
• 2010

In this paper, we present a methodology for fast segment restoration under multiple simultaneous link failures in mesh-type MPLS networks. The salient feature of the methodology is that both resilience and QoS constraint conditions have been taken into account for fast segment restoration. For fast restoration, a sufficient condition for testing the existence of backup segments with guaranteed-resilience has been derived for a mesh-type MPLS network. The algorithms for constructing backup segments which can meet both resilience and QoS constraint conditions are then presented with illustrating examples. Finally, simulation has been done to show the efficiency of the proposed segment restoration algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.598-599
• /
• 2015

For the wireless mesh networks, efficient routing protocol is required to transmit data from source to destination node through multi-hop transmission. Multipath routing enable the stable data transmission even in the case of traffic congestion or unstable link. In this paper, we propose partial multipath routing which does not make a full multipath but partial for some parts of unstable links. This partial multipath routing reduce the number of nodes for routing and minimized the required power.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1052-1070
• /
• 2016

Wireless Body Area Networks (WBANs) have received a lot of attention as a promising technology for medical and healthcare applications. A WBAN should guarantee energy efficiency, data reliability, and low data latency because it uses tiny sensors that have limited energy and deals with medical data that needs to be timely and correctly transferred. To satisfy this requirement, many multi-radio multi-channel MAC protocols have been proposed, but these cannot be implemented on current off-the-shelf sensor nodes because they do not support multi-radio transceivers. Thus, recently single-radio multi-channel MAC protocols have been proposed; however, these methods are energy inefficient due to data duplication. This paper proposes a TDMA-based single-radio, multi-channel MAC protocol that uses the Unbalanced Star+Mesh topology to satisfy the requirements of WBANs. Our analytical analysis together experiments using real sensor nodes show that the proposed protocol outperforms existing methods in terms of energy efficiency, reliability, and low data latency.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.236-242
• /
• 2004

In this paper, we propose an approach to parallelize a load balancing algorithm that was shown to be very effective in distributing workload for parallel computations. Load balancing algorithms are required in executing parallel program efficiently As a parallel computation model, we used dynamically growing tree structure that can be found in many application problems. The load balancing algorithm tries to balance the workload among processors while keeping the communication cost under certain limit. We show how the load balancing algorithm is effectively parallelized on mesh and hypercube interconnection networks, and analyzed the time complexity for each case to show that parallel algorithm actually reduced the various overhead.