• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1178-1191
• /
• 2014

The fault-tolerance routing problem is one of the most important issues in the application of the Internet of Things, and has been attracting growing research interests. In order to maintain the communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which alternate paths are created once the previous routing is broken. Then, we propose an improved efficient and intelligent fault-tolerance algorithm (IEIFTA) to provide the fast routing recovery and reconstruct the network topology for path failure in the Internet of Things. In the IEIFTA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by the immune mechanism, which can improve the ability of global search and improve the converging rate of the algorithm. The simulation results indicate that the IEIFTA-based fault-tolerance algorithm outperforms the EARQ algorithm and the SPSOA algorithm due to its ability of fast routing recovery mechanism and prolonging the lifetime of the Internet of Things.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3602-3620
• /
• 2016

Dynamic topology is one of the main influence factors on network performability. However, it was always ignored by the traditional network performability assessment methods when analyzing large-scale mobile ad hoc networks (MANETs) because of the state explosion problem. In this paper, we address this problem from the perspective of complex network. A two-layer hierarchical modeling approach is proposed for MANETs performability assessment, which can take both the dynamic topology and multi-state nodes into consideration. The lower level is described by Markov reward chains (MRC) to capture the multiple states of the nodes. The upper level is modeled as a small-world network to capture the characteristic path length based on different mobility and propagation models. The hierarchical model can promote the MRC of nodes into a state matrix of the whole network, which can avoid the state explosion in large-scale networks assessment from the perspective of complex network. Through the contrast experiments with OPNET simulation based on specific cases, the method proposed in this paper shows satisfactory performance on accuracy and efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3369-3385
• /
• 2019

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.77-82
• /
• 2004

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.52-68
• /
• 2019

Aiming at the optimal placement of communication relay nodes (OPCRN) problem in manned/unmanned aerial vehicle cooperative engagement system, this paper designed a kind of fully connected broadband backbone communication topology. Firstly, problem description of OPCRN was given. Secondly, based on problem analysis, the element attributes and decision variables were defined, and a bi-level programming model including physical layer and logical layer was established. Thirdly, a hierarchical artificial bee colony (HABC) algorithm was adopted to solve the model. Finally, multiple sets of simulation experiments were carried out to prove the effectiveness and superiority of the algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 한국인터넷방송통신학회논문지
• /
• 제9권2호
• /
• pp.51-57
• /
• 2009

유비쿼터스 센서 네트워크(USN)는 센서 노드들이 자유롭게 이동하며 망을 구성하고, 시스템에 접속하여 통신하는 환경을 말하며, 고정 망이 필요 없으므로 접근이 어려운 지역이나 전장 또는 재난 구조를 위한 응용을 위해 임의로 배치될 수 있다. 무선 센서 망 프로토콜은 자가 구성 능력을 가지며, 노드들의 이동성으로 인해 네트워크 회선 단절을 유발하기 쉬우므로 토폴로지 변경에 유연하게 적응하면서 동시에 센서 노드들이 서로 협력하며 동작하는 기법이 요구된다. 본 논문에서는 이러한 환경에서의 효율적인 토폴로지 구성과 데이터 전송을 보장하고자 노드 이동성으로 인한 망 단절에 경로 재설정을 위한 망 재구성 없이 유연한 클러스터 기반 결함허용 라우팅 프로토콜을 설계하고, 분석적 모델을 통하여 그 성능을 평가한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.1030-1050
• /
• 2021

The edges with "bridge characteristic" play the role of connecting the communication between regions in power optical cable network. To solve the problem of mining edges with "bridge characteristic" in provincial power optical cable network, the complex power optical cable network model is constructed. Firstly, to measure the generated potential energy of all nodes in n-level neighborhood local structure for one edge, the n-level neighborhood local structure topological potential is designed. And the minimum connected chain attenuation is designed to measure the attenuation degree caused by substituted edges. On the basis of that, the minimum connected chain attenuation topological potential based measurement is designed. By using the designed measurement, a bridge-edges mining algorithm is proposed to mine edges with "bridge characteristic". The experiments are conducted on the physical topology of the power optical cable network in Jilin Province. Compared with that of other three typical methods, the network efficiency and connectivity of the proposed method are decreased by 3.58% and 28.79% on average respectively. And the proposed method can not only mine optical cable connection with typical "bridge characteristic" but also can mine optical cables without obvious characteristics of city or voltage, but it have "bridge characteristic" in the topology structure.

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

Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3568-3584
• /
• 2016

In mobile opportunistic networks (MONs), human-carried mobile devices such as PDAs and smartphones, with the capability of short range wireless communications, could form various intermittent contacts due to the mobility of humans, and then could use the contact opportunity to communicate with each other. The dynamic changes of the network topology are closely related to the human mobility patterns. In this paper, we propose a social motivation-aware mobility model for MONs, which explains the basic laws of human mobility from the psychological point of view. We analyze and model social motivations of human mobility mainly in terms of expectancy value theory and affiliation motivation. Furthermore, we introduce a new concept of geographic functional cells, which not only incorporates the influence of geographical constraints on human mobility but also simplifies the complicated configuration of simulation areas. Lastly, we validate our model by simulating three real scenarios and comparing it with reality traces and other synthetic traces. The simulation results show that our model has a better match in the performance evaluation when applying social-based forwarding protocols like BUBBULE.