Cooperative models for synchronization, scheduling and transmission in large scale sensor networks: An overview

[[abstract]]What is the difference between classical remote sensing and sensor networks? What kind of data models that one can assume in the context of sensor networks? Can the sensors in the network concurrelty contribute to the sensing objective, without creating network conflicts ? It is becoming apparent that methodologies designed to resolve network resource allocation conflicts in the communications among open systems have several bottlenecks when applied to sustain networkign among concurrent sensing nodes. Can we structure the network activities so that they are always directly beneficial to the sensing task? The goal of this paper is to articulate these questions and indicate how some resource allocation conflicts can be removed embracing colaborative networking approaches among the sensors. © 2005 IEEE.[[fileno]]2030137030009[[department]]電機工程學

Orthogonal Multiple Access with Correlated Sources: Feasible Region and Pragmatic Schemes

In this paper, we consider orthogonal multiple access coding schemes, where correlated sources are encoded in a distributed fashion and transmitted, through additive white Gaussian noise (AWGN) channels, to an access point (AP). At the AP, component decoders, associated with the source encoders, iteratively exchange soft information by taking into account the source correlation. The first goal of this paper is to investigate the ultimate achievable performance limits in terms of a multi-dimensional feasible region in the space of channel parameters, deriving insights on the impact of the number of sources. The second goal is the design of pragmatic schemes, where the sources use "off-the-shelf" channel codes. In order to analyze the performance of given coding schemes, we propose an extrinsic information transfer (EXIT)-based approach, which allows to determine the corresponding multi-dimensional feasible regions. On the basis of the proposed analytical framework, the performance of pragmatic coded schemes, based on serially concatenated convolutional codes (SCCCs), is discussed