• 인터넷정보학회논문지
• /
• 제10권5호
• /
• pp.1-12
• /
• 2009

BGP 커뮤니티 기반의 라우팅 정책은 특정 네트워크에 대한 경로를 사용자 정의 라우팅 정책에 따라 선택할 수 있는 특성을 갖는다. 다양한 속성의 단위 네트워크가 상호 연결된 글로벌연구망 환경의 전체적인 성능향상을 위해 최근 커뮤니티 기반의 라우팅 정책에 대한 관심이 증대하고 있다. 본 논문은 기존 글로벌연구망에서 적용되고 있는 커뮤니티 라우팅을 전체 네트워크 성능향상의 관점에서 분석하고, 새로운 글로벌연구망에서 라우팅 성능에 관련된 문제점을 도출한다. 이를 바탕으로 새로운 글로벌연구망의 라우팅 경로상의 잘못된 경유 트래픽 개선, 비대칭 라우팅 등을 해결하는 네트워크 상호연동 구조와 최적의 커뮤니티 라우팅 정책 모델을 제시한다. 제시된 결과는 향후 개발될 국가연구망과 상업망의 성능향상에 크게 기여할 수 있을 것으로 기대된다.

• International Journal of Computer Science & Network Security
• /
• 제22권10호
• /
• pp.137-144
• /
• 2022

Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

• 한국멀티미디어학회지
• /
• 제12권4호
• /
• pp.28-40
• /
• 2008

Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

• International Journal of Computer Science & Network Security
• /
• 제21권12spc호
• /
• pp.636-642
• /
• 2021

Vehicular Ad hoc Networks (VANET's) are gaining popularity in research community with every passing year due to the key role they play in Intelligent Transportation System. Their primary objective is to provide safety, but their potential to offer a variety of user-oriented services makes them more attractive. The biggest challenge in providing all these services is the inherent characteristics of VANET itself such as highly dynamic topology due to which maintaining continuous communication among vehicles is extremely difficult. Here comes the importance of routing solutions which traditionally are designed using strict layered architecture but fail to address stringent QoS requirements. The paradigm of cross-layer design for routing has shown remarkable performance improvements. This paper aims to highlight routing challenges in VANET, limitations of single-layer solutions and presents a survey of cross-layer routing solutions that utilize the information from the MAC layer to improve routing performance in VANET.

• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.342-350
• /
• 2001

The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.

• Journal of Communications and Networks
• /
• 제13권6호
• /
• pp.602-611
• /
• 2011

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

• Industrial Engineering and Management Systems
• /
• 제15권3호
• /
• pp.259-267
• /
• 2016

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• 공학논문집
• /
• 제7권1호
• /
• pp.53-60
• /
• 2005

Community Wireless Networks define the next generation wireless services. Multimedia usages for financial services over community Wireless LAN (WLAN) based mesh networks require link stability. Several new services are being proposed for multimedia over WLANs. Portable Internet Services are implemented by several wireless carriers to proliferate their customer base. However, these services are still expensive and require a central telecom/wireless carrier whose monopoly and preference defines the availability of new services. Our research project identifies the usage of these critical services in public places over the financial services backbone architecture to provide efficient easy-to-use and economical services to their customers and merchants without being dependent on the central wireless carrier. The user connects to the network using his regular WLAN NIC using the Mesh Router/Bridge interconnectivity and obtains the needed multimedia and financial services from the ATM-AP Gateway, In our proposed scenario, the ATN AP-MR use AODV protocol and MR-MC is based on 802.11g/a/b IEEE standard. We use multi path routing protocols for reducing the congestion over a particular route. We demonstrate the results of our simulations and test-bed outcome to evaluate link failure rate and oversubscription factors to eliminate network congestion and non-availability of the critical financial services.

• 정보처리학회논문지C
• /
• 제16C권4호
• /
• pp.521-526
• /
• 2009

DTN(Disruption/Delay Tolerant Network)은 네트워크의 단절성(partitioning)이 높은 환경에서 단절된 지역 네트워크를 연동하기 위한 네트워크 구조이다. 현재 DTN과 관련하여 많은 연구가 이루어지고 있으며 특히 라우팅 기법에 대한 연구는 가장 많은 관심을 받는 분야 중 하나이다. 본 논문에서는 단절된 애드혹(Ad-hoc) 네트워크에서 사용자간의 연결성을 제공하기 위하여 무인항공기(Unmanned Aerial Vehicle: UAV)를 이용한 DTN의 구성 시 사용가능한 DTN 라우팅 기법을 살펴보고 UAV의 이동 경로 제어 기법을 제안한다. 또한 다양한 시나리오에서의 실험을 통하여 제안된 방법의 성능을 평가한다.