Gotowa bibliografia na temat „Wireless scheduling protocols”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Wireless scheduling protocols”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Wireless scheduling protocols"

1

Mathew K., Deepa, i Anita Jones. "Survey: energy efficient protocols using radio scheduling in wireless sensor network". International Journal of Electrical and Computer Engineering (IJECE) 10, nr 2 (1.04.2020): 1296. http://dx.doi.org/10.11591/ijece.v10i2.pp1296-1307.

Pełny tekst źródła
Streszczenie:
An efficient energy management scheme is crucial factor for design and implementation of any sensor network. Almost all sensor networks are structured with numerous small sized, low cost sensor devices which are scattered over the large area. To improvise the network performance by high throughput with minimum energy consumption, an energy efficient radio scheduling MAC protocol is effective solution, since MAC layer has the capability to collaborate with distributed wireless networks. The present survey study provides relevant research work towards radio scheduling mechanism in the design of energy efficient wireless sensor networks (WSNs). The various radio scheduling protocols are exist in the literature, which has some limitations. Therefore, it is require developing a new energy efficient radio scheduling protocol to perform multi tasks with minimum energy consumption (e.g. data transmission). The most of research studies paying more attention towards to enhance the overall network lifetime with the aim of using energy efficient scheduling protocol. In that context, this survey study overviews the different categories of MAC based radio scheduling protocols and those protocols are measured by evaluating their data transmission capability, energy efficiency, and network performance. With the extensive analysis of existing works, many research challenges are stated. Also provides future directions for new WSN design at the end of this survey.
Style APA, Harvard, Vancouver, ISO itp.
2

Uppalapati, Srilakshmi. "Energy-Efficient Heterogeneous Optimization Routing Protocol for Wireless Sensor Network". Instrumentation Mesure Métrologie 19, nr 5 (15.11.2020): 391–97. http://dx.doi.org/10.18280/i2m.190510.

Pełny tekst źródła
Streszczenie:
A wide range of applications include in Wireless Sensor Networks (WSNs), and it is being used extensively in data collection specifically to process the mission-critical tasks. The implementation of routing protocols of energy-efficient (EE) is one of the significant challenging jobs of Sensor Networks (MC-SSN) and Mission Critical Sensors. In hierarchical routing protocols, higher EE can reach when compared to the flat routing protocols. The network’s scheduling process doesn’t support enhanced balanced Energy-efficient network-integrated super-heterogeneous (E-BEENISH), which discusses earlier. An Energy. Energy efficient Time scheduling based particle swarm optimization unequal fault tolerance clustering protocol (EE-TDMA-PSO-UFC) is proposed in this paper. Based on the distance parameter, an efficient cluster head (CH) is selected in this protocol. Owing to the unexpected failure of MCH (Master Cluster Head), an additional “CH” is chosen that is termed as Surrogate cluster head (SCH) for the restoration of network’s connectivity in the protocol of PSO-UFC. Based on TDMA (Time Division Multiple Access) protocols, the consumption of Energy. Energy is reduced with the allocation of timeslots during transmission of data. Using the technique of EE-TDMA-PSOUFC, the network’s lifespan improves than CEEC and E-BEENISH protocols according to the assessment of simulation results.
Style APA, Harvard, Vancouver, ISO itp.
3

Mao, Yuxin, Chenqian Zhou, Yun Ling i Jaime Lloret. "An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)". Sensors 19, nr 2 (10.01.2019): 243. http://dx.doi.org/10.3390/s19020243.

Pełny tekst źródła
Streszczenie:
Many applications of Internet of Things (IoT) have been implemented based on unreliable wireless or mobile networks like the delay tolerant network (DTN). Therefore, it is an important issue for IoT applications to achieve efficient data transmission in DTN. In order to improve delivery rate and optimize delivery delay with low overhead in DTN for IoT applications, we propose a new routing protocol, called Scheduling-Probabilistic Routing Protocol using History of Encounters and Transitivity (PROPHET). In this protocol, we calculate the delivery predictability according to the encountering frequency among nodes. Two scheduling mechanisms are proposed to extend the traditional PROPHET protocol and improve performance in both storage and transmission in DTN. In order to evaluate the proposed routing protocol, we perform simulations and compare it with other routing protocols in an Opportunistic Network Environment (ONE) simulator. The results demonstrate that the proposed Scheduling-PROPHET can achieve better performances in several key aspects compared with the existing protocols.
Style APA, Harvard, Vancouver, ISO itp.
4

Susila, S. G., i J. Arputhavijayaselvi. "Multipart Layer Node Deployment and Computational Technique with Finest Cluster Head Selection for Network Lifetime Enhancement". Journal of Computational and Theoretical Nanoscience 13, nr 10 (1.10.2016): 6642–48. http://dx.doi.org/10.1166/jctn.2016.5609.

