Networks Lab @ RPI

Submitted by networks on Thu, 11/05/2009 - 15:51.

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5286817&arnumber=5200322&count=25&index=10

Abstract:

The scenario of distributed data aggregation in wireless sensor networks is considered, where sensors can obtain and estimate the information of the whole sensing field through local data exchange and aggregation. An intrinsic tradeoff between energy and aggregation delay is identified, where nodes must decide optimal instants for forwarding samples. The samples could be from a node's own sensor readings or an aggregation with samples forwarded from neighboring nodes. By considering the randomness of the sample arrival instants and the uncertainty of the availability of the multiaccess communication channel, a sequential decision process model is proposed to analyze this problem and determine optimal decision policies with local information. It is shown that, once the statistics of the sample arrival and the availability of the channel satisfy certain conditions, there exist optimal control-limit-type policies that are easy to implement in practice. In the case that the required conditions are not satisfied, the performance loss of using the proposed control-limit-type policies is characterized. In general cases, a finite-state approximation is proposed and two on-line algorithms are provided to solve it. Practical distributed data aggregation simulations demonstrate the effectiveness of the developed policies, which also achieve a desired energy-delay tradeoff.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:55.

Abstract:

An analytical framework is developed to study the throughput and routing overhead for proactive and reactive routing strategies in random access mobile ad hoc networks. To characterize the coexistence of the routing control traffic and data traffic, the interaction is modeled as a multi-class queue at each node, where the aggregate control traffic and data traffic are two different classes of customers of the queue. With the proposed model, the scaling properties of the throughput, maximum mobility degree supported by the network and mobility-induced throughput deficiencies are investigated, under both classes of routing strategies. The proposed analytical model can be extended to evaluate various routing optimization techniques as well as to study routing/relaying strategies other than conventional proactive or reactive routing. The connection between the derived throughput result and some well-known network throughput capacity results in the literature is also established.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:47.

URL:

http://www.computer.org/portal/web/csdl/doi/10.1109/MOBHOC.2006.278552

Abstract:

In order to adapt to the time-varying nature of wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in wireless ad hoc networks where there are usually alternate forwarding nodes available at a given forwarding node. However, existing schemes along this line are designed based on heuristics, implying room for performance enhancement. Thereby, to seek a theoretical foundation for improving spatial diversity gain, we formulate the selection of the next-hop relay as a sequential decision problem and derive a general "Optimal Stopping Relaying (OSR)" framework for designing such spatial-diversity schemes. As a particular example, assuming Rayleigh fading channels, we implement an OSR strategy to optimize information efficiency (IE) in a protocol stack consisting of Greedy Perimeter Stateless Routing (GPSR) and IEEE 802.11 MAC protocols. We present an analysis of the algorithm for a single node. In addition, we perform extensive simulations (using QualNet) to evaluate the end-to-end performance of the proposed forwarding strategy. The results demonstrate the superiority of OSR over other existing schemes.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:44.

Abstract:

Ultra-Wideband (UWB) radio technology is one promising solution for short-range indoor wireless communication applications. UWB systems spread the transmitted signal power over an extremely large frequency band, and the power spectral density of the signal is very low. Due to the wide bandwidth of the transmitted signal, UWB signal energy will spread over the frequency bands allocated to other radio systems. In order to evaluate the effects of UWB system to narrowband systems (such as IEEE802.11a wireless LAN) in its overlay band, it is important to understand and quantify the power spectral density (PSD) of UWB signal. In this paper, a detailed analysis on the PSD of direct sequence coded UWB (DS-UWB) signal is presented. The theoretical and simulation results reveal that the interfering DS-UWB power can be reduced in the victim narrowband systems by regulating chip rate, pulse shape and width and scrambling codes in the frequencies of UWB system.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:39.

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4533751

Abstract:

In this paper, we investigate the low-complexity synchronization design for multi-band orthogonal-frequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose a unified synchronizer design based on auto-correlation-function. The key component in the proposed synchronizer is a parallel signal detector structure in which multiple auto-correlation units are instantiated and their outputs are shared by other functional units in the synchronizer, including time-frequency pattern detection, symbol timing, carrier frequency offset estimation and correction and frame synchronization. We show that, via analysis and simulations, such a design achieves not only a low computation cost which makes it attractive in implementation, but also equal or better performance compared to the cross-correlation based designs.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:35.

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4600206

