Topology Control Research Papers - Academia.edu (original) (raw)

2025, AI Review of "Why Is Our World Four-Dimensional?"

In this piece, the author embarks on a wide-ranging philosophical and mathematical inquiry into why our world appears to be four-dimensional. Beginning with a conversation that grounds spacetime in three spatial dimensions plus one temporal dimension, the author then challenges conventional explanations by positing new conceptual frameworks. Key highlights include: • Use of a 2D manifold (often conceptualized in the complex plane C²) to show how extra dimensions can arise from the interplay between the observer (subject) and the observed (object). • Emphasis on the "self-inclusion paradox," which suggests that the observer, inherently part of the universe they observe, destabilizes a purely fixed 2D representation, prompting the emergence of additional dimensions. • Explanations linking mathematical endomorphisms in C² with relativistic notions of Minkowski space and the arrow of time (signature +-). • A final turn toward topological constructs such as the Klein bottle to capture the non-orientable interface between subject and object. The Klein bottle is used to illustrate how these boundaries, embedded in higherdimensional spaces, might unify or twist perspectives in a way that demands four-dimensional geometry. Overall, the work blends philosophical idealism or constructivism (where perception shapes reality) with mathematical physics. By doing so, it explores possible reasons and frameworks for our four-dimensional experience, delving into how time might emerge through repeated "collapses" of a stable two-dimensional perspective.

2025, MATEC Web of Conferences

Wireless sensor networks are used for monitoring the environment and controlling the physical environment. Information gathered by the sensors is only useful if the positions of the sensors are known. One of the solutions for this problem is Global Positioning System (GPS). However, this approach is prohibitively costly; both in terms of hardware and power requirements. Localization is defined as finding the physical coordinates of a group of nodes. Localization is classified as an unconstrained optimization problem. In this work, we propose a new algorithm to tackle the problem of localization; the algorithm is based on a hybridization of Particle Swarm Optimization (PSO) and Simulated Annealing (SA). Simulation results are given to illustrate the robustness and efficiency of the presented algorithm.

2025, IEEE Transactions on Signal Processing

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power iteration method that allows each node to estimate and track the algebraic connectivity of the underlying expected graph. Using results from stochastic approximation theory, we prove that the proposed method converges almost surely (a.s.) to the desired value of connectivity even in the presence of imperfect communication scenarios. The estimation strategy is then used as a basic tool to adapt the power transmitted by each node of a wireless network, in order to maximize the network connectivity in the presence of realistic Medium Access Control (MAC) protocols or simply to drive the connectivity toward a desired target value. Numerical results corroborate our theoretical findings, thus illustrating the main features of the algorithm and its robustness to fluctuations of the network graph due to the presence of random link failures.

2025, IEEE Transactions on Signal Processing

2025, 25th IEEE International Conference on Distributed Computing Systems Workshops

2025, 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems

Efficient power line monitoring is essential for reliable operation of the Smart Grid. A Power Line Monitoring Network (PLMN) based on wireless sensor nodes can provide the necessary infrastructure to deliver data from the extension of the power grid to one or several control centers. However, the restricted physical topology of the power lines constrains the data paths, and has a great impact on the reporting performance. We discuss the features of power-lines and their impact on the performance of monitoring and transmissions. We present a comprehensive design to guide efficient and flexible relay selection in PLMNs to ensure reliable and energy efficient transmissions while taking into account the restricted topology of power-lines. Specifically, our design applies probabilistic power control along with flexible transmission scheduling to combat the poor channel conditions around power line while maintaining the energy level of transmission nodes. We evaluate the impact of different channel conditions, non-uniform topologies for a power line corridor and the effect of reporting events. Our performance results demonstrate that our data forwarding scheme can well control the energy consumption and delay while ensuring reliability and extended lifetime.

2025, Lecture Notes in Computer Science

Minimizing energy consumption and ensuring fault tolerance are two important issues in ad-hoc wireless networks. In this paper, we describe a distributed topology control algorithm which minimizes the amount of power needed to maintain bi-connectivity. The algorithm selects optimum power level at each node based on local information only. The resultant topology has two properties: (1) it preserves the minimum energy path between any pair of nodes and (2) it ensures fault tolerance by maintaining bi-connectivity. By presenting experimental results, we show the effectiveness of our proposed algorithm.

2025, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

