Works (5)
Updated: July 5th, 2023 15:52
2009 journal article
Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks
IEEE-ACM TRANSACTIONS ON NETWORKING, 17(5), 1578–1591.
author keywords: Bounded domain; exponential versus power-law; intermeeting time distribution; mobile ad hoc network (MANET); time and space scaling
TL;DR:
It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the intermeeting time and that by simply removing the boundary in a simple two-dimensional isotropic random walk model, one is able to obtain the empirically observed power-law decay of the IntermeetingTime.
(via Semantic Scholar)
open access via citeseerx.ist.psu.edu (repository)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: Web Of Science
Added: August 6, 2018
2009 article
Multicast Scheduling in Cellular Data Networks
Won, H., Cai, H., Eun, D. Y., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2009, September). IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Vol. 8, pp. 4540–4549.
author keywords: Multicast scheduling; 3G; downlink schedule; optimization; proportional fair; cellular data networks
TL;DR:
It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2008 article
Invariance property of isotropic random walk mobility patterns in mobile ad-hoc networks
2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, pp. 2141–2145.
TL;DR:
It is found that the mean contact time of two mobile nodes following isotropic random walk mobility models is invariant with respect to the step-length distribution under both the simplest distance-based (Boolean) interference model and the more realistic SINR-based interference model.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
2008 journal article
Stochastic convex ordering for multiplicative decrease internet congestion control
COMPUTER NETWORKS, 53(3), 365–381.
author keywords: High-speed TCP; Convex ordering; Window growth function
TL;DR:
A new stochastic tool, called convex ordering, is presented that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
2008 article
Tuning up the performance of constant-time distributed scheduling algorithms via majorization
2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, pp. 2931–2935.
TL;DR:
It is proved that there exists ordering relationship for the success probability of any neighborhood when the contention probability vectors are ordered in the sense of majorization, which improves the performance of a class of distributed collision-based scheduling algorithms, called constant-time distributed scheduling algorithms.
(via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.