Pełny tekst źródła
Streszczenie:
The continual research and development in wireless sensor networks, power is most vital resource because each sensor node has limited battery power. Numerous clustering concept routing protocols have been developed to balance and enhance lifetime of the sensor nodes in wireless sensor networks. Available clustering routing protocols are select cluster heads periodically and they considered only how can select cluster heads energy-efficiently and the most excellent selection of cluster heads, without considering energy-efficient period of the cluster heads replacement. Herein paper, it is employed different formulae in homogeneous merged layer node deployment system, which has a threshold-based cluster head selection mechanism for clustering routing protocols of wireless sensor networks. The proposed routing protocol is minimizes the number of cluster head selection difficulty by using threshold of residual energy comparison. Reducing the amount of difficulty for cluster head selection procedure yields better life span of the whole sensor networks and it is compared with the available clustering routing protocols. In the proposed system of work, node scheduling or activation techniques are also integrated and the obtained simulation results illustrate that the best to the obtainable clustering protocols in wireless sensor networks (WSNs).
Style APA, Harvard, Vancouver, ISO itp.
5

Martin, K. M., i B. Seetha Ramanjaneyulu. "Priority Based Centralized Scheduling for Time Slotted Channel Hopping Based Multihop IEEE 802.15.4 Networks". Journal of Computational and Theoretical Nanoscience 17, nr 1 (1.01.2020): 363–72. http://dx.doi.org/10.1166/jctn.2020.8676.

Pełny tekst źródła
Streszczenie:
To meet the growing demands of low power and determinism in Industrial Wireless applications, IEEE defined IEEE 802.15.4e amendment that includes many channel access methods. Time Slotted Channel Hopping protocol is one of the most popular MAC protocols under IEEE 802.15.4e. However, scheduling of time slots for time slotted channel hopping, was not part of the protocol and so different scheduling algorithms were proposed by researchers. A new time slotted channel hopping scheduling mechanism that considers priorities to meet the time critical industrial applications is proposed in this work. Latency improvements of about 40 percentage are obtained here, for slot allocations to higher priority devices, when compared with the conventional queuing methods.
Style APA, Harvard, Vancouver, ISO itp.
6

SHELTAMI, TAREK R. "AN EFFICIENT NEIGHBOR-AWARE PROTOCOL FOR SNET FORMATION". Journal of Interconnection Networks 09, nr 04 (grudzień 2008): 439–54. http://dx.doi.org/10.1142/s0219265908002370.

Pełny tekst źródła
Streszczenie:
A wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. While traditional MAC protocols must balance between throughput, delay, and fairness concerns, WSN MAC protocols place an emphasis on energy efficiency as well. Schedule-based MAC protocols have been proposed for WSN. A common theme through all these protocols is putting radios to a low-power "sleep mode" either periodically or whenever possible when a node is neither receiving nor transmitting. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the Neighbor-Aware Clusterhead (NAC). We investigate the performance of the NAC protocol under different sleep scheduling protocols and compare it against another cluster-based protocol. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.
Style APA, Harvard, Vancouver, ISO itp.
7

Bollapragada Subrahmanya, Vikas, i Harlan B. Russell. "RMTS: A Novel Approach to Transmission Scheduling in Ad Hoc Networks by Salvaging Unused Slot Transmission Assignments". Wireless Communications and Mobile Computing 2018 (12.12.2018): 1–13. http://dx.doi.org/10.1155/2018/2484897.

Pełny tekst źródła
Streszczenie:
In mobile ad hoc networks (MANETs) there is no centralized supervision over the network operations. In such networks, it is imperative to have protocols that are implemented locally in a distributed manner. To achieve high network performance utilizing only the wireless channels a distributed transmission-scheduling medium-access control (MAC) protocol is desirable. This type of protocol can guarantee a certain level of quality of service (QOS) and works well in congested networks. However, the transmission schedules are often decided in advance and if a node does not have a packet to transmit in its assigned slot then the slot is unused. We propose a protocol called recovering minislots transmission scheduling (RMTS) that salvages these unused transmission slots that would have otherwise been wasted. We show that the proposed protocol produces significant improvements in network performance over traditional transmission-scheduling approaches.
Style APA, Harvard, Vancouver, ISO itp.
8

Alzahrani, Eman, Fatma Bouabdallah i Hind Almisbahi. "State of the Art in Quorum-Based Sleep/Wakeup Scheduling MAC Protocols for Ad Hoc and Wireless Sensor Networks". Wireless Communications and Mobile Computing 2022 (8.02.2022): 1–33. http://dx.doi.org/10.1155/2022/6625385.

