✦ LIBER ✦

Minimum-length scheduling with rate control in wireless networks: a shortest path approach

✍ Scribed by Anna Pantelidou; Anthony Ephremides

Book ID: 115021325
Publisher: Hindawi Publishing Corporation
Year: 2011
Tongue: English
Weight: 899 KB
Volume: 2011
Category: Article
ISSN: 1687-1472
DOI: 10.1186/1687-1499-2011-115

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for minimum CDS with

An exact algorithm for minimum CDS with shortest path constraint in wireless networks

✍ Ling Ding; Xiaofeng Gao; Weili Wu; Wonjun Lee; Xu Zhu; Ding-Zhu Du 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 235 KB

A shortest-path-based topology control a

A shortest-path-based topology control algorithm in wireless multihop networks

✍ Shen, Yao; Cai, Yunze; Xu, Xiaoming 📂 Article 📅 2007 🏛 Association for Computing Machinery 🌐 English ⚖ 786 KB

Minimum Length Scheduling With Packet Tr

Minimum Length Scheduling With Packet Traffic Demands in Wireless Ad Hoc Networks

✍ Sadi, Yalcin; Ergen, Sinem Coleri 📂 Article 📅 2014 🏛 IEEE 🌐 English ⚖ 815 KB

Estimation and determination of shortest

Estimation and determination of shortest path length in a road network with obstacles

✍ Nicolas Dubois; Frédéric Semet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 798 KB

Finding the K shortest paths in a time-s

Finding the K shortest paths in a time-schedule network with constraints on arcs

✍ Jin, Wen; Chen, Shuiping; Jiang, Hai 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Computing a fuzzy shortest path in a net

Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using -cuts

✍ Ali Tajdin; Iraj Mahdavi; Nezam Mahdavi-Amiri; Bahram Sadeghpour-Gildeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 533 KB

## a b s t r a c t We are concerned with the design of a model and an algorithm for computing a shortest path in a network having various types of fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy numbers in a path using α-cuts by proposing a linear least squar