• 제목/요약/키워드: wireless scheduling

검색결과 470건 처리시간 0.02초

Low Power Time Synchronization for Wireless Sensor Networks Using Density-Driven Scheduling

  • Lim, HoChul;Kim, HyungWon
    • Journal of information and communication convergence engineering
    • /
    • 제16권2호
    • /
    • pp.84-92
    • /
    • 2018
  • For large wireless sensor networks running on battery power, the time synchronization of all sensor nodes is becoming a crucial task for waking up sensor nodes with exact timing and controlling transmission and reception timing. However, as network size increases, this synchronization process tends to require long processing time consume significant power. Furthermore, a naïve synchronization scheduler may leave some nodes unsynchronized. This paper proposes a power-efficient scheduling algorithm for time synchronization utilizing the notion of density, which is defined by the number of neighboring nodes within wireless range. The proposed scheduling algorithm elects a sequence of minimal reference nodes that can complete the synchronization with the smallest possible number of hops and lowest possible power consumption. Additionally, it ensures coverage of all sensor nodes utilizing a two-pass synchronization scheduling process. We implemented the proposed synchronization algorithm in a network simulator. Extensive simulation results demonstrate that the proposed algorithm can reduce the power consumption required for the periodic synchronization process by up to 40% for large sensor networks compared to a simplistic multi-hop synchronization method.

무선 TDMA/TDD 시스템에서의 상.하향 링크 통합 페어큐잉 스케쥴링 (Uplink/downlink - combined Fair Queueing Scheduling for Wireless TDMA/TDD Systems)

  • 최효현;최명환
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.93-96
    • /
    • 2002
  • Fair Queueing has been studied only on wired network. When it is applied to wireless netowork, the collision phenomenon makes a problem.'rho information of queue of MT cannot be transferred to fair queueing algorithm In real time easily. We propose wireless fair queueing scheduler that protects short term farirness and long term fairness. We developed it in TDMA/TDD enviroment. Our scheme also supports uplink and downlink at the same time. And it can make subframe boundary based on fair scheduling algorithm.

  • PDF

Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks

  • Nie, Wei;Wang, Houjun;Park, Jong-Hyuk
    • Journal of Information Processing Systems
    • /
    • 제7권2호
    • /
    • pp.261-270
    • /
    • 2011
  • The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.

On the Performance Evaluation of Energy-Aware Sleep Scheduling (EASS) in Energy Harvesting WSN (EH-WSN)

  • Encarnacion, Nico N.;Yang, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제10권3호
    • /
    • pp.264-268
    • /
    • 2012
  • Tree-based structures offer assured optimal paths from the data source to the sink. Shortest routes are disregarded since these do not consider the remaining energy level of the nodes. This shortens the lifetime of the whole network. Most tree-based routing protocols, although aware of the nodes' energy, do not consider an energy aware sleep scheduling scheme. We propose an energy-aware sleep scheduling (EASS) scheme that will improve the sleep scheduling scheme of an existing tree-based routing protocol. An energy harvesting structure will be implemented on the wireless sensor network. The depth of sleep of every node will be based on the harvested energy.

Binary CDMA 기술을 이용한 무선 원격검침 시스템 구현 (Implementation of Wireless AMR System using Binary CDMA)

  • 권대길;조진웅;홍대기
    • 반도체디스플레이기술학회지
    • /
    • 제12권4호
    • /
    • pp.1-7
    • /
    • 2013
  • This paper presents the AMR (Automatic Meter Reading) system using the binary CDMA (Code Division Multiple Access) radio technology. The binary CDMA is the new radio technology in domestic research. Main implementation topics includes the binary CDMA remote meter reading system, the wireless piconet configuration for the wireless automatic meter reading, and the transmission scheduling for sending and receiving data. Also, the wireless packet data encryption is very important topics for the wireless automatic meter reading. The proposed AMR system is implemented as a pilot project in Jeju and Gangwon. It can be seen that the wireless remote reading using the binary CDMA wireless technology can be applied to the AMR system.

