International Journal of Communication Systems

Cover image for Vol. 26 Issue 3

March 2013

Volume 26, Issue 3

Pages 277–411

  1. Research Articles

    1. Top of page
    2. Research Articles
    1. An ant colony optimisation algorithm for aggregated multicast based on minimum grouping model (pages 277–292)

      Fangjin Zhu and Hua Wang

      Version of Record online: 1 SEP 2011 | DOI: 10.1002/dac.1342

      Thumbnail image of graphical abstract

      Figure 4 shows that at a significance of α = 0.05, the null hypotheses in all initial conditions are rejected, whereas when significance is at α = 0.01, most null hypotheses (37 out of 40) are also rejected. On the basis of these results, we conclude that the aggregation degree of algorithm 1 is significantly higher than that of algorithm 2. Thus, introducing the relative fullness of the tree as a component in fitness function significantly improves the optimization performance of the algorithm.

    2. On the performance and fairness of dynamic channel allocation in wireless mesh networks (pages 293–314)

      Bahador Bakhshi and Siavash Khorsandi

      Version of Record online: 22 SEP 2011 | DOI: 10.1002/dac.1344

      Thumbnail image of graphical abstract

      In this paper, we quantify the achievable performance gain and fairness improvement in multi-channel multi-radio WMNs through an optimal dynamic channel allocation scheme in comparison with optimal static schemes. The dynamic scheme is the online joint QoS routing and channel assignment algorithm. Static schemes are composed of online QoS routing and off-line channel assignment. We develop two optimal channel assignment algorithms. One of them maximizes the aggregate network throughput, and the other maintains max–min fairness. Both schemes are developed by MILP models.

    3. A review of routing strategies for optical burst switched networks (pages 315–336)

      C. Yahaya, M. S. Abd Latiff and A. B. Mohamed

      Version of Record online: 22 SEP 2011 | DOI: 10.1002/dac.1345

      Thumbnail image of graphical abstract

      Themain findings of this paper can be summarized as follows: Burst loss is themain roadblock to the implementation of OBS due to contention at the buffer-less core node; routing strategies are among the most effective approaches to handle this contention in especially heuristic routing algorithms such as ant colony optimization, the superiority of these methods is attributed to their proactive nature and the fact that routing is an important aspect of any network design and implementation.

    4. Performance analysis for relay networks with hierarchical support vector machines (pages 337–355)

      Bao Yuan Liu, Vin Sen Feng and Shih Yu Chang

      Version of Record online: 26 OCT 2011 | DOI: 10.1002/dac.1346

      Thumbnail image of graphical abstract

      In this paper, we consider a cooperative relay scheme for a mobile network with MIMO technology. In order to further increase the channel capacity, we propose an efficient hierarchical procedure based on support vector machine, namely hierarchical support vector machines (HSVM), to estimate approximately the wireless networks’ condition and design two ways (matched filter and minimum mean square error filter) of increasing the channel capacity according to the estimated wireless network condition.

    5. Suboptimal particle filtering for MIMO flat fading channel estimation (pages 356–368)

      Hai H. Hoang and Bing W. Kwan

      Version of Record online: 9 SEP 2011 | DOI: 10.1002/dac.1347

      Thumbnail image of graphical abstract

      Although particle filters have been successfully employed to track channel state information in wireless communications, an optimal importance density cannot be always found to optimize the performance. The paper presents a suboptimal particle filter that overcomes the drawbacks of the prior importance density and the noise uncertainty by utilizing the swarm behavior in the particle propagation. Computer simulation of a 2’2 multiple-input multiple-output (MIMO) system is presented to illustrate the performance of the proposed suboptimal particle filter technique.

    6. Throughput of DS-CDMA/unslotted ALOHA radio networks with Markovian arrival processes (pages 369–379)

      Shu-Ming Tseng and Yung-Chung Wang

      Version of Record online: 6 OCT 2011 | DOI: 10.1002/dac.1354

      Thumbnail image of graphical abstract

      The proposed Markovian arrival process/M/∞ queuing model and the previous M/M/∞ queuing model (Poisson arrival process) are quite different. The previous model is just a special case of the proposed.

    7. High energy-efficient and privacy-preserving secure data aggregation for wireless sensor networks (pages 380–394)

      Chen-Xu Liu, Yun Liu, Zhen-Jiang Zhang and Zi-Yao Cheng

      Version of Record online: 24 JUL 2012 | DOI: 10.1002/dac.2412

      Thumbnail image of graphical abstract

      In this paper, a tree structure is used to organize sensors to achieve the task of data aggregation for wireless sensor networks. Three types of nodes that exist hierarchically in the network were considered: the base station, intermediate nodes, and leaf nodes.

    8. Scheduling model and performance analysis in transport mapping layer of control element in forwarding and control element separation system (pages 395–411)

      Chuanhuang Li, Sanyuan Zhang and Weiming Wang

      Version of Record online: 10 JAN 2013 | DOI: 10.1002/dac.2490

      Thumbnail image of graphical abstract

      The transport mapping layer scheduling model in ForCES control element is important because it not only should be able to process the messages with different priorities but also can solve the fairness and robustness problems in network element level. In this paper, a two-stage scheduling scheme with strict priority and general processor share scheduling is proposed. In a stochastic network calculus framework, and based on moment generating functions, bounds on average backlogs and delays of all channels are derived.

SEARCH

SEARCH BY CITATION