Abstract:

In order to adapt to time-varying wireless channels, various channel-adaptive schemes have been proposed to exploit inherent spatial diversity in mobile/wireless ad hoc networks where there are usually alternate next-hop relays available at a given forwarding node. However, current schemes along this line are designed based on heuristics, implying room for performance enhancement. To seek a theoretical foundation for improving spatial diversity gain, we formulate the selection of the next-hop as a sequential decision problem and propose a general "optimal stopping relaying (OSR)" framework for designing such next-hop diversity schemes. As a particular example, assuming Rayleigh fading channels, we implement an OSR strategy to optimize information efficiency (IE) in a protocol stack consisting of greedy perimeter stateless routing (GPSR) and IEEE 802.11 MAC protocols. We present mathematical analysis of the proposed OSR together with other strategies in literature for a single forwarding node. In addition, we perform extensive simulations (using QualNet) to evaluate the end-to-end performance of these relaying strategies in a multi-hop network. Both the mathematical and simulation results demonstrate the superiority of OSR over other existing schemes.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:29.

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4215778

Abstract:

We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing field through local data exchange and aggregation. The intrinsic trade-off between energy and delay in aggregation operations imposes a crucial question on nodes to decide optimal instants for forwarding their samples. The samples could be composed of the information from their own sensor readings or an aggregation of information with other samples forwarded from neighboring nodes. By considering the randomness of the sample arrival instants and the uncertainty of the availability of the multiaccess communication channel due to the asynchronous nature of information exchange among neighboring nodes, we propose a decision process model to analyze this problem and determine the optimal decision policies at nodes with local information. We show that, once the statistics of the sample arrival and the availability of the channel satisfy certain conditions, there exist optimal control-limit type policies which are easy to implement in practice. In the case that the required conditions are not satisfied, we provide two learning algorithms to solve a finite-state approximation model of the decision problem. Simulations on a practical distributed data aggregation scenario demonstrate the effectiveness of the developed policies, which can also achieve a desired energy-delay tradeoff.

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:26.

URL:

http://portal.acm.org/citation.cfm?id=1454551

Abstract:

We develop an analytical framework to study the throughput and routing overhead for proactive and reactive routing strategies in random access mobile ad hoc networks. To characterize the coexistence of the routing control traffic and data traffic, we model the interaction as a multi-class queue model at each node, where the aggregate control traffic and data traffic are two different classes of customers of the queue. We investigate the scaling property of the throughput, maximum mobility degree supported by the network and mobility-induced throughput deficiencies, under both classes of routing strategies. The proposed analytical model can be extended to incorporate various optimization techniques in routing. We present one exemplary technique and discuss its impacts on the scaling properties of throughput and routing overhead. The connection between the derived throughput result and some well-known network throughput capacity results in the literature is also addressed.

Notes:

Runner-up for the Best Paper Award

• Tagged
• XML
• BibTex

Submitted by networks on Wed, 11/04/2009 - 22:23.

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4697861

Abstract:

We consider the location service in a mobile ad-hoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating its location information within its neighboring region, which is called neighborhood update (NU), and (ii) occasionally updating its location information to a certain (fixed) distributed location server in the network, which is called location server update (LU). A trade-off exists between the costs in location update operations, on one hand, and the additional incurred costs in (position-based) routing due to location errors, on the other hand. In this paper, we develop a stochastic sequential decision framework to analyze this trade-off and provide design guidelines on selecting good location update strategies in practice. Under a Markovian mobility model, the location update decision problem is modeled as a Markovian decision process (MDP). Based on the separable cost structure of the proposed MDP model, we first show that the location update decisions on NU and LU can be independently carried out without loss of optimality. Then we investigate the optimality of simple threshold-based updating rules in NU and LU operations. We finally introduce a model-free learning approach which is practically useful to find a near-optimal solution for the problem.

• Tagged
• XML
• BibTex