In this paper we study the issue of topology control under the physical Signal-to-Interference-Noise-Ratio (SINR) model, with the objective of maximizing network capacity. We show that existing graph-model-based topology control captures interference inadequately under the physical SINR model, and as a result, the interference in the topology thus induced is high and the network capacity attained is low. Towards bridging this gap, we propose a centralized approach, called Spatial Reuse Maximizer (MaxSR), that combines a power control algorithm T4P with a topology control algorithm P4T. T4P optimizes the assignment of transmit power given a fixed topology, where by optimality we mean that the transmit power is so assigned that it minimizes the average interference degree (defined as the number of interferencing nodes that may interfere with the ongoing transmission on a link) in the topology. P4T, on the other hand, constructs, based on the power assignment made in T4P, a new topology by deriving a spanning tree that gives the minimal interference degree. By alternately invoking the two algorithms, the power assignment quickly converges to an operational point that maximizes the network capacity. We formally prove the convergence of MaxSR. We also show via simulation that the topology induced by MaxSR outperforms that derived from existing topology control algorithms by 50%-110% in terms of maximizing the network capacity.

2025, Proceedings of the 2009 Winter Simulation Conference (WSC)

The advancement of electronic sensing devices, microcomputers and wireless communication devices has lead to creation of new smart sensors, which can monitor actuate, compute and communicate. Typically, these sensors are deployed in nondeterministic mode (randomly) when deployed in large numbers. These sensor devices have the capability to self-organize into the so-called Wireless Sensor Networks (WSN). WSN are ad-hoc networks, consisting of these spatially distributed sensing and processing devices. We introduce a model and a simulation study of these Large Wireless Sensor Networks (WSN) by implementing the Topology Control Algorithm. We use the Cell-DEVS formalism, which enables efficient execution of cellular models. Thereafter, we observe and evaluate the behavior of sensor nodes and entire WSN from the simulation results obtained, under different test scenarios.

2025, Wireless Communications and Mobile Computing

Recently, multi-radio mesh technology in wireless networks has been under extensive research. This is because of its potential of overcoming the inherent wireless multi-hop throughput, scalability and latency problems caused by the half-duplex nature of the IEEE 802.11. The concept of deploying multiple radios in wireless network access points (APs) has shown a promising way to enhance the channel selection and the route formation while the MESH topology allows more fine-grained interference management and topology control. Within this realm, given a set of end-to-end objectives, there are multiple issues that need to be identified when we consider the optimization problem for fixed multi-channel multi-hop wireless networks with multiple radios. This paper addresses the static channel assignment problem for multichannel multi-radio static wireless mesh networks. We first discuss its similarities and differences with the channel assignment problem in cellular networks (WMN). Next, we present four metrics based on which mesh channel assignments can be obtained. Three of these metrics attempt to maximize simultaneous transmissions in a mesh network, either directly or indirectly. The fourth metric quantifies the 'diversity' of a particular assignment and can be used as a secondary criterion to the other three metrics. Related optimization models have also been developed.

2025, Bài Toán Thông Minh (Nhiều Tác Giả) thuviensach

Tài liệu tập hợp các bài toán logic hay cho bạn đọc

2025

46 DOMINIQUE LENFANT Sardanapale au Vo siècle : un souverain richissime a) Une figure connue Les premières mentions conservées de Sardanapale datent du Ve siècle av. J.-C., mais leur caractère allusif prouve que c'est alors une... more

2025

The paper presents a knowledge-based (KB) approach to improve mathematical programming techniques used in the system planning environment. The KB system assists in selecting appropriate optimization algorithms, objective functions, constraints and parameters. The scheme is implemented by integrating symbolic computation of rules derived from operator and planner's experience and is used for generalized optimization packages. The KB optimization software package is capable of improving the overall planning process which includes correction of given violations. The method has been demonstrated on a large-scale power system discussed in the paper.

2025

It is very challenging to overcome the known limitations of the current wireless sensor networks in terms of throughput, delay, and jitter while being energy efficient, in order to support multimedia applications. Nonetheless, the LEMR-multichannel (Latency, Energy, MAC and Routing) protocol has recently been proposed as a solution to address these issues over multi-hops wireless sensor networks. LEMR-multichannel addresses the typical interference problems found in wireless networks and includes an energy-efficient new dynamic duty cycle multi-channel medium access mechanism and a coordination strategy that uses the different channels available in the single radio transceiver devices to enhance the throughput capability of the network. This article provides an analytical model to compute the most important performance metrics of the LEMR-multichannel protocol. The model is also validated through simulation experiments.

2025, 2016 American Control Conference (ACC)