IEEE 802.15.4e TSCH-mode Scheduling in Wireless Communication Networks

  • Ines Hosni;Ourida Ben boubaker
    • International Journal of Computer Science & Network Security
    • /
    • 제23권4호
    • /
    • pp.156-165
    • /
    • 2023
  • IEEE 802.15.4e-TSCH is recognized as a wireless industrial sensor network standard used in IoT systems. To ensure both power savings and reliable communications, the TSCH standard uses techniques including channel hopping and bandwidth reserve. In TSCH mode, scheduling is crucial because it allows sensor nodes to select when data should be delivered or received. Because a wide range of applications may necessitate energy economy and transmission dependability, we present a distributed approach that uses a cluster tree topology to forecast scheduling requirements for the following slotframe, concentrating on the Poisson model. The proposed Optimized Minimal Scheduling Function (OMSF) is interested in the details of the scheduling time intervals, something that was not supported by the Minimal Scheduling Function (MSF) proposed by the 6TSCH group. Our contribution helps to deduce the number of cells needed in the following slotframe by reducing the number of negotiation operations between the pairs of nodes in each cluster to settle on a schedule. As a result, the cluster tree network's error rate, traffic load, latency, and queue size have all decreased.

Mobile Resource Reliability-based Job Scheduling for Mobile Grid

  • Jang, Sung-Ho;Lee, Jong-Sik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권1호
    • /
    • pp.83-104
    • /
    • 2011
  • Mobile grid is a combination of grid computing and mobile computing to build grid systems in a wireless mobile environment. The development of network technology is assisting in realizing mobile grid. Mobile grid based on established grid infrastructures needs effective resource management and reliable job scheduling because mobile grid utilizes not only static grid resources but also dynamic grid resources with mobility. However, mobile devices are considered as unavailable resources in traditional grids. Mobile resources should be integrated into existing grid sites. Therefore, this paper presents a mobile grid middleware interconnecting existing grid infrastructures with mobile resources and a mobile service agent installed on the mobile resources. This paper also proposes a mobile resource reliability-based job scheduling model in order to overcome the unreliability of wireless mobile devices and guarantee stable and reliable job processing. In the proposed job scheduling model, the mobile service agent calculates the mobile resource reliability of each resource by using diverse reliability metrics and predicts it. The mobile grid middleware allocated jobs to mobile resources by predicted mobile resource reliability. We implemented a simulation model that simplifies various functions of the proposed job scheduling model by using the DEVS (Discrete Event System Specification) which is the formalism for modeling and analyzing a general system. We also conducted diverse experiments for performance evaluation. Experimental results demonstrate that the proposed model can assist in improving the performance of mobile grid in comparison with existing job scheduling models.

Novel Section-Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

  • Cha, Jae Ryong;Baek, Gwang Hun
    • ETRI Journal
    • /
    • 제37권2호
    • /
    • pp.380-386
    • /
    • 2015
  • Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

차세대 이동통신시스템을 위한 패킷 스케쥴링 알고리즘과 효율적인 프레임 구성 방법 및 성능 분석 (A Packet Scheduling Algorithm and Efficient Framing Method for Next Generation Wireless Communication System and its Performance)

  • 백장현;김동회
    • 한국경영과학회지
    • /
    • 제30권2호
    • /
    • pp.29-40
    • /
    • 2005
  • In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

Scheduling and Power Control Framework for Ad hoc Wireless Networks

  • Casaquite, Reizel;Yoon, Myung-Hyun;Hwang, Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제10권6호
    • /
    • pp.745-753
    • /
    • 2007
  • The wireless medium is known to be time-varying which could affect and result to a poor network's performance. As a solution, an opportunistic scheduling and power control algorithm based on IEEE 802.11 MAC protocol is proposed in this paper. The algorithm opportunistically exploits the channel condition for better network performance. Convex optimization problems were also formulated i.e. the overall transmission power of the system is minimized and the "net-utility" of he system is maximized. We have proven that an optimal transmission power vector may exist, satisfying the maximum power and SINR constraints at all receivers, thereby minimizing overall transmission power and maximizing net-utility of the system.

  • PDF