• Title/Summary/Keyword: wireless scheduling

Search Result 469, Processing Time 0.025 seconds

Performance Evaluation of Traffic Adaptive Sleep based MAC in Clustered Wireless Sensor Networks (클러스터 기반 무선 센서 망에서 트래픽 적응적 수면시간 기반 MAC 프로토콜 성능 분석)

  • Xiong, Hongyu;So, Won-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.5
    • /
    • pp.107-116
    • /
    • 2011
  • In this paper, a traffic adaptive sleep based medium access control (TAS-MAC) protocol for wireless sensor networks (WSNs) is proposed. The protocol aims for WSNs which consist of clustered sensor nodes and is based on TDMA-like schema. It is a typical schedule based mechanism which is adopted in previous protocols such as LEACH and Bit-Map Assisted MAC. The proposed MAC, however, considers unexpected long silent period in which sensor nodes have no data input and events do not happen in monitoring environment. With the simple traffic measurement, the TAS-MAC eliminates scheduling phases consuming energy in previous centralized approaches. A frame structure of the protocol includes three periods, investigation (I), transmission (T), and sleep-period (S). Through the I-period, TAS-MAC aggregates current traffic information from each end node and dynamically decide the length of sleep period to avoid energy waste in long silent period. In spite of the energy efficiency of this approach, the delay of data might increase. Thus, we propose an advanced version of TAS-MAC as well, each node in cluster sends one or more data packets to cluster head during the T-period of a frame. Through simulation, the performance in terms of energy consumption and transmission delay is evaluated. By comparing to BMA-MAC, the results indicate the proposed protocol is more energy efficient with tolerable expense in latency, especially in variable traffic situation.

A Distributed Altruistic Locking Scheme For Multilevel Secure Database in Wireless Mobile Network Environments (무선 이동 네트워크 환경에서 다단계 보안 데이터베이스를 위한 분산 이타적 잠금 기법)

  • Kim, Hee-Wan;Park, Dong-Soon;Rhee, Hae-Kyung;Kim, Ung-Mo
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.235-242
    • /
    • 2002
  • We propose an advanced transaction scheduling protocol for concurrency control of multilevel secure databases in wireless mobile network environment. Wireless communication is characterized by frequent spurious disconnections. So short-lived transaction must quickly access database without any delay by long-lived one. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure databases in wireless mobile network environment. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of a1truism has also been deployed for extended a1truistic locking. This is in a way that scope of data to he early released is enlarged to include even data initially not intended to be donated. Our protocol is based on extended altruistic locking, but a new method, namely bi-directional donation locking for multilevel secure databases (MLBiDL), is additionally used in order to satisfy security requirements and concurrency. We showed the Simulation experiments that MLBiDL outperforms the other locking protocols in terms of the degree of throughput and average waiting time.

The IEEE 802.15.4e based Distributed Scheduling Mechanism for the Energy Efficiency of Industrial Wireless Sensor Networks (IEEE 802.15.4e DSME 기반 산업용 무선 센서 네트워크에서의 전력소모 절감을 위한 분산 스케줄링 기법 연구)

  • Lee, Yun-Sung;Chung, Sang-Hwa
    • Journal of KIISE
    • /
    • v.44 no.2
    • /
    • pp.213-222
    • /
    • 2017
  • The Internet of Things (IoT) technology is rapidly developing in recent years, and is applicable to various fields. A smart factory is one wherein all the components are organically connected to each other via a WSN, using an intelligent operating system and the IoT. A smart factory technology is used for flexible process automation and custom manufacturing, and hence needs adaptive network management for frequent network fluctuations. Moreover, ensuring the timeliness of the data collected through sensor nodes is crucial. In order to ensure network timeliness, the power consumption for information exchange increases. In this paper, we propose an IEEE 802.15.4e DSME-based distributed scheduling algorithm for mobility support, and we evaluate various performance metrics. The proposed algorithm adaptively assigns communication slots by analyzing the network traffic of each node, and improves the network reliability and timeliness. The experimental results indicate that the throughput of the DSME MAC protocol is better than the IEEE 802.15.4e TSCH and the legacy slotted CSMA/CA in large networks with more than 30 nodes. Also, the proposed algorithm improves the throughput by 15%, higher than other MACs including the original DSME. Experimentally, we confirm that the algorithm reduces power consumption by improving the availability of communication slots. The proposed algorithm improves the power consumption by 40%, higher than other MACs.

Residual Energy-Aware Duty-Cycle Scheduling Scheme in Energy Harvesting Wireless Sensor Networks (에너지 생산이 가능한 무선 센서 네트워크에서 잔여 에너지 인지 듀티-사이클 스케줄링 기법)

  • Lee, Sungwon;Yoo, Hongseok;Kim, Dongkyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.10
    • /
    • pp.691-699
    • /
    • 2014
  • In order to increase network lifetime, duty-cycle MAC protocols which can reduce energy consumption caused by idle listening is proposed for WSNs. In common duty-cycle MAC protocols, each sensor node calculates its duty-cycle interval based on the current amount of residual energy. However, in WSNs with the capability of energy harvesting, existing duty-cycle intervals based on the residual energy may cause the sensor nodes which have high energy harvesting rate to suffer unnecessary sleep latency. Therefore, a duty-cycle scheduling scheme which adjust the duty-cycle interval based on both of the residual energy and the energy harvesting rate was proposed in our previous work. However, since this duty-cycle MAC protocol overlooked the performance variation according to the change of duty-cycle interval and adjusted the duty-cycle interval only linearly, the optimal duty-cycle interval could not be obtained to meet application requirements. In this paper, we propose three methods which calculate the duty-cycle interval and analyse their results. Through simulation study, we verify that network lifetime, end-to-end delay and packet delivery ratio can be improved up to 23%, 44% and 31% as compared to the existing linear duty-cycle scheduling method, respectively.

