Search results for "routing"
showing 10 items of 587 documents
A Group-Based Architecture for Wireless Sensor Networks
2007
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then they propagate it to the rest of sensors in their groups. We have simulated our proposal for different types of sensor topologies to know which type of topology is the best depending on the number of sensors in the whole network or depending on the number of interior sensors. We have also simulated how much time is needed to propagate information between groups. The application areas for our proposal coul…
A dynamic multi-sink routing protocol for static and mobile self-organizing wireless networks: A routing protocol for Internet of Things
2021
Abstract With the rapid advent of using various devices like smart phones, vehicles etc, the connection of these devices with the help of Internet connectivity has emerged to IoT paradigm. The interconnection of smart objects under the various real world constraints like communication technologies, network scalability, node mobility, energy consumption etc, is a big challenge and requires designing new robust, adaptive, dynamic, and configurable routing protocols. With the arrival of the 5G and the future Internet, the latency time will be extremely reduced, this motivated us to propose a new protocol that entrust internet to transport a large part of control and data traffic of the network…
A Group-Based Protocol for Large Wireless AD-HOC and Sensor Networks
2008
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them is based on groups. It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads. We propose an approach where the network is split into several groups of sensors where connections between groups are established as a function of the proximity and the neighbor's available capacity (based on the sensor's energy). In this paper the network architecture is described with its mathematical description and the messages that are needed to proper operation. It is also simulated how much time is n…
Web Tool for Path Analysis in Wireless Sensor Networks to Improve Their Performance
2018
Wireless Sensor Networks (WSNs) are based on tiny autonomous devices, usually named motes or nodes, and are used in many monitoring applications, such as environment, habitat, precision horticulture, etc. These motes are power-limited and most energy is wasted through the communication process when exchanging data packets. Because these motes are quite simple, with low power transmission and simple antennas, these networks usually run multihop routing protocols in order to forward packets between one mote to the sink, or the collector node, using the other motes as relaying motes. Basically, these routing protocols try to find out new routes within these wireless network, optimizing differe…
A mini-slot-based cooperative MAC protocol for wireless mesh networks
2010
This paper proposes a TDMA-based medium access control protocol with cooperative communications enabled in wireless mesh networks. The proposed scheme is based on a multi-hop scenario which is extended from the conventional one-hop triangle cooperative transmission scenario. Benefiting from the elaborate mini-slot design, channel resources are fairly and efficiently allocated to each router so that no handshake is needed prior to every packet transmission. By giving priority for channel access to cooperative transmission performed by an optimal helper which is determined based on the received SNR, higher successful transmission rate can be achieved. Numerical results demonstrate that the pr…
Reliable Data Gathering in Tree-Based IEEE 802.15.4 Wireless Sensor Networks
2007
This paper describes a routing protocol for enhanced robustness in IEEE 802.15.4-based sensor networks, which also addresses typical MAC layer issues, including power management, synchronization and link reliability. The algorithm uses a single-path strategy in error-free scenarios and resorts to using alternative paths when communication errors are detected. Our proposal exploits implicit acknowledgement of reception, a feature which may be provided by data aggregation when a broadcast medium such as the wireless channel is used. Therefore MAC layer acknowledgements are not used and errors recovery relies on a caching and retransmission strategy. The protocol requires synchronization among…
Notice of Violation of IEEE Publication Principles: Reinforcement learning for P2P searching
2005
For a peer-to-peer (P2P) system holding a massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple reinforcement learni…
IMRR and IMPR Routing Protocols For Inter and Intra Wireless Mesh Communications
2015
Given the evolution of wireless technologies, Wireless Mesh Networks (WMN) have appeared as an emerging low-cost solution to ensure last-mile connectivity to the Internet network. However, providing real-time and streaming applications, such as VoIP (Voice over IP) and VoD (Video on Demand), with a satisfying QoS level is considered as an important challenge within these networks. In this paper, we propose a QoS based routing protocol, called Hybrid QoS Mesh Routing (HQMR), jointly with a clustering algorithm to improve the scalability of mesh networks. HQMR is composed of two routing sub- protocols: a reactive QoS based routing protocol for intra-mesh infrastructure communications and a pr…
SUBOPTIMAL-OPTIMAL ROUTING FOR LAN INTERNETWORKING USING TRANSPARENT BRIDGES
1998
The current standard transparent bridge protocol IEEE-802.1D is based on the Spanning Tree (ST) algorithm. It has a very important restriction: it cannot work when the topology has active loops. Therefore, a tree is the only possible interconnection topology that can be used. The ST algorithm guarantees that the active topology is a tree discarding lines that form loops. However, because of this, network bandwidth cannot be fully utilized. Moreover, trees have a very serious bottleneck near the root. This paper proposes a new transparent bridge protocol for LAN interconnection that allows active loops. Therefore, strongly connected regular topologies like tori, hypercubes, meshes, etc., as…
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
2008
In this paper we present an algorithm called STPA (shortest time path algorithm) which aims at providing a comparison tool for the evaluation of a bound for mobile ad hoc networks (MANETs) routing protocols performance. STPA provides an exhaustive evaluation of an ideal routing protocol. Based on the current position and state of the nodes it can determine factors like: how many complete messages get to the destination, which is the smallest amount of time required by a packet to get to the destination, which path followed each packet, and so on. This values would allow a protocol designer to improve or fine tune his proposal. We demonstrate that the complexity of the algorithm is O(sigma2)…