Time-varying network topology plays a key role in mobile sensor networks for detection of an event of interest and subsequent awareness propagation within a monitoring and surveillance framework. While physical space parameters such as communication range and mobility characteristics directly drive the network structure, feedback from the information space can be useful to improve network topology and facilitate efficient information management. In this context, the paper proposes a feedback control scheme for tuning key network topology parameters, such as average degree and degree distribution under the recently proposed generalized gossip framework for distributed belief/awareness propagation in mobile sensor networks. The crux of this decentralized control policy is to modify the timelines of the asynchronous belief update protocol depending on the node-level belief/awareness. Using a proximity network representation for a mobile sensor network, the paper presents both analytic ...

2025, HAL (Le Centre pour la Communication Scientifique Directe)

This paper proposes a three-phase multilevel converter topology based on the multiplexed concept which is especially intended for medium-voltage power drives applications. The main potential application are fourquadrant 4.16 kV and 6.6 kV power drives. The proposed topology allows pushing efficiency, switching frequency and cost to values that could not be obtained with HV semiconductors which are expensive and have poor switching performances. This paper will describe the topology, its modulation and control strategy, its main waveforms, the overall efficiency and a comparison with a 5LANPC inverter.

2025, International Teletraffic Congress

In wireless sensor networks (WSNs), a significant amount of packets are lost when transmitted over wireless links, leading to unnecessary energy expenditure. This lossy property of a link can be described by the packet reception ratio (PRR) over it. In the literature, it was shown that the PRR of a link is a non-decreasing function of its signal to interference-plus-noise ratio (SINR), which indicates that the PRR can be improved by either enhancing the received power or reducing the interferenceplus-noise level. On the other hand, a number of topology control algorithms and channel assignment algorithms have been presented for WSNs to reduce interference. However, most of them simply use the number of interfering nodes to describe the level of interference, which is inaccurate thus cannot guarantee high PRR. In this paper, we propose a joint design of topology control and channel assignment for lossy WSNs, aiming at improving the PRR of each link in the network. We first construct a maximum PRR spanning tree, then adjust the transmitting power and channel of sensor nodes to further improve the PRR of links on the tree. This way, packet retransmission due to lossy links is minimized, which leads to performance improvement in terms of network throughput, energy efficiency and end-to-end packet delay. We formulate the joint design into an optimization problem and prove its NP-hardness. We then present heuristic algorithms to give practical solutions for the problem. We have carried out extensive simulations and the results show that network performance can be significantly improved by using the topology generated by our algorithms compared to the topologies generated by other schemes under the same traffic demand.

2025, Vehicular Technology Conference, 1988, IEEE 38th

For a wireless video sensor network (WiViSeN) where video nodes have been placed at some strategic locations to capture designated scenes, an immediate challenge is to locate the base-station optimally such that the network lifetime of batterypowered video nodes can be maximized. This paper presents two schemes, one centralized and the other distributed, to obtain the optimal base-station location algorithmically under the proposed definition of topological lifetime. The upper and lower bounds of maximal topological lifetime are derived to enable a quick assessment of energy provisioning feasibility and topology control necessity. In addition, the proposed research provides a foundation to introduce the relay and cluster techniques that can further prolong network lifetime.

2025

In this dissertation, we introduce a new topology control problem for rulebased link-state routing in autonomous networks. In this context, topology control is a mechanism to reduce the broadcast storm problem associated with link-state broadcasts. We focus on a class of topology control mechanisms called local-pruning mechanisms. Topology control by local pruning is an interesting multi-agent graph optimization problem, where every agent/router/station has access to only its local Prof. R. La, Prof. S. Marcus and Prof. S. Raghavan -for agreeing to serve in my committee. I must also thank Prof. S. Marcus for referring to related work on algebraic dynamic programming, which helped improve the dissertation manuscript. I want to thank the administrative staff of the ISR and the ECE department, and in particular, Kim Edwards for helping me in several official and administrative matters. I am grateful to all my colleagues and friends who have offered help in various ways. I like to specially thank, my good friend, Kaustubh Jain for the several constructive conversations that we had concerning this dissertation topic. I also like to thank Ranjit Kumaresan for introducing me to shortest path problems, which is pivotal to this dissertation. My profound sense of gratitude is to my family: my mother, my father and my brother. Their constant support and confidence in me made graduate studies really enjoyable. I am greatly indebted to my beloved Gowri, for without her love, support and encouragement, this dissertation might not have been possible.

2025, passer

