• Title/Summary/Keyword: Dissemination Network

Search Result 190, Processing Time 0.05 seconds

Sink Location Dissemination Scheme in Geographic Routing for Wireless Sensor Networks (무선 센서 망을 위한 위치 기반 라우팅에서 싱크 위치 전달 방안)

  • Lee, Eul-Sin;Park, Soo-Chang;Lee, Jeong-Cheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.847-856
    • /
    • 2009
  • In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

Unspecified Event Detection System Based on Contextual Location Name on Twitter (트위터에서 문맥상 지역명을 기반으로 한 불특정 이벤트 탐지 시스템)

  • Oh, Pyeonghwa;Yim, Junyeob;Yoon, Jinyoung;Hwang, Byung-Yeon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.9
    • /
    • pp.341-348
    • /
    • 2014
  • The advance in web accessibility with dissemination of smart phones gives rise to rapid increment of users on social network platforms. Many research projects are in progress to detect events using Twitter because it has a powerful influence on the dissemination of information with its open networks, and it is the representative service which generates more than 500 million Tweets a day in average; however, existing studies to detect events has been used TFIDF algorithm without any consideration of the various conditions of tweets. In addition, some of them detected predefined events. In this paper, we propose the RTFIDF VT algorithm which is a modified algorithm of TFIDF by reflecting features of Twitter. We also verified the optimal section of TF and DF for detecting events through the experiment. Finally, we suggest a system that extracts result-sets of places and related keywords at the given specific time using the RTFIDF VT algorithm and validated section of TF and DF.

Cooperation-Aware VANET Clouds: Providing Secure Cloud Services to Vehicular Ad Hoc Networks

  • Hussain, Rasheed;Oh, Heekuck
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.103-118
    • /
    • 2014
  • Over the last couple of years, traditional VANET (Vehicular Ad Hoc NETwork) evolved into VANET-based clouds. From the VANET standpoint, applications became richer by virtue of the boom in automotive telematics and infotainment technologies. Nevertheless, the research community and industries are concerned about the under-utilization of rich computation, communication, and storage resources in middle and high-end vehicles. This phenomenon became the driving force for the birth of VANET-based clouds. In this paper, we envision a novel application layer of VANET-based clouds based on the cooperation of the moving cars on the road, called CaaS (Cooperation as a Service). CaaS is divided into TIaaS (Traffic Information as a Service), WaaS (Warning as a Service), and IfaaS (Infotainment as a Service). Note, however, that this work focuses only on TIaaS and WaaS. TIaaS provides vehicular nodes, more precisely subscribers, with the fine-grained traffic information constructed by CDM (Cloud Decision Module) as a result of the cooperation of the vehicles on the roads in the form of mobility vectors. On the other hand, WaaS provides subscribers with potential warning messages in case of hazard situations on the road. Communication between the cloud infrastructure and the vehicles is done through GTs (Gateway Terminals), whereas GTs are physically realized through RSUs (Road-Side Units) and vehicles with 4G Internet access. These GTs forward the coarse-grained cooperation from vehicles to cloud and fine-grained traffic information and warnings from cloud to vehicles (subscribers) in a secure, privacy-aware fashion. In our proposed scheme, privacy is conditionally preserved wherein the location and the identity of the cooperators are preserved by leveraging the modified location-based encryption and, in case of any dispute, the node is subject to revocation. To the best of our knowledge, our proposed scheme is the first effort to offshore the extended traffic view construction function and warning messages dissemination function to the cloud.

Distance Based Dynamic Probabilistic Broadcasting in Ad Hoc Wireless Networks

  • Kim Jae-Soo;Kim Jeong-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.12
    • /
    • pp.1613-1622
    • /
    • 2005
  • Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

  • PDF

A Reliable Data Transfer Mechanism Using Directed Diffusion in Wireless Sensor Networks (무선 센서 네트워크에서 Directed Diffusion을 이용한 신뢰성 있는 데이터 전달 기법)

  • Choi Jae-Won;Lee Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.77-83
    • /
    • 2006
  • In this paper, we have pesented a reliable data transfer mechanism using Directed Diffusion in WSNs (fireless Sensor Networks). This mechanism involves selecting a route with higher reachability and transferring data along the route chosen, which is based on the end-to-end reliability calculated by the dissemination procedure of Interest packets, while each node of a sensor network maintains the only information on its neighborhood. We performed various experiments changing the link error rates and the number of nodes and discovered that this proposed mechanism improves event-to-sink data transfer reliability in WSNs. We also found that this mechanism spreads traffic load over and reduces energy consumption, which in turn prolongs network lifetime.