Pełny tekst źródła
Streszczenie:
In energy-constrained networks, designing an energy-efficient MAC protocol is crucial since the MAC protocol controls the access of the nodes to the shared wireless medium. Indeed, an efficient MAC protocol should reduce or even mitigate the consumption of the main sources of energy wastage, namely, overhearing, collision, and idle listening, and hence the network lifetime will be improved. One of the most efficient solutions is designing a MAC protocol that utilizes the quorum concept to increase energy efficiency by reducing idle listening and overhearing. Researchers have proposed several quorum-based MAC protocols to conserve energy. This paper presents a detailed overview and classification of several existing quorum-based sleep/wakeup scheduling MAC protocols. We classify these quorum-based MAC protocols into homogeneous and heterogeneous based on their quorum system characteristics. Moreover, we further classify these protocols according to the guaranteed intersection between any two quorums into fixed and limited. Furthermore, we compare these protocols in terms of their quorum system characteristics, limitations, and performance. Finally, a guide for future research directions is presented.
Style APA, Harvard, Vancouver, ISO itp.
9

Iqbal Khan, Muhammad Zafar, Kamarularifin Abd Jalil i Mohd Faisal Ibrahim. "Efficient Energy Optimization Routing for WSN Based on Even-Odd Scheduling". Pertanika Journal of Science and Technology 30, nr 2 (28.03.2022): 1343–61. http://dx.doi.org/10.47836/pjst.30.2.27.

Pełny tekst źródła
Streszczenie:
Several routing protocols are being developed and used to develop energy-efficient wireless sensor networks. The necessity of saving energy is the need for technology as well as the scarcity of conventional energy. The wireless sensor nodes are run on battery power with energy limitations; therefore, this study needs to develop wireless sensor networks that can be kept alive for a longer period. From a computer science point of view, a routing mechanism can help in the improvement of the network. This research aims to design and develop a routing protocol that utilizes less energy and keeps sensor networks alive for longer period while using limited energy. An efficient and intelligent even-odd scheduling-based routing protocol influenced by LEACH has been proposed to achieve this goal. During transmission, this protocol alternatively considers evenly or oddly indexed nodes. The concept in this approach is to keep the node into consideration when it is ready to send data and when it is in the queue. Any node that is not in the queue or does not have data will not consume any significant energy, and thus the whole network conserves energy after each transmission round.
Style APA, Harvard, Vancouver, ISO itp.
10

Birur Viswanath, Shruti, Thippeswamy Muddenahalli Nagendrappa i Krishna Rao Venkatesh. "JSMCRP: Cross-Layer Architecture based Joint-Synchronous MAC and Routing Protocol for Wireless Sensor Network". ECTI Transactions on Electrical Engineering, Electronics, and Communications 19, nr 1 (22.03.2021): 94–113. http://dx.doi.org/10.37936/ecti-eec.2021191.240719.

Pełny tekst źródła
Streszczenie:
The exponential rise in wireless technologies and allied applications has revitalized academia-industries to develop more efficient and economic routing solution to meet Quality-of-Service (QoS) provision. Amongst the major wireless communication systems, Wireless Sensor Network (WSN) is the most sought technology for defense surveillance, healthcare monitoring, industrial monitoring and control, civic and strategic infrastructure surveillance etc. Additionally, the up surge in Internet of Things (IoT) and Machine to Machine (M2M) communication systems too have broadened the horizon for WSNs based communication. However, the parallel increase in communication environment, complex network conditions etc confine efficacy of the classical WSN protocols. Dynamic network and node conditions often force classical protocols to undergo pre-mature link outage, delayed transmission, energy exhaustion and eventual QoS violation. To address such issues enhancing Median Access Control (MAC) and allied routing decision can have vital significance. However major existing efforts either focus on MAC enhancement or routing optimization, even under static WSN topology. Considering it as motive in this paper a highly robust “Cross-layer architecture based Joint-Synchronous MAC and Routing Protocol for WSN communication (JSMCRP)” has been developed. Being cross layer model JSMCRP protocol employs Application Layer, Network Layer, MAC Layer and PHY Layer to perform Network Adaptive MAC scheduling and Dynamic Routing Decision. JSMCRP employs Data Traffic Assessment, Prioritization and Scheduling (DTAPS), Proactive Network Monitoring and Knowledge (PNMK), Dynamic Congestion Index Estimation (DCIE), Adaptive Link Quality, Packet Injection Rate and Cumulative Rank Sensitive Routing Decision (CRSRD) to perform routing decision. Additionally, exploiting dynamic network/node conditions it performs Cognitive MAC scheduling to ensure QoS centric communication over IEEE 802.15.4 protocol stack. JSMCRP exhibited higher PDR, lower PLR and low delay under varying network conditions, suitable for real-time communication over constrained mobile WSN conditions.
Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat "Wireless scheduling protocols"

1

Fei, Xin. "Coverage-awareness Scheduling Protocols for Wireless Sensor Networks". Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23282.