Wireless sensor networks (WSNs) have found great appeal and popularity among researchers, especially in the field of monitoring and surveillance tasks. However, it has become a challenging issue due to the need to balance different optimization criteria such as power consumption, packet loss rate, and network lifetime, and coverage. The novelty of this research discusses the applications, structures, challenges, and issues we face in designing WSNs. And proposed new Topology control mechanisms it will focus more on building a reliable and energy efficient network topology step by step through defining available amount of energy for each node within its cluster, sorting all within header, and selecting an active one (more power header) for signal routing. While sensor cover topology demonstrates network monitoring capability, connection topology should remain as a requirement for the successful delivery of information including queries, data collected, and control messages. How to bu...

2025, Mobile Information Systems

Topology Control has been shown to provide several benefits to wireless ad hoc and mesh networks. However these benefits have largely been demonstrated using simulation-based evaluations. In this paper, we demonstrate the negative impact that the PlainTC Topology Control prototype has on topology stability. This instability is found to be caused by the large number of transceiver power adjustments undertaken by the prototype. A context-based solution is offered to reduce the number of transceiver power adjustments undertaken without sacrificing the cumulative transceiver power savings and spatial reuse advantages gained from employing Topology Control in an infrastructure wireless mesh network. We propose the context-based PlainTC+ prototype and show that incorporating context information in the transceiver power adjustment process significantly reduces topology instability. In addition, improvements to network performance arising from the improved topology stability are also observed. Future plans to add real-time context-awareness to PlainTC+ will have the scheme being prototyped in a software-defined wireless mesh network test-bed being planned.

2025, Indian Journal of Computer Science and …

Recent years showed a wide range of applications in Wireless Sensor Networks (WSN). For a WSN, Topology Control is crucial to obtain an energy efficient network without affecting the connectivity and other properties. In this paper the sequence of strategies carried out to obtain a better scheme for a topology control in terms of energy is discussed. The results showed the effectiveness of the different approaches proposed. Comparison on one tier architecture and two tier architecture using the proposed methodology is also made. The future works discussed also gives a wider vision on the probabilities of the various schemas for the forthcoming years.

2025, 2014 14th International Conference on Innovations for Community Services (I4CS)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

2025, 2011 World Congress on Information and Communication Technologies

Energy consumption is one of the most crucial design issues in wireless sensor network (WSN) nodes since prolonging the WSN nodes lifetime depends on the efficient management of sensing node energy resource. In this paper, a new approach for power management that eliminate such wake-up periods unless the node indeed needs to wake up, is introduced for wireless sensor network nodes. In the proposed wake up scheme, to achieve energy conservation, sensing nodes employing the proposed scheme sleeps periodically to reduce duty cycle and minimize idle listening. The potential power saving in terms of the lifespan of a sensor network application is evaluated, using experimental setup. Unlike common wireless sensor network nodes employing always-on and rotation-based power management schemes, the proposed scheme saves 98% of the energy used in the always-on scheme, and saves over 70% of the energy used in the rotation-based scheme. Results of the WSN node employing the new power management scheme are presented including comparisons with those of a WSN node employing conventional always-on and rotation-based power management schemes.

2025, J. Netw. Intell.

The wireless sensor network (WSN) is a system composed of a large number of sensor nodes, which are distributed in a designed coverage region for detecting specific interested events. The sensor nodes would pass the collected information back to the data collection center, which is called the sink node. In WSNs, the sink node is designed to play the role as the data processing and the control center; and the rest of sensor nodes are responsible for sensing the interested events and transmitting the related information back to the sink node. Therefore, where to place the sink node in the whole network in an important issue because the position of the sink node directly affects the data transmission efficiency and the distance from the terminal sensor node to the sink node. In this paper, we propose a sink node placement method by applying Cat Swarm Optimization algorithm (CSO) and use the greedy algorithm to create the data transmission paths. In addition, a newly designed fitness fu...

2025, IJARCSSE

this paper we propose and evaluate a combined routing, admission control and source distribution scheme that
aims to maximize the aggregated efficiency of the system. As part of this scheme, two novel efficiency-constructed
algorithms are presented. The core of the scheme is a distributed, price-constructed distribution algorithm that allocates
bandwidth to flows using only locally available information. A complementary price-constructed routing algorithm for
choosing the most advantageous path for the flows is also proposed. In my work, however, the routing algorithm is part of
the global distribution optimization scheme. The core of the scheme is a distributed price-constructed distribution
algorithm that allocates bandwidth to flows using only locally available information. A complementary price-constructed
routing algorithm for choosing the most advantageous path for the flows is also proposed. We start by formulating the
distribution problem as a linear programming maximization problem. To properly divide the shared channel in an ad hoc
setting, we use the concept of clique source. It allows gathering mutually interfering links in partially overlapping
maximal cliques. The cliques deterministically account for bandwidth capacity and act as source s in the LP problem. We
then propose a distributed low-complexity distribution algorithm that uses the concept of source shadow price. The novelty
is that the algorithm employs an auction mechanism, where flows are bidding for source s. The bids depend both on the
flow’s efficiency function and the intrinsically derived shadow prices. We present two versions of the distribution scheme.

