A network is an interconnected collection of self-directed computers. Information can
be exchanged at a very quick pace. Allocation of resource diminishes the price
(Georgiadis et al., 2006). A file can have its copies on two or more computers of the
network. Meanwhile, they communicate through serial port which is a bit slow
compared to the USB port. Recognizing networking by means of the USB port involves
the inscription of a USB driver, though resourceful scheduling algorithms must consider
the fixed size for energy loading at each network node (Chen et al., 2006). In this paper,
the problem of assembling utility prime scheduling algorithms (Huang and Neely, 2011)
in a discrete stochastic network is considered, where the communication links have
time varying quantities, and the nodes are driven by restricted capacity energy storage
devices but are capable of harvesting energy. In each time period, the network decides how much new data to admit and how much power to assign over each communication
link for data broadcast.
|