To see the other types of publications on this topic, follow the link: Distributed time slot assignment.

Journal articles on the topic 'Distributed time slot assignment'

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Distributed time slot assignment.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Bekmezci, Ilker, and Fatih Alagöz. "Delay Sensitive, Energy Efficient and Fault Tolerant Distributed Slot Assignment Algorithm for Wireless Sensor Networks under Convergecast Data Traffic." International Journal of Distributed Sensor Networks 5, no. 5 (2009): 557–75. http://dx.doi.org/10.1080/15501320802300123.

Full text
Abstract:
The scarcest resource for most of the wireless sensor networks (WSNs) is energy and the major factor in energy consumption for WSNs is communication. Not only transmission, but also reception is the source of energy consumption. The lore to decrease energy consumption is to turn off the radio circuit when it is not needed. This is why TDMA is advantageous over contention based methods. A time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, a centralized approach is not scalable. In this articl
APA, Harvard, Vancouver, ISO, and other styles
2

Bekmezci, Ilker, and Fatih Alagoz. "A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic." Journal of Communications Software and Systems 2, no. 4 (2017): 331. http://dx.doi.org/10.24138/jcomss.v2i4.278.

Full text
Abstract:
The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors inenergy consumption for WSNs is due to communication. Notonly transmission but also reception is the source of energyconsumption. The lore to decrease energy consumption is toturn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper
APA, Harvard, Vancouver, ISO, and other styles
3

Lei, Jianjun, Jianhua Jiang, and Fengjun Shang. "Channel Assignment Mechanism for Multiple APs Cochannel Deployment in High Density WLANs." Wireless Communications and Mobile Computing 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/6931765.

Full text
Abstract:
In Wireless Local Area Networks (WLANs), cochannel deployment can bound channel access delay and improve network capacity due to mitigating the collision and interference among different Access Points (APs). In this paper, we present a network model and an interference model for multiple APs cochannel deployment and propose a channel assignment mechanism which formulates the channel assignment problem into a time slot allocation problem. Meanwhile, we assign the channel based on the vertex coloring algorithm and make extra polls by utilizing the time slot reservation strategy to improve the ch
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Hui, Bi Sheng Quan, and Zi Chun Le. "Routing, Wavelength and Time-Slot Assignment Algorithm for Dynamic Traffic in WDM-TDM Optical Networks." Applied Mechanics and Materials 303-306 (February 2013): 2027–32. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.2027.

Full text
Abstract:
Due to the lower channel utilization in conventional wavelength-routed networks, TDM technique is implemented on top of WDM to achieve a WDM-TDM network. RWTA problem in WDM-TDM networks is discussed. With the idea that assigned time-slots of one session can be distributed in multiple different wavelengths and the objective of minimizing network blocking probability, a RWTA algorithm called MUMD was proposed for dynamic traffic in mesh single-fiber networks. Then we demonstrate the performance of the proposed MUMD algorithm through numerical simulation. The results show that MUMD can efficient
APA, Harvard, Vancouver, ISO, and other styles
5

Hao, Shenxue, Licai Yang, Li Ding, and Yajuan Guo. "Distributed Cooperative Backpressure-Based Traffic Light Control Method." Journal of Advanced Transportation 2019 (March 5, 2019): 1–14. http://dx.doi.org/10.1155/2019/7481489.

Full text
Abstract:
On the foundation of the original backpressure-based traffic light control algorithm, a distributed cooperative backpressure-based traffic light control method is proposed in this paper. The urban traffic network is modeled as a smart agent-controlled queuing network, in which the intersection agents exchange the queue length information and the selected activating light phase information of neighboring intersections through communications and determine the activating light phase at each time slot according to local traffic information. The improved phase pressure computation method considers
APA, Harvard, Vancouver, ISO, and other styles
6

Yakoh, Takahiro, Tohru Iwasawa, and Yuichiro Anzai. "A Dynamic Time-slot Assignment Mechanism for Wireless Packet Communication in Open and Distributed Multi-Robot Environment." Journal of the Robotics Society of Japan 12, no. 8 (1994): 1157–65. http://dx.doi.org/10.7210/jrsj.12.1157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mohammadani, Khalid Hussain, Kamran Ali Memon, Imran Memon, Nazish Nawaz Hussaini, and Hadiqua Fazal. "Preamble time-division multiple access fixed slot assignment protocol for secure mobile ad hoc networks." International Journal of Distributed Sensor Networks 16, no. 5 (2020): 155014772092162. http://dx.doi.org/10.1177/1550147720921624.