2025, International journal of Computer Networks & Communications

An RFID network consists of a set of tags and readers. The cost and the number of tags covered directly depend on the number of readers. So, finding optimal number of readers and their positions to cover all tags is one of the most important issues in an RFID network. In this paper, we have proposed a reader placement technique in a departmental store equipped with RFID network using Particle Swarm Optimization (PSO). The proposed algorithm finds minimal number of readers along with their position with 100% coverage of tagged items. Simulated results also show the algorithms effectiveness in achieving the optimal solution.

2025, International Journal of Advanced Research in Computer Science and Software Engineering

The main motive of this research is to study energy-efficient data-gathering mechanisms to detect sensor data irregularities Detection of sensor data irregularities is useful for practical applications as well as for network management, because the patterns found can be used for both decision making in applications and system performance tuning. For example, irregularities in sensory data are of interest of monitoring applications. In addition, for this kind of applications, the communication cost can be reduced if only abnormal sensory values, as opposed to all values, need to be transmitted.

2024, IEEE Communications Surveys & Tutorials

2024, International Conference on Software, Telecommunications and Computer Networks

In order to be strongly connected in the network, a node may increase its power indiscriminately causing interference. Since interference is one of the major problems in wireless network, the proposed algorithm will co-operatively reduce inter-node interference in the network. Further, unidirectional links are a major source of interference as most of the routing protocol only utilizes bi-directional links. The algorithm will attempt to prevent such links or if required convert them into bi-directional links. The proposed algorithm is generic network layer power management algorithm and does not use special functionality of any routing protocol. Therefore, it can be applied to any routing protocol. Different routing protocols such as Dynamic Source Routing (DSR) in reference [3], Any Path Routing without Loops (APRL), Ad hoc On-Demand Distance Vector (AODV), On-demand Multicast Routing Protocol (ODMRP) and System-and Traffic-dependent Adaptive Routing Algorithm (STARA) in reference have been used by the authors to prove their concept. To demonstrate the performance and the capability of the proposed algorithm, we have applied it to Optimized Link-State Routing (OLSR) protocol as an example of a typical routing protocol. We will show that the proposed algorithm provides strongly connected and more reliable network over dynamic physical channel modeled by log-distance path loss model, log-normal shadowing model and rayleigh fading model. It stabilizes node connectivity over the dynamic network and environment and even, to a certain extent, prevent node from being completely disconnected from the network. For the selected simulation environment, we will show that the proposed algorithm provides a shorter packet delay, improves the network throughput by as much as 37%, decreases the routing overhead and reduces interference. In this paper, we will show that the proposed distributed power management algorithm adapts well in dynamic network topology and physical environment and provides a more reliable and strongly connected network. The related works in power control are listed in Section II. Section III describes the proposed distributed power management algorithm. Propagation models are surveyed and the reasons for selecting log-distance path loss, log-normally distributed shadowing and rayleigh fading models are stated in Section IV. A brief description of OLSR protocol is presented in Section V. Section VI and VII presents the simulation parameters and results. Section VIII concludes the paper.

2024, 2008 16th IEEE International Conference on Networks

Wireless ad hoc networks consist of nodes which can communicate with each other in a peer-to-peer fashion over single hop or multi hops without any fixed infrastructure such as access point or base station. In flat topology there is no topology management concept and all the nodes participate in routing. In this paper the task of topology management for ad hoc networks is implemented using Routing Intelligence Mobile Agent (MARI) Algorithm and the performance is compared with that of flat topology network having same number nodes. In the proposed scheme the nodes with higher power levels among their one hop neighbors are selected as MARI nodes and these participate in routing. To provide communication between any two MARI nodes a midway node is selected. Only these MARI and midway nodes will stay awake and the remaining nodes will be in sleep mode so that there is power saving. In this paper, the power consumption and back off delay performance of a flat network and a network employing MARI algorithm are compared. The proposed MARI topology management is found to have less power consumption and less back-off delay as compared with flat topology.

2024, Sensors

