• Title/Summary/Keyword: wireless large-scale network

Search Result 117, Processing Time 0.026 seconds

Broadcast Data Delivery in IoT Networks with Packet Loss and Energy Constraint (IoT 네트워크에서 패킷 손실과 에너지 소모를 고려한 브로드캐스트 데이터 전달 방법)

  • Jeon, Seung Yong;Ahn, Ji Hyoung;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.269-276
    • /
    • 2016
  • Internet of Things (IoT) is based on wireless networks being able to connect things and people on a large scale. In the IoT environment, reliable broadcast plays an important role to distribute data to a large number of devices. Energy harvesting from a surrounding environment is a key technique to achieve a sustainable IoT network. In IoT networks, a problem of transmission errors and energy shortage should be mitigated for reliable broadcast. In this paper, we propose an energy-efficient and reliable broadcast method to consider packet errors and energy consumption in the environment where a large number of nodes are connected. The proposed scheme can improve data restoration probability by up to 15% and reduce energy consumption by up to 17%.

Developing the Mobile GIS System Using CDMA Networking - Case Study of Forest Fire Ground Fighting Team - (CDMA 데이터망을 이용한 Mobile GIS 시스템 개발 - 산불발생시 지상진화대원 업무를 사례로 -)

  • Jo, Myung-Hee;Lee, Myung-Bo;Jo, Yun-Won;Kim, Dong-Hyun;Shin, Dong-Ho
    • Fire Science and Engineering
    • /
    • v.21 no.1 s.65
    • /
    • pp.60-68
    • /
    • 2007
  • In order to guide the safe extinguishment duty of forest fire ground fighting team and acquire its exact location information in case of a large scale of forest fire, it is very important to monitor the real time coordination data the forest fire ground fighting team. In this study the guidance for safe extinguishment duty of forest fire ground fighting team could be provided by monitoring the current location information and moving route information, which are received form GPS through CDMA (Code Division Multiple Access).

Hierarchical Location Caching Scheme for Mobile Object Tracking in the Internet of Things

  • Han, Youn-Hee;Lim, Hyun-Kyo;Gil, Joon-Min
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1410-1429
    • /
    • 2017
  • Mobility arises naturally in the Internet of Things networks, since the location of mobile objects, e.g., mobile agents, mobile software, mobile things, or users with wireless hardware, changes as they move. Tracking their current location is essential to mobile computing. To overcome the scalability problem, hierarchical architectures of location databases have been proposed. When location updates and lookups for mobile objects are localized, these architectures become effective. However, the network signaling costs and the execution number of database operations increase particularly when the scale of the architectures and the numbers of databases becomes large to accommodate a great number of objects. This disadvantage can be alleviated by a location caching scheme which exploits the spatial and temporal locality in location lookup. In this paper, we propose a hierarchical location caching scheme, which acclimates the existing location caching scheme to a hierarchical architecture of location databases. The performance analysis indicates that the adjustment of such thresholds has an impact on cost reduction in the proposed scheme.

Compressed Sensing Based Low Power Data Transmission Systems in Mobile Sensor Networks (모바일 센서 네트워크에서 압축 센싱을 이용한 저전력 데이터 전송 시스템)

  • Hong, Jiyeon;Kwon, Jungmin;Kwon, Minhae;Park, Hyunggon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1589-1597
    • /
    • 2016
  • In this paper, we propose a system in a large-scale environment, such as desert and ocean, that can reduce the overall transmission power consumption in mobile sensor network. It is known that the transmission power consumption in wireless sensor network is proportional to the square of transmission distance. Therefore, if the locations of mobile sensors are far from the sink node, the power consumption required for data transmission increases, leading to shortened operating time of the sensors. Hence, in this paper, we propose a system that can reduce the power consumption by allowing to transmit data only if the transmission range of the sensors is within a predetermined distance. Moreover, the energy efficiency of the overall sensor network can even be improved by reducing the number of data transmissions at the sink node to gateway based on compressed sensing. The proposed system is actually implemented using Arduino and Raspberry Pi and it is confirmed that source data can be approximately decoded even when the gateway received encoded data fewer than the required number of data from the sink node. The performance of the proposed system is analyzed in theory.

A Time Slot Assignment Scheme for Sensor Data Compression (센서 데이터의 압축을 위한 시간 슬롯 할당 기법)

  • Yeo, Myung-Ho;Kim, Hak-Sin;Park, Hyoung-Soon;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.846-850
    • /
    • 2009
  • Recently, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics such as environmental monitoring, smart spaces, medical applications, and precision agriculture. The sensor nodes are battery powered. Therefore, the energy is the most precious resource of a wireless sensor network since periodically replacing the battery of the nodes in large scale deployments is infeasible. Energy efficient mechanisms for gathering sensor readings are indispensable to prolong the lifetime of a sensor network as long as possible. There are two energy-efficient approaches to prolong the network lifetime in sensor networks. One is the compression scheme to reduce the size of sensor readings. When the communication conflict is occurred between two sensor nodes, the sender must try to retransmit its reading. The other is the MAC protocol to prevent the communication conflict. In this paper, we propose a novel approaches to reduce the size of the sensor readings in the MAC layer. The proposed scheme compresses sensor readings by allocating the time slots of the TDMA schedule to them dynamically. We also present a mathematical model to predict latency from collecting the sensor readings as the compression ratio is changed. In the simulation result, our proposed scheme reduces the communication cost by about 52% over the existing scheme.