Full text
Abstract:
Mobile ad hoc networks are the “spontaneous networks” which create a temporary network in any place and any time without using any extra fixed radio device of a full infrastructure network. Each device in this network works as a router to develop end-to-end communication connections and move independently in any direction. Mostly, mobile ad hoc networks use the IEEE 802.11b protocol with carrier-sense multiple access with collision avoidance medium access control layer protocol for sharing a common medium among the nodes simultaneously. Due to this distributed medium, the routing and medium ac
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Jiaxin, Ke Xiong, Jie Cao, Xi Yang, and Tong Liu. "Energy Efficiency in RF Energy Harvesting-Powered Distributed Antenna Systems for the Internet of Things." Sensors 20, no. 16 (2020): 4631. http://dx.doi.org/10.3390/s20164631.

Full text
Abstract:
This paper studies a distributed antenna system (DAS) network with radio frequency (RF) energy harvesting (EH) technology where the distributed antenna ports (DAPs) transmit energy and information to multiple users simultaneously. The time division multiple access (TDMA) protocol is adopted, so for each time slot is allowed to receive information, while the rest of the users harvest energy. In order to maximize the system energy efficiency (EE), subject to the EH requirements and data rate requirements of the users, the transmission time and power assignment are jointly optimized. In order to
APA, Harvard, Vancouver, ISO, and other styles
9

Bo, Zeng, Yabo Dong, Jie He, and Lu Dongming. "An Energy-Efficient One-Shot Scheduling Algorithm for Wireless Sensor Networks." Journal of Sensors 2021 (November 22, 2021): 1–15. http://dx.doi.org/10.1155/2021/9999403.

Full text
Abstract:
In low-load wireless sensor networks, the power consumption of the node consists mainly of two parts: data transmission and node state switching. The lower node workload causes low energy consumption on data transmission, and the state switching energy of the node cannot be ignored. This paper proposes a one-shot time division multiple access (TMDA) scheduling with unlimited channels (SUC) on the assumption that the number of available channels is unlimited. SUC combines the receiver-based consecutive slot allocation with channel allocation, which minimises the number of node state switching a
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Bin, Jennifer C. Hou, and Ching‐Chih Han. "On dynamically establishing and terminating isochronous message streams in WDM star‐based lightwave networks." Journal of High Speed Networks 11, no. 1 (2002): 45–66. https://doi.org/10.3233/hsn-2002-214.

Full text
Abstract:
Complement to our prior work in [21], we address in this paper the problem of dynamically establishing/terminating real‐time message streams in response to call setup/clear requests in single‐hop star‐coupled WDM optical networks. We consider a network architecture in which N stations are connected to a star coupler with W data channels (W≤N) and one control channel. Each of the W data channels is slotted and shared by the N stations by means of time division multiplexing. The control channel is used for stations to coordinate the call establishment and termination operations. We propose a dis
APA, Harvard, Vancouver, ISO, and other styles
11

Ismail, Razi Azrie, Nur Haliza Abdul Wahab, Khairunnisa A. Kadir, et al. "Dental Service System into Blockchain Environment." International Journal of Innovative Computing 13, no. 1 (2023): 47–58. http://dx.doi.org/10.11113/ijic.v13n1.394.

Full text
Abstract:
A platform that enables users to schedule appointments and connect with dentists is called the Dental Services System. The bulk of appointment slot orders are placed through more traditional channels, such phone calls, texts, or clinic entrances, prior to obtaining treatment. When staff members are unable to alter their status or take too long to provide information, schedule a time, or complete an assignment, this might be troublesome. Blockchain technology is a distributed ledger system that makes use of mathematics, algorithms, encryption, and financial factors. Blockchain's high-security d
APA, Harvard, Vancouver, ISO, and other styles
12

Tung, Tran Van, To Truong An, and Byung Moo Lee. "Joint Resource and Trajectory Optimization for Energy Efficiency Maximization in UAV-Based Networks." Mathematics 10, no. 20 (2022): 3840. http://dx.doi.org/10.3390/math10203840.