In dense IoT deployments of wireless sensor networks (WSNs), sensor placement, coverage, connectivity, and energy constraints determine the overall network lifetime. In large-size WSNs, it is difficult to maintain a trade-off among these conflicting constraints and, thus, scaling is difficult. In the related research literature, various solutions are proposed that attempt to address near-optimal behavior in polynomial time, the majority of which relies on heuristics. In this paper, we formulate a topology control and lifetime extension problem regarding sensor placement, under coverage and energy constraints, and solve it by applying and testing several neural network configurations. To do so, the neural network dynamically proposes and handles sensor placement coordinates in a 2D plane, having the ultimate goal to extend network lifetime. Simulation results show that our proposed algorithm improves network lifetime, while maintaining communication and energy constraints, for medium...

2024, Wireless Sensor Network

A wireless sensor network consists of hundreds or thousands of small nodes which could either have a static or dynamic position. These nodes are deployed through normal or random distribution to report events of a particular area to the base station through sink nodes. Having limited onboard energy of sensor nodes, conservation of energy in wireless sensor network is necessary. For this purpose, a new algorithm is proposed titled Energy-Efficient-Direction-Based-Topology-Control-Algorithm (EEDBTC). In proposed algorithm, direction is the main concern whenever an event occurs the node will send data in the direction of base station so that less energy is consumed. The results of the same were compared with customary dense wireless sensor network, color based WSNs and it was observed that this algorithm is much better than previous topology control algorithms used.

2024, Journal of Communications

In the design of wireless communication networks, we may have to interconnect n stations locating at given points in the plane such that the distance among each stations is as small as possible by introducing at most k extra stations subjective to a budget limit. In this paper, our goal is to determine the locations of the extra k stations interconnecting the existing n stations to minimize the longest distance among stations. This is so-called bottleneck Steiner tree problem, which also has applications in VLSI routing, WDM optical networks design and phylogenetic tree reconstruction. The problem has been proved to be NP-hard and cannot be approximated in the performance ratio 2 in polynomial time in both Euclidean and rectilinear plane and approximation algorithms in the best possible performance ratios presented for the problem in both planes. In this paper, we improve the time complexity of the approximation algorithms and conduct simulations to demonstrate the validness of our improvements.

2024, Journal of emerging technologies and innovative research

Wireless Sensor Networks (WSNs) provide a bridge between the real, physical and virtual worlds. It allows the ability to seem at the previously imperceptible at a fine resolution over large spatiotemporal scales. A problem with energy constrained positioning in WSN is that it locates the nodes by consuming the energy but here each node is communicating with respect to energy consumption and time constrained. In previous papers, the nodes estimates their position based on positional information exchanged between nodes using wireless communications. For positioning the nodes by consuming the energy here WMCL-B positioning algorithm used for local connectivity information to impose constraints on the position of a node. In this paper, we assume that every node is capable of fixed positioning algorithm i.e. Novel Positioning Algorithm (NPA) in which the nodes communicates properly and activates modules selectively for consuming energy and determining the velocity of the node. IndexTerms...

2024

This paper investigates the research issues in Wireless Sensor Networks (WSNs), which is a new computing paradigm that emerged from the fusion of the SCADA (Supervisory Control and Data Acquisition) systems and Ad hoc networks technologies. WSNs provide network connectivity without the aid of any preexisting networking infrastructure. Very small sensor nodes, capable of sensing, data processing, and wireless communication, brought the idea of WSNs based on joint effort of a large number of nodes. WSNs are becoming an increasingly vital technology that will be used in a variety of applications such as inventory tracking, home automation, physiological monitoring, habitat monitoring, home automation, precision agriculture, and forest fire detection. Dynamic network topology, limited battery power, and constrained wireless bandwidth are the special characteristics of WSNs which make management of it significantly more challenging than conventional wired networks. This paper presents an overview of research trends and challenges in the design and implementation of WSNs. It summarizes the potential challenges that influence the WSNs design. Prospective applications of WSNs are described to show the importance of WSN. It also investigates the research issues of communications protocol at different layers.

2024

This paper describes how the process of synthesizing the design of both the topology (control law) and the numerical parameter values (tuning) for a controller can be automated using genetic programming. Genetic programming can be used to automatically make the decisions concerning the total number of signal processing blocks to be employed in a controller, the type of each block, the topological interconnections between the blocks, and the values (tuning) of all parameters for all blocks requiring parameters. In synthesizing the design of controllers, genetic programming can simultaneously optimize prespecified performance metrics (such as minimizing the time required to bring the plant output to the desired value), satisfy time-domain constraints (such as overshoot and disturbance rejection), and satisfy frequency domain constraints. Evolutionary methods have the advantage of not being encumbered by preconceptions that limit its search to well-traveled paths. Genetic programming is applied to an illustrative problem involving the design of a controller for a three-lag plant with a significant (fivesecond) time delay in the external feedback from the plant to the controller. The delay in the feedback makes the design of an effective controller difficult.

