• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.48-57
• /
• 2008

Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.355-366
• /
• 2003

Today's market share of mobile internet service is growing rapidly in internet due to the rapid advances in wireless mobile networks. To guarantee for QoS of Mobile Nodes in wireless mobile networks, we propose the Proxy MRSVP (PMRSVP) which is efficient resource reservation protocol. The PMRSVP using a modified regional registration restrains excessive message generation from existing protocols that propose an alternative plan of existing best effort service in wireless mobile networks. We show that signaling message generation quantities and resource registration costs of the PMRSVP are lower than MRSVP and Hierarchical MRSVP (HMRSVP) because as Mobile Agent (MA) plays a proxy role instead of Corresponding Host (CH). We evaluate resource reservation cost with registration cost of intradomain and interdomain of the proposed method in the paper by comparing to that of the MRSVP and HMRSVP.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.563-572
• /
• 2002

Wireless mobile networks tend to drop a large portion of packets due to propagation errors rather than congestion. To Improve reliability over noisy wireless channels, wireless networks can employ forward error correction (FEC) techniques. Static FEC algorithms, however, can degrade the performance by poorly matching their overhead to the degree of the underlying channel error, especially when the channel path loss rate fluctuates widely. This paper investigates the benefits of an adaptable FEC mechanism for wireless networks with severe packet loss by analytical analysis or measurements over a real wireless network called sensor network. We show that our adaptive FEC named FECA (FEC-level Adaptation) technique improves the performance by dynamically tuning FEC strength to the current amount of wireless channel loss. We quantify these benefits through a hybrid simulation integrating packet-level simulation with bit-level details and validate that FECA keeps selecting the appropriate FEC-level for a constantly changing wireless channel.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.336-346
• /
• 2001

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastnlcture or centralized administration. Currently, numerous routing protocols have been developed for changing messages between nodes in a wireless ad-hoc network. Applications of wireless ad-hoc network technology are various and proper routing protocol must be used according to application domain or network size. In a wireless ad-hoc network. some hosts want services from fixed networks. For supporting such services, it is necessary to interconnect wireless ad-hoc networks and fixed networks. The DSMIHDynamic Source Multipath Routing) protocol, proposed in this paper, focuses on supporting seamless communication services between the nodes within a wireless ad-hoc network and providing fixed networks to the mobile hosts in wireless an-hoc networks. In DSMR protocol, each node need not broadcast routing messages periodically. and mobile hosts that to send data packets initiate route request and route establishment procedure. By maintaining multiple paths in each node. faster route re-establishment is also possible in our scheme.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.603-614
• /
• 2005

The wireless LAN environment using Mobile IP is constructed and managed to be connected with Ethernet based wired networks. However, there have been many problems with wireless networks using Mobile IP. Some important facts on network performance have not been considered when introducing wireless LAN by Mobile IP to wired networks. In this paper, we suggest schemes which can solve problems on Handover latency caused by the asymmetrical connectivity of the Access Router at applying the HMIPv6 and on binding updates due to the MN frequent movement. Our proposed schemes can reduce network latency by using the HMIPv6 architecture with a virtual router layer, and reduce communication overhead by interchanging information of the MN movement between routers. Our schemes are expected to assist in constructing a more real and effective wireless LAN environment based on the HMIPv6 and FMIP.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.113-118
• /
• 2015

Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.87-93
• /
• 2016

In this paper, we propose a RF energy harvesting based routing protocol in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, establishment of routing route based on both remaining energy of mobile sensor nodes and RF energy harvesting. Second, establishment of routing route by considering availability and stability of route based on energy of mobile sensor nodes to increase lifetime of networks and route. The performance evaluation of the proposed routing protocol using OPNET shows that the routing method considering both route availability and route stability based on RF energy harvesting can increase efficiently route lifetime.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.216-222
• /
• 2009

This paper proposes an integrated mobile sink networks management system which can monitor and control various kinds of wireless lan access points, located in many different areas divided by their managing groups, from multi-vendors, and their operations in networks. The proposed system has the center-local interoperability structure cooperating with local-center servers which can perform the same operations as the central servers for wireless lan access points from multi-vendors and wireless lan centric management features. For this purpose, we propose a new way of data design, messaging policy, and hierarchical system structure such that we can achieve stable and consistent management methods for various wireless access points on distributed networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.15-24
• /
• 2008

In this paper, we propose a Cross-Layer Transmission Architecture (CLTA) to support power saving high-speed multimedia services in mobile ad-hoc wireless sensor networks(MAWSN). The main goals of this paper are in showing and proposing how the routing routes are decided on route stability based on mobility of mobile nodes to increase the operational lifetime of routes as well as how the transmit power can be saved in mobile ad-hoc wireless sensor networks. To obtain these goals, we propose a cross-layer architecture strategy which combines network layer technology with physical layer technology to get synergy effects in the view of transmission power saving. 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 CLTA is performed via simulation and analysis.