Mathematical Model with Energy and Clustering Energy Based Routing Protocols as Remediation to the Directional Source Aware Routing Protocol in Wireless Sensor Networks

In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is the routing problem. Due to the limited energy of sensor nodes, routing in this type of network shall perform efficiently to maximize the network lifetime. One of the proposed algorithms is the directional source aware routing protocol (DSAP) which, after simulation, showed a lot of limitations and drawbacks. The modified directional source aware routing protocol (MDSAP) was proposed by the authors of this paper to address some of the DSAP’s limitations but remains limited to a fixed topology, fixed source and stationary nodes. So EBP is proposed and operated under different scenarios and showed, after its simulation using TinyOS, many advantages in terms of load balancing, free looping, minimizing packet error rate and maximizing network lifetime.

Generic Tabu Search

The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, to implement and run any of the main categories of heuristic. This paper intends to discuss our proposed generic implementation of the Tabu Search algorithm, a heuristic procedure proposed by Fred Glover to solve discrete combinatorial optimization problems. In this research, we try to coordinate and synchronize different designs/implementations discussed in many literatures, with some of the references mentioned in this paper. The basic idea is to avoid that the search for best solutions stops when a local optimum is found, by maintaining a list of non-acceptable or forbidden (taboo) solutions/costs, called Tabu list or Short-Term Memory (STM). In our algorithm, we attempt to add some executions tracing functionalities in order to help later analysis for initial parameters tuning. On the other hand, we propose to include the concept of a list called Long-Term Memory (LTM), so that some of the best solutions found so far can be saved, for search diversification.

Flexible Traceable Generic Genetic Algorithm

This document elaborates on the generic implementation one of the main heuristics algorithms verified through its quick application to a biology problem requiring to find out an optimal sequences tree topology. In order to solve this problem, categorized as Non-Polynomial Hard (NP-Hard), “to minimize differences between given (leaf) and/or derived (parent) sequences”, many popular methods are used. “The higher the number of given sequences is, the more advisable and efficient it would be to go towards heuristics as they would provide a close-enough solution faster, as for instance genetic algorithms amongst others do. Thus, as part of a larger research in Heuristics and phylogenies, this paper aims to suggest a generic advanced flexible implementation of the Genetic Algorithm verified by a “general way to encode the problem into instances of different heuristic algorithms” as mentioned in our first reference below. The proposed algorithm will also present a chronology traceability feature for further analysis and potential improvements.

Generic Simulated Annealing

One of the many problems that are considered to be NP-Hard is the Multiple Sequence Alignment one that initially requires, as for any other of its siblings, a specific encoding schema and design of the main functionalities of the heuristics algorithm being implemented and executed. This paper intends to discuss our proposed generic implementation of the Simulated Annealing, inspired for the procedure of cooling and shaping methods of metals. In our algorithm, we attempted to add some executions tracing functionalities in order to help later analysis for initial parameters tuning. On another hand, we also tried to get closer in our attempt to mimic the cooling of metals, but giving it an option to run under different cooling schedules. We proposed a few schedules that seemed to be studied and/or used in many algorithm implementations.

Internet of Things: Towards a Solid Ecosystem of Interconnected Things

The Internet of Things (IoT) is a technological revolution that has changed everything we do and given us a new perspective on our daily lives, but despite the fact that numerous publications have focused on characterizing the many edges and technologies that make up an IoT system, the IoT ecosystem is still seen as too complex to be recognized as a stand-alone environment due to its significant diversity;hence, the objective of this research is to address such a complex environment in a way that highlights its components and distinguishes them both individually and in relation to their broader context. Therefore, the definition of IoT and its emergence were discussed and organized around the timeline of Internet development phases demonstrating that IoT has been a need that has accompanied the presence of the Internet since its early stages, and then its growth and impact were discussed and highlighted with estimates and numbers. On the technical side, each of the following groups, IoT components, protocols, and architectures, was defined, discussed, and grouped in such a way that their intergroup organization, as well as their placement and contribution to the overall ecosystem, was highlighted. This, in addition to the various examples mentioned throughout the discussion, will provide the reader with a better understanding of the Internet of Things and how deeply it has become entwined in our daily lives and routines as a result of its numerous applications.