Other affiliations: French Institute for Research in Computer Science and Automation, Orange S.A., Shanghai Jiao Tong University
Bio: Jia-Liang Lu is an academic researcher from Institut national des sciences Appliquées de Lyon. The author has contributed to research in topics: Wireless sensor network & Wireless network. The author has an hindex of 10, co-authored 14 publications receiving 272 citations. Previous affiliations of Jia-Liang Lu include French Institute for Research in Computer Science and Automation & Orange S.A..
••18 Jul 2010
TL;DR: This work proposes in this work a distributed data aggregation scheme based on an adaptive Auto-Regression Moving Average (ARMA) model estimation using a moving window technique and running over suitable communications protocols that provides significant energy savings for mass data collection applications.
Abstract: Wireless sensor networks (WSNs) are data centric networks to which data aggregation is a central mechanism. Nodes in such networks are known to be of low complexity and highly constrained in energy. This requires novel distributed algorithms to data aggregation, where accuracy, complexity and energy need to be optimized in the aggregation of the raw data as well as the communication process of the aggregated data. To this end, we propose in this work a distributed data aggregation scheme based on an adaptive Auto-Regression Moving Average (ARMA) model estimation using a moving window technique and running over suitable communications protocols. In our approach, we balance the complexity of the algorithm and the accuracy of the model so as to facilitate the implementation. Subsequent analysis shows that an aggregation efficiency of up to 60% can be achieved with a very fine accuracy of 0.03 degree. And simulation results confirm that this distributed algorithm provides significant energy savings (over 80%) for mass data collection applications.
••08 Oct 2007
TL;DR: This paper proposes to resolve the problem of data dissemination in two steps: firstly using a localized self-organization scheme which generates a non-directed backbone; secondly, sink node sends a request through this backbone to create a directed dissemination structure in the network.
Abstract: Data dissemination has been put forward as an important mechanism for WSN. The dissemination schemes allow sink nodes to diffuse information in the network. It is known as an energy-consuming phase. In this paper, we propose to resolve this problem in two steps: firstly using a localized self-organization scheme which generates a non-directed backbone; secondly, sink node sends a request through this backbone to create a directed dissemination structure in the network. Our scheme effectively reduces the data traffic during the dissemination phase and saves energy when compared to other schemes. It is also extended to run properly in multiple sinks and mobile sink scenarios. The results also put forward the benefits of using a self-organization scheme for data dissemination.
29 Mar 2007
TL;DR: In this paper, a leader node detection phase is followed by a phase of member node detection, where the new node takes the role of a member node in the cell of the leader node, the messages originating from or destined for a member belonging to a given cell being intended to travel by way of the node covering said cell.
Abstract: The method makes it possible to organise a network of communicating objects, into at least one partition comprising a plurality of communication cells that are respectively covered by a plurality of leader nodes able to communicate with one another, the network having a set of addresses to be allocated which is split into a plurality of pools of addresses intended to be managed in a distributed manner by the leader nodes of the network. When a new node arrives in the network, there is provided a phase a) of leader node detection followed, as appropriate, by a phase b) of member node detection. During phase a), if the new node detects a leader node in its vicinity, said leader node allocates it an address extracted from a pool of addresses which it manages and the new node takes the role of member node in the cell of the leader node, the messages originating from or destined for a member node belonging to a given cell being intended to travel by way of the leader node covering said cell. If the new node does not detect any leader node in its vicinity, it goes to phase b). During phase b), if the new node detects a member node in its vicinity belonging to a first cell, it takes the role of leader covering a second cell, obtains an available pool of addresses to be managed and allocates itself one of the addresses of said pool obtained.
••19 Jun 2006
TL;DR: This paper proposes an automatic base station planning approach that does not only try to assess usual objectives such as radio coverage, but further implements a quality of service (QoS) constraint as the mean available bandwidth per user.
Abstract: This paper proposes an automatic base station planning approach. This approach does not only try to assess usual objectives such as radio coverage, but further implements a quality of service (QoS) constraint. This criterion is here defined as the mean available bandwidth per user. Its computation takes the medium access control (MAC) layer behavior, the multiple bit rates of IEEE 802.11b and the coverage area of each access point (AP) into account. A Markov chain is used to evaluate the available bandwidth of each cell independently. This is sensible because a non-overlapping criterion between cells is used during the planning phase to avoid interference between adjacent cells. The planning process estimates an optimal number of APs and their placement minimizing an aggregate criterion using a Tabu meta-heuristic. The AP's coverage is estimated with a powerful multi-resolution radio propagation simulator previously described. This paper presents results for a QoS oriented planning process providing a predefined minimum peruser throughput. The example provided herein applies for 100 users distributed over a 12600 m 2 building floor
TL;DR: The notion of entropy is applied to ad hoc type wireless networks facilitating a quantification of the internal organizational state generated by different self-organization schemes.
Abstract: With the aim to reduce disorder and improve efficiency, nodes in an ad hoc network run a self-organization scheme to cooperatively organize the network. Although metrics such as complexity or self-stability are commonly used for evaluation, to the best of our knowledge, none of them quantifies the efficiency to build and maintain an organization (order). We henceforth apply the notion of entropy to ad hoc type wireless networks facilitating a quantification of the internal organizational state generated by different self-organization schemes. Invoking node and link failure probabilities, we expose the dependency of the organizational state on the self-organization protocol of choice.
01 Jan 1906
TL;DR: Methods for measuring the entropy of graphs are described and relationships between selected entropy measures are examined, illustrating differences quantitatively with concrete examples.
Abstract: This survey seeks to describe methods for measuring the entropy of graphs and to demonstrate the wide applicability of entropy measures. Setting the scene with a review of classical measures for determining the structural information content of graphs, we discuss graph entropy measures which play an important role in a variety of problem areas, including biology, chemistry, and sociology. In addition, we examine relationships between selected entropy measures, illustrating differences quantitatively with concrete examples.
22 Mar 2010
TL;DR: Facilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed.
Abstract: Facilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed. The authors discuss hardware, complexity and power consumption issues, which are vital for understanding what can be realized at the PHY layer, showing how wireless channel models differ from more traditional models, and highlighting the reliance of PHY algorithm performance on the underlying channel models. Numerous transparent and regenerative relaying protocols are described in detail for a variety of transparent and regenerative cooperative schemes. Key Features: Introduces background, concepts, applications, milestones and thorough taxonomy Identifies the potential in this emerging technology applied to e.g. LTE/WiMAX, WSN Discusses latest wireless channel models for transparent and regenerative protocols Addresses the fundamentals as well as latest emerging PHY protocols Introduces transparent distributed STBC, STTC, multiplexing and beamforming protocols Quantifies regenerative distributed space-time, channel and network coding protocols Explores system optimization, such as distributed power allocation and relay selection Introduces and compares analog and digital hardware architectures Quantifies complexity, memory and power consumption of 3G UMTS & 4G LTE/WiMAX relay Highlights future research challenges within the cooperative communications field This book is an invaluable guide for professionals and researchers in communications fields. It will also be of interest to graduates of communications and electronic engineering courses. It forms part of an entire series dedicated to cooperative wireless systems.
TL;DR: A survey of the existing distributed mobile sink routing protocols is presented and a definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
Abstract: The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.
01 May 2009
TL;DR: For a wireless Routing Over Low power and Lossy networks (ROLL) solution to be useful, the protocol(s) ought to be energy-efficient, scalable, and autonomous.
Abstract: The application-specific routing requirements for Urban Low Power and Lossy Networks (U-LLNs) are presented in this document. In the near future, sensing and actuating nodes will be placed outdoors in urban environments so as to improve the people's living conditions as well as to monitor compliance with increasingly strict environmental laws. These field nodes are expected to measure and report a wide gamut of data, such as required in smart metering, waste disposal, meteorological, pollution and allergy reporting applications. The majority of these nodes is expected to communicate wirelessly which - given the limited radio range and the large number of nodes - requires the use of suitable routing protocols. The design of such protocols will be mainly impacted by the limited resources of the nodes (memory, processing power, battery, etc.) and the particularities of the outdoor urban application scenarios. As such, for a wireless Routing Over Low power and Lossy networks (ROLL) solution to be useful, the protocol(s) ought to be energy-efficient, scalable, and autonomous. This documents aims to specify a set of requirements reflecting these and further U-LLNs tailored characteristics.