• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.351-360
• /
• 2003

To provide good-quality services of multimedia in wireless mobile networks, QoS for multimedia traffic should be guaranteed. However, since the existing QoS guaranteed schemes are designed for fixed networks, they are inadequate in the wireless network environments. Recently, as the size of cells like micro cell or pico cell becomes smaller. Mobile hosts on micro cellular networks, change their location frequently. It causes many drawbacks such as delayed delivery, packet losses and signaling overheads. Because the existing schemes supporting interoperability between RSVP and Mobile If are designed for macro cell environments. Their uses in micro cellular networks can be restricted. In this paper, we propose the CRSVP(Cellular RSVP Protocol) which supports QoS in micro cellular network environments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.1
• /
• pp.31-37
• /
• 2008

In this paper, we propose an entropy-based routing protocol to effectively support both stable route construction and route lifetime in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The basic idea and feature of the proposed routing protocol are as follows. First, we construct the stable routing routes based on entropy concept using mobility of mobile nodes. Second, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET(Optimized Network Engineering Tool) and analysis. The results of the performance evaluation show that the proposed routing protocol can efficiently support both the construction of stable route and route lifetime in mobile ad-hoc wireless networks.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.844-849
• /
• 2002

A provision of spatial information is expected to make a market explosion in various fields. A distribution of spatial data on wireless mobile environments indicates a huge expansion of mobile technology as well as a spread of geospatial applications. For high quality spatial information, 4S technology project integrating 4 kinds of spatial systems is currently being executed with the goal of nationwide integration of spatial data and spatial information systems. In terms of network environments, a mobile ad hoc network where mobile terminals communicate with each other without any infrastructures has been standardized for the next generation mobile wireless network. With respect to the future technologies for spatial information, it is necessary to design 4S applications on mobile ad hoc networks. This paper addresses the issue, which is proposing design points for distributing 4S spatial data on mobile ad hoc networks and ad hoc styled 4S applications.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.68-76
• /
• 2011

In this paper, we propose a method for joining mobile nodes in wireless sensor networks using hysteresis features. It is possible to use static hysteresis, whereby joining and withdrawal are carried out repeatedly when a mobile node is located at boundary points. The energy consumption of the nodes can be effectively managed by a decrease in the response packets of the neighbors under the joining requests of the mobile nodes. However, static hysteresis causes a decrease in the joining rate. In order to increase the joining rate, dynamic hysteresis is used. To evaluate the performance of the proposed technique, the joining rate is investigated and analyzed. Simulation results show that the proposed method enables efficient joining according to the mobility of nodes in wireless sensor networks.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.189-198
• /
• 2001

In recent years, the predominant part in telecommunications is mobile communications. The next generation network is extending today's voice-only mobile networks to multi-service networks. ATM Network is possible to carry such multi-media traffic and it will be expect to use wireless ATM for the future mobile access network. One of manly important aspects for the performance of wireless ATM is the Medium Access Control (MAC) protocol. The MAC protocol must be able to satisfyingly handle the different ATM services (CBR, VBR, ABR and UBR) with their radically different performance requirements. Additionally, the MAC protocol must be able to cope with the complex radio environment where fading, multi-path propagation interference and burst-errors further complicate the situation. In this paper, a dynamic slot allocation algorithm in wireless ATM is proposed for an efficient channel sharing/media access at the MAC layer. We use equivalent capacity in the allocation of slots for VBR traffic which is variable along the time. It is simple and effective slot allocation method for VBR service. In particular, we consider the slot allocation of a session consisted of several connections for requirement of multimedia traffic. Simulation shows that the cell loss ratio is reduced by re-allocation of extra slots in Mobile Terminal (MT).

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.967-970
• /
• 2002

Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message from a terminal and send it to the other terminal. In this paper, we discuss edge coloring problems related to multihop wireless networks. We show some relations about the problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.815-834
• /
• 2012

Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.291-294
• /
• 2004

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.916-922
• /
• 2007

Wireless networks (WNs) are developed and applied widely in a lot of areas. Now, a new generation of wireless networks is coming, and that is Wireless Mesh Network (WMN). At present, there are not so many researches which deal on this area. Most researches are derived from Mobile Ad hoc Networks (MANET) and WNs. In WMNs, there are some applications that require real-time delivery. To guarantee this, rate control and congestion control are needed. This problem leads to optimization issue in transport layer. In this paper, we propose a mathematical model which is applied in rate and congestion control in WNMs. From this model, we optimize rate and congestion control in WMNs by maximizing network utility. The proposed algorithm is implemented in distributed way both in links and sources.