• 제목/요약/키워드: Dissemination Network

검색결과 190건 처리시간 0.031초

무선 센서 네트워크에서 확률 기반의 클러스터링을 이용한 계층적 데이터 전송 프로토콜 (A Probability-based Clustering Protocol for Data Dissemination in Wireless Sensor Networks)

  • 김문성;조상훈;임형진;추현승
    • 인터넷정보학회논문지
    • /
    • 제10권2호
    • /
    • pp.153-160
    • /
    • 2009
  • 무선 센서 네트워크를 위한 데이터 전송의 설계 중에서 가장 중요한 이슈 중 하나는 에너지 효율적인 측면이다. 이를 위해 최근 여러 연구들이 진행되고 있으며 그중에서 가장 대표적인 프로토콜은 SPMS이다. SPMS의 주요 특징 중 하나는 에너지 소비를 줄이기 위한 수단으로 최단경로를 사용한다는 것이다. 그러나 반복적인 최단 경로의 사용으로 인하여 네트워크 라이프타임의 최대화는 불가능하다. 본 논문에서는 에너지 잔존량과 거리를 메트릭으로 사용하는 확률 함수 기반의 데이터 전송 프로토콜을 제안한다. 시뮬레이션 결과, 제안 프로토콜은 에너지 효율적인 데이터 전송을 하며 SPMS보다 네트워크 라이프타임이 약 78%증가하였다.

  • PDF

고구려, 백제, 신라 왕조실록 인명 네트워크 분석 (Analysis of People Networks in Goguryeo, Baekje, and Silla Dynasty Silloks)

  • 정진수;김학용
    • 한국콘텐츠학회논문지
    • /
    • 제11권5호
    • /
    • pp.474-480
    • /
    • 2011
  • 고구려, 백제, 신라 왕조실록에 등장하는 인물 네트워크는 다른 사회 네트워크와는 달리 척도 없는 네트워크 (scale-free network)의 특성이 아닌 정보의 보급, 인터넷 연쇄 편지, 청원 편지 등에서 보여주는 유포 네트워크 (dissemination network) 의 특성을 보여주고 있다. 그러나 이들 세 왕조를 통합한 삼국왕조실록은 사회 네트워크와 마찬가지로 척도 없는 네트워크의 전형적인 특성을 보여주고 있었다. 일반적으로 생명체 네트워크는 척도 없는 네트워크와 계층적 네트워크 (hierarchical network)의 특성을 동시에 가지는데, 삼국왕조실록도 척도 없는 네트워크뿐만 아니라 계층적 네트워크의 특성을 동시에 보여주고 있었다. 네트워크를 기반으로 각 국가의 영토 변화 양상을 분석하였는데, 고구려나 백제와는 달리 신라만의 독특한 양상을 가지는데, 이 양상이 삼국 통일을 이루는 근간을 만든 것으로 분석하였다. 고구려, 백제, 신라의 전반적인 나라 경영, 발전 양상 및 이들 나라의 중심이 되는 왕의 인물 네트워크를 바탕으로 통치 양상을 분석하였다. 본 연구는 삼국 왕조실록에 등장하는 인물을 역사학적 관점이 아닌 실록에 등장하는 인물 네트워크를 기반으로 분석함으로서 새로운 각도에서 해석할 수 있는 가능성을 제시하였다.

Edge-Node Deployed Routing Strategies for Load Balancing in Optical Burst Switched Networks

  • Barradas, Alvaro L.;Medeiros, Maria Do Carmo R.
    • ETRI Journal
    • /
    • 제31권1호
    • /
    • pp.31-41
    • /
    • 2009
  • Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

  • PDF

Responsibility for Dissemination of Inaccurate Information on the Internet

  • Romanova, Vera;Nikitin, Yurii;Vozniuk, Natalia;Sverdlyk, Zoriana;Boichuk, Nelia;Kunderevych, Olena
    • International Journal of Computer Science & Network Security
    • /
    • 제21권8호
    • /
    • pp.137-140
    • /
    • 2021
  • The article is devoted to the study of the issue of liability for the dissemination of inaccurate information on the Internet. The article emphasizes that now the public opinion of socially active segments of the population is mainly formed on the basis of not critical but subjective ("consumer") analysis of the received information. The modern realities show that the main source of its origin is the Internet: electronic media and, above all, the relevant social networks. The problem of dissemination by the mass media of inaccurate information obtained via the Internet is solved; it is seen in bringing the laws of Ukraine, which regulate public relations regarding the dissemination of information, into compliance with the Civil Code of Ukraine. The issues of development and implementation of new legislative acts aimed at regulating the status of subjects of informational relations on the Internet and establishing the grounds for their liability are also investigated.

