• Title/Summary/Keyword: wireless scheduling

Search Result 469, Processing Time 0.041 seconds

Energy-Efficient Quorum-Based MAC Protocol for Wireless Sensor Networks

  • Annabel, L. Sherly Puspha;Murugan, K.
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.480-490
    • /
    • 2015
  • The reliability of sensor networks is generally dependent on the battery power of the sensor nodes that it employs; hence it is crucial for the sensor nodes to efficiently use their battery resources. This research paper presents a method to increase the reliability of sensor nodes by constructing a connected dominating tree (CDT), which is a subnetwork of wireless sensor networks. It detects the minimum number of dominatees, dominators, forwarder sensor nodes, and aggregates, as well as transmitting data to the sink. A new medium access control (MAC) protocol, called Homogenous Quorum-Based Medium Access Control (HQMAC), is also introduced, which is an adaptive, homogenous, asynchronous quorum-based MAC protocol. In this protocol, certain sensor nodes belonging to a network will be allowed to tune their wake-up and sleep intervals, based on their own traffic load. A new quorum system, named BiQuorum, is used by HQMAC to provide a low duty cycle, low network sensibility, and a high number of rendezvous points when compared with other quorum systems such as grid and dygrid. Both the theoretical results and the simulation results proved that the proposed HQMAC (when applied to a CDT) facilitates low transmission latency, high delivery ratio, and low energy consumption, thus extending the lifetime of the network it serves.

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

  • Sharifi, Mohsen;Okhovvat, Morteza
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.330-340
    • /
    • 2012
  • In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

Congestion Detection for QoS-enabled Wireless Networks and its Potential Applications

  • Ramneek, Ramneek;Hosein, Patrick;Choi, Wonjun;Seok, Woojin
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.513-522
    • /
    • 2016
  • We propose a mechanism for monitoring load in quality of service (QoS)-enabled wireless networks and show how it can be used for network management as well as for dynamic pricing. Mobile network traffic, especially video, has grown exponentially over the last few years and it is anticipated that this trend will continue into the future. Driving factors include the availability of new affordable, smart devices, such as smart-phones and tablets, together with the expectation of high quality user experience for video as one would obtain at home. Although new technologies such as long term evolution (LTE) are expected to help satisfy this demand, the fact is that several other mechanisms will be needed to manage overload and congestion in the network. Therefore, the efficient management of the expected huge data traffic demands is critical if operators are to maintain acceptable service quality while making a profit. In the current work, we address this issue by first investigating how the network load can be accurately monitored and then we show how this load metric can then be used to provide creative pricing plans. In addition, we describe its applications to features like traffic offloading and user satisfaction tracking.

Rotational Wireless Video Sensor Networks with Obstacle Avoidance Capability for Improving Disaster Area Coverage

  • Bendimerad, Nawel;Kechar, Bouabdellah
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.509-527
    • /
    • 2015
  • Wireless Video Sensor Networks (WVSNs) have become a leading solution in many important applications, such as disaster recovery. By using WVSNs in disaster scenarios, the main goal is achieving a successful immediate response including search, location, and rescue operations. The achievement of such an objective in the presence of obstacles and the risk of sensor damage being caused by disasters is a challenging task. In this paper, we propose a fault tolerance model of WVSN for efficient post-disaster management in order to assist rescue and preparedness operations. To get an overview of the monitored area, we used video sensors with a rotation capability that enables them to switch to the best direction for getting better multimedia coverage of the disaster area, while minimizing the effect of occlusions. By constructing different cover sets based on the field of view redundancy, we can provide a robust fault tolerance to the network. We demonstrate by simulating the benefits of our proposal in terms of reliability and high coverage.

Implementation and Performance Evaluation of Reporting Interval-adaptive Sensor Control Scheme for Energy Efficient Data Gathering (에너지 효율적 센서 데이터 수집을 위한 리포팅 허용 지연시간 적응형 센서 제어 기법 구현 및 성능평가)

  • Shon, Tae-Shik;Choi, Hyo-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.459-464
    • /
    • 2010
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we implement and evaluate a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC), in wireless sensor networks. The TPC is implemented on sensor Mote hardwares. With the help of TPC implemented, sensors selectively use direct links for control and forwarding time critical sensed data and relay links for data forwarding based on the user delay constraints given. Implementation study shows that TPC helps the sensors to increase a significant amount of energy while collecting sensed data from sensors in a real environment.

Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN (클러스터-트리 기반 LR-WPAN에서 End-to-End 지연시간을 줄이기 위한 적응적 Beacon 스케줄링 알고리즘)

  • Kang, Jae-Eun;Park, Hak-Rae;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.255-263
    • /
    • 2009
  • In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5835-5854
    • /
    • 2017
  • The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

Codebook Design and Centralized Scheduling for Joint Transmission SDMA with Limited Feedback (제한된 피드백을 사용하는 결합 전송 공간 분할 다중 접속 기술을 위한 코드북 설계와 집중 스케줄링)

  • Mun, Cheol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.10
    • /
    • pp.1180-1187
    • /
    • 2012
  • In this paper, joint transmission space division multiple access(JT-SDMA) scheme is proposed to mitigate inter-cell interference(ICI) in cooperative wireless communications system with limited feedback. We propose a systematic design method for a codebook consisting of a finite number of unitary matrices suitable for network multiple-input multiple-output( MIMO) channel characteristics. A centralized cluster scheduling scheme is proposed to both mitigate ICI and maximizes multiuser diversity gain with limited feedback. It is shown that the proposed JT-SDMA scheme outperforms a existing coordinated SDMA scheme even in wireless network environments where sufficient multiuser diversity order can not be provided through efficient ICI mitigation.

A Multi-Channel Scheduling MAC (MCS-MAC) Protocol for Wi-Fi Mesh Networks (Wi-Fi 메쉬 네트워크를 위한 다중 채널 스케줄링 MAC (MCS-MAC) 프로토콜)

  • Wu, Ledan;Yang, Jae-Young;Zhou, Yafeng;Jeong, Han-You
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1C
    • /
    • pp.54-62
    • /
    • 2012
  • A Wi-Fi mesh network providing multi-hop wireless connections based on IEEE 802.11 PHY/MAC technology has recently received a significant attention as a network infrastructure that interconnects RFID systems and wireless sensor networks (WSNs). However, the current IEEE 802.11 contention-based MAC protocol cannot fully utilize the network capacity due to eithor frame collisions or unused network resources. In this paper, we propose a novel multi-channel scheduling MAC (MCS-MAC) protocol for Wi-Fi mesh networks. Under the secondary interference model of Wi-Fi mesh networks, the MCS-MAC protocol can maximize the network throughput via activation of collision-free links that has a maximal link weight. Through the simulations, we show that the throughput of the MCS-MAC protocol is at least three times higher than that of existing MAC protocols in Wi-Fi mesh networks.

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.