Full text
Abstract:
The explosive growth of unmanned aerial vehicles (UAVs)-based networks has accelerated in recent years. One of the crucial tasks of a UAV-based network is managing and allocating resources, including time, power, fly trajectory, and energy resources. We investigate a UAV-based network that gathers information from smart devices, sensor devices, and IoT devices (IDs) with respect to energy efficiency (EE) maximization. The EE of users served by the UAV over the time slots of a cycle is maximized through three categories: UAV trajectory optimization, power allocation, and time slot assignment. H
APA, Harvard, Vancouver, ISO, and other styles
13

Burkard, R. E. "Time-slot assignment for TDMA-systems." Computing 35, no. 2 (1985): 99–112. http://dx.doi.org/10.1007/bf02260498.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Kwon, Bo-Seob. "Time Slot Assignment Algorithm with Graph Coloring." Journal of the Korea Contents Association 8, no. 5 (2008): 52–60. http://dx.doi.org/10.5392/jkca.2008.8.5.052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Wen-Tsuen Chen, Pi-Rong Sheu, and Jiunn-Hwa Yu. "Time slot assignment in TDM multicast switching systems." IEEE Transactions on Communications 42, no. 1 (1994): 149–65. http://dx.doi.org/10.1109/26.275310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

N, Pavitha. "EFFICIENT AND FAST INFORMATION GATHERING IN SENSOR NETWORK ORGANISED AS A TREE." International Journal of Research -GRANTHAALAYAH 1, no. 1 (2014): 35–42. http://dx.doi.org/10.29121/granthaalayah.v1.i1.2014.3084.

Full text
Abstract:
In a network organised as a tree how fast the data can be collected is a fundamental objective of this paper. To address this, a number of different techniques are explored and evaluated using realistic simulation models under the many-to-one communication paradigm known as converge cast. Use of TDMA scheduling gives better performance in case of many to one communication. Channel assignment methods such as BFS time slot assignment, Local time slot assignment and multichannel scheduling algorithm Joint Frequency time slot scheduling for moderate size networks of about 100 nodes, by using multi
APA, Harvard, Vancouver, ISO, and other styles
17

Pavitha, N. "EFFICIENT AND FAST INFORMATION GATHERING IN SENSOR NETWORK ORGANISED AS A TREE." International Journal of Research – Granthaalayah 1, no. 1 (2017): 35–42. https://doi.org/10.5281/zenodo.884568.

Full text
Abstract:
In a network organised as a tree how fast the data can be collected is a fundamental objective of this paper. To address this, a number of different techniques are explored and evaluated using realistic simulation models under the many-to-one communication paradigm known as converge cast. Use of TDMA scheduling gives better performance in case of many to one communication. Channel assignment methods such as BFS time slot assignment, Local time slot assignment and multichannel scheduling algorithm Joint Frequency time slot scheduling for moderate size networks of about 100 nodes, by using multi
APA, Harvard, Vancouver, ISO, and other styles
18

Han, Xiaofeng, Yan Li, and Guodong Liu. "Study on the Optimization and Performance of TDMA Allocation Algorithm in Ships’ Ad Hoc Networks." Polish Maritime Research 25, s2 (2018): 170–75. http://dx.doi.org/10.2478/pomr-2018-0089.

Full text
Abstract:
Abstract This paper analyzes the requirements of the information transmission network of ship integrated condition monitoring system, and proposes a design scheme of ship condition monitoring system based on wireless ad hoc network. The wireless ad hoc network protocol was designed, its networking process was analyzed in detail, and the network transmission performance of the monitoring system was tested. The results proved the feasibility of the system. The above solution can be used for the transmission of ship state information that satisfies the requirements of wireless transmission, and h
APA, Harvard, Vancouver, ISO, and other styles
19

Zeng, Bin, Jing Zhang, and Hai Qing Liu. "Optimal Channel Assignment Algorithm for Wireless Networks." Advanced Materials Research 211-212 (February 2011): 993–97. http://dx.doi.org/10.4028/www.scientific.net/amr.211-212.993.

Full text
Abstract:
In wireless cellular network, users will share the time-slots channel and bandwidth with voice users. With the characteristic of dynamic slot allocation, some time slots can be allocated to one single user. How to choose the slot allocation methodology is a significant problem when considering the system revenue and users’ satisfaction. A new model based on improvement of Markov Decision Process) is developed that can combines the original maximum system revenue model and the call blocking constraints, and will find out the optimal policy of time slots allocation. The experiment result shows t
APA, Harvard, Vancouver, ISO, and other styles
20