Location Error Compensation in indoor environment by using MST-based Topology Control (MST 토폴로지를 이용한 실내 환경에서의 위치측정에러의 보상기법)

  • Jeon, Jong-Hyeok;Kwon, Young-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1926-1933
    • /
    • 2013
  • Many localization algorithms have been proposed for Wireless Sensor Networks (WSNs). The IEEE 802.15.4a-based location-aware-system can provide precise ranging distance between two mobile nodes. The mobile nodes can obtain their exact locations by using accurate ranging distances. However, the indoor environments contain various obstacles which cause non-line-of-sight (NLOS) conditions. In NLOS condition, the IEEE 802.15.4a-based location-aware system has a large scale location error. To solve the problem, we propose location error compensation in indoor environment by using MST-based topology control. Experimental and simulation results show that the proposed algorithm improves location accuracy in NLOS conditions.

Blind Detouring Problem in Geographic Routing for Wireless Ad-hoc Networks (무선 애드-혹 망을 위한 위치기반 라우팅에서의 맹목적 우회경로 결정문제)

  • Na, Jong-Keun;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.6
    • /
    • pp.428-437
    • /
    • 2006
  • Wireless ad-hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad-hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called Geographic Landmark Routing(GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.

Performance Evaluation of LTE-VPN based Disaster Investigation System for Sharing Disaster Field Information (재난사고 정보공유를 위한 LTE-VPN기반 현장조사시스템 성능평가)

  • Kim, Seong Sam;Shin, Dong Yoon;Nho, Hyun Ju
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.11
    • /
    • pp.602-609
    • /
    • 2020
  • In the event of a large-scale disaster such as an earthquake, typhoon, landslide, and building collapse, the disaster situation awareness and timely disaster information sharing play a key role in the disaster response and decision-making stages for disaster management, such as disaster site control and evacuation of residents. In this paper, an exited field investigation system of NDMI (National Disaster Management Research Institute) was enhanced with an LTE-VPN- based wireless communication system to provide an effective on-site response in an urgent disaster situation and share observation data or analysis information acquired at the disaster fields in real-time. The required performance of wireless communication for the disaster field investigation system was then analyzed and evaluated. The experimental result for field data transmission performance of an advanced wireless communication investigation system showed that the UDP transmission performance of at least 4.1Mbps is required to ensure a seamless video conference system between disaster sites. In addition, a wireless communication bandwidth of approximately 10 Mbps should be guaranteed to smoothly share the communication and field data between the survey equipment currently mounted on the survey vehicle.

A Mass-Processing Simulation Framework for Resource Management in Dense 5G-IoT Scenarios

  • Wang, Lusheng;Chang, Kun;Wang, Xiumin;Wei, Zhen;Hu, Qingxin;Kai, Caihong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4122-4143
    • /
    • 2018
  • Because of the increment in network scale and test expenditure, simulators gradually become main tools for research on key problems of wireless networking, such as radio resource management (RRM) techniques. However, existing simulators are generally event-driven, causing unacceptably large simulation time owing to the tremendous number of events handled during a simulation. In this article, a mass-processing framework for RRM simulations is proposed for the scenarios with a massive amount of terminals of Internet of Things accessing 5G communication systems, which divides the time axis into RRM periods and each period into a number of mini-slots. Transmissions within the coverage of each access point are arranged into mini-slots based on the simulated RRM schemes, and mini-slots are almost fully occupied in dense scenarios. Because the sizes of matrices during this process are only decided by the fixed number of mini-slots in a period, the time expended for performance calculation is not affected by the number of terminals or packets. Therefore, by avoiding the event-driven process, the proposal can simulate dense scenarios in a quite limited time. By comparing with a classical event-driven simulator, NS2, we show the significant merits of our proposal on low time and memory costs.

Resource Weighted Load Distribution Policy for Effective Transcoding Load Distribution (효과적인 트랜스코딩 부하 분산을 위한 자원 가중치 부하분산 정책)

  • Seo, Dong-Mahn;Lee, Joa-Hyoung;Choi, Myun-Uk;Kim, Yoon;Jung, In-Bum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.401-415
    • /
    • 2005
  • Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the resource weighted load distribution policy is proposed for a fair load balance and a more scalable performance in cluster-based transcoding servers. Our proposed policy is based on the resource weighted table and number of maximum supported users, which are pre-computed for each pre-defined grade. We implement the proposed policy on cluster-based transcoding servers and evaluate its fair load distribution and scalable performance with the number of transcoding servers.