• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1436-1457
• /
• 2018

Secure routing services in Wireless Sensor Networks (WSNs) are essential, especially in mission critical fields such as the military and in medical applications. Additionally, they play a vital role in the current and future Internet of Things (IoT) services. Lightness and efficiency of a routing protocol are not the only requirements that guarantee success; security assurance also needs to be enforced. This paper proposes a Secure-Fuzzy Energy Aware Routing Protocol (S-FEAR) for WSNs. S-FEAR applies a security model to an existing energy efficient FEAR protocol. As part of this research, the S-FEAR protocol has been analyzed in terms of the communication and processing costs associated with building and applying this model, regardless of the security techniques used. Moreover, the Qualnet network simulator was used to implement both FEAR and S-FEAR after carefully selecting the following security techniques to achieve both authentication and data integrity: the Cipher Block Chaining-Message Authentication Code (CBC-MAC) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The performance of both protocols was assessed in terms of complexity and energy consumption. The results reveal that achieving authentication and data integrity successfully excluded all attackers from the network topology regardless of the percentage of attackers. Consequently, the constructed topology is secure and thus, safe data transmission over the network is ensured. Simulation results show that using CBC-MAC for example, costs 0.00064% of network energy while ECDSA costs about 0.0091%. On the other hand, attacks cost the network about 4.7 times the cost of applying these techniques.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.219-228
• /
• 2007

End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.208-217
• /
• 2001

In mobile Internet environment, providing multicast requires much more complex mechanism comparing with the unicast Mobile IP routing protocol. This is because multicast datagrams are sent to a group address that do not belong to a specific network. The IETF Mobile IP suggested two approaches for mobile multicasting, namely remote subscription and hi-directional tunneling. In remote subscription, a mobile node may join a group via a local multicast router on the visited subnet. Therefore remote subscription may cause much datagram loss while reconstructing the delivery tee. In bi-directional tunneling, a mobile node may join a group via a hi-directional tunnel to its home agent. Bi-directional tunneling may suffer from inefficient routing. In this paper, we proposed a new mobile multicasting protocol, Mobile If Multicast using Local Broadcast(MIMLB) which can receive multicast datagrams as fast as possible and optimize routing path for multicast delivery. The MIMLB protocol uses hi-directional tunneling to receive multicast datagrams. And the MIMLB protocol can resolve datagram duplicated problem and optimize routing path by using local broadcast. Simulation results show that MIMLB reduces delivery path length and optimizes multicast routing path when a mobile nod? moves into a foreign network.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.252-259
• /
• 2003

In the case of link congestion, most of the existing ad-hoc routing protocols like AODV and DSR do not try to discover a new route if there is no change in the network topology. Hence, with low mobility, traffic may get concentrated on some specific nodes. Since mobile devices have low battery power and low computing capability, traffic concentration on a specific node is not a desirable phenomenon. Therefore, in this paper, we propose a new protocol called SLAP (Simple Load-balancing Ad-hoc routing Protocol) which resolves the traffic concentration problem by letting each node check its own load situation and give up its role as a packet forwarder gracefully in the case of high traffic load. We compare the performance of SLAP with that of AODV and DSR in terms of the forwarding traffic distribution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2010

It is recently issued scalability, mobility and external internet connection on Wire-less sensor network. The low power wireless sensor networks based on IPv6 technology 6LoWPAN technology is being standardized in the IETF. This paper for the 6LoWPAN environment based on the routing protocol LOAD, route cost applied the packet re-transmission rate which follows in Link Qualities price which uses at course expense and packet transmission Minimum route Cost routing protocol where does on the course wherethe smallest packet re-transmission becomes accomplished proposed. The technique which proposes compared and LOAD and AODV that about 13%, about 16% energy consumption is few respectively averagely, Energy of the entire network equally, used and energy effectiveness and improvement of network life time experiment led and confirmed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2026-2034
• /
• 2015

Wireless sensor networks (WSNs) consist of a lot of sensor nodes having limited transmission range. So multi-hop transmission is used for communication among nodes but the multi-hop transmission degrade the end-to-end reliability. Multipath routing and opportunistic routing are typical approaches for guaranteeing end-to-end reliability in WSNs. The existing protocols improve the reliability effectively in small networks but they suffer from rapid performance degradation in large networks. In this paper, we propose the opportunistic multipath routing protocol for guaranteeing end-to-end reliability in large WSNs. Applying multipath routing and opportunistic routing simultaneously is very hard because their conflicting routing features. The proposed protocol applies these approaches simultaneously by section-based routing thereby enhancing end-to-end reliability. Additionally, the proposed protocol guarantees required reliability by the concept of section reliability. The section reliability over a certain level might satisfy required end-to-end reliability. Our simulation results show that the proposed protocol is more suitable for guaranteeing reliability than existing protocols in large-scale WSNs.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.29-34
• /
• 2008

In this paper, we propose an entropy-based dynamic routing protocol for supporting effective route stability in mobile ad-hoc wireless sensor networks(MAWSN). The basic ideas and features are as follows. First, construction of entropy-based stable routing route using mobility of nodes between a source node and a destination node. Second, usage of location and direction information for route construction to support resource saving. Third, 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. The simulation results show the proposed routing protocol can effectively support route stability and packet delivery ratio.

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

Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient cooperative multipath routing protocol with a small number of paths based on an inter path communication. The inter path communication (namely, cooperative multipath routing) in the proposed protocol helps to reinforce the multipath reliability and reduce the use of network resources. In addition, the proposed protocol provides a reliable end-to-end transmission time by using a transmission recovery method based on the local decision for the path or transmission failures.

• 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.