• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.295-303
• /
• 2007

An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.634-644
• /
• 2009

A diversity of wireless networks, with rapidly evolving wireless technology, are currently in service. Due to their innate physical layer vulnerability, wireless networks require enhanced security components. WLAN, WiBro, and UMTS have defined proper security components that meet standard security requirements. Extensive research has been conducted to enhance the security of individual wireless platforms, and we now have meaningful results at hand. However, with the advent of ubiquitous service, new horizontal platform service models with vertical crosslayer security are expected to be proposed. Research on synchronized security service and interoperability in a heterogeneous environment must be conducted. In heterogeneous environments, to design the balanced security components, quantitative evaluation model of security policy in wireless networks is required. To design appropriate evaluation method of security policies in heterogeneous wireless networks, we formalize the security properties in wireless networks. As the benefit of security protocols is indicated by the quality of protection (QoP), we improve the QoP model and evaluate hybrid security policy in heterogeneous wireless networks by applying to the QoP model. Deriving relative indicators from the positive impact of security points, and using these indicators to quantify a total reward function, this paper will help to assure the appropriate benchmark for combined security components in wireless networks.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.1
• /
• pp.120-130
• /
• 2009

In recent years, many mobile wireless communication devices and applications have been deployed on the planet. The mobile multi-hop wireless network models appeared to provide means to access to networks where few infrastructure exists. However, the mobile multi-hop wireless networks have weaker points in attacks and intrusions than the wired and one-hop wireless networks. In this paper, the secure routing issues in most mobile multi-hop wireless network models are surveyed in depth. The state-of-the-art technologies and research activities are explained. Finally, the issues and technologies for the secure routing specific to a maritime network model are sufficiently discussed as conclusions.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.105-116
• /
• 2019

Recently, there has been an increase in research on wireless sensor networks (WSNs) because they are easy to deploy in applications such as internet-of-things (IoT) and body area networks. However, WSNs have constraints in terms of power, quality-of-service (QoS), computation, and others. To overcome the power constraint issues, wireless energy harvesting has been introduced into WSNs, the application of which has been the focus of many studies. Additionally, to improve system performance in terms of achievable rate, cooperative networks are also being explored in WSNs. We present a review on current research in the area of energy harvesting in WSNs, specifically on the application of simultaneous wireless information and power transfer (SWIPT) in a cooperative sensor network. In addition, we discuss possible future extensions of SWIPT and cooperative networks in WSNs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.799-802
• /
• 2005

In this paper, we analyses of Key Management Protocol for Wireless Sensor Networks in Wireless Sensor Networks. Wireless sensor networks have a wide spectrum of civil military application that call for security, target surveillance in hostile environments. Typical sensors possess limited computation, energy, and memory resources; therefore the use of vastly resource consuming security mechanism is not possible. In this paper, we propose a cryptography key management protocol, which is based on identity based symmetric keying.

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

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.51-55
• /
• 2008

A digital home is a ubiquitous environment that is expected to be realized in the near future. All information appliances in a house are connected to each other through wired and/or wireless home networks. Authenticated user can access the various services provided by the digital home, and the access is not restricted by equipment, time, or location. The technologies that form the digital home can be grouped into two categories: wired networking technologies and wireless networking technologies. For the purpose of ubiquitous environments, wireless-networks offer suitable and seamless high-quality services. A wireless LAN can be created simply by equipping a single access point. For that reason, the cost of establishing such a network is low and using it is easy. Of course, there is an exciting new wireless technology. It is the Ultra Wide Band (UWB). However, it is not enough to bring wireless convenience, although offering a broad range of high-speed data transfer capabilities, Because of unstable. Thus, of the wireless-networking systems, we focus on the wireless LAN. We quantitatively analyze its capabilities. The dynamic and adaptive wireless LAN provides a foundation for the evolution toward the next generation of wireless and adaptive networks. The difference between wired LAN and wireless LAN in upload and download rates is small. Although the wireless LAN experiences a greater loss rate than the wired LAN, the difference is minimal. We conclude that a wireless LAN is suitable for use in an apartment environment.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.236-246
• /
• 2007

This paper investigates the performance of the transmission control protocol (TCP) transport protocol over IEEE 802.11 infrastructure based wireless networks. A wireless link is generally characterized by high transmission errors, random interference and a varying latency. The erratic packet losses usually lead to a curbing of the flow of segments on the TCP connection and thus limit TCP's performance. This paper examines the impact of the lossy nature of IEEE 802.11 wireless networks on the TCP performance and proposes a scheme to improve the performance of TCP over wireless links. A negative acknowledgment scheme, selective negative acknowledgment (SNACK), is applied on TCP over wireless networks and a series of ns-2 simulations are performed to compare its performance against that of other TCP schemes. The simulation results confirm that SNACK and its proposed enhancement SNACK-S, which incorporates a bandwidth estimation model at the sender, outperform conventional TCP implementations in 802.11 wireless networks.