• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.169-178
• /
• 2023

Wireless sensor network is wieldy use for IoT application. The sensor node consider as physical device in IoT architecture. This all sensor node are operated with battery so the power consumption is very high during the data communication and low during the sensing the environment. Without proper planning of data communication the network might be dead very early so primary objective of the cluster based routing protocol is to enhance the battery life and run the application for longer time. In this paper we have comprehensive of twenty research paper related with clustering based routing protocol. We have taken basic information, network simulation parameters and performance parameters for the comparison. In particular, we have taken clustering manner, node deployment, scalability, data aggregation, power consumption and implementation cost many more points for the comparison of all 20 protocol. Along with basic information we also consider the network simulation parameters like number of nodes, simulation time, simulator name, initial energy and communication range as well energy consumption, throughput, network lifetime, packet delivery ration, jitter and fault tolerance parameters about the performance parameters. Finally we have summarize the technical aspect and few common parameter must be fulfill or consider for the design energy efficient cluster based routing protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.969-978
• /
• 2006

Recently, there has been explosive growth in Internet service contents, and we have witnessed the emergence of many real-time applications on the Internet. These types of applications require special support from the underlying network such as reliability, timeless, and guaranteed delivery, as well as different levels of service quality. Estimation network status and transcoding data rate are researching for QoS of multimedia service by using the RTP/RTCP. We propose two schemes that the way to calculate the one-way delay by expanding the structure of RTP/RTCP in Internet that provides us 'best effort' service and to estimate the network condition by using this in this paper. And we propose the dynamic RTCP mechanism based on one-way delay to deal with rapidly changed network situation immediately. In simulation, proposed monitoring schemes using the one-way delay has similar in performance to monitoring schemes using the GPS, proposed dynamic RTCP scheme obtain the desired result of decreased packet loss rate by sending RTCP RR packet lower than other schemes.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.519-526
• /
• 2004

This paper presents an efficient interoperation scheme of a VPN(Virtual Private Network) and Mobile IP using a hierarchical structure of a FA(Foreign Agent). In the proposed scheme, the GFA(Gateway Foreign Agent) plays a role of VPN gateway on behalf of the MN(Mobile Node). When the MN moves in the same GFA domain, because the GFA has already an IPsec security association with a VPN gateway in the home network of the MN, the MN does not need an IPsec re-negotiaion. In this way, our mechanism reduces a message overhead and a delay resulted from an IPsec negotiation. And a MN can send a data to a correspondent node without a packet leakage. We show a performance of our scheme by using a discrete analytical model. Analytical results demonstrated that the total processing cost calculated by a registration update cost and a packet delivery cost is significantly reduced through our proposed scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.13-21
• /
• 2008

In general, data communication among sensor nodes requires more energy than internal processing or sensing activities. In this paper, we propose a noble technique to reduce the number of packet transmissions necessary for sending/receiving queries/results among neighboring nodes with the help of context-aware routing tables. The important information maintained in the context-aware routing table is which physical properties can be measured by descendent nodes reachable from the current node. Based on the information, the node is able to eliminate unnecessary packet transmission by filtering out the child nodes for query dissemination or result relaying. The simulation results show that up to 80% of performance gains can be achieved with our technique.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.720-740
• /
• 2011

Wi-Fi-enabled portable devices have recently been introduced into the consumer electronics market. These devices download or upload content, from or to a host machine, such as a personal computer, a laptop, a home gateway, or a media server. This paper investigates the fairness among multiple Wi-Fi-enabled portable devices in a home network when they are simultaneously communicated with the host machine. First, we present that, a simple IEEE 802.11-based home network suffers from unfairness, and the fairness is exaggerated by the wireless link errors. This unfairness is due to the asymmetric response of the TCP to data-packet loss and to acknowledgment-packet loss, and the wireless link errors that occur in the proximity of any node; the errors affect other wireless devices through the interaction at the interface queue of the home gateway. We propose a QoS-provisioning framework in order to achieve per-device fairness and service differentiation. For this purpose, we introduce the medium access price, which denotes an aggregate value of network-wide traffic load, per-device link usage, and per-device link error rate. We implemented the proposed framework in the ns-2 simulator, and carried out a simulation study to evaluate its performance with respect to fairness, service differentiation, loss and delay. The simulation results indicate that the proposed method enforces the per-device fairness, regardless of the number of devices present and regardless of the level of wireless link errors; furthermore it achieves high link utilization with only a small amount of frame losses.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.88-96
• /
• 2001

Future mobile communication networks, which consist of ATM-based B-ISDN backbone networks and wireless ATM networks, will provide u user with broadband connection and QoS service. These network systems need the lossless handoff methods which support user mobility, satisfy ATM features such as ATM cell ordering and no ATM cell duplication and minimize buffer requirement for ATM cell buffering. In this paper we suggest a multicast-based handoff method to supp$\alpha$t lossless connection as well as to minimize buffer overhead. It establishes a dynamic multicast connection between source terminal and wireless member AP (access point)s. When the mobile terminal receives data packet correctly, it notifies the positive acknowledgement of the packet to all member APs. And member APs then release the MT related temporary buffer space for MT's future movement. Therefore member APs can eliminate unnecessary buffer usage and manage the buffer space efficiently. Analysis result shows that our handoff method has better performance in buffer requirement for lossless and seamless connection services over VCT (virtual connection tree) method and other dynamic multicast-based handoff methods.