Han, Shi-Yuan, and Chang-Yue Zhang. "ASMAC: An Adaptive Slot Access MAC Protocol in Distributed VANET." Electronics 11, no. 7 (2022): 1145. http://dx.doi.org/10.3390/electronics11071145.

Full text
Abstract:
The media access control (MAC) protocol is responsible for channel resource sharing and conflict management in the communication process in VANET, which is of great significance for ensuring efficient and reliable communication. The existing MAC protocol with fixed time slot allocation cannot solve the problem of time slot resource exhaustion or waste when the traffic density is unbalanced. In this paper, we propose an adaptive time slot access MAC protocol in distributed VANET (ASMAC). ASMAC adapts the access time slot according to the driving direction of the vehicle and the traffic density
APA, Harvard, Vancouver, ISO, and other styles
21

Sourour, E. "Time slot assignment techniques for TDMA digital cellular systems." IEEE Transactions on Vehicular Technology 43, no. 1 (1994): 121–27. http://dx.doi.org/10.1109/25.282272.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Chen, A., A. K. S. Wong, and C. T. Lea. "Routing and Time-Slot Assignment in Optical TDM Networks." IEEE Journal on Selected Areas in Communications 22, no. 9 (2004): 1648–57. http://dx.doi.org/10.1109/jsac.2004.833832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Bonuccelli, M. A., I. Gopal, and C. K. Wong. "Incremental time-slot assignment in SS/TDMA satellite systems." IEEE Transactions on Communications 39, no. 7 (1991): 1147–56. http://dx.doi.org/10.1109/26.87220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Park, Junyoung, Sunggu Lee, and Sungjoo Yoo. "Time slot assignment for convergecast in wireless sensor networks." Journal of Parallel and Distributed Computing 83 (September 2015): 70–82. http://dx.doi.org/10.1016/j.jpdc.2015.05.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Jia, Gu, Yu Wen Wang, Fan Ji Meng, Guo Hua Ye, and Guo Lin Wang. "An Adaptive TDMA Slot Assignment Algorithm for Scalable Wireless Mesh Networks." Applied Mechanics and Materials 392 (September 2013): 872–75. http://dx.doi.org/10.4028/www.scientific.net/amm.392.872.

Full text
Abstract:
The media access control (MAC) protocol based on fixed slot allocation has low throughput and high delay in high load wireless mesh network. In order to improve the performance of wireless mesh network, we propose a scalable adaptive time division multiple access (TDMA) slot allocation algorithm based on the existing fixed TDMA. The algorithm uses the network structure of clustering and builds a more optimized frame structure, cluster head dynamically allocates time slot according to the packet number of the cluster member sent and the priority level, at the same time taking into account the s
APA, Harvard, Vancouver, ISO, and other styles
26

Shan, Guangjun, Guangxi Zhu, and Deming Liu. "Study on the problem of routing, wavelength, and time-slot assignment towards optical time-slot switching technology." Photonic Network Communications 22, no. 2 (2011): 162–71. http://dx.doi.org/10.1007/s11107-011-0316-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Chalasani, S., and A. Varma. "Parallel algorithms for time-slot assignment in TDM switching systems." IEEE Transactions on Communications 41, no. 11 (1993): 1736–47. http://dx.doi.org/10.1109/26.241754.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Bertossi, A., G. Bongiovanni, and M. Bonuccelli. "Time Slot Assignment in SS/TDMA Systems with Intersatellite Links." IEEE Transactions on Communications 35, no. 6 (1987): 602–8. http://dx.doi.org/10.1109/tcom.1987.1096831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Roorda, P. D., and V. C. M. Leung. "Dynamic control of time slot assignment in multiaccess reservation protocols." IEE Proceedings - Communications 143, no. 3 (1996): 167. http://dx.doi.org/10.1049/ip-com:19960474.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Ismayilova, Nergiz A., Mujgan Sağir, and Rafail N. Gasimov. "A multiobjective faculty–course–time slot assignment problem with preferences." Mathematical and Computer Modelling 46, no. 7-8 (2007): 1017–29. http://dx.doi.org/10.1016/j.mcm.2007.03.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Ren, Gao, Tang Long, and Hu Wen. "A Dynamic Time-slot Assignment for Ground Wireless Sensor Network." International Journal of Future Generation Communication and Networking 9, no. 7 (2016): 239–56. http://dx.doi.org/10.14257/ijfgcn.2016.9.7.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Barcaccia, P., and M. A. Bonuccelli. "Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems." IEEE/ACM Transactions on Networking 2, no. 3 (1994): 247–51. http://dx.doi.org/10.1109/90.311622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Sari, Wiktasari, and Jatmiko Endro Suseno. "Metode Simulated Annealing untuk Optimasi Penjadwalan Perkuliahan Perguruan Tinggi." JURNAL SISTEM INFORMASI BISNIS 6, no. 2 (2016): 133. http://dx.doi.org/10.21456/vol6iss2pp133-143.

