• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.63-74
• /
• 2021

According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.339-345
• /
• 2013

This paper addresses the system lifetime maximization algorithm in multi-hop sensor network system. A multi-hop sensor network consists of many battery-driven sensor nodes that collaborate with each other to gather, process, and communicate information using wireless communications. As sensor-driven applications become increasingly integrated into our lives, we propose a energy-aware scheme where each sensor node transmits informative data with adaptive data rate to minimize system energy consumption. We show the optimal data rate to maximize the system lifetime in terms of remaining system energy. Furthermore, the proposed algorithm experimentally shows longer system lifetime in comparison with greedy algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.3
• /
• pp.138-144
• /
• 2007

Wireless Sensor Network(WSN) consists of a lot of light-weight sensor nodes with the capability of wireless communication. Studies have been done to improve stability and fault-tolerancy of WSN because the sensor nodes are basically vulnerable to the harsh environment. Specially, the time synchronization among sensor nodes becomes a challenging issue in WSN. All the local times should always keep the same with each other in the sensor field to perform data aggregation and energy-aware communication in WSN. In this paper, a new time synchronization technique is proposed to operate efficiently irrespective of the number of sensor nodes and the number of hops needed to cover all sensor nodes for synchronization. Simulation results show that the proposed technique has the lowest amount of packet traffic among the several time synchronization techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.1-7
• /
• 2011

Recently, multi-hop relay transmission has drawn much attention owing to its advantage of coverage extension at low power consumption. In this paper, we derive a performance bound of multi-hop communication systems with multiple amplify-and-forward relays when the optimal path is selected. The bound is derived in generalized Nakagami fading channels with different parameters for each hop by applying the geometric mean bound to the path signal-to-noise ratio (SNR) and obtaining the moment generation function of the bound. It is shown that the bound based on the geometric mean is closer to the actual performance of optimal path selection when the fading effect is small.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2473-2492
• /
• 2012

Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1716-1721
• /
• 2008

Currently, Wireless Networks have some nice characteristics such as multi-hop, multi-channel, multi-radio, etc but these kinds of resources are not fully used. The most difficulty to solve this issue is to solve mixed integer optimization. This paper proposes a method to solve a class of mixed integer optimization for wireless networks by using AMPL modeling language with CPLEX solver. The result of method is scheduling and congestion control in multi-channel multi-radio wireless networks.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.481-504
• /
• 2010

Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.736-741
• /
• 2005

The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.