Device to device (D2D) communication underlaying LTE can be used to distribute traffic loads of eNBs. However, a conventional D2D link is controlled by an eNB, and it still remains burdens to the eNB. We propose a completely distributed power allocation method for D2D communication underlaying LTE using deep learning. In the proposed scheme, a D2D transmitter can decide the transmit power witho...

Like in any distributed systems, communication in Multi-Agent System (MAS) plays an important role as it helps agents sharing knowledge and facilitating cooperation. Communication in MAS may present at various forms; it can be exchanging of comprehensible messages, or requesting to perform an action, or negotiating cooperation. Agent communication has common properties like in any other distrib...

With the development of computer network, the smart of communication agents was significantly increased, more intelligent process can be done by computers. To realize this, agents need more detailed concrete message to be transferred. But what should be transferred? How to transfer necessary message to improve the receiver’s understanding capability and not add too much communication load? In t...

This paper describes an automatic switching of modulation method to reconfigure transceivers of Software Defined Radio (SDR) based wireless communication system. The programmable architecture of Software Radio promotes a flexible implementation of modulation methods. This flexibility also translates into adaptively, which is used here to optimize the throughput of a wireless network, operating ...

This paper presents language features for High Performance Fortran (HPF) to specify non-local access patterns of distributed arrays, called halos, and to control the communication associated with these non-local accesses. Using these features crucial optimization techniques required for an e cient parallelization of irregular applications may be applied. The information provided by halos is uti...

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that...

Understanding the machine-type communication (MTC) traffic is a key for designing and optimizing a network and the applicable QoS scheme capable of providing adequate communication services without compromising the conventional services such as data, voice, and video. In this paper, we propose a framework for traffic modeling, generation, and load estimation for machine-type communication that ...

MPI standard offers a set of topology-aware interfaces that can be used to construct graph and Cartesian topologies for MPI applications. These interfaces have been mostly used for topology construction and not for performance improvement. To optimize the performance, in this paper we use graph embedding and node/network architecture discovery modules to match the communication topology of the ...

Since the message delivery time of asynchronous applications is unpredictable, each asynchronous process must probe (or poll) the network for new messages regularly. If polling is carried out too aggressively, a majority of the probes will be unsuccessful. However, the cost for probing the network is similar to the cost of communication operations. Thus, optimizing the message reception behavio...