Nonlinear Integer Programming Formulation for Quasi-Optimal Grouping of Clusters in Ferry-Assisted DTNs
スポンサーリンク
概要
- 論文の詳細を見る
Communication among isolated networks (clusters) in delay tolerant networks (DTNs) can be supported by a message ferry, which collects bundles from clusters and delivers them to a sink node. When there are lots of distant static clusters, multiple message ferries and sink nodes will be required. In this paper, we aim to make groups, each of which consists of physically close clusters, a sink node, and a message ferry. Our objective is minimizing the overall mean delivery delay of bundles in consideration of both the offered load of clusters and distances between clusters and their sink nodes. Based on existing work, we first model this problem as a nonlinear integer programming. Using a commercial nonlinear solver, we obtain a quasi-optimal grouping. Through numerical evaluations, we show the fundamental characteristics of grouping, the impact of location limitation of base clusters, and the relationship between delivery delay and the number of base clusters.
著者
-
Kabir K.
Department Of Information And Communications Technology Graduate School Of Engineering Osaka Univers
-
Sasabe Masahiro
Department Of Information And Communications Technology Graduate School Of Engineering Osaka Univers
-
Takine Tetsuya
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
関連論文
- Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks
- Dynamic Contention Window Control Scheme in IEEE 802.11e EDCA-Based Wireless LANs
- Enhanced Fallback+ : An Efficient Multiconstraint Path Selection Algorithm for QoS Routing(Internet)
- Network Map Architecture Using Inter-Agent Communication Techniques for Multiple QoS Routing
- Proxy Caching Mechanisms with Quality Adjustment for Video Streaming Services(Proxy Caching)(Special Issue on Content Delivery Networks)
- Inferring Traffic Flow Characteristics from Aggregated-flow Measurement(Special Issue on Selected Papers from SAINT 2002(The 2002 Symposium on Applications and the Internet))
- Identifying Heavy-Hitter Flows from Sampled Flow Statistics(Next Generation Network Management)
- MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS
- ANALYSIS OF A DISCRETE-TIME QUEUE WITH GEOMETRICALLY DISTRIBUTED GATE OPENING INTERVALS
- ON THE M/G/1 QUEUE WITH MULTIPLE VACATIONS AND GATED SERVICE DISCIPLINE
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
- Nonlinear Integer Programming Formulation for Quasi-Optimal Grouping of Clusters in Ferry-Assisted DTNs