The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In a data collection sensor network, how to maximize the network lifetime through topology control remains an open research problem. Previous work has studied this problem by aiming to build a max-lifetime data collection tree, however, tree-based data collection does not necessarily yield maximum network lifetime. In this paper, we consider collaborative multipath data delivery and formulate the...
Low-cost non-intrusive wireless sensor network is ideal for high-fidelity data center monitoring and helping improve energy efficiency. However, the stringent quality of service (QoS) requirements such as real-time data delivery together with the dynamic nature of low-power wireless communication render traditional MAC protocols inapplicable to high-fidelity data center sensing networks. In this paper,...
Development barriers of building energy efficient market (BEEM) in China mainly centralize on unitary construction capital source channel and deficient effective capital supply. To the key problems of capital financing in BEEM, this study takes the incremental investment and financing (IIF) as research object. Establish two-stage leader-followers game model based on Stackelberg with government and...
This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs max (2N(u1)-1, N(u0)-1) time slots, assuming each node...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.