Pełny tekst źródła
Streszczenie:
The coverage and energy issues are the fundamental problems which prevent the development of wireless sensor networks. In order to accurately evaluate the monitoring quality (coverage), one needs to model the interactive of sensors, phenomenons and the environment. Furthermore, in collaborative with scheduling algorithm and computer optimization, protocols can improve the overall monitoring quality and prolong the lifetime of network. This thesis is an investigation of coverage problem and its relative applications in the wireless sensor networks. We first discuss the realistic of current boolean sensing model and propose an irregular sensing model used to determine the coverage in the area with obstacles. We then investigate a joint problem of maintaining the monitoring quality and extending the lifetime of network by using scheduling schemes. Since the scheduling problem is NP hard, genetic algorithm and Markov decision process are used to determine an achievable optimal result for the joint problem of coverage-preserving and lifetime-prolong. In order to avoid the cost of centralized or distributed scheduling algorithms, a localized coverage-preserving scheduling algorithm is proposed by exploring the construction process of Voronoi diagram. Besides exploring the coverage characteristic in a static wireless sensor network, we investigate the coverage problem when the mobile elements are introduced into network. We consider the single-hop mobile data gathering problem with the energy efficiency and data freshness concerns in a wireless sensor network where the connectivity cannot be maintained. We first investigate the upper/lower bound of the covering time for a single collector to cover the monitoring area. Through our investigation we show that for a bounded rectangle area a hexagon walk could explore the area more efficiently than a random walk when the edges of area are known. We then propose a virtual force mobile model (VFM) in which the energy consumption for data transmission is modeled as a virtual elastic force and used to guide of mobile collectors to move to optimal positions for energy saving.
Style APA, Harvard, Vancouver, ISO itp.
2

Chui, T. Y. "Medium access control and packet scheduling algorithms for personal area wireless networking". Thesis, Queen's University Belfast, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273216.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Salayma, Marwa. "Reliable and energy efficient scheduling protocols for Wireless Body Area Networks (WBAN)". Thesis, Edinburgh Napier University, 2018. http://researchrepository.napier.ac.uk/Output/1532410.

Pełny tekst źródła
Streszczenie:
Wireless Body Area Network (WBAN) facilitates efficient and cost-effective e-health care and well-being applications. The WBAN has unique challenges and features compared to other Wireless Sensor Networks (WSN). In addition to battery power consumption, the vulnerability and the unpredicted channel behavior of the Medium Access Control (MAC) layer make channel access a serious problem. MAC protocols based on Time Division Multiple Access (TDMA) can improve the reliability and efficiency of WBAN. However, conventional static TDMA techniques adopted by IEEE 802.15.4 and IEEE 802.15.6 do not sufficiently consider the channel status or the buffer requirements of the nodes within heterogeneous contexts. Although there are some solutions that have been proposed to alleviate the effect of the deep fade in WBAN channel by adopting dynamic slot allocation, these solutions still suffer from some reliability and energy efficiency issues and they do not avoid channel deep fading. This thesis presents novel and generic TDMA based techniques to improve WBAN reliability and energy efficiency. The proposed techniques synchronise nodes adaptively whilst tackling their channel and buffer status in normal and emergency contexts. Extensive simulation experiments using various traffic rates and time slot lengths demonstrate that the proposed techniques improve the reliability and the energy efficiency compared to the de-facto standards of WBAN, i.e. the IEEE 802.15.4 and the IEEE 802.15.6. In normal situations, the proposed techniques reduce packet loss up to 61% and 68% compared to the IEEE 802.15.4 and IEEE 802.15.6 respectively. They also reduce energy consumption up to 7.3%. In emergencies, however, the proposed techniques reduce packets loss up to 63.4% and 90% with respect to their counterparts in IEEE 802.15.4 and 802.15.6. The achieved results confirm the significant enhancements made by the developed scheduling techniques to promote the reliability and energy efficiency of WBAN, opening up promising doors towards new horizons and applications.
Style APA, Harvard, Vancouver, ISO itp.
4

Liu, Minkui. "A cross-layer approach : impact of the physical layer on the design and performance of wireless scheduling protocols /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2005. http://wwwlib.umi.com/cr/ucsd/fullcit?p3170227.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Sánchez, Garache Marvin. "Multihop Wireless Networks with Advanced Antenna Systems : An Alternative for Rural Communication". Doctoral thesis, KTH, Kommunikationssystem, CoS, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4755.

