• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.177-179
• /
• 2006

This paper presents an analysis architecture of embedded operating systems for wireless sensor network. Wireless multi-hop sensor networks use battery-operated computing and sensing device. We expect sensor networks to be deployed in an ad hoc fashion, with very high energy constraints. These characteristics of multi-hop wireless sensor networks and applications motivate an operating system that is different from traditional embedded operating system. These days new wireless sensor network embedded operating system come out with some advances compared with previous ones. The analysis is focusing on understanding differences of dominant wireless sensor network OS, such as TinyOS 2.0 with TinyOS 1.x.

• Journal of information and communication convergence engineering
• /
• 제11권2호
• /
• pp.69-81
• /
• 2013

Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identification algorithm and also present numerical results that compare the critical points of the network and H-hop sub-network illustrating how effectively sub-network information can detect the network-wide critical points. Then, we propose two localized topological control resilient schemes that can be applied to both global and local H-hop sub-network critical points to improve the network connectivity and the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions show that our proposed resilient schemes increase the probability of the network being connected in variety of link and node failure conditions.

• Journal of information and communication convergence engineering
• /
• 제13권1호
• /
• pp.7-14
• /
• 2015

In a multi-hop wireless network, connectivity is determined by the link that is established by the receiving signal strength computed by subtracting the path loss from the transmission power. Two path loss models are commonly used in research, namely two-ray ground and shadow fading, which determine the receiving signal strength and affect the link quality. Link quality is one of the key factors that affect network performance. In general, network performance improves with better link quality in a wireless network. In this study, we measure the network connectivity and performance in a shadow fading path loss model, and our observation shows that both are severely degraded in this path loss model. To improve network performance, we propose power control schemes utilizing link quality to identify the set of nodes required to adjust the transmission power in order to improve the network throughput in both homogeneous and heterogeneous multi-hop wireless networks. Numerical studies to evaluate the proposed schemes are presented and compared.

• 한국인터넷방송통신학회논문지
• /
• 제13권4호
• /
• pp.17-22
• /
• 2013

본 논문에서는 레일리 페이딩 채널의 멀티 홉 협력 전송 프로토콜을 제안한다. 제안된 프로토콜에서, 멀티 홉 협력 전송은 시스템 성능의 향상을 위해 사용되었다. 중계라는 특성으로 인해, 전송받는 노드와 다음의 노드뿐만 아니라, 목적지와 그 사이의 전송 받는 모든 노드들이 제한되어 있지 않다. 제안된 프로토콜은 선택된 릴레이나 몇몇의 중간 노드로부터 건너 뛰어 전송되는 멀티 홉 직접 전송 프로토콜에 비해 평균 전송 전력을 절약할 수 있다. 제안하는 기법은 모바일 ad-hoc 무선 네트워크에서 시행 및 평가되어진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1083-1097
• /
• 2018

This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

• 디지털콘텐츠학회 논문지
• /
• 제8권3호
• /
• pp.323-328
• /
• 2007

3G 이후의 통신 시스템은 무선 접속을 위하여 100 Mbps 이상을 제공해야 한다. 스마트 안테나 외에도 무선 멀티 홉 네트워크는 셀 크기와 처리율을 증가시키는 방식이다. 예를 들어 지그비 기술은 기기 사이의 저 가격과 저 전력 연결을 제공하며 블루투스에서 제공하는 네트워크 구성보다 큰 메쉬 네트워크를 구축할 수 있다. 무선 메쉬 네트워크를 이용한 홈 임베디드 시스템은 지그비 응용을 위한 큰 시장중의 하나이다. 만약 LOS 경로가 보장되지 않고 높은 주파수를 사용하면 AP와 마지막 노드사이에 직접 연결은 불가능하다. 따라서 멀티 홉 릴레이 기법을 사용하게 되면 AP와 마지막 노드사이의 연결은 가능하게 된다. 본 논문은 AP와 마지막 노드사이의 데이터 릴레이 방식을 연구하였으며 멀티 홉 무선 메쉬 네트워크에서 DSSS/BPSK 시스템의 처리율과 PER 성능을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권1호
• /
• pp.26-51
• /
• 2009

In this paper, we propose an empirical framework for modeling and emulating interference in multi-hop wireless ad-hoc networks. Wireless interference causes wide variation in the frame delivery rate at a link, and thus we cannot represent the state of the link with only two states, connected state and disconnected state, as in wired networks. We first investigate wireless interference in detail, in order to accurately calibrate the interference and identify its underlying attributes, and then we simulate the diverse occurrences and effects of interference, after incorporating the scheme into a simulation tool. Based on these observations, we devise a modeling and simulation framework with several control parameters, and perform an extensive set of simulation studies. The simulation results indicate that the proposed framework enables us to examine various attributes of wireless interferences and their effects on wireless network protocols and systems.