• Title/Summary/Keyword: Research Networks

Search Result 5,151, Processing Time 0.031 seconds

Performance Analysis of CMAP-WDMA MAC Protocol for Metro-WDMA Networks

  • Yun, Chang-Ho;Cho, A-Ra;Park, Jong-Won;Lim, Yong-Kon
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.4
    • /
    • pp.480-488
    • /
    • 2009
  • A channel-shared modified accelerative pre-allocation wavelength division multiple access (CMAP-WDMA) media access control (MAC) has been proposed for metro-WDMA networks, as an extension of modified pre-allocation wavelength division multiple access (MAP-WDMA) MAC protocol. Similarly, CAP WDMA as an extension of accelerative pre-allocation wavelength division multiple access (AP-WDMA) MAC protocol. Performance of CMAP- and CAP-WDMA was extensively investigated under several channel sharing methods (CSMs), asymmetric traffic load patterns (TLPs), and non-uniform traffic distribution patterns (TDPs). The result showed that the channel utilization of the CMAP-WDMA always outperforms that of CAP-WDMA at the expense of longer channel access delay for channel shared case while CMAP-WDMA provided higher channel utilization at specific network conditions but always shorter channel access delay than CAP-WDMA for non-channel shared case. Additionally both for CMAP- and CAP-WDMA, determining an effective CSM is a critical design issue because TDPs and TLPs can be neither managed nor expected while CSM is manageable, and the CSM supporting the best channel utilization can be recommended.

A 4S Design on Mobile Ad hoc Networks

  • Lee, Eun-Kyu;Kim, Mi-Jeong;Oh, Byoung-Woo;Kim, Min-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.19 no.1
    • /
    • pp.81-89
    • /
    • 2003
  • A provision of spatial information is expected to make a market explosion in various fields. A distribution of spatial data on wireless mobile environments indicates a huge expansion of mobile technology as well as a spread of geospatial applications. For high-qualified spatial information, the 4S technology Project that is integrating four kinds of spatial systems is currently being executed with the goal of nationwide integration of spatial data and spatial information systems. In terms of network environments, a mobile ad hoc network where mobile terminals communicate with each other without any infrastructures has been standardized for the next generation mobile wireless network. With respect to the future technologies for spatial information, it is necessary to design 4S applications on mobile ad hoc networks. This paper addresses the issue, which is proposing design concepts for distributing 4S spatial data on mobile ad hoc networks and for ad hoc styled 4S applications.

A Virtual Laboratory to Practice Mobile Wireless Sensor Networks: A Case Study on Energy Efficient and Safe Weighted Clustering Algorithm

  • Dahane, Amine;Berrached, Nasr-Eddine;Loukil, Abdelhamid
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.205-228
    • /
    • 2015
  • In this paper, we present a virtual laboratory platform (VLP) baptized Mercury allowing students to make practical work (PW) on different aspects of mobile wireless sensor networks (WSNs). Our choice of WSNs is motivated mainly by the use of real experiments needed in most courses about WSNs. These experiments require an expensive investment and a lot of nodes in the classroom. To illustrate our study, we propose a course related to energy efficient and safe weighted clustering algorithm. This algorithm which is coupled with suitable routing protocols, aims to maintain stable clustering structure, to prevent most routing attacks on sensor networks, to guaranty energy saving in order to extend the lifespan of the network. It also offers a better performance in terms of the number of re-affiliations. The platform presented here aims at showing the feasibility, the flexibility and the reduced cost of such a realization. We demonstrate the performance of the proposed algorithms that contribute to the familiarization of the learners in the field of WSNs.

A Survey on Mobility Support Mechanisms in the Internet (인터넷에서의 이동성 연구 동향)

  • Lee, Kye-Sang
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.882-885
    • /
    • 2008
  • Recently, various types of wireless networks have been proliferated. Bluetooth, IEEE 802.11 WLAN, 802.16e Mobile WiMAX (or Wibro) and 3G celluar networks are some examples. Accordingly, research on seamless mobility support mechanisms among homogeneous or heterogeneous networks has drawn significant interests. This paper examines recent research efforts on seamless mobility support mechanisms from link to transport layer. Yet, no single solution meets all the requirements for supporting the seamless mobility and it seems hard to tell which layer is the most appropriate one for supporting mobility. This area is still wide open and needs further research.

  • PDF

