• Title/Summary/Keyword: information dissemination speed

Search Result 21, Processing Time 0.021 seconds

Travel and Social Changes in Modern Jiangnan

  • Zhou, Ye
    • Journal of East-Asian Urban History
    • /
    • v.2 no.2
    • /
    • pp.309-339
    • /
    • 2020
  • Obviously the speed of dissemination of new, modern ideas in Jiangnan was closely related to the development of transportation. Looking back at the history, the backwardness of transportation in the early modern Jiangnan restrict the dissemination of new ideas in this region and then the situation changed a lot since the 1890s, when the spatial distance between Shanghai and Jiangnan was remarkably shortened, the dissemination of new ideas was accelerated, and the new ideas in return significantly influenced the Jiangnan society. It was the constantly improved transportation that facilitated the diversification of channels disseminating information and made the dissemination itself faster. As a consequence, the new ideas, knowledge, and things were rapidly disseminated and popularized in Jiangnan, thereby giving impetus to the social changes in this region.

BL-CAST:Beacon-Less Broadcast Protocol for Vehicular Ad Hoc Networks

  • Khan, Ajmal;Cho, You-Ze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1223-1236
    • /
    • 2014
  • With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.

Restricted Multi-hop Information Lookahead Scheme for Real-Time Data Dissemination in Wireless Sensor Networks (무선 센서 망에서 실시간 데이터 전송을 위한 제한적 멀티-홉 정보 예측 기법)

  • Jung, Ju-Hyun;Oh, Seung-Min;Lee, Jeong-Cheol;Park, Ho-Sung;Yim, Yong-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7A
    • /
    • pp.706-714
    • /
    • 2010
  • In wireless sensor networks, real-time data delivery schemes typically achieve a desired delivery speed by performing one-hop lookahead. Recently, to reduce the deadline miss ratio against the desired delivery speed, a study has proposed a real-time routing protocol based on proactively performing two-hop lookahead. However, the study might cause heavy message exchange overhead and high computing complexity to carry out obtainment of two-hop neighborhood speed information in the entire sensor nodes whether data are delivered or not. Moreover, although multi-hop lookahead provides the least deadline miss ratio, due to the restriction from the overhead and the complexity, the recent study merely adopts the two-hop lookahead manner. In this paper, we propose a novel real-time routing protocol that adopts on-demand neighborhood multi-hop information obtainments only around data forwarding paths. Simulation results prove that the proposed routing protocol offers better performances with respect to deadline miss ratio, total communication costs, energy efficiency, and network lifetime.

정보전달 매체로서의 과학저어널의 문제점과 그 개선책

  • 이영자
    • Journal of Korean Library and Information Science Society
    • /
    • v.6
    • /
    • pp.159-185
    • /
    • 1979
  • The dissemination of scientific information in Society involves interactions among a number of publics and many kinds of information channels. There is a need for examining the the entire process of information dissemination for the solving many problems which scientific many problems which scientific communication is now confronted with, This paper is an attempt to identify the functions of a scientific journal as one of major inf. transfer media, to clarify the problems in performing the functions, and to synthesize various on-going efforts toward the improvement and solution of such problems. Some conclusions derived from this study are as follows; (1) a scientific journal was, is and will be the valuable primary source for the recording and controlling scientific in formation which plays a role as a main energy source in the scientific activities. (2) Traditional built-in delays involved in the communication by a scientific journal should be improved by way of some new methods and techniques such as, of establishing a publishing center, controlling vocabularies in the scientific papers, distributing pre-publication materials, etc. (3) There should be a organized special committe for scientific communication for the assuming the responsibilities of educating, planning and carrying out activities relating to scientific information. (4) To improve the function of a scientific journal as information transfer media, other informal primary media such as report, preprint, etc, and secondary media such as abstracts and indexes should be studied which will result in the clarification of unigue functions, and advantages and disadvantages of each media. as an information dissemination media. (5) Each government should pay attention to the national information system as a changing social system and should recognize the gap in speed between technological development and the change of a social system Technological development should be made a contribution to the improvement of social system.

  • PDF

An Analysis for the Efficient Dissemination of Beacon Messages in Vehicle-to-Vehicle (V2V) Communications (자동차 간 통신에서 비컨 메시지의 효율적인 방송을 위한 성능 분석)

  • Nguyen, Hoa-Hung;Bhawiyuga, Adhitya;Jeong, Han-You
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6C
    • /
    • pp.483-491
    • /
    • 2012
  • In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

An Adaptable Destination-Based Dissemination Algorithm Using a Publish/Subscribe Model in Vehicular Networks

  • Morales, Mildred Madai Caballeros;Haw, Rim;Cho, Eung-Jun;Hong, Choong-Seon;Lee, Sung-Won
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.3
    • /
    • pp.227-242
    • /
    • 2012
  • Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