IoT에서 중요한 데이터를 위한 쿼럼 기반 적응적 전파 알고리즘의 설계 및 평가 (Design and Evaluation of a Quorum-Based Adaptive Dissemination Algorithm for Critical Data in IoTs)

  • 배인한;노흥태
    • 한국멀티미디어학회논문지
    • /
    • 제22권8호
    • /
    • pp.913-922
    • /
    • 2019
  • The Internet of Things (IoT) envisions smart objects collecting and sharing data at a massive scale via the Internet. One challenging issue is how to disseminate data to relevant data consuming objects efficiently. In such a massive IoT network, Mission critical data dissemination imposes constraints on the message transfer delay between objects. Due to the low power and communication range of IoT objects, data is relayed over multi-hops before arriving at the destination. In this paper, we propose a quorum-based adaptive dissemination algorithm (QADA) for the critical data in the monitoring-based applications of massive IoTs. To design QADA, we first design a new stepped-triangular grid structures (sT-grid) that support data dissemination, then construct a triangular grid overlay in the fog layer on the lower IoT layer and propose the data dissemination algorithm of the publish/subscribe model that adaptively uses triangle grid (T-grid) and sT-grid quorums depending on the mission critical in the overlay constructed to disseminate the critical data, and evaluate its performance as an analytical model.

센서 네트워크에서 다수의 이동 싱크로의 에너지 효율적인 데이터 전파에 관한 연구 (Proactive Data Dissemination Protocol on Distributed Dynamic Sink Mobility Management in Sensor Networks)

  • 황광일;엄두섭;허경
    • 한국통신학회논문지
    • /
    • 제31권9B호
    • /
    • pp.792-802
    • /
    • 2006
  • In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

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

  • Khan, Ajmal;Cho, You-Ze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권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.

무선 센서 네트워크 상에서 network coding을 이용한 효율적인 코드 전파 기법 (An Efficient Dissemination Protocol Using Network Coding in Wireless Sensor Network)

  • 차정우;김일휴;김창훈;권영직
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2008년도 추계 공동 국제학술대회
    • /
    • pp.623-628
    • /
    • 2008
  • 소프트웨어 업 데이트를 위한 업데이트 코드 전파 기법은 매우 중요한 기술 중 하나이다. 본 논문에서는 네트워크 코딩 기법을 이용한 새로운 업데이트 코드 전파 기법을 제안한다. 제안된 코드전파 기법은 기존의 파이프라이닝 방식에 비해 데이터 송수신 횟수에 있어 약 49%의 성능 향상을 보인다. 따라서 본 논문에서 제안한 코드 업데이트 기법을 사용할 경우 속도, 에너지, 네트워크 혼잡도 측면에서 효율적인 소프트웨어 업데이트를 수행할 수 있다. 뿐만 아니라 본 논문에서 제안한 방식은 네트워크 코딩의 overhearing 문제점인 원본 데이터의 분실이나 데이터의 미 수신시 발생하는 디코딩문제를 미리 정의된 메시지를 이용, 방지함으로써 신뢰성있는 데이터 전송을 가능하게 한다.

  • PDF

차량간 Ad hoc 네트워크에서 트래픽 잼 정보의 전달 방법 (Dissemination of Traffic-Jam Information in inter-vehicle ad-hoc networks)

  • 장형준;박귀태
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
    • /
    • pp.293-295
    • /
    • 2009
  • In an Intelligent Transport System(ITS), data dissemination based on inter-vehicle communication is effective for acquiring real-time traffic-jam information. In this paper, we propose a novel method for traffic jam information dissemination in vehicular ad-hoc networks. In our proposed method, vehicles already trapped in a Traffic-Jam elect leaders according to their locations from upstream and downstream respectively. Then each leader generates traffic data which contains their position, velocity and leader counter respectively, and disseminate the information. {{br}}The implementation of our proposed method is evaluated by means of simulation, and we also present simulation result

  • PDF

Mobility-Based Clustering Algorithm for Multimedia Broadcasting over IEEE 802.11p-LTE-enabled VANET

  • Syfullah, Mohammad;Lim, Joanne Mun-Yee;Siaw, Fei Lu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1213-1237
    • /
    • 2019
  • Vehicular Ad-hoc Network (VANET) facilities envision future Intelligent Transporting Systems (ITSs) by providing inter-vehicle communication for metrics such as road surveillance, traffic information, and road condition. In recent years, vehicle manufacturers, researchers and academicians have devoted significant attention to vehicular communication technology because of its highly dynamic connectivity and self-organized, decentralized networking characteristics. However, due to VANET's high mobility, dynamic network topology and low communication coverage, dissemination of large data packets (e.g. multimedia content) is challenging. Clustering enhances network performance by maintaining communication link stability, sharing network resources and efficiently using bandwidth among nodes. This paper proposes a mobility-based, multi-hop clustering algorithm, (MBCA) for multimedia content broadcasting over an IEEE 802.11p-LTE-enabled hybrid VANET architecture. The OMNeT++ network simulator and a SUMO traffic generator are used to simulate a network scenario. The simulation results indicate that the proposed clustering algorithm over a hybrid VANET architecture improves the overall network stability and performance, resulting in an overall 20% increased cluster head duration, 20% increased cluster member duration, lower cluster overhead, 15% improved data packet delivery ratio and lower network delay from the referenced schemes [46], [47] and [50] during multimedia content dissemination over VANET.