R3: A Lightweight Reactive Ring based Routing Protocol for Wireless Sensor Networks with Mobile Sinks

  • Yu, Sheng;Zhang, Baoxian;Yao, Zheng;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5442-5463
    • /
    • 2016
  • Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

Impacts of Hierarchy in Ethernet Ring Networks on Service Resiliency

  • Lee, Kwang-Koog;Ryoo, Jeong-Dong;Kim, Young-Lok
    • ETRI Journal
    • /
    • v.34 no.2
    • /
    • pp.199-209
    • /
    • 2012
  • In transport networks, a multi-ring architecture is very useful to facilitate network planning and to design and provide more resilient services for customers. Unlike traditional synchronous optical network multi-rings, the service resiliency of Ethernet-based multi-rings is significantly impacted by the ring hierarchy because a link or node failure in a certain level ring triggers filtering database flush actions in all higher level rings as well as in the ring with the failure, and consequently a large amount of duplicated data frames may be flooded. In this paper, we investigate how the ring hierarchy impacts the service resiliency of multi-ring networks. Based on extensive experiments on various single- and multiple-link failures, we suggest two effective inter-ring connection rules to minimize the transient traffic and to ensure more resilient multi-ring networks. In addition, we consider a flush optimization technique called e-ADV, and show that the combination of e-ADV and multi-ring structures satisfying our inter-ring connection rules results in a more attractive survivability performance.

Packet-Level Scheduling for Implant Communications Using Forward Error Correction in an Erasure Correction Mode for Reliable U-Healthcare Service

  • Lee, Ki-Dong;Kim, Sang-G.;Yi, Byung-K.
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.160-166
    • /
    • 2011
  • In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

A Survey of Code Dissemination Mechanisms on Sensor Networks (센서 네트워크에서 코드분배 메커니즘에 대한 조사 연구)

  • Kim, Mi-Hui;Kim, Ji-Sun;Kim, Jee-Hyun;Lim, Ji-Young;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.423-438
    • /
    • 2009
  • The sensor network is highlighted because it is one of the essentialbase networks in the ubiquitous computing realization. Researches for providing security and efficiency are being perfomed in the various isuues because of the characteristics of sensor nodes and sensor networks. Recently, code dissemination mechanism is recognized as an important research issue since sensor nodes are in the need of updating new software or the need of modifying bugs in dynamically. Generally lots of nodes are in the sensor networks and they are ramdomly deployed in hostile environments. Thus it is especially important that the code dissemination from the base station to nodes should be processed efficienctly and securely. In this paper, we check up the recent existing code dissemination mechanisms, and comparatively analyze the requirements of the code dissemination and the characteristicsof existing mechanisms. Through the analysis, we present future research issues for the code dissemination area. This research can expedite the research on the code dissemination and improve the usability of sensor networks with efficiency and security.

A Distributed Trust Model Based on Reputation Management of Peers for P2P VoD Services

  • Huang, Guimin;Hu, Min;Zhou, Ya;Liu, Pingshan;Zhang, Yanchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2285-2301
    • /
    • 2012
  • Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

Fronthaul Technology Trends for 5G Mobile Communications (5G 이동통신을 위한 프론트홀 기술 동향)

  • Oh, D.S.;Lyu, D.S.;Lee, H.
    • Electronics and Telecommunications Trends
    • /
    • v.32 no.5
    • /
    • pp.97-106
    • /
    • 2017
  • The introduction of new access technologies in 5G radio networks has had a considerable impact on the design of transport networks. Research activities are underway on new transport technologies in both the wireless and optical domains to support 5G transport. This paper provides an overview of the concept and requirements of a fronthaul. We also discuss the research activities of a new fronthaul interface for future 5G networks, a 5G integrated fronthaul/backhaul transport network (5G-Crosshaul), a next-generation fronthaul interface (NGFI), a mobile xhaul network (MXN), and a next-generation mobile fronthaul architecture with multi-IF carrier transmission scheme.