Pełny tekst źródła
Streszczenie:
Providing access to telecommunication services in rural areas is of paramount importance for the development of any country. Since the cost is the main inhibiting factor, any technical solution for access in sparsely populated rural areas has to be reliable, efficient, and deployable at low-cost. This thesis studies the utilization of Multihop Wireless Networks (MWN) as an appealing alternative for rural communication. MWN are designed with a self-configuring capability and can adapt to the addition or removal of network radio units (nodes). This makes them simple to install, allowing unskilled users to set up the network quickly. To increase the performance and cost-efficiency, this thesis focuses on the use of Advanced Antenna Systems (AAS) in rural access networks. AAS promise to increase the overall capacity in MWN, improving the link quality while suppressing or reducing the multiple access interference. To effectively exploit the capabilities of AAS, a proper design of Medium Access Control (MAC) protocols is needed. Hence, the results of system level studies into MAC protocols and AAS are presented in this thesis. Two different MAC protocols are examined: Spatial Time Division Multiple Access (STDMA) and Carrier Sense Multiple Access Collision Avoidance (CSMA/CA) with handshaking. The effects of utilizing advanced antennas on the end-to-end network throughput and packet delay are analyzed with routing, power control and adaptive transmission data rate control separately and in combination. Many of the STDMA-related research questions addressed in this thesis are posed as nonlinear optimization problems that are solved by the technique called "column generation" to create the transmission schedule using AAS. However, as finding the optimal solution is computationally expensive, we also introduce low-complexity algorithms that, while simpler, yield reasonable results close to the optimal solution. Although STDMA has been found to be very efficient and fair, one potential drawback is that it may adapt slower than a distributed approach like CSMA/CA to network changes produced e.g. by traffic variations and time-variant channel conditions. In CSMA/CA, nodes make their own decisions based on partial network information and the handshaking procedure allows the use of AAS at the transmitter and the receiver. How to effectively use AAS in CSMA/CA with handshaking is addressed in this thesis. Different beam selection policies using switched beam antenna systems are investigated. Finally, we demonstrate how the proposed techniques can be applied in a rural access scenario in Nicaragua. The result of a user-deployed MWN for Internet access shows that the supported aggregated end-to-end rate is higher than an Asymmetric Digital Subscriber Line (ADSL) connection.
QC 20100908
Style APA, Harvard, Vancouver, ISO itp.
6

Kunert, Kristina. "Architectures and Protocols for Performance Improvements of Real-Time Networks". Doctoral thesis, Högskolan i Halmstad, Inbyggda system (CERES), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-14082.

Pełny tekst źródła
Streszczenie:
When designing architectures and protocols for data traffic requiring real-time services, one of the major design goals is to guarantee that traffic deadlines can be met. However, many real-time applications also have additional requirements such as high throughput, high reliability, or energy efficiency. High-performance embedded systems communicating heterogeneous traffic with high bandwidth and strict timing requirements are in need of more efficient communication solutions, while wireless industrial applications, communicating control data, require support of reliability and guarantees of real-time predictability at the same time. To meet the requirements of high-performance embedded systems, this thesis work proposes two multi-wavelength high-speed passive optical networks. To enable reliable wireless industrial communications, a framework in­corporating carefully scheduled retransmissions is developed. All solutions are based on a single-hop star topology, predictable Medium Access Control algorithms and Earliest Deadline First scheduling, centrally controlled by a master node. Further, real-time schedulability analysis is used as admission control policy to provide delay guarantees for hard real-time traffic. For high-performance embedded systems an optical star network with an Arrayed Waveguide Grating placed in the centre is suggested. The design combines spatial wavelength re­use with fixed-tuned and tuneable transceivers in the end nodes, enabling simultaneous transmis­sion of both control and data traffic. This, in turn, permits efficient support of heterogeneous traf­fic with both hard and soft real-time constraints. By analyzing traffic dependencies in this mul­tichannel network, and adapting the real-time schedulability analysis to incorporate these traffic dependencies, a considerable increase of the possible guaranteed throughput for hard real-time traffic can be obtained. Most industrial applications require using existing standards such as IEEE 802.11 or IEEE 802.15.4 for interoperability and cost efficiency. However, these standards do not provide predict­able channel access, and thus real-time guarantees cannot be given. A framework is therefore de­veloped, combining transport layer retransmissions with real-time analysis admission control, which has been adapted to consider retransmissions. It can be placed on top of many underlying communication technologies, exemplified in our work by the two aforementioned wireless stan­dards. To enable a higher data rate than pure IEEE 802.15.4, but still maintaining its energy saving properties, two multichannel network architectures based on IEEE 802.15.4 and encompassing the framework are designed. The proposed architectures are evaluated in terms of reliability, utiliza­tion, delay, complexity, scalability and energy efficiency and it is concluded that performance is enhanced through redundancy in the time and frequency domains.
Style APA, Harvard, Vancouver, ISO itp.
7

Yang, Fei. "Reliable and time-constrained communication in wireless sensor networks". Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00706211.