Full text
Abstract:
Course scheduling an assignment of courses and lecturers in the available time slots involving certain restrictions. Simulated annealing is a heuristic method can be used as search method and provide acceptable solutions with good results. The research aims to make scheduling courses at the college using simulated annealing using five variables data that lecturer courses, the time slot is comprised of the day and the time period and class room. The research has two objective functions to be generated, the first is the assignment of a lecturer on courses that will be of teaching, second lecture
APA, Harvard, Vancouver, ISO, and other styles
34

Xie, Na, Zhidong Liu, Xiqun (Michael) Chen, and Shen Li. "Fair Assignment for Reserved Nucleic Acid Testing." Sustainability 14, no. 18 (2022): 11752. http://dx.doi.org/10.3390/su141811752.

Full text
Abstract:
Corona Virus Disease 2019 (COVID-19) is now treating the health of millions of people worldwide. The Chinese government now applies nucleic acid testing as a tool to detect patients from healthy people to control the spread of COVID-19. However, people may come to the nucleic acid testing stations simultaneously, leading to long queues and wasting time. In this paper, we proposed the reserved nucleic acid testing method, which could be easily implemented via Web applications associated with nucleic acid testing. Its key idea is to assign people to different pre-scheduled time slots so that the
APA, Harvard, Vancouver, ISO, and other styles
35

Lee, Heyung Sub Lee, Un Gi Joo Joo, Hyeong Ho Lee Lee, and Whan Woo Kim Kim. "Optimal Time Slot Assignment Algorithm for Combined Unicast and Multicast Packets." ETRI Journal 24, no. 2 (2002): 172–75. http://dx.doi.org/10.4218/etrij.02.0202.0201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Chalasani, S., and A. Varma. "An improved time-slot assignment algorithm for TDM hierarchical switching systems." IEEE Transactions on Communications 41, no. 2 (1993): 312–17. http://dx.doi.org/10.1109/26.216505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Bonuccelli, M. A. "A fast time slot assignment algorithm for TDM hierarchical switching systems." IEEE Transactions on Communications 37, no. 8 (1989): 870–74. http://dx.doi.org/10.1109/26.31186.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Sheu, Pi-Rong, and Charng-Maw Lin. "An optimal time slot assignment algorithm for CRMA high-speed networks." Computer Communications 21, no. 7 (1998): 675–85. http://dx.doi.org/10.1016/s0140-3664(97)00191-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Kim, Sehun, and Jae-In Kim. "An adaptive time slot assignment algorithm for variable bandwidth switching systems." Computers & Operations Research 27, no. 5 (2000): 423–35. http://dx.doi.org/10.1016/s0305-0548(99)00060-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Pomalaza-Ráez, Carlos A. "SS/TDMA time-slot assignment with knowledge-base and prolog implementation." International Journal of Satellite Communications 7, no. 1 (1989): 55–63. http://dx.doi.org/10.1002/sat.4600070109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Khan, Mushtaq, Rahim Khan, Nadir Shah, et al. "Sensing and Device Neighborhood-Based Slot Assignment Approach for the Internet of Things." Applied Sciences 13, no. 8 (2023): 4682. http://dx.doi.org/10.3390/app13084682.

Full text
Abstract:
Concurrent communication constitutes one of the challenging issues associated with IoT networks, as it is highly likely that multiple devices may start communication simultaneously. This issue has become more complex as devices belonging to the IoT networks increasingly become mobile. To resolve this issue, various mechanisms have been reported in the literature. However, none of these approaches has considered the neighborhood information of a server module to resolve this issue. In this paper, a neighborhood-based smart slot allocation scheme for the IoT is presented where member devices are
APA, Harvard, Vancouver, ISO, and other styles
42

Mondal, Sakib A. "Resource allocation problem under single resource assignment." RAIRO - Operations Research 52, no. 2 (2018): 371–82. http://dx.doi.org/10.1051/ro/2017035.