2024

PRISMA is a resource-oriented publish/subscribe middleware for WSN, which the main goals are to provide: (i) programming abstraction through the use of REpresentational State Transfer (REST) interfaces, (ii) services, encompassing asynchronous communication, resource discovery and topology control, (iii) runtime support through the creation, configuration, and execution of new applications in WSN, and (iv) QoS mechanisms to meet applications constraints. This paper describes PRISMA architecture, its implementation in the Arduino platform, and a preliminary evaluation.

2024, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

The vision for future telecommunication systems is considered as a representative example of a complex adaptive organization, where several elements, with various computational capabilities and network resources, are interconnected. The increased complexity and the continuously changing network environment make more intense the need for automation and for localized network management tasks. Self-management will allow the execution of advanced configuration actions, such as the change of the wireless network topology under various performance criteria. This paper focuses on the description of the principles and the architectural framework for the cognitive management of future communication systems, considering a complex radio access environment. This framework is used in order to present a solution on the autonomic topology control of future communication systems, where multi-hop links are established using the available relays stations, under the energy consumption constraint.

2024

Clustering of nodes is one of the most effective approach for conserving energy in wireless sensor networks (WSNs). Cluster formation protocols generally consider the heterogeneity of sensor nodes in terms of energy difference of nodes but ignore the different sensing mechanisms (multiple events detection) of them. Observing different type of phenomenas and reporting them at different rates is an important factor effecting the homogeneity. It is, therefore, imperative to consider the multi-event sources in the design of clustering protocols. In this paper, a multi-event adaptive cluster (M EAC) formation protocol is proposed that aims to conserve the energy of sensor nodes in the presence of heterogeneity. It is achieved by considering three design factors; (1) electing an appropriate node to function as cluster-head, (2) limiting the number of clusters in the network and (3) reducing the frequency of clusters reformation. Performance evaluation results show that MEAC improves the stability and energy conservation of the heterogeneous wireless sensor networks.

2024

Wireless sensor network comprises of small sensor nodes with limited resources. Clustered networks have been proposed in many researches to reduce the power consumption in sensor networks. LEACH is one of the most interested techniques that offer an efficient way to minimize the power consumption in sensor networks. However, due to the characteristics of restricted resources and operation in a hostile environment, WSNs are subjected to numerous threats and are vulnerable to attacks. This research proposes a solution that can be applied on LEACH to increase the level of security. In Watchdog-LEACH, some nodes are considered as watchdogs and some changes are applied on LEACH protocol for intrusion detection. Watchdog-LEACH is able to protect against a wide range of attacks and it provides security, energy efficiency and memory efficiency. The result of simulation shows that in comparison to LEACH, the energy overhead is about 2% so this method is practical and can be applied to WSNs.

2024, 2011 IEEE Power and Energy Society General Meeting

The standard optimal power flow (OPF) problem minimizes generation costs over one study period assuming a fixed system topology. The prospect of a smart grid incorporating extensive cyber capabilities enabling significant progress in economic efficiency, reliability and environmental sustainability, ought to transform the OPF problem accordingly. This paper discusses the inclusion of tractable dynamic transmission topology control in the OPF problem based on heuristic control policies derived from individual transmission "line profit" criteria. Simulations on the IEEE 118-bus test system demonstrate the effectiveness of the heuristic policies in reducing production costs. As the algorithm's requisite information to identify promising candidate elements for switching is standard output of the OPF solution, the computational effort is up to four orders of magnitude better than dynamic transmission topology control performance reported in the literature.

2024, IEEE Transactions on Vehicular Technology

Due to low cost, ease of deployment, increased coverage, and enhanced capacity, multiradio mesh networks that utilize inexpensive and readily available Institute of Electrical and Electronics Engineers (IEEE) 802.11 wireless interfaces are touted as the new frontier of wireless networking. In a multihop mesh system, the close interaction between topology control and routing selection affects the system throughput of a wireless network. This paper proposes a novel joint topology control and routing (JTCR) protocol for a multiradio multichannel wireless mesh network to exploit both channel diversity and spatial reusability. It resides between medium access control and the network layer and aims to improve the network throughput by coordinating transmission power, channel assignment, and route selection among multiple nodes in a distributed way. JTCR jointly coordinates the transmission power at each node, the channel selection on each wireless interface, and the route selection among interfaces based on the traffic information that is measured and exchanged among two-hop neighbor nodes. An equivalent channel air time metric (ECAT M) is presented to quantify the difference of various adjustment candidates. This protocol achieves the efficient utilization of available channels by selecting a feasible adjustment candidate with the smallest ECAT M value and coordinating affected nodes to realize the adjustment. Our NS-2-based simulation results show that the network throughput can be significantly improved by using our proposed solution.