Pełny tekst źródła
Streszczenie:
Wireless Sensor Networks (WSNs) are composed of a large number of battery-powered sensor nodes that have the ability to sense the physical environment, compute the obtained information and communicate using the radio interfaces. Because sensor nodes are generally deployed on a large and wild area, they are powered by embedded battery. And it is difficult to change or recharge the battery, thus to reduce the energy consumption when sensors and protocols are designed is very important and can extend the lifetime of WSNs. So sensor nodes transmit packets with a lower transmission power (e.g. OdBm). With this transmission power, a packet can only be transmitted dozens of meters away. Therefore, when a sensor detects an event, a packet is sent in a multi-hop, ad-hoc manner (without fixed infrastructure and each sensor is able to relay the packet) to the sink (specific node which gathers information and reacts to the network situation). In this thesis, we first give an elaborate state of the art of WSNs. Then the impacts of duty-cycle and unreliable links or the performances of routing layer are analyzed. Based on the analytical results, we then propose three new simple yet effective methods to construct virtual coordinates under unreliable links in WSNs. By further taking the duty-cycle and real-time constraints into consideration we propose two cross-layer forwarding protocols which can have a greater delivery ratio and satisfy the deadline requirements. In order to have protocols for the WSNs that have dynamic topology, we then propose a robust forwarding protocol which can adapt its parameters when the topology changes. At last, we conclude this thesis and give some perspectives.
Style APA, Harvard, Vancouver, ISO itp.
8

Khemapech, Ittipong. "PoRAP : an energy aware protocol for cyclic monitoring WSNs". Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/1899.

Pełny tekst źródła
Streszczenie:
This work starts from the proposition that it is beneficial to conserve communication energy in Wireless Sensor Networks (WSNs). For WSNs there is an added incentive for energy-efficient communication. The power supply of a sensor is often finite and small. Replenishing the power may be impractical and is likely to be costly. Wireless Sensor Networks are an important area of research. Data about the physical environment may be collected from hostile or friendly environments. Data is then transmitted to a destination without the need for communication cables. There are power and resource constraints upon WSNs, in addition WSN networks are often application specific. Different applications will often have different requirements. Further, WSNs are a shared medium system. The features of the MAC (Medium Access Control) protocol together with the application behaviour shape the communication states of the node. As each of these states have different power requirements the MAC protocol impacts upon the operation and power consumption efficiency. This work focuses on the development of an energy conservation protocol for WSNs where direct communication between sources and a base station is feasible. Whilst the multi-hop approach has been regarded as the underlying communication paradigm in WSNs, there are some scenarios where direct communication is applicable and a significant amount of communication energy can be saved. The Power & Reliability Aware Protocol has been developed. Its main objectives are to provide efficient data communication by means of energy conservation without sacrificing required reliability. This has been achieved by using direct communication, adaptive power adaptation and intelligent scheduling. The results of simulations illustrate the significance of communication energy and adaptive transmission. The relationship between Received Signal Strength Indicator (RSSI) and Packet Reception Rate (PRR) metrics is established and used to identify when power adaptation is required. The experimental results demonstrate an optimal region where lower power can be used without further reduction in the PRR. Communication delays depend upon the packet size whilst two-way propagation delay is very small. Accurate scheduling is achieved through monitoring the clock drift. A set of experiments were carried out to study benefits of direct vs. multi-hop communication. Significant transmitting current can be conserved if the direct communication is used. PoRAP is compared to Sensor-MAC (S-MAC), Berkeley-MAC (B-MAC) and Carrier Sense Multiple Access (CSMA). Parameter settings used in the Great Duck Island (GDI) a production habitat monitoring WSNs were applied. PoRAP consumes the least amount of energy.
Style APA, Harvard, Vancouver, ISO itp.
9

Dickow, Victor Hugo. "Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/97235.

Pełny tekst źródła
Streszczenie:
A aplicação de redes sem fio vem crescendo consideravelmente nos últimos anos. Protocolos baseados nesta tecnologia estão sendo desenvolvidos para uma grande variedade de aplicações. A confiabilidade é um dos principais requisitos dos protocolos de comunicação nos ambientes industriais. Interferências, ambiente ruidoso e o grande risco das aplicações industriais que são monitoradas são fatores que elevam os níveis de exigência no que se refere à confiabilidade, redundância e segurança do protocolo. O protocolo WirelessHART é um padrão de comunicação sem fio desenvolvido especificamente para monitoramento e controle de processos com os requisitos necessários para ser utilizado em ambientes industriais. A norma do WirelessHART define diversos aspectos técnicos a serem utilizados no desenvolvimento de algoritmos. Os algoritmos de roteamento e escalonamento de mensagens são de grande relevância para o cumprimento dos requisitos temporais, de confiabilidade e segurança. Requisitos de roteamento e escalonamento são especificados, porém, os algoritmos a serem utilizados não são definidos. O objetivo nessa dissertação é analisar alguns dos principais algoritmos que tem sido propostos especificamente para o protocolo WirelessHART e apresentar um conjunto capaz de ser aplicado nesse protocolo. Análises e comparações entre os algoritmos são realizadas proporcionando um estudo aprofundado sobre seus impactos no desempenho do protocolo.
The application of wireless networks has grown considerably in recent years. Protocols based on this technology are being developed for a great variety of applications. Reliability is one of the main requirements for communication protocols in industrial environments. Interferences, noisy environment and high risk processes that are monitored are factors that increase the levels of requirements in terms of reliability, redundancy and security of the protocol. The WirelessHART protocol is a wireless communication standard specifically designed for process monitoring and control applications with the necessary requirements for to be used in industrial environments. The WirelessHART standard defines several technical aspects to be used in the development of the algorithms. The algorithms of routing and scheduling messages are highly relevant to meeting the timing requirements of reliability and safety. Routing and scheduling strategies are specified, however, the routing and scheduling algorithms are not defined for use. The goal of this dissertation is to analyze some of the main algorithms that have been proposed specifically for the WirelessHART protocol and to present a set able to be applied in this protocol. Analyzes and comparisons between algorithms are realized by providing a detailed study of their impacts on the protocol performance.
Style APA, Harvard, Vancouver, ISO itp.
10

