Towards an Efficient Context-Aware System: Problems and Suggestions to Reduce Energy Consumption in Mobile Devices

Looking for optimizing the battery consumption is an open issue, and we think it is feasible if we analyze the battery consumption behavior of a typical context-aware application to reduce context-aware operations at runtime. This analysis is based on different context sensors configurations. Actually existing context-aware approaches are mainly based on collecting and sending context data to external components, without taking into account how expensive are these operations in terms of energy consumption. As a first result of our work in progress, we are proposing a way for reducing the context data publishing. We have designed a testing battery consumption architecture supported by Nokia Energy Profiler tool to verify consumption in different scenarios

Performance Analysis of Cell Zooming Based Centralized Algorithm for Energy Efficient in Surabaya

The cellular subscribers’s growth over the years increases the traffic volume at Base Stations (BSs) significantly. Typically, in central business district (CBD) area, the traffic load in cellular network in the daytime is relatively heavy, and light in the daynight. But, Base Station still consumes energy normally. It can cause the energy consumption is wasted. On the other hand, energy consumption being an important issue in the world. Because, higher energy consumption contributes on increasing of emission. Thus, it requires for efficiency energy methods by switching BS dynamically. The methods are Lower-to-Higher (LH) and Higher-to-Lower (HL) scheme on centralized algorithm. In this paper propose cell zooming technique  which can adjusts the cell size dynamic based on traffic condition. The simulation result by using Lower-to-Higher (LH) scheme can save the network energy consumption up to 70.7917% when the number of mobile user is 37 users and 0% when the number of mobile user is more than or equal to 291 users. While, Higher-to-Lower (HL) scheme can save the network energy consumption up to 32.3303% when the number of mobile user is 37 users and 0% when the number of mobile user is more than or equal to 292 users. From both of these schemes, we can analyze that by using Lower-to-Higher (LH) scheme reduces energy consumption greater than using Higher-to-Lower (HL) scheme. Nevertheless, both of them can be implemented for energy-efficient method in CBD area. Eventually, the cell zooming technique by using two schemes on centralized algorithm which leads to green cellular network in Surabaya is investigated

ON THE LOCATION-AWARE COOPERATIVE SPECTRUM SENSING IN URBAN ENVIRONMENT

Spectrum sensing is a key enabling technology for cognitive radio networks (CRNs). The main objective of spectrum sensing is to provide more spectrum access opportunities to cognitive radio users without interfering with the operations of the licensed network. Spectrum sensing decisions can lead to erroneous sensing with low performance due to fading, shadowing and other interferences caused by either terrain inconsistency or dense urban structure. In order to improve spectrum sensing decisions, in this paper a cooperative spectrum sensing scheme is proposed. The propagation conditions such as the variance and intensity of terrain and urban structure between two points with respect to signal propagation are taken into consideration. We have also derived the optimum fusion rule which accounts for location reliability of secondary users (SUs). The analytical results show that the proposed scheme slightly outperforms the conventional cooperative spectrum sensing approaches

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4