By Topic

Communications and Networks, Journal of

Issue 4 • Date Aug. 2009

Filter Results

Displaying Results 1 - 20 of 20
  • Front cover

    Publication Year: 2009 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (304 KB)  
    Freely Available from IEEE
  • Inside front cover

    Publication Year: 2009 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (282 KB)  
    Freely Available from IEEE
  • Distributed processing for wireless networks

    Publication Year: 2009 , Page(s): 323 - 326
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (254 KB)  

    The benefits of cooperation among devices of wireless networks are potentially so rewarding that distributed processing has become a major research topic in recent years. Distributed protocols are designed to achieve a global task over a network of devices connected via wireless links for different applications in wireless networks such as statistical inference and decision making, optimization in radio access and interference management, fault-tolerant networking. Channel variability and fading, dynamic routing and battery-aware policy, are only few of the specific challenges that the design of any distributed algorithm over wireless links need to account for. Of the many problems that are still open in this fascinating area of research, this special JCN issue sheds some light on the following important issues. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hole modeling and detour scheme for geographic routing in wireless sensor networks

    Publication Year: 2009 , Page(s): 327 - 336
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1344 KB) |  | HTML iconHTML  

    Geographic routing has been considered as an attractive approach in wireless sensor networks, since it routes data packets by using location information rather than global topology information. In geographic routing schemes, packets are usually sent along the boundary of a hole by face routing to detour the hole. As result, all data flows which need to detour the hole are concentrated on the boundary of the hole. This hole detour scheme results in much more energy consumption for nodes at the hole boundary, and the energy exhaustion of hole boundary nodes enlarges the holes. This is referred to as a hole diffusion problem. The perimeter mode may also lead to data collisions on the hole boundary nodes if multiple data flows need to bypass a hole simultaneously. In this paper, we propose a hole modeling and detour scheme for geographic routing in wireless sensor networks. Our hole modeling and detour scheme can efficiently prevent hole diffusion, avoid the local minimum problem faced by geographic routing protocols, and reduce data collisions on the hole boundary nodes. Simulation results show that the proposed scheme is superior to the other protocols in terms of control overhead, average delivery delay and energy consumption. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting mobility for efficient data dissemination in wireless sensor networks

    Publication Year: 2009 , Page(s): 337 - 349
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (857 KB) |  | HTML iconHTML  

    In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its application in an online structural health monitoring (SHM) system. The objective is to recover a damage severity vector, which identifies, localizes, and quantifies damages in a structure, via distributive and collaborative decision-making among wireless sensors. Observing the fact that damages are generally scarce in a structure, this paper develops a nonlinear 0-norm minimization formulation to recover the sparse damage severity vector, then relaxes it to a linear and distributively tractable one. An optimal algorithm based on the alternating direction method of multipliers (ADMM) and a heuristic distributed linear programming (DLP) algorithm are proposed to estimate the damage severity vector distributively. By limiting sensors to exchange information among neighboring sensors, the distributed decision-making algorithms reduce communication costs, thus alleviate the channel interference and prolong the network lifetime. Simulation results in monitoring a steel frame structure prove the effectiveness of the proposed algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed decision-making in wireless sensor networks for online structural health monitoring

    Publication Year: 2009 , Page(s): 350 - 358
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (857 KB) |  | HTML iconHTML  

    In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its application in an online structural health monitoring (SHM) system. The objective is to recover a damage severity vector, which identifies, localizes, and quantifies damages in a structure, via distributive and collaborative decision-making among wireless sensors. Observing the fact that damages are generally scarce in a structure, this paper develops a nonlinear 0-norm minimization formulation to recover the sparse damage severity vector, then relaxes it to a linear and distributively tractable one. An optimal algorithm based on the alternating direction method of multipliers (ADMM) and a heuristic distributed linear programming (DLP) algorithm are proposed to estimate the damage severity vector distributively. By limiting sensors to exchange information among neighboring sensors, the distributed decision-making algorithms reduce communication costs, thus alleviate the channel interference and prolong the network lifetime. Simulation results in monitoring a steel frame structure prove the effectiveness of the proposed algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed decision-making mechanism for wireless P2P networks

    Publication Year: 2009 , Page(s): 359 - 367
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1423 KB) |  | HTML iconHTML  

    Trust-based solutions provide some form of payment to peers to encourage good behavior. The problem with trust management systems is that they require prior knowledge to work. In other words, peers are vulnerable to attack if they do not have knowledge or correct knowledge of other peers in a trust management system. Therefore, considering only trust is inadequate when a decision is made to identify the best set of peers to utilize. In order to solve the problem, we propose a distributed decision-making mechanism for wireless peer-to-peer (P2P) networks based on game theory and relevant trust mechanisms in which we incorporate the element of trust and risk into a single model. The main idea of our mechanism is to use utility function to express the relationship between benefits and costs of peers, and then make the decision based on expected utility as well as risk attitude in a fully distributed fashion. The unique feature of our mechanism is that it not only helps a peer to select its partners, but also mitigates vulnerabilities in trust-based mechanisms. Through analysis and experiments, we believe our approach is useful for peers to make the decision regarding who to interact with. In addition, it is also a good starting point for exploring tradeoffs among risk, trust and utility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed multiple spectrum pricing scheme for optimality support in multiaccess systems

    Publication Year: 2009 , Page(s): 368 - 374
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1228 KB) |  | HTML iconHTML  

    This paper focuses on a distributed multiple spectrum pricing scheme to maximize system capacity in next generation multiaccess systems, where multimode user equipments (MUEs) can connect simultaneously to multiple base stations (BSs) with multiple radio access technologies (RATs). The multi-price based scheme provides a distributed decision making for an optimal solution where radio resource allocations are determined by each MUE, unlike most centralized mechanisms where BS controls the whole radio resource. By the proposed optimal solution, MUEs can decide their share of spectrum bands and power allocation according to the spectrum price of each RAT, and at the same time the multiaccess system can achieve maximized total throughput. Numerical analysis shows that the proposed scheme achieves the maximal capacity by distributed resource allocation for the multiaccess system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fair distributed resource allocation method in UWB wireless PANs with WiMedia MAC

    Publication Year: 2009 , Page(s): 375 - 383
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1480 KB) |  | HTML iconHTML  

    The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity estimation of optical wireless communication systems over moderate to strong turbulence channels

    Publication Year: 2009 , Page(s): 384 - 389
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1119 KB) |  | HTML iconHTML  

    Optical wireless communication (OWC) systems are rapidly gaining popularity as effective means of transferring data at high rates over short distances. OWC facilitates rapidly deployable, lightweight, high-capacity communication without licensing fees and tariffs. Nevertheless, the performance of this new technology depends strongly on the atmospheric conditions and the characteristics of the link. In this work, we study the influence of these parameters on both the average (ergodic) capacity and the outage capacity of an OWC system over moderate to strong turbulence channels modeled by gamma-gamma distribution. Moreover, we compare the results that we obtain estimating the average and outage capacities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-aware QoS provisioning for wireless sensor networks: Analysis and protocol

    Publication Year: 2009 , Page(s): 390 - 405
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1821 KB) |  | HTML iconHTML  

    Wireless sensor networks (WSNs) are envisioned to facilitate information gathering for various applications and depending on the application types they may require certain quality of service (QoS) guarantee for successful and guaranteed event perception. Therefore, QoS in WSNs is an important issue and two most important parameters that hinder the goal of guaranteed event perception are time-sensitive and reliable delivery of gathered information, while a minimum energy consumption is desired. In this paper, we propose an energy-aware, multi-constrained and multi-path QoS provisioning mechanism for WSNs based on optimization approach. Hence, a detailed analytical analysis of reliability, delay and energy consumption is presented to formulate the optimization problem in an analytical way. A greedy algorithm is proposed to achieve the desired QoS guarantee while keeping the energy consumption minimum. Also, a simple but efficient retransmission mechanism is proposed to enhance the reliability further, while keeping the delay within delay bound. Simulation results demonstrate the effectiveness of our scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance modeling of wireless sensor networks as a queueing network with on and off servers

    Publication Year: 2009 , Page(s): 406 - 415
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (942 KB) |  | HTML iconHTML  

    In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DNS resolution with renewal using piggyback

    Publication Year: 2009 , Page(s): 416 - 427
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1546 KB) |  | HTML iconHTML  

    Domain name system (DNS) is a primary identification mechanism for Internet applications. However, DNS resolutions often take an unbearably long time, and this could seriously impair the consistency of the service quality of Internet applications based on DNS such as World Wide Web. Several approaches reduce DNS resolution time by proactively refreshing expired cached records or prefetching available records beforehand, but these approaches have an inherent problem in that they cause additional DNS traffic. In this paper, we propose a DNS resolution time reduction scheme, named renewal using piggyback (RUP), which refreshes expired cached records by piggybacking them onto solicited DNS queries instead of by issuing additional DNS queries. This method decreases both DNS resolution time and DNS traffic since it reduces the number of queries generated to handle a given DNS resolution without generating additional DNS messages. Simulation results based on two large independent DNS traces show that our proposed approach much reduces not only the DNS resolution time but also the DNS traffic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for papers

    Publication Year: 2009 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (401 KB)  
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2009 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (313 KB)  
    Freely Available from IEEE
  • Call for papers

    Publication Year: 2009 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (311 KB)  
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2009 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (277 KB)  
    Freely Available from IEEE
  • Copyright transfer form

    Publication Year: 2009 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (34 KB)  
    Freely Available from IEEE
  • Journal of Communications and Networks (JCN)

    Publication Year: 2009 , Page(s): c3
    Save to Project icon | Request Permissions | PDF file iconPDF (272 KB)  
    Freely Available from IEEE
  • Back cover

    Publication Year: 2009 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (304 KB)  
    Freely Available from IEEE

Aims & Scope

The Journal of Communications and Networks is published six times per year, and is committed to publishing high-quality papers that advance the state-of-the-art and practical applications of communications and information networks.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Vincent Poor
Princeton University