Oliveira, Camila Helena Souza. "Gerenciamento AutonÃmico de Energia em Redes de Sensores Sem Fio AtravÃs do Escalonamento de Atividade dos NÃs". Universidade Federal do CearÃ, 2011. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7164.

Pełny tekst źródła
Streszczenie:
CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior
A evoluÃÃo no desenvolvimento de novos dispositivos, cada vez mais baratos e eficientes, expandiu o uso das Redes Sensores Sem Fio (RSSF) e incentivou a criaÃÃo de novas aplicaÃÃes, no cenÃrio contemporÃneo da ComputaÃÃo UbÃqua e Pervasiva. No entanto, a limitaÃÃo de energia continua sendo um desafio na Ãrea de RSSF. Essa situaÃÃo à agravada ainda mais pela a inviabilidade de recarga de energia jà que, em muitos casos, as RSSF sÃo utilizadas em ambientes inacessÃveis. Com o barateamento dos dispositivos utilizados nas RSSFs, ficou mais fÃcil empregar redes muito densas e de larga escala nos ambientes a serem monitorados. O emprego de redes densas, que apresentam alto grau de redundÃncia dos nÃs, permite que a rede continue funcional mesmo com a exaustÃo de alguns nÃs. AlÃm de oferecer tolerÃncia a falhas, o uso de redes muito densas oferece a oportunidade da implementaÃÃo de mecanismos de escalonamento dos nÃs redundantes, de forma que o tempo de vida da rede seja ainda melhor otimizado. Assumindo um cenÃrio com rede muito densas, este trabalho descreve a implementaÃÃo de um mecanismo de escalonamento autonÃmico, simples, robusto e escalÃvel, com o objetivo de melhorar ainda mais os resultados jà apresentados pelo BiO4SeL, um protocolo de roteamento baseado em ColÃnia de Formigas e desenvolvido para maximizar o tempo de vida da rede. Os resultados mostram que o novo esquema de escalonamento efetivamente melhora o tempo de vida de uma RSSF baseada no BiO4SeL em cenÃrios densos.
he evolution and development of new devices, increasingly cheaper and more efficient, expanded the use of Wireless Sensor Networks (WSN) and encouraged the creation of new applications in the contemporary scenery of Ubiquitous and Pervasive Computing. However, energy limitation remains a challenge in the field of WSN. This situation is aggravated even more by the infeasibility of energy recharge since, in many cases, WSN are used in inaccessible enviroments. With cheapness devices used in WSN, became easier to employ dense and large-scale networks in environments that will be monitored. The use of dense networks, which have a high degree redundancy of nodes, allows the network remains functional even with the exhaustion of some nodes. In addition to provide fault tolerance, the use of very dense networks offer the opportunity of implementing scheduling mechanisms for redundant nodes, in a way that the network lifetime is even better optimized. Assuming a scenery with very dense networks, this dissertation describes the implementation of an autonomic scheduling mechanism, simple, robust and scalable, in order to further improve the results already presented by BiO4SeL, which is a routing protocol based on Ant Colony and designed to maximize the network lifetime. The results show that the new scheduling scheme effectively improves the WSN lifetime based on BiO4SeL in dense scenarios.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Wireless scheduling protocols"

1

Scheduling And Congestion Control For Wireless Internet. Springer-Verlag New York Inc., 2013.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wang, Xin. Scheduling and Congestion Control for Wireless Internet. Springer London, Limited, 2013.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Wireless scheduling protocols"

1

Rentel, Carlos H., i Thomas Kunz. "Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks". W Ad-Hoc, Mobile, and Wireless Networks, 221–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11561354_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Zhang, Rongrong, i Jihong Yu. "Energy-Efficient and Reliable Sleep Scheduling Algorithms in WBSNs". W Energy-Efficient Algorithms and Protocols for Wireless Body Sensor Networks, 101–21. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-28580-7_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Liu, Chong, Kui Wu i Valerie King. "Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks". W NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 956–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_77.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Zhang, Fan, i Samuel T. Chanson. "Proxy-Assisted Scheduling for Energy-Efficient Multimedia Streaming over Wireless LAN". W NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 980–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_79.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Bao, Lichun, i J. J. Garcia-Luna-Aceves. "Distributed Transmission Scheduling Using Code-Division Channelization". W NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 154–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_12.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Marias, Giannis F., i Lazaros Merakos. "Scheduling Differentiated Traffic in Multicarrier Unlicensed Systems". W NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 911–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_74.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Heikkinen, Tiina. "Distributed Scheduling via Pricing in a Communication Network". W NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 850–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_69.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Kaheel, Ayman, i Hussein Alnuweiri. "Batch Scheduling Algorithms for Optical Burst Switching Networks". W NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 90–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Srinivasan, Sridhar, i Ellen Zegura. "Scheduling Uplink Bandwidth in Application-Layer Multicast Trees". W NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 1018–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_82.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Dadhich, Khushboo, i Devika Kataria. "Effect of Channel Slot Time on Performance of IEEE 802.15.6-Based Medical Body Area Network". W Communications in Computer and Information Science, 376–85. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28180-8_25.

