• Annual Conference of KIPS
• /
• 2011.11a
• /
• pp.177-180
• /
• 2011

In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1390-1411
• /
• 2024

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.43-54
• /
• 2007

The effective power consumption is the primary issue in a sensor network which consists of the sensor nodes with limited battery power. So, most of the MAC protocols in sensor networks have been designed with the consideration of energy efficiency. Generally, these protocols make use of the listen and sleep mode periodically. However, this approach inevitably causes a long transmission delay on the data forwarding path, which is mainly resulted from the sleep time of the receiver node. This paper deals with a design of DT-MAC(Data Transmission centric MAC) protocol, with minimizes the data transmission delay while it forces each node to consume its energy efficiently. Thus, a node received a packet converts its remained sleep time to the pseudo_listen time, in which the node is able to transmit a packet. With benefit of the pseudo_listen period, the data transmission delay along with the data forwarding path will be shortened as much as it possible. Therefore, DT-MAC protocol is very suitable to the various applications which require a real time sensing data such as disaster and fire alarm.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.254-260
• /
• 2017

Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.7
• /
• pp.495-499
• /
• 2009

An underlying assumption in geographic routing protocols, periodic position exchange among neighbors has two problems: (1) unnecessary energy consumptions of nodes in regions without data delivery and (2) position invalidation of neighbors in forwarding data. Hence, this paper proposes an on-demand geographic routing protocol in mobile wireless sensor networks. The proposed protocol make a sender acquire position information of only necessary neighbors to reduce energy consumption in data forwarding time and determine an optimal node among them as a receiver for relaying data to a destination by considering their mobility. Simulation results show that the proposed protocol is more efficient than an existing geographic routing protocol.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.165-175
• /
• 2019

Networks use relatively slow heartbeat mechanisms, usually in routing protocols, to detect failures when there is no hardware signaling to help out. The time to detect failures available in the existing protocols is no better than a second, which is far too long for some applications and represents a great deal of lost data at 10 Gigabit rates. We compare the convergence time of routing protocol applying Bidirectional Forwarding Detection (BFD) protocol in wired mesh network topology. This paper suggests the combinations of protocols improving fail-over performance. Through the performance analysis, we contribute to reduce convergence time when system is fail-over.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.68-75
• /
• 2017

In this paper, we propose an energy entropy based multipath routing protocol using dynamic forwarding range in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, can select stable routing routes by using the calculated route entropy based on energy information of sensor nodes. Second, using dynamic forwarding range based on the route stability of route entropy can reduce energy, control overhead, delay for route establishment, finally improve data transmission efficiency. The performance evaluation using OPNET shows that the proposed routing protocol can efficiently support PDR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.71-76
• /
• 2003

Internet traffic is getting tremendously heavier due to the exponential growth of the Internet users, the spread of the E-commerce and the network games. High-speed routers for fast packet forwarding are commercially available to satisfy the growing bandwidth. A high-speed router, which has the decentralized multiprocessing architecture for IP and routing functions, consists of host processors, line interfaces and switch fabrics. In this paper, we propose a software architecture tuned for high-speed non-forwarding packet manipulation. IPCMP (Inter-Processor Communication Message Protocol), which is a mechanism for IPC (Inter-Processor Communication), is also proposed and implemented as well. Proposed IPC mechanism results in faster packet-processing rate by 10% as compared to the conventional IPC mechanism using UDP/IP.