Lessons learned from the design of a mobile multimedia system in the Moby Dick project

Recent advances in wireless networking technology and the exponential development of semiconductor technology have engendered a new paradigm of computing, called personal mobile computing or ubiquitous computing. This offers a vision of the future with a much richer and more exciting set of architecture research challenges than extrapolations of the current desktop architectures. In particular, these devices will have limited battery resources, will handle diverse data types, and will operate in environments that are insecure, dynamic and which vary significantly in time and location. The research performed in the MOBY DICK project is about designing such a mobile multimedia system. This paper discusses the approach made in the MOBY DICK project to solve some of these problems, discusses its contributions, and accesses what was learned from the project

Octopus - an energy-efficient architecture for wireless multimedia systems

Multimedia computing and mobile computing are two trends that will lead to a new application domain in the near future. However, the technological challenges to establishing this paradigm of computing are non-trivial. Personal mobile computing offers a vision of the future with a much richer and more exciting set of architecture research challenges than extrapolations of the current desktop architectures. In particular, these devices will have limited battery resources, will handle diverse data types, and will operate in environments that are insecure, dynamic and which vary significantly in time and location. The approach we made to achieve such a system is to use autonomous, adaptable modules, interconnected by a switch rather than by a bus, and to offload as much as work as possible from the CPU to programmable modules that is placed in the data streams. A reconfigurable internal communication network switch called Octopus exploits locality of reference and eliminates wasteful data copies

An Energy Aware and Secure MAC Protocol for Tackling Denial of Sleep Attacks in Wireless Sensor Networks

Wireless sensor networks which form part of the core for the Internet of Things consist of resource constrained sensors that are usually powered by batteries. Therefore, careful energy awareness is essential when working with these devices. Indeed,the introduction of security techniques such as authentication and encryption, to ensure confidentiality and integrity of data, can place higher energy load on the sensors. However, the absence of security protection c ould give room for energy drain attacks such as denial of sleep attacks which have a higher negative impact on the life span ( of the sensors than the presence of security features. This thesis, therefore, focuses on tackling denial of sleep attacks from two perspectives A security perspective and an energy efficiency perspective. The security perspective involves evaluating and ranking a number of security based techniques to curbing denial of sleep attacks. The energy efficiency perspective, on the other hand, involves exploring duty cycling and simulating three Media Access Control ( protocols Sensor MAC, Timeout MAC andTunableMAC under different network sizes and measuring different parameters such as the Received Signal Strength RSSI) and Link Quality Indicator ( Transmit power, throughput and energy efficiency Duty cycling happens to be one of the major techniques for conserving energy in wireless sensor networks and this research aims to answer questions with regards to the effect of duty cycles on the energy efficiency as well as the throughput of three duty cycle protocols Sensor MAC ( Timeout MAC ( and TunableMAC in addition to creating a novel MAC protocol that is also more resilient to denial of sleep a ttacks than existing protocols. The main contributions to knowledge from this thesis are the developed framework used for evaluation of existing denial of sleep attack solutions and the algorithms which fuel the other contribution to knowledge a newly developed protocol tested on the Castalia Simulator on the OMNET++ platform. The new protocol has been compared with existing protocols and has been found to have significant improvement in energy efficiency and also better resilience to denial of sleep at tacks Part of this research has been published Two conference publications in IEEE Explore and one workshop paper

Energy Efficient Stable Cluster Scheme for MANET

In Mobile Ad-hoc Networks, cluster based routing protocol(CBRP) is robustly used since they combine the advantages of Reactive and Proctive routing protocols. And they have less routing overhead and less end-to-end delay compared to Reactive and Proctive routing protocols respectively. Energy source for a mobile node is limited, and even difficult to recharge. The life time of the network depends on the life time of the nodes. So we propose different shemes to have energy efficient stable clusters. By using stable clustering algorithm to avoid frequent reclustering, efficient clustering scheme to minimize overlapping clusters, and allow nodes to save their energy by changing their mode to sleep mode

Improving Performance of WSN Based On Hybrid Range Based Approach

Improving the performance of WSN supported hybrid range based approach. WSN is self-possessed minimization error of nodes prepared with limited resources, limited memory and computational abilities. WSNs reliably work in unidentified hubs and numerous situations, it's difficult to trade sensor hubs after deployment, and therefore a fundamental objective is to optimize the sensor nodes' lifetime. A WSN may be a set of a large number of resource-constrained sensor nodes which have abilities for information detection, processing, and short-range radio communication, Analysis localization error minimization based several applications of wireless sensor networks (WSN) need data regarding the geographical location of each detector node. Self-organization and localization capabilities are one in every of the foremost necessary needs in detector networks. It provides a summary of centralized distance-based algorithms for estimating the positions of nodes during very sensing nodes. Secure localization of unknown nodes during a very wireless detector network (WSN) may be a vital analysis subject wireless sensor networks (WSN), a component of enveloping computing, are presently getting used on a large scale to look at period environmental standing, Be that as it may, these sensors work underneath extraordinary vitality imperatives and are planned by remembering an application. Proposed approaches are sensing node location and challenging task, involve assessing sort of various parameters needed by the target application. In study realize drawback not sense positioning of nodes .but proposed approach formula recognizes the optimal location of nodes supported minimize error and best answer in WSN. Localization algorithms mentioned with their benefits and disadvantages. Lastly, a comparative study of localization algorithms supported the performance in WSN. This was often done primarily to offer a summary of the proposed approach known today for reliable data and minimizing the energy consumption in wireless sensor networks

Protocol

hyperviso