A. Ephremides and B. Hajeck, "Information theory and communication networks: An unconsumated union," IEEE Trans. Information Theory, vol. 44, pp. 2416--2434, Oct 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....only if the existing packets at the source nodes can be carried away to their destinations with rate # almost surely. I. Introduction It is well known that an important issue neglected by the classical information theory is the bursty nature of the packet arrivals in real communication systems [1]. Even in multiuser environment, the classical approach essentially assumes that all the information exists in the sender nodes and the objective of a communication network is to deliver the information with a desired rate to the given destination. On the other hand, in real networks the data ....

....a to a neighboring node b V (a) such that the destination of the packet is d # N a . Define T = a, b, d) as the set of all triples, and let ) denote the power set of T . We define a network protocol (or, simply, a protocol) as follows. Suppose is a set of i.i.d. uniform[0,1] random variables. A network protocol is specified by a set of deterministic functions f t , t # 0, such that the value of f t shows the transmissions and receptions which take place in slot t. Namely, f t is a deterministic function which maps all information up to time t to one of ....

A. Ephremides and B. Hajek, "Information theory and communication networks: an unconsummated union," IEEE Trans. on Inf. Theory, vol. 44, no. 6, pp. 2416-2434, Oct. 1998.

....layer design, where information is exchanged between layers to enhance performance, is being explored as an alternative to the traditional design paradigm [17] In this context, allowing interaction between MAC and PHY layers seems natural, especially for wireless networks. As has been noted in [5], the field of random access uses rather simplistic models for the physical layer. As the sophistication of signal processing increases, it is necessary to consider more accurate models of the physical layer and redesign the MAC layer based on these models so as to improve the overall performance ....

Anthony Ephremides and Bruce Hajek. Information Theory and Communication Networks: An Unconsummated Union. IEEE Trans. Inform. Theory, 44(6):2416--2434, October 1998.

....optimal power sequence allocation is derived in Section 2.2.2 in both non asymptotical and asymptotical fiat fading regimes. The maximization of the sum capacity in the oversaturated CDMA systems for fading channels led us to disregard the delay constraints (QoS requirements) of specific users [68]. In the delay sensitive applications, the symmetric capacity of [18] or the delay limited capacities of the system [20] 29] are more appropriate information theoretic measures. The benefits of reducing the complexity of the joint optimal decoder through allocation of sequences in orthogonal ....

A. Ephremides and B. Hajek, "Information theory and communication networks: An unconsummated union," IEEE Trans. on Inform. Theory, pp. 2619 2692, Oct. 1998.

....state information on centralized or decentralized resource allocation are information theoretic in nature. Information theoretic studies assume that data is always present at each user and this makes the analysis of network throughput, delay and buffer overflow with bursty sources difficult [14] [15]. The field of random access protocols is an approach to the multi access problem that explicitly takes into account the burstiness of sources. In this paper, we will consider the use of decentralized channel state information for the design of random access protocols in the MAC layer. As has ....

....access protocols is an approach to the multi access problem that explicitly takes into account the burstiness of sources. In this paper, we will consider the use of decentralized channel state information for the design of random access protocols in the MAC layer. As has been noted in [14] [15], the field of random access is built upon simplistic models for the physical layer. Random access protocols like traditional ALOHA, splitting algorithms and CSMA have all been developed assuming that the physical layer behaves like a collision channel. To conduct a meaningful study of the use CSI ....

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416-2434, October 1998.

....state information on centralized or decentralized resource allocation are information theoretic in nature. Information theoretic studies assume that data is always present at each user and this makes the analysis of network throughput, delay and buffer overflow with bursty sources difficult [14] [15]. The field of random access protocols is an approach to the multi access problem that explicitly takes into account the burstiness of sources. In this paper, we will consider the use of decentralized channel state information for the design of random access protocols in the MAC layer. As has ....

....access protocols is an approach to the multi access problem that explicitly takes into account the burstiness of sources. In this paper, we will consider the use of decentralized channel state information for the design of random access protocols in the MAC layer. As has been noted in [14] [15], the field of random access is built upon simplistic models for the physical layer. Random access protocols like traditional ALOHA, splitting algorithms and CSMA have all been developed assuming that the physical layer behaves like a collision channel. To conduct a meaningful study of the use CSI ....

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416-2434, October 1998.

....for solutions of practical problems of communication networks has not given much time for making solid theoretical foundations. But, on the other hand, being mainly concerned with non bursty sources and point to point delay insensitive traffic, information theory also has not offered much help [1]. Resource sharing, based on the periods of source inac tivity, is one of the main features that made networks so popular. Therefore, information theoretic analysis of bursty traffic could make some useful contributions in narrowing the gap between information theory and communication networks. ....

A.Ephremides and B.Hajek,"Information theory and communication networks: an unconsummated union," IEEE Trans. on Information Theory, vol. 44, pp. 2416-2434. 1998.

