• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.147-162
• /
• 2009

In this paper, we propose a Cooperative Transmission Strategy using Entropy-based Relay Selection in Mobile Ad-hoc Wireless Sensor Networks(MAWSN) with Rayleigh Fading Environments. The main features and contributions of the proposed cooperative transmission strategy are as follows. First, entropy-based relay selection is used to improve data transmission reliability from a source node to a destination node. Second, we present a theoretical analysis model for the proposed cooperative transmission strategy with the outage probability of the end-to-end performance. The performance of our protocol is evaluated using analysis and simulation.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.444-450
• /
• 2008

With the advancement of the mobile device and arrival of the integrated wired/wireless environments, the damand for services accessible by mobile devices is rapidly increasing. However, unlike existing wired networks, communication in wireless networks has many weaknesses. Therefore, research and development into an appropriate security technology has reached a critical stage, as combined wired/wireless environments emerge. Therefor, in this paper, we propose that device authentication technology in AAA (Authentication, Authorization, Accounting) mechanism of Mobile environment for secure service offer.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.107-115
• /
• 2005

For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.9
• /
• pp.33-40
• /
• 2017

In this paper, we propose a sink-location management and data-routing scheme to effectively support the mobile sink in solar-powered WSN. Battery-based wireless sensor networks (WSNs) have a limited lifetime due to their limited energy, but solar energy-based WSNs can be supplied with energy periodically and can operate forever. On the other hand, introduction of mobile sink in WSNs can solve some energy unbalance problem between sink-neighboring nodes and outer nodes which is one of the major challenges in WSNs. However, there is a problem that additional energy should be consumed to notify each sensor node of the location of the randomly moving mobile sink. In the proposed scheme, one of the nodes that harvests enough energy in each cluster are selected as the cluster head, and the location information of the mobile sink is shared only among the cluster heads, thereby reducing the location management overhead. In addition, the overhead for setting the routing path can be removed by transferring data in the opposite direction to the path where the sink-position information is transferred among the heads. Lastly, the access node is introduced to transmit data to the sink more reliably when the sink moves frequently.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.367-376
• /
• 2005

The smooth handoff supported by the route optimization extension to the mobile IP standard protocol should support a packet buffering mechanism at the base station (BS), in order to reduce the degradation in TCP performance caused by packet losses within mobile network environments. The purpose of packet buffering at the BS is to recover the packets dropped during intersubnetwork handoff by forwarding the packets buffered at the previous BS to the new BS. However, when the mobile host moves to a congested BS within a new foreign subnetwork, the buffered packets forwarded by the previous BS are likely to be dropped. This subsequently causes global synchronization to occur, resulting in the degradation of the wireless link in the congested BS, due to the increased congestion caused by the forwarded burst packets. Thus, in this paper, we propose an implicit priority forwarding (IPF) packet buffering scheme as a solution to this problem within mobile IP based networks. In the proposed IPF method, the previous BS implicitly marks the priority packets being used for inter-subnetwork handoff. Moreover, the proposed modified random early detection (M-RED) buffer at the new congested BS guarantees some degree of reliability to the priority packets. The simulation results show that the proposed IPF packet buffering scheme increases the wireless link utilization and, thus, it enhances the TCP throughput performance in the context of various intersubnetwork handoff cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3396-3411
• /
• 2015

Sensors used in Wireless Sensor Networks (WSN) have mostly limited capacity which affects the performance of their applications. One of the data-gathering methods is to use mobile sinks to visit these sensors so that they can save their limited battery energies from forwarding data packages to static sinks. The main disadvantage of employing mobile sinks is the delay of data collection due to relative low speed of mobile sinks. Since sensors have very limited memory capacities, whenever a mobile sink is too late to visit a sensor, that sensor's memory would be full, which is called a 'memory overflow', and thus, needs to be purged, which causes loss of collected data. In this work, a method is proposed to generate mobile sink tours, such that the number of overflows and the amount of lost data are minimized. Moreover, the proposed method does not need either the sensor locations or sensor memory status in advance. Hence, the overhead stemmed from the information exchange of these requirements are avoided. The proposed method is compared with a previously published heuristic. The simulation experiment results show the success of the proposed method over the rival heuristic with respect to the considered metrics under various parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.993-1003
• /
• 2012

In this paper, we propose a method that wireless mobile nodes can obtain high throughput in heterogeneous wireless networks using multiple connections and it has low packet loses under handover situation. Currently, a mobile node exchanges data with server for one network connection. The proposed method can use high throughput because it doesn't only use one network(WLAN, 3G, etc.) but also use multiple wireless networks. When mobile nodes move to area to use multiple connection, mobile nodes request heterogeneous wireless networks using multiple connections message from the server and the server transmit packets using multiple connections. Also, this method doesn't disconnect previous networks, so packets losses are decreased. Using the NS-2 simulation, we verify that the propose method enhances throughput.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.80-84
• /
• 2010

Data multicasting from a source to multiple sinks in wireless sensor networks is used to achieve both reducing communication costs and energy efficiency. Almost all existing schemes for the multicasting might be effectively performed by optimal construction of a multicasting tree between a source and multiple stationary sinks. However, in practical sensor applications, sinks could move around on the wireless sensor networks for own missions, such as scouting of soldiers and saving lives of victims by firefighters. Unfortunately, the sink mobility causes frequent entire reconstruction of the multicasting tree and thus it leads to exhaustion of battery power of sensors. Hence, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Update-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. Our simulation results show that our scheme for mobile sinks is more efficient in terms of energy resource management than other exist works.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.405-411
• /
• 2015

In this paper, we propose routing protocol for mobile wireless sensor networks with a mobile sink in cluster configuration. The proposed protocol extends LEACH-ME by introducing a mobile sink. The mobile sink moves to the cluster head with the highest number of member nodes to collect sensed data from cluster heads within its vicinity, which results in reducing energy consumption in forwarding packets to the sink. The simulation results show that the proposed protocol outperform LEACH-ME in terms of energy efficiency.