Results 1 - 10
of
29
Packet Switching In Radio Channels: Part III -- Polling and . . .
- IEEE TRANSACTIONS ON COMMUNICATIONS
, 1976
"... Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packet-switched radio channel. The allocation of bandwidth among the contend ..."
Abstract
-
Cited by 309 (3 self)
- Add to MetaCart
Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packet-switched radio channel. The allocation of bandwidth among the contending terminals can befixed [e.g., time-division multiple access (TDMA) or frequency-division multiple access (FDMA)]-,rundom [e.&, ALOHA or carrier sen? multiple access (CSMA)] or centrally controlled (e.g., polling or reservation). In this paper we show that with a large population of bursty users, (as expected) random access is superior to both futed assignment and polling. We also introduce and analyze a dynamic reservation technique which we call split-channel reservation multiple access (SRMA) which is interesting in that it is both simple and efficient over a large range of system parameters.
IP-based Protocols for Mobile Internetworking
, 1991
"... We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and routing because their location, and hence the route to reach them, cannot be deduced from their network address. In this p ..."
Abstract
-
Cited by 191 (4 self)
- Add to MetaCart
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and routing because their location, and hence the route to reach them, cannot be deduced from their network address. In this paper, we explore the concept of providing continuous network access to mobile computers, and present a set of IP-based protocols that achieve that goal. They are primarily targeted at supporting a campus environment with mobile computers, but also extend gracefully to accommodate hosts moving between different networks. The key feature is the dependence on ancillary machines, the Mobile Support Stations (MSSs), to track the location of the Mobile Hosts. Using a combination of caching, forwarding pointers, and timeouts, a minimal amount of state is kept in each MSS. The state information is kept in a distributed fashion; the system scales well, reacts quickly to changing topologies, and does ...
Security mechanisms in high-level network protocols
- ACM Computing Surveys
, 1983
"... The implications of adding security mechanisms to high-level network protocols operating in an open-system environment are analyzed. First the threats to security that may arise in such an environment are described, and then a set of goals for communications security measures is established. This is ..."
Abstract
-
Cited by 131 (0 self)
- Add to MetaCart
The implications of adding security mechanisms to high-level network protocols operating in an open-system environment are analyzed. First the threats to security that may arise in such an environment are described, and then a set of goals for communications security measures is established. This is followed by a brief description of the two basic
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
- In ACM Symposium on Principle of Distributed Computing (PODC
, 2001
"... bahl~microsoft, corn ymwang~microsoft, corn rogerwa~microsoft, corn The topology of a wireless multi-hop network can be con-trolled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based dis-tributed topology control algorithm. This algorithm, intr ..."
Abstract
-
Cited by 115 (9 self)
- Add to MetaCart
bahl~microsoft, corn ymwang~microsoft, corn rogerwa~microsoft, corn The topology of a wireless multi-hop network can be con-trolled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based dis-tributed topology control algorithm. This algorithm, intro-duced in [16], does not assume that nodes have GPS in-formation available; rather it depends only on directional information. Roughly speaking, the basic idea of the algo-rithm is that a node u transmits with the minimum power P~,,a required to ensure that in every cone of degree a around u, there is some node that u can reach with power Pma- We show that taking a = 57r/6 is a necessary and sufficient con-dition to guarantee that network connectivity is preserved. More precisely, if there is a path from a to t when every node communicates at maximum power then, if a < _ 5~r/6, there is still a path in the smallest symmetric graph Ga con-taining all edges (u, v) such that u can communicate with v using power p~,a. On the other hand, if ~> 51r/6, connec-tivity is not necessarily preserved. We also propose a set of optimizations that further reduce power consumption and prove that they retain network connectivity. Dynamic re-configuration in the presence of failures and mobility is also discussed. Simulation results are presented to demonstrate the effectiveness of the algorithm and the optimizations. 1.
The Case for Wireless Overlay Networks
, 1996
"... Wireless data services, other than those for electronic mail or paging, have thus far been more promising than successful. We believe that future mobile information systems must be built upon heterogeneous wireless overlay networks', extending traditional wired and internetworked processing "islands ..."
Abstract
-
Cited by 81 (2 self)
- Add to MetaCart
Wireless data services, other than those for electronic mail or paging, have thus far been more promising than successful. We believe that future mobile information systems must be built upon heterogeneous wireless overlay networks', extending traditional wired and internetworked processing "islands" to hosts on the move over coverage areas ranging from in-room, in-building, campus, metropolitan, and wide-areas. Unfortunately, network planners continue to think in terms of homogeneous wireless communications systems and technologies. In this paper, we describe a new wireless data networking architecture that integrates diverse wireless technologies into a seamless internetwork. In addition, we describe the applications support services needed to make it possible for applications to continue to operate as mobile hosts roam across such networks. The architecture described herein is being implemented in a testbed at the University of California, Berkeley under joint government/industry sponsorship.
The Throughput of Packet Broadcasting Channels
- IEEE TRANSACTIONS ON COMMUNICATIONS
, 1977
"... Packet broadcasting is a form of data communications architecture which can combine the features of packet switching with those of broadcast channels for data communication networks. Much of the basic theory of packet broadcasting has been presented as a byproduct in a sequence of papers with a dist ..."
Abstract
-
Cited by 67 (0 self)
- Add to MetaCart
Packet broadcasting is a form of data communications architecture which can combine the features of packet switching with those of broadcast channels for data communication networks. Much of the basic theory of packet broadcasting has been presented as a byproduct in a sequence of papers with a distinctly practical emphasis. In this paper we provide a unified presentation of packet broadcasting theory.
In Section II we introduce the theory of packet broadcasting data networks. In Section I1I we provide some theoretical results dealing with the performance of a packet broadcasting network when the users of the network have a variety of data rates. In Section IV we deal with packet broadcasting networks distributed in space, and in Section V we derive some properties of power-limited packet broadcasting channels, showing that the throughput of such channels can approach that of equivalent point-to-point channels.
unknown title
- IEEE Transactions on Communications
, 1975
"... Abstract-Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packet-switched radio channel. The allocation of bandwidth among the ..."
Abstract
-
Cited by 34 (1 self)
- Add to MetaCart
Abstract-Here we continue the analytic study of packet switching in radio channels which we reported upon in our two previous papers [ 11, [2]. Again we consider a population of terminals communicating with a central station over a packet-switched radio channel. The allocation of bandwidth among the contending terminals can befixed [e.g., time-division multiple access (TDMA) or frequency-division multiple access (FDMA)]-,rundom [e.&, ALOHA or carrier sen? multiple access (CSMA)] or centrally controlled (e.g., polling or reservation). In this paper we show that with a large population of bursty users, (as expected) random access is superior to both futed assignment and polling. We also introduce and analyze a dynamic reservation technique which we call split-channel reservation multiple access (SRMA) which is interesting in that it is both simple and efficient over a large range of system parameters. I.
A Cone-Based Distributed Topology-Control Algorithm for Wireless Multi-Hop Networks
- IEEE/ACM Transactions on Networking
, 2002
"... The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology control algorithm. This algorithm does not assume that nodes have GPS information available; rather it dep ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology control algorithm. This algorithm does not assume that nodes have GPS information available; rather it depends only on directional information. Roughly speaking, the basic idea of the algorithm is that a node u transmits with the minimum power p u,# required to ensure that in every cone of degree # around u, there is some node that u can reach with power p u,# . We show that taking # = 5#/6 is a necessary and su#cient condition to guarantee that network connectivity is preserved. More precisely, if there is a path from s to t when every node communicates at maximum power then, if # 5#/6, there is still a path in the smallest symmetric graph G # containing all edges (u, v) such that u can communicate with v using power p u,# . On the other hand, if # > 5#/6, # This is a revised and extended version of "Analysis of a cone-based topology control algorithm for wireless multi-hop networks", which appeared in Proceedings of ACM Principles of Distributed Computing (PODC), 2001, and includes results from "Distributed topology control for power e#cient operation in multihop wireless ad hoc networks", by R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang, which appeared in Proceedings of IEEE INFOCOM, 2001.
The Application of Microeconomics to the Design of Resource Allocation and Control Algorithms
, 1989
"... In this thesis, we present a new methodology for resource sharing algorithms in distributed systems. We propose that a distributed computing system should be composed of a decentralized community of microeconomic agents. We show that this approach decreases complexity and can substantially improve ..."
Abstract
-
Cited by 19 (4 self)
- Add to MetaCart
In this thesis, we present a new methodology for resource sharing algorithms in distributed systems. We propose that a distributed computing system should be composed of a decentralized community of microeconomic agents. We show that this approach decreases complexity and can substantially improve performance. We compare the performance, generality and complexity of our algorithms with non-economic algorithms. To validate the usefulness of our approach, we present economies that solve three distinct resource management problems encountered in large, distributed systems. The first economy performs CPU load balancing and demonstrates how our approach limits complexity and effectively allocates resources when compared to non-economic algorithms. We show that the economy achieves better performance than a representative non-economic algorithm. The load balancing economy spa...

