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

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.577-594
• /
• 2020

Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.630-635
• /
• 2008

Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.65-70
• /
• 2013

In this paper, we propose a multi-hop cooperative transmission protocol to obtain energy savings in static wireless networks. Each terminal in the network is equipped with a single antenna and each receiver uses equal gain combining technique (EGC) to combine received signals. We also propose a power allocation strategy which optimizes the total transmit power at each stage. Monte-Carlo simulations are presented to evaluate and compare performance of the proposed protocol with the multi-hop direct transmission (MDT) and the cooperative routing protocol proposed by Khadani [8], in terms of the average total transmit power and the average number of required stages.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.69-76
• /
• 2013

A lot of researches have been done to improve the energy efficiency of Wireless Sensor Networks. But all the current researches are based on the idea of direct communication between cluster head and sink node. Previous results assume that node can intelligently regulate signal energy according to the distance between nodes. It is difficult to implement algorithms based on this assumption. We present a multi-level routing algorithm from the sink node to all other nodes which have fixed radio wave radius. We also show the energy saving efficiency and the implementation in real WSN using the simulation result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1881-1886
• /
• 2016

In this paper, by using D2D communications that perform direct communications among devices within small transmission range of each device without base station, we assume that a device generates and transmits data packets to other proximate devices and the devices which receive the data packets relay those to other adjacent devices. To maximize the total number of devices which successfully receive data packets, Epidemic routing protocol is considered in this paper. In Epidemic routing protocol, all devices which received data packets try to relay the packets to other adjacent devices. We assume various network environment where devices are densely distributed in specific area(crowded area). In this environment, D2D SD can be a source node and D2D devices can be relay nodes. By setting transmission range of D2D SD and D2D devices as parameters, we analyze performance results of coverage probability of Epidemic routing protocol through intensive simulations.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4701-4719
• /
• 2015

A Mobile Ad hoc Network (MANET) consists of mobile nodes which co-operate to forward each other's packets without the presence of any centralized authority. Due to this lack of centralized monitoring authority, MANETs have become vulnerable to various kinds of routing misbehaviour. Sometimes, nodes exhibit non-cooperating behaviour for conserving their own resources and exploiting others' by relaying their traffic. A node may even drop packets of other nodes in the guise of forwarding them. This paper proposes an efficient Reputation and Collaboration technique through route-request for handling such misbehaving nodes. It lays emphasis not only on direct observation but also considers the opinion of other nodes about misbehaving nodes in the network. Unlike existing schemes which generate separate messages for spreading second-hand information in the network, nodes purvey their opinion through route-request packet. Simulation studies reveal that the proposed scheme significantly improves the network performance by efficiently handling the misbehaving nodes in the network.