....optimal power sequence allocation is derived in Section II.B in both non asymptotical and asymptotical fiat fading regimes. The maximization of the sum capacity in the oversat urated CDMA systems for fading channels led us to disregard the delay constraints (QoS requirements) of specific users [5]. In the delay sensitive applications, the symmetric pacity of [11] or the delay limited capacities of the system [4] 18] are more appropriate information theoretic measures. APPENDIX A Proof of the Lemma 1: Using the asymptotic weak convergence of ordered statistics (8) the distribution of ....

A.Ephremides, B. Hajek, 'Information Theory and Communication Networks: An Unconsummated Union', IEEE Trans. on Inform. Theory, vol.44, pp. 2619-2692, Oct 1998.

....flat fading channels are discussed. The optimal power sequence allocation is derived for asymptotical flat fading regimes. The maximization of the sum capacity in the oversaturated CDMA systems for fading channels led us to disregard the delay constraints (QoS requirements) of specific users [5]. ....

A.Ephremides, B. Hajek, 'Information Theory and Communication Networks: An Unconsummated Union', IEEE Trans. on Inform. Theory, vol.44, pp. 2619-2692, Oct 1998.

....within this infrastructure. Although the simultaneous routing and resource allocation often gives significant performance improvements over classical (non coordinated) approaches, it does not address the information theoretic question about the ultimate capacity of a wireless network (see, e.g. [14, 26, 27] for recent research on network information theory) In addition, the work in this paper does not directly address some important practical issues in wireless data networks, such as quality of service (e.g. 28, 29] An extension of the SRRA formulation in this direction seems very attractive ....

A. Ephremides and B. Hajek. Information theory and communication networks: An unconsummated union. IEEE Trans. Inform. Theory, 44(6):2416 2434, 1998.

....to achieve recovery under different failure scenarios. Apart from Gallager s 1976 paper [4] on the protocol information needed to keep track of source and receiver addresses and of the starting and stopping of messages, not much theoretical work has been done in the area of network management [5]. We describe network behavior by a code specifying the relationships between the signals on the input and output links of each node, which may have to change in order to recover from different link failures. The network management information needed to effect the appropriate changes in network ....

A. Ephremides and B. Hajek, "Information Theory and Com- munication Networks: An Unconsummated Union", IEEE Transactions on Information Theory, vol. 44, 1998.

....the number of nodes in a bounded domain is increased, while excluding them from open neighborhoods of the source and destination; see [16] Y Y 2 m Figure 1: The Gaussian broadcast channel. X X 2 m Figure 2: The Gaussian multiple access channel. However, as observed in [17], the union between information theory and networks is not wholly consummated. The capacity region of even the simple four node system with two sources and two receivers shown in Figure 3, the so called interference channel originally studied by Shannon (see [18] 19] is unknown when the ....

A. Ephremides and B. Hajek, \Information theory and communication networks: An unconsummated union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416-2434, 1998.

No context found.

A. Ephremides and B. Hajeck, "Information theory and communication networks: An unconsumated union," IEEE Trans. Information Theory, vol. 44, pp. 2416--2434, Oct 1998.

No context found.

A. Ephremides and B. Hajeck. Information theory and communication networks: An unconsumated union. IEEE Trans. Information Theory, 44:2416--2434, Oct 1998.

No context found.

A. Ephremides and B. Hajek, \Information Theory and Communication Networks: An Unconsummated Union." IEEE Trans. on Information Theory, 44(6):2416-2434, 1998.

No context found.

A. Ephremides and B. Hajek, Information theory and communication networks: an unconsummated union, IEEE Trans. on Inf. Theory, IT-44 (1998) 2416-2434.

No context found.

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union." IEEE Trans. on Information Theory, Vol 44, pp. 2416--2434, 1998.

No context found.

A. Ephremides and B. Hajek, \Information Theory and Communication Networks: An Unconsummated Union." IEEE Trans. on Information Theory, 44(6):2416-2434, 1998.

No context found.

A. Ephremides and B. Hajek. Information theory and communication networks: An unconsummated union. IEEETIT: IEEE Transactions on Information Theory, 44, 1998.

No context found.

A. Ephremides and B. Hajeck, "Information theory and communication networks: An unconsumated union," IEEE Trans. Information Theory, vol. 44, pp. 2416--2434, Oct 1998.

No context found.

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416--2434, October 1998.

No context found.

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416--2434, October 1998.

No context found.

A. Ephremides and B. Hajek. Information theory and communication networks: An unconsummated union. IEEETIT: IEEE Transactions on Information Theory, 44, 1998.

No context found.

A. Ephremides and B. Hajek, "Information Theory and Communication Networks: An Unconsummated Union," IEEE Trans. Inform. Theory, vol. 44, pp. 2416--2434, October 1998.

No context found.

Anthony Ephremides and Bruce Hajek, "Information theory and communication networks: An unconsummated union," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2416--2434, Oct. 1998.

No context found.

A. Ephremides and B. Hajek, "Information theory and communication networks: An unconcummated union," IEEE Trans. on Information Theory 44, pp. 2416--2434, Oct 1998.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC