Effective paging schemes with delay bounds as QoS constraints in wireless systems

DOI10.1023/A:1016718509350MaRDI QIDQ5957048zbMATH OpenOpenAlexFDO

Authors Wenye Wang, Ian F. Akyildiz, Gordon L. Stüber, Boo-Young Chung

Publication date 2001

Published in Wireless Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016718509350

zbMATH Keywords

paging schemeswireless networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• IP paging service for mobile hosts
• A cost-effective approach to selective IP paging scheme using explicit multicast
• Paging mobile users in cellular networks: optimality versus complexity and simplicity
• A cost-minimization algorithm for fast location tracking in mobile wireless networks
• scientific article; zbMATH DE number 1983298

Cited in

(5)

• IP paging service for mobile hosts
• A cost-effective approach to selective IP paging scheme using explicit multicast
• A cost-minimization algorithm for fast location tracking in mobile wireless networks
• scientific article; zbMATH DE number 1983298 (Why is no real title available?)
• A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks

Describes a project that uses

Uses Software

• LeZi-update

This page was built for publication: Effective paging schemes with delay bounds as QoS constraints in wireless systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957048)