The Channel Scheduler based on Water-filling Algorithm for Best Effort Forward Link Traffics in AMC/TDM/CDM System (AMC/TDM/CDM 다중접속방식에서의 Best Effort 순방향 서비스를 위한 Water-filling Based 채널 스케줄러)

  • Ma, Dongl-Chul;Ki, Young-Min;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.1
    • /
    • pp.59-71
    • /
    • 2003
  • The channel scheduler is suggested the radio resource management method in order to provide service with guaranteeing fairness and throughput to the users who use limited wireless channel. Proportional fairness scheduling algorithm is the channel scheduler used in the AMC(Adaptive Modulation and Coding)/TDM system, and this algorithm increases the throughput considering the user's time fairness. In this paper is suggested the channel scheduler combining CDM scheme available in AMC/TDM/CDM system. Unlike the system which only uses TDM which provide the only one user at the same slot, this scheduler can service a lot of users since this uses the CDM scheme with multi-cord channel. At every moment, allocation of transmission power to multi-channel users is problematic because of CDM scheme. In this paper, we propose a water-filling scheduling algorithm to solve the problem. Water-filling fairness(WF2) scheduling algorithm watches the average channel environment. So, this modified method guarantees fairness for each user in terms of power and service time.

  • PDF

Buffer Management Algorithm for Performance Improvement in WBAN (WBAN 환경에서 성능향상을 위한 버퍼 관리 알고리즘)

  • Kim, JiWon;Kim, Kanghee;Lee, ChangHo;Choi, SangBang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.106-114
    • /
    • 2015
  • Wireless Body Area Network(WBAN) is a network standard around a human body which connects various medical sensor and devices It has to satisfy various demands such as data transmission rate, priority, and delay time. In this paper, considering a data priority and transmission delay time, is proposed to improve efficiency of WBAN service depending on congestion status of network. The proposed algorithm operates with adapted data removal probability according to data priority when the hub buffer is congested than before. And in the case of lower congestion within the hub buffer data is served considering data delay time. Through the comparison with other existing scheduling algorithms, it is confirmed that quality of WBAN service is improved due to lower data loss rate of medical data and less delay time in the proposed algorithm.

Security Scheme for Prevent malicious Nodes in WiMAX Environment (노드간 에너지 소비를 효율적으로 분산시킨 PRML 메커니즘)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Nam-Kyu;Park, Gil-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.774-784
    • /
    • 2009
  • A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at each node to prolong the network lifetime. To improve the sensitivity of wireless sensor networks, an efficient scheduling algorithm and energy management technology for minimizing the energy consumption at each node is desired. ill this paper, we propose energy-aware routing mechanism for maximum lifetime and to optimize the solution quality for sensor network maintenance and to relay node from its adjacent cluster heads according to the node"s residual energy and its distance to the base station. Proposed protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of where the sink is located outside or inside the cluster. Simulation results of proposed scheme show that our mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. To verify propriety using NS-2, proposed scheme constructs sensor networks adapt to current model and evaluate consumption of total energy, energy consumption of cluster head, average energy dissipation over varying network areas with HEED and LEACH-C.

Dynamic Channel Time Allocation Scheme for Multimedia Traffic with Delay Bound in High-Rate Wireless PANs (고속율 무선 PAN에서 지연한도를 갖는 멀티미디어 트래픽을 위한 동적 채널시간할당 방법)

  • Kim Sun-Myeng;Cho Young-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.11
    • /
    • pp.1-12
    • /
    • 2005
  • In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

Clock Synchronization for Periodic Wakeup in Wireless Sensor Networks (무선 센서 망에서 주기적인 송수신 모듈 활성화를 위한 클락 동기)

  • Kim, Seung-Mok;Park, Tae-Keun
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.3
    • /
    • pp.348-357
    • /
    • 2007
  • One of the major issues in recent researches on wireless sensor networks is to reduce energy consumption of sensor nodes operating with limited battery power, in order to lengthen their lifespan. Among the researches, we are interested in the schemes in which a sensor node periodically turns on and off its radio and requires information on the time when its neighbors will wake up (or turn on). Clock synchronization is essential for wakeup scheduling in such schemes. This paper proposes three methods based on the asynchronous averaging algorithm for clock synchronization in sensor nodes which periodically wake up: (1) a fast clock synchronization method during an initial network construction period, (2) a periodic clock synchronization method for saving energy consumption, and (3) a decision method for switching the operation mode of sensor nodes between the two clock synchronization methods. Through simulation, we analyze maximum clock difference and the number of messages required for clock synchronization.

  • PDF

Dynamic Channel-Time Assignments based on the link status in IEEE 802.15.3 High-rate WPAN (IEEE 802.15.3 고속 무선 PAN(Personal Area Network)에서 링크상태에 따른 동적 채널할당)

  • 곽동원;이승형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.844-851
    • /
    • 2004
  • Various types of error are caused due to many factors of various environment in air interface channel of wireless communications. In this case, the reliability of the channel is much lower than that of wired case. IEEE 802.15.3 high-rate WPAN, which operates in an ad hoc networking environment, is more susceptible to such errors. The problem has been investigated for wireless LANs, for example, as follows. If the queue size of a certain node is longer than that of other nodes, the node estimates that its channel state is bad and the resource of the node is decreased. However this method has a disadvantage that a central controller must always monitor the status. To avoid this disadvantage, in this paper, a new MAC protocol that the throughput of overall piconet is increased by LDS (Link-status Dependent Scheduling) is proposed.