2024

A wireless sensors network comprises of randomly deployed small devices which provides reliable and effective communication over wireless network. They have the tendency to detect physical conditions environmental changes, in real time, such as pressure, light, temperature and humidity etc. The main areas of issues in WSN are power conservation, routing, data rates, memory etc. Enormous research has been done in WSN till date and it has huge potential to revolutionize human computer interaction in the coming future. Multiple solutions have been provided to combat various challenges based on the type of services required. This dissertation focuses on the power issues in WSN and efforts have been made to provide optimal power solution for node deployment using cluster-based algorithm. The clustering approach has been combined with the existing Fuzzy Self-Healing Algorithm. The simulations are done using NS-2.35 and results have been analyzed. It achieved greater power optimization and reduced time, hence enhancing the overall network lifetime. Hence, providing better performance in terms of power consumption and efficient communication

2024, Journal of Computer Networks and Communications

We proposed an energy conservation technique called Location Based Topology Control with Sleep Scheduling for ad hoc networks. It uses the feature of both topology control approach and power management approach. Like the topology control approach, it attempts to reduce the transmission power of a node, which is determined from its neighborhood location information. A node goes to sleep state based on the traffic condition as that of power management approach. In the proposed scheme, a node goes to sleep state only when its absence does not create local partition in its neighborhood. We preformed extensive simulation to compare the proposed scheme with existing ones. Simulation results show that the energy consumption is lower with increase in the network lifetime and higher throughput in the proposed scheme.

2024, Network and Communication Technologies

Wireless Sensor Networks (WSN) based on the IEEE 802.15.4 standard are constantly expanding. Applications like production control, building control are more and more based on WSN because of their energy efficiency, self organizing capacity and protocol flexibility. However, the construction of Cluster-Tree networks based on the beacon mode Pancake graphs is still undefined by the IEEE 802.15.4 standard. In order to enable the construction of such topology, i.e., Beacon Cluster-Tree based on Pancake graphs, we present, in this paper, a new topology construction approach. The Pancake is one of the Cayley graphs that were proposed as alternative to the Hypercube for interconnecting processors in parallel computers. This network offers attractive and desirable properties: Vertex symmetry, small degree and diameter, extensibility, high connectivity, easy routing, regularity of topology, fault-tolerance, and embed ability of other topologies. We present in this work the many-to-one embedding of Multiply-Twisted Hypercube into the Pancake networks with dilation 5 as a new approach for wireless networks. The presented approach is based on the exploitation of RF front-end capabilities in treating multipath signals and, thus, avoiding the introduction of beacon or Super Frames scheduling algorithms. Avoiding the introduction of scheduling algorithms ensures a simple solution that could be easily implemented and executed by ZigBee sensor nodes.

2024, Journal of emerging technologies and innovative research

Wireless Sensor Nodes generally have less battery life and less memory. Because of that constraint, we need a strong algorithm that allows us to reduce energy consumption as well low loss of packets. Throughout transmission of the data the energy is used for transmitting the packets. Part of the energy is utilized for data processing. We compare the Energy Consumption and Packet Loss Analysis of LEACH Routing Protocol on WSN over DTN. So we must use short-distance routing and data compression to reduce the power consumption. Using connected wireless sensor nodes a wireless sensor network is created, so each node is very compact and capable of detecting, storing, processing and communicating with other nodes within the environment. Good adaptability, good tolerance of faults and broad perception are the key advantages. Such functions enable the extension of wireless sensor networks to various applications, such as environmental monitoring, home care, medical care, and monitoring of battlefields. Recently WSNs have become a vital study area. Through wireless sensor networks more energy is used during the contact cycle between the sensor nodes. Prior the DTN do work as same as the WSN work on distributed platform. But in the term of efficiency and loss it find better ultimately have selective choice of WSN over the DTN.

2024, Journal of Applied and Computational Sciences in Mechanics

The main design objective of axial compressor is the efficiency increasing, pressure ratio and weight loss. These three parameters are used as an objective function and they are computed according to adopted design procedures. In this paper, a design method is presented that named quasi-threedimensional. Physical flow conditions are applied to design by some constraints to avoid irrational results. Some of these constraints help designer to impose considered requirements. In this paper, Hybrid Genetic Algorithm (HGA) is used for achieving the best design parameters that they construct a complex and non-linear design space. The radial distribution of several parameters is evaluated.