ZDNet UK


Skip to Main Content

ZDNet.co.uk - Winner of Best Business Website 2007
  1. Home
  2. News
  3. Blogs
  4. Reviews
  5. Prices
  6. Resources
  7. Community
  8. My ZDNet

 

ZDNet UK RSS Feeds


IT Jobs

All content for

'TDMA - CDMA scheduling'.

17 results. Displaying: 1-17




Efficient Interference-Aware TDMA Link Scheduling For Static Wireless Networks

White Papers Using a mathematical formulation, the paper develops synchronized TDMA link scheduling that optimize the networking throughput. This paper studies efficient link scheduling for a multihop wireless network to maximize its throughput.

[January 1, 1970, 0:59]

On-Demand TDMA Scheduling For Energy Conservation In Sensor Networks

White Papers This paper presents two variants of an on-demand TDMA (Time Division Multiple Access) MAC protocol. The two variants of the protocol presented in this paper are Busy Tone On-Demand Scheduling (BTODS) and On-Demand Scheduling (ODS).

[January 1, 1970, 0:59]

A Column Generation Method For Spatia TDMA Scheduling In Ad Hoc Networks

White Papers Spatial TDMA (STDMA) is a scheme for access control in ad hoc networks. STDMA improves TDMA by allowing simultaneous transmission of multiple units. This paper studies the problem of STDMA scheduling, where the objective is to find minimum-length...

[January 1, 1970, 0:59]

Distributed Scalable TDMA Scheduling Algorithm

White Papers In the paper, a new distributed TDMA scheduling algorithm, called DRAND, is employed that gives a channel schedule as efficient as RAND - a commonly used centralized channel allocation scheme. Lack of scalability and channel efficiency is often...

[January 1, 1970, 0:59]

A GRASP For Broadcast Scheduling In Ad-Hoc TDMA Networks

White Papers The BSP is an NP-Complete problem in which a finite set of stations are to be scheduled in a time division multiple access (TDMA) frame. In a TDMA frame, time is divided into equal length slots in which transmissions occur.

[January 1, 1970, 0:59]

An Optimal TDMA-Based MAC Scheduling For The Minimum Energy Multicast In Wireless Ad Hoc Networks

White Papers This paper only considers "bandwidth" as the QoS in TDMA-based wireless ad hoc networks that use omni-directional antennas and have limited energy resources. Energy conservation is a critical issue in wireless ad hoc networks since batteries are...

[January 1, 1970, 0:59]

Cross-Layer Optimization For Scheduling In OFDM-TDMA Transmission

White Papers This paper gives an overview of some initial activities in the air interface design considered in the orthogonal frequency-division multiplexing (OFDM) time-division multiple access (TDMA) cluster. In the integrated project My personal Adaptive...

[January 1, 1970, 0:59]

Comparison Between Scheduling Models For Spatial Reuse TDMA

White Papers Spatial reuse TDMA is a collision-free access scheme for ad hoc networks. The idea is to let spatially separated radio terminals reuse the same time slot when the resulting interferences are not too severe.

[January 1, 1970, 0:59]

Combined Routing & Scheduling For Spatial TDMA In Multihop Ad Hoc Networks

White Papers This paper analyze the performance of a novel routing and scheduling strategy to create the link transmission schedule in STDMA, named Reuse Adaptive Minimum Hop Algorithm (RA-MHA). Multihop ad hoc radio networks can potentially provide low cost...

[January 1, 1970, 0:59]

Energy-Delay Tradeoffs For Data Collection In TDMA-Based Sensor Networks

White Papers The paper first analyzes the delay performance of a transmission scheme based on time division multiple access (TDMA). A simple link scheduling algorithm is proposed to find the minimum-delay schedule given the slot lengths for all the links.

[January 1, 1970, 0:59]

Power And Rate Control For Spatial TDMA In Wireless Radio Networks

White Papers S-TDMA is a link oriented scheduling. Spatial TDMA (S-TDMA) is a "conflict-free" multiple access for MPRNets, which ensures that a packet transmission, whenever made, is successful. A very attractive alternative for communications in areas in which...

[January 1, 1970, 0:59]

Throughput Analysis Of A Probabilistic Topology-Unaware TDMA MAC Policy For Ad-Hoc Networks

White Papers The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots.

[January 1, 1970, 0:59]

Implementation Of Real-Time Communication Capabilities In RTLinux-GPL Systems

White Papers This paper concentrates in describing the main real-time parts: software TDMA multiplexing and QoS scheduling. This paper presents the ongoing work in the development of a real-time communication software infrastructure.

[January 1, 1970, 0:59]

Proportionally Fair Allocation Of End-to-End Bandwidth In STDMA Wireless Networks

White Papers This paper considers the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is posed as a utility maximization subject to link rate...

[July 11, 2008, 1:02]

Energy Minimization And Delay Analysis In TDMA-Based Sensor Networks

White Papers The paper proposes variable-length TDMA schemes where the slot length is optimally assigned according to the routing requirement while minimizing the energy consumption across the network. In this context, energy-efficient joint routing, scheduling...

[January 1, 1970, 0:59]

Analysis Of A Probabilistic Topology-Unaware TDMA MAC Policy For Ad-Hoc Networks

White Papers These schemes consider a deterministic policy for the utilization of the assigned scheduling time slots that never utilizes non-assigned slots although in such slots collision-free transmissions are possible even under heavy traffic conditions.

[January 1, 1970, 0:59]

Distributed Dynamic Scheduling For End-to-End Rate Guarantees In Wireless Ad Hoc Networks

White Papers Using a distributed Time Division Multiple Access (TDMA) protocol nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the demand changes stabilize, the nodes must incrementally converge...

[January 1, 1970, 0:59]