Log in

Relevant bibliographies by topics / Delay-sensitive communication

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Delay-sensitive communication'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Delay-sensitive communication.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Delay-sensitive communication"

1

Malak, Derya, Howard Huang, and Jeffrey G. Andrews. "Throughput Maximization for Delay-Sensitive Random Access Communication." IEEE Transactions on Wireless Communications 18, no. 1 (January 2019): 709–23. http://dx.doi.org/10.1109/twc.2018.2885295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aoun, Marc, Paul Beekhuizen, Antonios Argyriou, Dee Denteneer, and Peter van der Stok. "Packet skipping and network coding for delay-sensitive network communication." Performance Evaluation 69, no. 9 (September 2012): 456–69. http://dx.doi.org/10.1016/j.peva.2012.05.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kaleem, Zeeshan, Muhammad Yousaf, Aamir Qamar, Ayaz Ahmad, Trung Q. Duong, Wan Choi, and Abbas Jamalipour. "UAV-Empowered Disaster-Resilient Edge Architecture for Delay-Sensitive Communication." IEEE Network 33, no. 6 (November 2019): 124–32. http://dx.doi.org/10.1109/mnet.2019.1800431.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bicen, A. Ozan, V. Cagri Gungor, and Ozgur B. Akan. "Delay-sensitive and multimedia communication in cognitive radio sensor networks." Ad Hoc Networks 10, no. 5 (July 2012): 816–30. http://dx.doi.org/10.1016/j.adhoc.2011.01.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kawabata, Akio, Bijoy Chand Chatterjee, Seydou Ba, and Eiji Oki. "A Real-Time Delay-Sensitive Communication Approach Based on Distributed Processing." IEEE Access 5 (2017): 20235–48. http://dx.doi.org/10.1109/access.2017.2758803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hamidi-Sepehr, Fatemeh, Henry D. Pfister, and Jean-Francois Chamberland. "Delay-Sensitive Communication Over Fading Channels: Queueing Behavior and Code Parameter Selection." IEEE Transactions on Vehicular Technology 64, no. 9 (September 2015): 3957–70. http://dx.doi.org/10.1109/tvt.2014.2365181.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wu, Qiong, Xiumei Fan, Wei Wei, and Marcin Wozniak. "Dynamic Scheduling Algorithm for Delay-Sensitive Vehicular Safety Applications in Cellular Network." Information Technology And Control 49, no. 1 (March 25, 2020): 161–78. http://dx.doi.org/10.5755/j01.itc.49.1.24113.

Full text

Abstract:

The vehicular safety applications disseminate the burst messages during an emergency scenario, but effort to reduce delay of communication are hampered by wireless access technology. As conventional VANET (Vehicular ad-hoc network) connected intermittently, the LTE-based framework has been established for the vehicular communication environment. However, resource allocation which affected by many factors, such as power, PRB (physical resource block), channel quality, are challenging to guarantee the safety services QoS in LTE downlink for OFDM. In order to solve the problem of safety message dissemination in LTE vehicular network, we proposed a delay-aware control policy by leveraging cross-layer approach to maximize the system throughput. First, we model the resource allocation problem using the queuing theory based on the MISO. Second, the method casts the problem of throughput and latency for dynamic communication system into a stochastic network optimization problem, and then makes tradeoffs between them by Lyapunov optimization technique. Finally, we use the improved the branch and bound algorithm to search optimal solution in system capacity region for these decomposed subproblems. The simulation results show that our algorithm can guarantee the delay while maximum system throughput

APA, Harvard, Vancouver, ISO, and other styles

8

Karamchandani, Nikhil, and Massimo Franceschetti. "Scaling laws for delay-sensitive traffic in Rayleigh fading networks." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, no. 2096 (May 6, 2008): 2187–205. http://dx.doi.org/10.1098/rspa.2007.0330.

Full text

Abstract:

The throughput of delay-sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of the study is that of a pair of nodes establishing a data stream that has routing priority over all the remaining traffic in the network. For every delay constraint, upper and lower bounds on the achievable information rate between the two endpoints of the stream are obtained as the network size grows. The analysis concerns decentralized schemes , in the sense that all nodes make next-hop decisions based only on local information, namely their channel strength to other nodes in the network and the position of the destination node. This is particularly important in a fading scenario, where the channel strength varies with time and hence pre-computing routes can be of little help. Natural applications are remote surveillance using sensor networks and communication in emergency scenarios.

