Design and evaluation of wireless dense networks : application to in-flight entertainment systems

Le réseau sans fil est l'un des domaines de réseautage les plus prometteurs avec des caractéristiques uniques qui peuvent fournir la connectivité dans les situations où il est difficile d'utiliser un réseau filaire, ou lorsque la mobilité des nœuds est nécessaire. Cependant, le milieu de travail impose généralement diverses contraintes, où les appareils sans fil font face à différents défis lors du partage des moyens de communication. De plus, le problème s'aggrave avec l'augmentation du nombre de nœuds. Différentes solutions ont été introduites pour faire face aux réseaux très denses. D'autre part, un nœud avec une densité très faible peut créer un problème de connectivité et peut conduire à l'optension de nœuds isolés et non connectes au réseau. La densité d'un réseau est définit en fonction du nombre de nœuds voisins directs au sein de la portée de transmission du nœud. Cependant, nous croyons que ces métriques ne sont pas suffisants et nous proposons une nouvelle mesure qui considère le nombre de voisins directs et la performance du réseau. Ainsi, la réponse du réseau, respectant l'augmentation du nombre de nœuds, est considérée lors du choix du niveau de la densité. Nous avons défini deux termes: l'auto-organisation et l'auto-configuration, qui sont généralement utilisés de façon interchangeable dans la littérature en mettant en relief la différence entre eux. Nous estimons qu'une définition claire de la terminologie peut éliminer beaucoup d'ambiguïté et aider à présenter les concepts de recherche plus clairement. Certaines applications, telles que Ies systèmes "In-Flight Entertainment (IFE)" qui se trouvent à l'intérieur des cabines d'avions, peuveut être considérées comme des systèmes sans fil de haute densité, même si peu de nœuds sont relativement présents. Pour résoudre ce problème, nous proposons une architecture hétérogène de différentes technologies à fin de surmonter les contraintes spécifiques de l'intérieur de la cabine. Chaque technologie vise à résoudre une partie du problème. Nous avons réalisé diverses expérimentations et simulations pour montrer la faisabilité de l'architecture proposée. Nous avons introduit un nouveau protocole d'auto-organisation qui utilise des antennes intelligentes pour aider certains composants du système IFE; à savoir les unités d'affichage et leurs systèmes de commande, à s'identifier les uns les autres sans aucune configuration préliminaire. Le protocole a été conçu et vérifié en utilisant le langage UML, puis, un module de NS2 a été créé pour tester les différents scénarios.Wireless networking is one of the most challenging networking domains with unique features that can provide connectivity in situations where it is difficult to use wired networking, or when ! node mobility is required. However, the working environment us! ually im poses various constrains, where wireless devices face various challenges when sharing the communication media. Furthermore, the problem becomes worse when the number of nodes increase. Different solutions were introduced to cope with highly dense networks. On the other hand, a very low density can create a poor connectivity problem and may lead to have isolated nodes with no connection to the network. It is common to define network density according to the number of direct neighboring nodes within the node transmission range. However, we believe that such metric is not enough. Thus, we propose a new metric that encompasses the number of direct neighbors and the network performance. In this way, the network response, due to the increasing number of nodes, is considered when deciding the density level. Moreover, we defined two terms, self-organization and self-configuration, which are usually used interchangeably in the literature through highlighting the difference ! between them. We believe that having a clear definition for terminology can eliminate a lot of ambiguity and help to present the research concepts more clearly. Some applications, such as In-Flight Entertainment (IFE) systems inside the aircraft cabin, can be considered as wirelessly high dense even if relatively few nodes are present. To solve this problem, we propose a heterogeneous architecture of different technologies to overcome the inherited constrains inside the cabin. Each technology aims at solving a part of the problem. We held various experimentation and simulations to show the feasibility of the proposed architecture

SenMinCom: Pervasive Distributed Dynamic Sensor Data Mining for Effective Commerce

In last few years, the use of wireless sensor networks and cell phones has become ubiquitous; fusing these technologies in the field of business will open up new possibilities. To fill this lacuna, I propose a novel idea where the combination of these will facilitate companies to receive feedback on their products and services. System\u27s unobtrusive sensors will not only collect shopping, mobile usage data from consumers but will also make effective use of this information to increase revenue, cut costs, etc.; the use of mobile agent based data mining allows analyzing the data from different dimensions, categorizing it on factors such as product positioning, promotion of goods, etc. as in the case of a shopping store. Additionally, because of the dynamic mining system the companies get on-the-scene recommendation of products rather than off-the-scene. In this thesis, a novel distributed pervasive mining system is proposed to get dynamic shopping information and mobile device usage of the customers

Exploring Wireless Data Center Networks: Can They Reduce Energy Consumption While Providing Secure Connections?