A High Speed Code Dissemination Protocol for Software Update in Wireless Sensor Network (무선 센서 네트워크상의 소프트웨어 업데이트를 위한 고속 코드 전파 프로토콜)

  • Cha, Jeong-Woo;Kim, Il-Hyu;Kim, Chang-Hoon;Kwon, Young-Jik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.5
    • /
    • pp.168-177
    • /
    • 2008
  • The code propagation is one of the most important technic for software update in wireless sensor networks. This paper presents a new scheme for code propagation using network coding. The proposed code propagation method roughly shows 20$\sim$25% performance improvement according to network environments in terms of the number of data exchange compared with the previously proposed pipelining scheme. As a result, we can efficiently perform the software update from the viewpoint of speed, energy, and network congestion when the proposed code propagation system is applied. In addition, the proposed system solves the overhearing problems of network coding such as the loss of original messages and decoding error using the predefined message. Therefore, our system allows a software update system to exchange reliable data in wireless sensor networks.

  • PDF

Measuring a Range of Information Dissemination in a Traffic Information System Based on a Vehicular ad hoc Network (Vehicular ad hoc network 기반 교통 정보 시스템에서 차량간 통신에 의한 정보 전달 범위 측정)

  • Kim, Hyoung-Soo;Shin, Min-Ho;Nam, Beom-Seok;Lovell, David J.
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.12-20
    • /
    • 2008
  • Recent wireless communication technologies are envisioned as an innovative alternative to solve transportation problems. On ad hoc networks, as a wireless communication technology, nodes can communicate data without any infrastructure. In particular, vehicular ad hoc networks (VANETs), a specific ad hoc network applied to vehicles, enable vehicles equipped with a communication device to form decentralized traffic information systems in which vehicles share traffic information they experienced. This study investigated traffic information dissemination in a VANET-based traffic information system. For this study, an integrated transportation and communications simulation framework was developed, and experiments were conducted with real highway networks and traffic demands. The results showed that it took 3 minutes in the low traffic density situations (10 vehicle/lane.km) and 43 seconds in the high traffic density condition (40 vehicle/lane.km) to deliver traffic information of 5km away with 10% market penetration rate. In uncongested traffic conditions, information seems to be disseminated via equipped vehicles in the opposite direction. In congested traffic conditions, the sufficient availability of equipped vehicles traveling in the same direction reduces the chance to use vehicles in the opposing direction even though it is still possible.

  • PDF

A Hole Self-Organization Real-Time Routing Protocol for Irregular Wireless Sensor Networks (비정형적인 무선 센서 네트워크에서 음영지역 자가 구성 실시간 라우팅 프로토콜)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Yim, Yongbin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.5
    • /
    • pp.281-290
    • /
    • 2014
  • The real-time data dissemination schemes exploit the spatiotemporal commuication approach which forwards data at the delivery speed calculated with the desired time deadline and the end-to-end distance in wireless sensor networks (WSNs). In practical environments, however, the performance of the real-time data dissemination might be degraded by additional and inevitable delay due to some holes. Namely, the holes lengthen the data delivery path and the spatiotemporal approach could not estimate a distance of the data delivery path. To deal with this, we propose A Hole Self-Organization Real-time Routing Protocol for Irregular Wireless Sensor Networks. In proposed protocol, nodes around holes could detect them at deploying phase. A hole is represented as a circle with center point and radius. This hole information is processed and provided as a form of location service. When a source queries a destination location, location provider replies certain points for avoiding holes as well as destination location. Thus, the source could set desired speed toward the destination via the points. Performance evaluation shows that provides better real-time service in practical environments.

Lane-wise Travel Speed Characteristics Analysis in Uninterrupted Flow Considering Lane-wise Speed Reversal (차로속도역전현상을 고려한 연속류 도로의 차로별 주행 속도 특성 분석)

  • Yang, Inchul;Jeon, Woo Hoon;Ki, Sung hwan;Yoon, Jungeun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.6
    • /
    • pp.116-126
    • /
    • 2016
  • In this study, lane-wise traffic flow characteristics were analysed on uninterrupted flow using a new notion of "lane-wise travel speed reversal (LTSR)" which is defined as a phenomena that travel speed in the median lane is lower than other lanes. Mathematical formulation was also proposed to calculate the strength of LTSR. The experiment road site is Seoul Outer Ring Expressway (Jayuro-IC~Jangsoo-IC), and travel trajectories for each four lane were collected for weekdays (Mon. through Fri.) during morning peak. Comparing lane-wise travel speeds for entire test road section, no LTSR was observed, meaning that the travel speed in the median lane is the fastest, followed by 2nd, 3rd, and 4th lane as in order. Howerver, the result of microscopic analysis using 100-meter discrete road section based data shows that LTSR occurs many times. Especially the strength of LTSR is higher in congestion area and freeway merge and diverge segment. It is expected that these results could be used as a fundamental data when establishing lane-by-lane traffic operation strategy and developing lane-wise traffic information collection and dissemination technology.