Full text
Abstract:
We consider a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost. Each resource has a start time, finish time, availability and cost. The objective of the problem is to assign resources to meet the demands so that the overall cost is minimum. It is necessary that only one resource contributes to the demand of a slot. This constraint will be referred to as single resource assignment (SRA) constraint. We would refer to the problem as the S_RA problem. So far, only 16-approximation to this problem is known. In this paper, we
APA, Harvard, Vancouver, ISO, and other styles
43

Zhao, Lin, Hao Fu, and Mu Su. "Optimal Energy-Aware Scheduling of Heterogeneous Jobs with Monotonically Increasing Slot Costs." Symmetry 17, no. 7 (2025): 980. https://doi.org/10.3390/sym17070980.

Full text
Abstract:
Energy-aware scheduling plays a critical role in modern computing and manufacturing systems, where energy consumption often increases with job execution order or resource usage intensity. This study investigates a scheduling problem in which a sequence of heterogeneous jobs—classified as either heavy or light—must be assigned to multiple identical machines with monotonically increasing slot costs. While the machines are structurally symmetric, the fixed job order and cost asymmetry introduce significant challenges for optimal job allocation. We formulate the problem as an integer linear progra
APA, Harvard, Vancouver, ISO, and other styles
44

Kabaciński, Wojciech, and Remigiusz Rajewski. "Wide-Sense Nonblocking Converting-Converting Networks with Multirate Connections." Sensors 22, no. 16 (2022): 6217. http://dx.doi.org/10.3390/s22166217.

Full text
Abstract:
In this paper, we consider a two-stage converting-converting (CC) switching network. This structure can be used, for instance, in switches of elastic optical networks (EONs) or in time-division switches. We propose a new routing algorithm based on fixed slot assignment in interstage links. This algorithm, called Fixed Input–interstage Slot Assignment (FISA), reduces the switching network complexity compared to the rearrangeable (RNB) switching networks of the same structure. We derive the wide-sense nonblocking (WNB) conditions for the switching network controlled by this algorithm. The obtain
APA, Harvard, Vancouver, ISO, and other styles
45

Yeung, K. L. "Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems." IEEE Transactions on Communications 49, no. 2 (2001): 351–59. http://dx.doi.org/10.1109/26.905898.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Chen, Weiwei, and Chin-Tau Lea. "A Node-Based Time Slot Assignment Algorithm for STDMA Wireless Mesh Networks." IEEE Transactions on Vehicular Technology 62, no. 1 (2013): 272–83. http://dx.doi.org/10.1109/tvt.2012.2214492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Chalasani, S. "A new parallel algorithm for time-slot assignment in hierarchical switching systems." IEEE Transactions on Computers 46, no. 12 (1997): 1387–95. http://dx.doi.org/10.1109/12.641940.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Kim, Soo-Hyun, and Sehun Kim. "Time slot assignment in a heterogeneous environment of a SS/TDMA system." International Journal of Satellite Communications 15, no. 5 (1997): 197–203. http://dx.doi.org/10.1002/(sici)1099-1247(199709/10)15:5<197::aid-sat576>3.0.co;2-j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Haque, Md Niaz Morshedul, Young-Doo Lee, and Insoo Koo. "Deep Learning-Based Scheduling Scheme for IEEE 802.15.4e TSCH Network." Wireless Communications and Mobile Computing 2022 (March 18, 2022): 1–17. http://dx.doi.org/10.1155/2022/8992478.

Full text
Abstract:
IEEE 802.15.4e time-slotted channel hopping (TSCH) is one of the most reliable resources of the Industrial Internet of Things (IIoT). TSCH operates on the slot-frame structure consisting of multiple channel-offsets and multiple slot-offsets. It is gaining acceptance due to its simple architecture and consume low power in industrial applications. The performance of TSCH is mainly dominated by the media access control (MAC) mechanism, which covers the refitment, enumeration, composition, and data transmission. However, in many cases, the data transmission schedules are not accurately prescribed.
APA, Harvard, Vancouver, ISO, and other styles
50

Hong, Shengyan, Thidapat Chantem, and Xiaobo Sharon Hu. "Local-Deadline Assignment for Distributed Real-Time Systems." IEEE Transactions on Computers 64, no. 7 (2015): 1983–97. http://dx.doi.org/10.1109/tc.2014.2349494.

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!