APA, Harvard, Vancouver, ISO, and other styles

9

Hussain, Abid, Muddesar Iqbal, Sohail Sarwar, Muhammad Safyan, Zia ul Qayyum, Honghao Gao, and Xinheng Wang. "Servicing delay sensitive pervasive communication through adaptable width channelization for supporting mobile edge computing." Computer Communications 162 (October 2020): 152–59. http://dx.doi.org/10.1016/j.comcom.2020.07.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Venkatesh, K., L. N. B. Srinivas, M. B. Mukesh Krishnan, and A. Shanthini. "QoS improvisation of delay sensitive communication using SDN based multipath routing for medical applications." Future Generation Computer Systems 93 (April 2019): 256–65. http://dx.doi.org/10.1016/j.future.2018.10.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Delay-sensitive communication"

1

Liu, Lingjia. "On delay-sensitive communication over wireless systems." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ali, Omar Ahmed. "Delay-sensitive communication over wireless multihop channels." [College Station, Tex. : Texas A&M University, 2008. http://hdl.handle.net/1969.1/ETD-TAMU-2715.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Böhm, Annette. "Delay-sensitive wireless communication for cooperative driving applications." Doctoral thesis, Högskolan i Halmstad, Centrum för forskning om inbyggda system (CERES), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-22164.

Full text

Abstract:

Cooperative driving holds the potential to considerably improve the level of safety and efficiency on our roads. Recent advances in in-vehicle sensing and wireless communication technology have paved the way for the development of cooperative traffic safety applications based on the exchange of data between vehicles (or between vehicles and road side units) over a wireless link. The access to up-to-date status information from surrounding vehicles is vital to most cooperative driving applications. Other applications rely on the fast dissemination of warning messages in case a hazardous event or certain situation is detected. Both message types put high requirements on timeliness and reliability of the underlying communication protocols. The recently adopted European profile of IEEE 802.11p defines two message types,periodic beacons for basic status exchange and event-triggered hazard warnings, both operating at pre-defined send rates and sharing a common control channel. The IEEE 802.11p Medium Access Control (MAC) scheme is a random access protocol that doesnot offer deterministic real-time support, i.e. no guarantee that a packet is granted access to the channel before its deadline can be given. It has been shown that a high number of channel access requests, either due to a high number of communicating vehicles or highdata volumes produced by these vehicles, cannot be supported by the IEEE 802.11p MAC protocol, as it may result in dropped packets and unbounded delays. The goal of the work presented in this thesis has therefore been to enhance IEEE 802.11p without altering the standard such that it better supports the timing and reliability requirements of traffic safety applications and provides context-aware andefficient use of the available communication resources in a vehicular network. The proposed solutions are mapped to the specific demands of a set of cooperative driving scenarios (featuring infrastructure-based and infrastructure-free use cases, densely and sparsely trafficked roads, very high and more relaxed timing requirements) and evaluated either analytically, by computer simulation or by measurements and compared to the results produced by the unaltered IEEE 802.11p standard. As an alternative to the random MAC method of IEEE 802.11p, a centralized solution isproposed for application scenarios where either a road side unit or a suitable dedicated vehicle is present long enough to take the coordinating role. A random access phase forevent-driven data traffic is interleaved with a collision-free phase where timely channel access of periodic delay-sensitive data is scheduled. The ratio of the two phases isdynamically adapted to the current data traffic load and specific application requirements. This centralized MAC solution is mapped on two cooperative driving applications: merge assistance at highway entrances and platooning of trucks. Further,the effect of a context-aware choice of parameters like send rate or priority settings based on a vehicle’s position or role in the safety application is studied with the goal to reduce the overall number of packets in the network or, alternatively, use the available resources more efficiently. Examples include position-based priorities for the merge assistance use case, context-aware send rate adaptation of status updates in anovertaking warning application targeting sparsely-trafficked rural roads and an efficient dissemination strategy for warning messages within a platoon. It can be concluded that IEEE 802.11p as is does not provide sufficient support for the specific timing and reliability requirements imposed by the exchange of safety-criticalreal-time data for cooperative driving applications. While the proper, context-awarechoice of parameters, concerning send rate or priority level, within the limits of the standard, can lead to improved packet inter-arrival rates and reduced end-to-end delays,the added benefits from integrating MAC solutions with real-time support into the standard are obvious and needs to be investigated further.

APA, Harvard, Vancouver, ISO, and other styles

4

Jarupan, Boangoat. "CROSS-LAYER DESIGN FOR LOCATION- AND DELAY-AWARE COMMUNICATION IN VEHICULAR NETWORKS." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306504587.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lui, Devin Waine-Tak. "Coding Theorems for Delay Sensitive Communication over Burst-Erasure Channels." Thesis, 2011. http://hdl.handle.net/1807/31318.

Full text

Abstract:

In this thesis, we consider error-correction codes for systems which have burst erasure channels, but where the packet delay is constrained. The packet delay itself is the time di erence between the arrival of a source packet at the encoder and the reconstruction of that source packet at the decoder. While such a framework was introduced by Martinian (2004) and his co-authors, several problems remain open. We make three contributions in this thesis. First we develop a rigorous converse proof for the point-to-point case and thus complete the result of Martinian (2004). Our proof technique is also applied to a multicast channel model and new results are obtained. Secondly we study the case when there are multiple parallel links between the encoder and decoder and obtain the capacity in some special cases. Finally we study a setup when there are multiple source streams, each with a di erent delay constraint, and obtain capacity results.

APA, Harvard, Vancouver, ISO, and other styles

6

Hammad, Eman. "Exploiting Reconfigurable Antennas in Communication Systems with Delay-Sensitive Applications." Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10538.

Full text

Abstract:

Wireless communication systems continue to face the challenge of time varying quality of the underlying communication channel. When a slow fading channel goes into a deep fade, the corresponding communication system might face successive decoding failures at the destination, and for delay-sensitive communication systems, this amounts to delays that are not desired. In such situations, it becomes a priority to get out of the deep fades. Many techniques and approaches are already available in the literature to counteract fading effects. This work is motivated by recent advances in fast reconfigurable antennas, which provide new means to change the statistical profile of fading channels, and hence reduce the probability of prolonged fades. Fast reconfigurable antennas are poised to improve overall performance, especially for delay-sensitive traffic in slow-fading environments. This potential enhanced performance motivates this study of the queueing behavior of point-to-point communication systems with reconfigurable antennas. We focus on finite-state channels with memory, and we analyze the queueing behavior of the wireless communication system over erasure channels, for a traditional system versus a reconfigurable antenna implementation. We provide numerical results for situations where using reconfigurable antennas yield substantial performance gains in terms of throughput, delay and buffer overflow.

APA, Harvard, Vancouver, ISO, and other styles

7

Parag, Parimal. "Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control." Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10699.

Full text

Abstract:

An ever increasing demand for instant and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a fast feedback mechanism. Large occupancy of this buffer results in longer communication delays. Therefore, codewords need to be designed carefully to reduce transmit queue-length and thus the delay experienced in this buffer. We first study the consequences of physical layer decisions on the transmit buffer occupancy. We develop an analytical framework to relate physical layer channel to the transmit buffer occupancy. We compute the optimal code-rate for finite-length codewords operating over a correlated channel, under certain communication service guarantees. We show that channel memory has a significant impact on this optimal code-rate. Next, we study the delay in small ad-hoc networks. In particular, we find out what rates can be supported on a small network, when each flow has a certain end-to-end service guarantee. To this end, service guarantee at each intermediate link is characterized. These results are applied to study the potential benefits of setting up a network suitable for network coding in multicast. In particular, we quantify the gains of network coding over classic routing for service provisioned multicast communication over butterfly networks. In the wireless setting, we study the trade-off between communications gains achieved by network coding and the cost to set-up a network enabling network coding. In particular, we show existence of scenarios where one should not attempt to create a network suitable for coding. Insights obtained from these studies are applied to design a distributed rate control algorithm in a large network. This algorithm maximizes sum-utility of all flows, while satisfying per-flow end-to-end service guarantees. We introduce a notion of effective-capacity per communication link that captures the service requirements of flows sharing this link. Each link maintains a price and effective-capacity, and each flow maintains rate and dissatisfaction. Flows and links update their respective variables locally, and we show that their decisions drive the system to an optimal point. We implemented our algorithm on a network simulator and studied its convergence behavior on few networks of practical interest.

APA, Harvard, Vancouver, ISO, and other styles

8

Thejaswi, Chandrashekhara P. S. "Adaptive Joint Source/Channel Rate Allocation Policies For Delay Sensitive Applications Over Fading Channels." Thesis, 2004. http://etd.iisc.ernet.in/handle/2005/1192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Abedini, Navid. "Achieving Quality of Service Guarantees for Delay Sensitive Applications in Wireless Networks." Thesis, 2012. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11671.

Full text

Abstract:

In the past few years, we have witnessed the continuous growth in popularity of delay-sensitive applications. Applications like live video streaming, multimedia conferencing, VoIP and online gaming account for a major part of Internet traffic these days. It is also predicted that this trend will continue in the coming years. This emphasizes the significance of developing efficient scheduling algorithms in communication networks with guaranteed low delay performance. In our work, we try to address the delay issue in some major instances of wireless communication networks. First, we study a wireless content distribution network (CDN), in which the requests for the content may have service deadlines. Our wireless CDN consists of a media vault that hosts all the content in the system and a number of local servers (base stations), each having a cache for temporarily storing a subset of the content. There are two major questions associated with this framework: (i) content caching: which content should be loaded in each cache? and (ii) wireless network scheduling: how to appropriately schedule the transmissions from wireless servers? Using ideas from queuing theory, we develop provably optimal algorithms to jointly solve the caching and scheduling problems. Next, we focus on wireless relay networks. It is well accepted that network coding can enhance the performance of these networks by exploiting the broadcast nature of the wireless medium. This improvement is usually evaluated in terms of the number of required transmissions for delivering flow packets to their destinations. In this work, we study the effect of delay on the performance of network coding by characterizing a trade-off between latency and the performance gain achieved by employing network coding. More specifically, we associate a holding cost for delaying packets before delivery and a transmission cost for each broadcast transmission made by the relay node. Using a Markov decision process (MDP) argument, we prove a simple threshold-based policy is optimal in the sense of minimum long-run average cost. Finally, we analyze delay-sensitive applications in wireless peer-to-peer (P2P) networks. We consider a hybrid network which consists of (i) an expensive base station-to-peer (B2P) network with unicast transmissions, and (ii) a free broadcast P2P network. In such a framework, we study two popular applications: (a) a content distribution application with service deadlines, and (b) a multimedia live streaming application. In both problems, we utilize random linear network coding over finite fields to simplify the coordination of the transmissions. For these applications, we provide efficient algorithms to schedule the transmissions such that some quality of service (QoS) requirements are satisfied with the minimum cost of B2P usage. The algorithms are proven to be throughput optimal for sufficiently large field sizes and perform reasonably well for finite fields.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Delay-sensitive communication"

1

Jonsson, Magnus, Kristina Kunert, and Annette Böhm. "Increased Communication Reliability for Delay-Sensitive Platooning Applications on Top of IEEE 802.11p." In Lecture Notes in Computer Science, 121–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37974-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wright, Steven, and Yannis Viniotis. "Buffer Size Requirements for Delay Sensitive Traffic Considering Discrete Effects and Service-Latency in ATM Switches." In Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, 61–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45551-5_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Al Guqhaiman, Ahmed, Oluwatobi Akanbi, Amer Aljaedi, and C. Edward Chow. "Efficient Design of Underwater Acoustic Sensor Networks Communication for Delay Sensitive Applications over Multi-hop." In Advances in Intelligent Systems and Computing, 91–103. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70416-2_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Syed Masood, M., and P. Sheik Abdul Khader. "Effective Queue Management Using Fuzzy Logic for Congestion Control in Delay-Sensitive Applications Over Mobile Ad Hoc Networks." In Emerging Research in Computing, Information, Communication and Applications, 385–95. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0287-8_36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ritter, Michael, and Jorge García. "Determination of Traffic Descriptors for VPs Carrying Delay-Sensitive Traffic." In Broadband Communications, 3–15. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-0-387-34987-9_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shi, Rui, Xi Li, Hong Ji, and Heli Zhang. "Hybrid Caching Transmission Scheme for Delay-sensitive Service in Vehicular Networks." In Communications and Networking, 283–93. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-06161-6_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Awan, Irfan, and Muhammad Younas. "Towards QoS in Internet of Things for Delay Sensitive Information." In Communications in Computer and Information Science, 86–94. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03737-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Babu, Ravi, Udaya Kumar K. Shenoy, and Kiran Kumari Patil. "Lifetime Elongation of Wireless Sensor Networks with Mobile Sink in Delay-Sensitive Applications." In Communications in Computer and Information Science, 335–48. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-6427-2_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Thanigaivelu, K., and K. Murugan. "To Alleviate Congestion Using Hybrid Sink for Delay Sensitive Applications in Wireless Sensor Networks." In Communications in Computer and Information Science, 431–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14493-6_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zaheer, Tayyaba, Sarah Iqbal, Asad Waqar Malik, Anis U. Rahman, and Zeseya Sharmin. "Vehicle-assisted framework for delay-sensitive applications in smart cities." In Communication Technologies for Networked Smart Cities, 175–99. Institution of Engineering and Technology, 2021. http://dx.doi.org/10.1049/pbte090e_ch8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Delay-sensitive communication"

1

Khisti, Ashish. "Session MA2b: Delay sensitive communication." In 2011 45th Asilomar Conference on Signals, Systems and Computers. IEEE, 2011. http://dx.doi.org/10.1109/acssc.2011.6189946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Chonggang, Wei Wei, and Ting Wang. "Differentiated Scheduling for Delay-Sensitive and Delay-Tolerant Jobs in Optical Grids." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2009. http://dx.doi.org/10.1364/ofc.2009.omg3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Javed, Umar, Martin Suchara, Jiayue He, and Jennifer Rexford. "Multipath protocol for delay-sensitive traffic." In 2009 First International Communication Systems and Networks and Workshops (COMSNETS). IEEE, 2009. http://dx.doi.org/10.1109/comsnets.2009.4808885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Baccarelli, Enzo, Mauro Biagi, Nicola Cordeschi, and Cristian Pelizzoni. "Minimum-delay optimal scheduling for delay-sensitive bursty-traffic connections." In 2008 IEEE International Symposium on Wireless Communication Systems (ISWCS). IEEE, 2008. http://dx.doi.org/10.1109/iswcs.2008.4726056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Deng, Xi, and Yuanyuan Yang. "Cluster Communication Synchronization in Delay-Sensitive Wireless Sensor Networks." In 2013 IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS). IEEE, 2013. http://dx.doi.org/10.1109/dcoss.2013.68.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Katoh, Masafumi, Tomonori Kubota, Takeshi Yasuie, Yukihiro Watanabe, and Yuji Nomura. "Proposal of Management Agent for Delay Sensitive IoT Communication." In 2021 International Conference on Information Networking (ICOIN). IEEE, 2021. http://dx.doi.org/10.1109/icoin50884.2021.9334001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Roscher, Karsten, and Gerhard Maierbacher. "Reliable message forwarding in VANETs for delay-sensitive applications." In 2016 International Symposium on Wireless Communication Systems (ISWCS). IEEE, 2016. http://dx.doi.org/10.1109/iswcs.2016.7600900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Panigrahi, Bighnaraj, Sipra Behera, Samar Shailendra, Hemant Kumar Rath, and Arpan Pal. "Delay-sensitive Wireless Relaying in Multi-Robot Indoor Networks." In 2019 11th International Conference on Communication Systems & Networks (COMSNETS). IEEE, 2019. http://dx.doi.org/10.1109/comsnets.2019.8711060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Jingjun Zhang, Yuanbin Han, and Liguo Wang. "New topology aggregation mechanisms for delay-bandwidth sensitive networks." In 2008 11th IEEE Singapore International Conference on Communication Systems (ICCS). IEEE, 2008. http://dx.doi.org/10.1109/iccs.2008.4737283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

George, Emy Mariam, and Lillykutty Jacob. "Multi-Class Delay Sensitive Medical Packet Scheduling in Inter-WBAN Communication." In 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2019. http://dx.doi.org/10.1109/ants47819.2019.9117925.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!