Data centers have become the digital backbone of the modern world. To support the growing demands on bandwidth, Data Centers consume an increasing amount of power. A significant portion of that power is consumed by information technology (IT) equipment, including servers and networking components. Additionally, the complex cabling in traditional data centers poses design and maintenance challenges and increases the energy cost of the cooling infrastructure by obstructing the flow of chilled air. Hence, to reduce the power consumption of the data centers, we proposed a wireless server-to-server data center network architecture using millimeter-wave links to eliminate the need for power-hungry switching fabric of traditional fat-tree-based data center networks. The server-to-server wireless data center network (S2S-WiDCN) architecture requires Line-of-Sight (LoS) between servers to establish direct communication links. However, in the presence of interference from internal or external sources, or an obstruction, such as an IT technician, the LoS may be blocked. To address this issue, we also propose a novel obstruction-aware adaptive routing algorithm for S2S-WiDCN. S2S-WiDCN can reduce the power consumption of the data center network portion while not affecting the power consumption of the servers in the data center, which contributes significantly towards the total power consumption of the data center. Moreover, servers in data centers are almost always underutilized due to over-provisioning, which contributes heavily toward the high-power consumption of the data centers. To address the high power consumption of the servers, we proposed a network-aware bandwidth-constrained server consolidation algorithm called Network-Aware Server Consolidation (NASCon) for wireless data centers that can reduce the power consumption up to 37% while improving the network performance. However, due to the arrival of new tasks and the completion of existing tasks, the consolidated utilization profile of servers change, which may have an adverse effect on overall power consumption over time. To overcome this, NASCon algorithm needs to be executed periodically. We have proposed a mathematical model to estimate the optimal inter-consolidation time, which can be used by the data center resource management unit for scheduling NASCon consolidation operation in real-time and leverage the benefits of server consolidation. However, in any data center environment ensuring security is one of the highest design priorities. Hence, for S2S-WiDCN to become a practical and viable solution for data center network design, the security of the network has to be ensured. S2S-WiDCN data center can be vulnerable to a variety of different attacks as it uses wireless links over an unguided channel for communication. As being a wireless system, the network has to be secured against common threats associated with any wireless networks such as eavesdropping attack, denial of services attack, and jamming attack. In parallel, other security threats such as the attack on the control plane, side-channel attack through traffic analysis are also possible. We have done an extensive study to elaborate the scope of these attacks as well as explore probable solutions against these issues. We also proposed viable solutions for the attack against eavesdropping, denial of services, jamming, and control-plane attack. To address the traffic analysis attack, we proposed a simulated annealing-based random routing mechanism which can be adopted instead of default routing in the wireless data center

ReSCon '11, Research Student Conference: Book of Abstracts

The fourth SED Research Student Conference (ReSCon2011) was hosted over three days, 20-22 June 2011, in the Hamilton Centre at Brunel University. The conference consisted of technical presentations, a poster session and social events. which focused on current research being conducted within the School of Engineering and Design by postgraduate research students from the School. The conference is held annually, and ReSCon plays a key role in contributing to research and innovations within the School

Agriculture fleet vehicle routing: A decentralised and dynamic problem

To date, the research on agriculture vehicles in general and Agriculture Mobile Robots (AMRs) in particular has focused on a single vehicle (robot) and its agriculture-specific capabilities. Very little work has explored the coordination of fleets of such vehicles in the daily execution of farming tasks. This is especially the case when considering overall fleet performance, its efficiency and scalability in the context of highly automated agriculture vehicles that perform tasks throughout multiple fields potentially owned by different farmers and/or enterprises. The potential impact of automating AMR fleet coordination on commercial agriculture is immense. Major conglomerates with large and heterogeneous fleets of agriculture vehicles could operate on huge land areas without human operators to effect precision farming. In this paper, we propose the Agriculture Fleet Vehicle Routing Problem (AF-VRP) which, to the best of our knowledge, differs from any other version of the Vehicle Routing Problem studied so far. We focus on the dynamic and decentralised version of this problem applicable in environments involving multiple agriculture machinery and farm owners where concepts of fairness and equity must be considered. Such a problem combines three related problems: the dynamic assignment problem, the dynamic 3-index assignment problem and the capacitated arc routing problem. We review the state-of-the-art and categorise solution approaches as centralised, distributed and decentralised, based on the underlining decision-making context. Finally, we discuss open challenges in applying distributed and decentralised coordination approaches to this problem

E-grocery logistics: exploring the gap between research and practice

Purpose: This paper investigates the logistics management in the e-grocery sector. It contrasts the key issues faced by practitioners and the topics addressed in the academic literature, to identify potential misalignments between research and practice and propose avenues for future efforts. Design/methodology/approach: This work adopts a twofold methodological approach. From an academic perspective, a systematic literature review (SLR) is performed to define the topics addressed so far by scholars when analysing e-grocery logistics. From a managerial perspective, a Delphi study is accomplished to identify the most significant issues faced by logistics practitioners in the e-grocery context and the associated significance. Findings: The study develops a conceptual framework, identifying and mapping the 9 main logistics challenges for e-grocery along 4 clusters, in the light of a logistics-related revision of the SCOR model: distribution network design (area to be served, infrastructures), order fulfilment process (picking, order storage, consolidation, delivery), logistics-related choices from other domains (product range, stock-out management) and automation. These elements are discussed along three dimensions: criticalities, basic and advanced/automation-based solutions. Finally, the main gaps are identified – in terms of both under-investigated topics (order storage and stock-out management) and investigated topics needing further research (picking and automation) – and research questions and hypotheses are outlined. Originality/value: This paper provides a threefold contribution, revolving around the developed framework. First, it investigates the state of the art about e-grocery logistics, classifying the addressed themes. Second, it explores the main issues e-grocery introduces for logistics practitioners. Third, it contrasts the two outcomes, identifying the misalignment between research and practice, and accordingly, proposing research directions

Networks, Communication, and Computing Vol. 2

Networks, communications, and computing have become ubiquitous and inseparable parts of everyday life. This book is based on a Special Issue of the Algorithms journal, and it is devoted to the exploration of the many-faceted relationship of networks, communications, and computing. The included papers explore the current state-of-the-art research in these areas, with a particular interest in the interactions among the fields