A Sensing Data Collection Strategy in Software-Defined Mobile-Edge Vehicular Networks (SDMEVN) (소프트웨어 정의 모바일 에지 차량 네트워크(SDMEVN)의 센싱 데이터 수집 전략)

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.62-65
    • /
    • 2018
  • This paper comes out with the study on sensing data collection strategy in a Software-Defined Mobile Edge vehicular networking. The two cooperative data dissemination are Direct Vehicular cloud mode and edge cell trajectory prediction decision mode. In direct vehicular cloud, the vehicle observe its neighboring vehicles and sets up vehicular cloud for cooperative sensing data collection, the data collection output can be transmitted from vehicles participating in the cooperative sensing data collection computation to the vehicle on which the sensing data collection request originate through V2V communication. The vehicle on which computation originate will reassemble the computation out-put and send to the closest RSU. The SDMEVN (Software Defined Mobile Edge Vehicular Network) Controller determines how much effort the sensing data collection request requires and calculates the number of RSUs required to support coverage of one RSU to the other. We set up a simulation scenario based on realistic traffic and communication features and demonstrate the scalability of the proposed solution.

  • PDF

A Short Path Data Routing Protocol for Wireless Sensor Network (단거리 데이터 전달 무선 센서네트워크 라우팅 기법)

  • Ahn, Kwang-Seon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.395-402
    • /
    • 2007
  • Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.

On Hybrid Re-Broadcasting Techniques in Vehicular Ad Hoc Networks

  • Hussain, Rasheed;Abbas, Fizza;Son, Junggab;Oh, Heekuck
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.610-613
    • /
    • 2013
  • Vehicular Ad Hoc NETwork (VANET), a subclass of Mobile Ah Hoc NETwork (MANET) has been a tech-buzz for the last couple of decades. VANET, yet not deployed, promises the ease, comfort, and safety to both drivers and passengers once deployed. The by far most important factor in successful VANET application is the data dissemination scheme. Such data includes scheduled beacons that contain whereabouts information of vehicles. In this paper, we aim at regularly broadcasted beacons and devise an algorithm to disseminate the beacon information up to a maximum distance and alleviate the broadcast storm problem at the same time. According to the proposed scheme, a vehicle before re-broadcasting a beacon, takes into account the current vehicular density in its neighborhood. The re-broadcasters are chosen away from the source of the beacon and among the candidate re-broadcasters, if the density in the neighborhood is high, then the candidate rebroadcaster re-broadcasts the beacon with high probability and with low probability, otherwise. We also performed thorough simulations of our algorithms and the results are sound according to the expectations.

Using Online IT-Industry Courses in Computer Sciences Specialists' Training

  • Yurchenko, Artem;Drushlyak, Marina;Sapozhnykov, Stanislav;Teplytska, Alina;Koroliova, Larysa;Semenikhina, Olena
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.11
    • /
    • pp.97-104
    • /
    • 2021
  • The authors provide characteristics of the open educational platforms, classification and quantitative analysis regarding the availability of IT courses, teaching language, thematic directions on the following platforms: Coursera, EdX, Udemy, MIT Open Course Ware, OpenLearn, Intuit, Prometheus, UoPeople, Open Learning Initiative, Open University of Maidan (OUM). The quantitative analysis results are structured and visualized by tables and diagrams. The authors propose to use open educational resources (teaching, learning or research materials that are in the public domain or released with an intellectual property license that allows free use, adaptation, and distribution) for organization of independent work; for organization of distance or correspondence training; for professional development of teachers; for possibility and expediency of author's methods dissemination in the development of their own courses and promoting them on open platforms. Post-project activities are considered in comparing the courses content of one thematic direction, as well as studying the experience of their attending on different platforms.

The Possibilities of Cultural Diplomacy for Sustainable Development at Different Levels of Social Interactions

  • Pletsan, Khrystyna;Konovalova, Marta;Varenia, Nataliia;Khodanovych, Vitalii;Rozvadovskyi, Oleksandr
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.283-293
    • /
    • 2022
  • One of the important areas of state policy in the socio-economic and cultural development of the country is cultural diplomacy. It contributes to the information dissemination about the country, strengthens interstate relations, and forms a positive image. Through cultural diplomacy, we achieve a positive perception of the world community of the country, determined by its place in the modern system of international relations. The aim of the study is a comparative analysis of cultural diplomacy opportunities for sustainable development at different levels of public relations, as well as the impact of cultural diplomacy opportunities on the indicators of the Global Sustainable Competitiveness Index and the Global Sustainable Development Index. Regarding the results of the research on the impact of cultural diplomacy opportunities on the indicators of the Global Index of Sustainable Competitiveness and the Global Index of Sustainable Development, four groups are identified among the countries of the European Union: countries with a very high level of sustainable competitiveness and sustainable development; countries with a high level of sustainable competitiveness and sustainable development; countries with low levels of sustainable competitiveness and sustainable development.