Pełny tekst źródła
Streszczenie:
AbstractThe IEEE 802.15.6 standard is an emerging technology that supports low data rate, short-range wireless communication. Medical Body Area Networks (MBAN) are a special type of wireless communication where multiple sensor nodes are deployed on the human body to measure vital parameters. The data is sent by the nodes to a coordinator, the latter aggregates the data and sends it to a central server using standard protocols. The coordinator allows the nodes to access the channel using different access modes-beacon mode with the super frame, non-beacon mode with super frame and non-beacon mode without super frame. The standard allows different user priorities to be assigned to the nodes. The nodes may access the channel using scheduling done by the coordinator (scheduled access) or may randomly access the channel using the CSMA/CA (for narrowband PHY) or Slotted Aloha for UltraWideBand (UWB PHY) protocols. In this work we have conducted an analytical study to understand the performance parameters of different user priority nodes using CSMA/CA protocol and operating in the Beacon access mode with super frame boundaries. Parameters like the probability of successful transmission (reliability) which in turn depend on the probability of packet drop due to channel access failure and the probability of failure due to insufficient time slot available have been studied. This study reveals that once a channel is assessed by a node, then the probability of sufficient time slot of 60% yields the best packet transmission probability. The successful delivery of the packet also depends on back off counter. Markov chain models for nodes with different priorities have been developed using backoff stage and backoff counter as parameters.
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Wireless scheduling protocols"

1

Moscibroda, T., R. Rejaie i R. Wattenhofer. "How Optimal are Wireless Scheduling Protocols?" W 25th IEEE INFOCOM Conference. IEEE, 2007. http://dx.doi.org/10.1109/infcom.2007.169.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Haoyang Lu i Wei Gao. "Scheduling dynamic wireless networks with limited operations". W 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 2016. http://dx.doi.org/10.1109/icnp.2016.7784421.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chipara, Octav, Chenyang Lu i John Stankovic. "Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks". W 2006 IEEE International Conference on Network Protocols. IEEE, 2006. http://dx.doi.org/10.1109/icnp.2006.320182.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Le, Jilin, John C. S. Lui i Dah Ming Chiu. "Towards Coding-Efficient Link-Scheduling and Coding-Aware Routing in Wireless Networks". W 2007 IEEE International Conference on Network Protocols. IEEE, 2007. http://dx.doi.org/10.1109/icnp.2007.4375864.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Hannachi, Ahlem, i Abdelmalik Bachir. "Distributed cell scheduling for multichannel IoT MAC protocols". W 2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC). IEEE, 2017. http://dx.doi.org/10.1109/iwcmc.2017.7986450.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Wang, Bo, Matt Mutka i Eric Torng. "Optimization based rate allocation and scheduling in TDMA based wireless mesh networks". W 2008 IEEE International Conference on Network Protocols (ICNP). IEEE, 2008. http://dx.doi.org/10.1109/icnp.2008.4697033.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Cheng, Xia, i Mo Sha. "ATRIA: Autonomous Traffic-Aware Scheduling for Industrial Wireless Sensor-Actuator Networks". W 2021 IEEE 29th International Conference on Network Protocols (ICNP). IEEE, 2021. http://dx.doi.org/10.1109/icnp52444.2021.9651914.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Moayedian, Naghm, i S. Jamaloddin Golestani. "A Unified theory of scheduling, routing, and flow control in wireless networks". W 2009 17th IEEE International Conference on Network Protocols (ICNP). IEEE, 2009. http://dx.doi.org/10.1109/icnp.2009.5339668.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Che, Xin, Xi Ju i Hongwei Zhang. "The case for addressing the limiting impact of interference on wireless scheduling". W 2011 19th IEEE International Conference on Network Protocols (ICNP). IEEE, 2011. http://dx.doi.org/10.1109/icnp.2011.6089051.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Liu, J. C. "Session details: T1-D: ad hoc -- casting & scheduling protocols". W IWCMC06: 2006 International Wireless Communications and Mobile Computing Conference. New York, NY, USA: ACM, 2006. http://dx.doi.org/10.1145/3249584.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii