The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For energy constrained wireless sensor networks, lifetime is a critical issue. Several medium access control protocols have been proposed to address this issue, often at the cost of poor network capacity. To address both capacity and energy issues, we propose a novel medium sharing protocol for Wireless Sensor Networks named Cascading Tournament (CT-MAC). CT-MAC is a synchronous, localized, dynamic,...
This paper quantifies the impact of topological characteristics on the performance of single radio multichannel IEEE 802.11 mesh networks. Topological characteristics are the number of nodes per subnetwork, the hop count, the neighbor node density, the hidden nodes, the number of nodes in the neighborhood of the gateway, and the hidden nodes in the neighborhood of the gateway. Network performance...
Industrial wireless sensor network design requires efficient channel usages and timeslot assignment. In this paper, we describe an integrated channel-timeslot allocation algorithm based on a routing-tree coloring scheme. According to a strict routing-tree definition and corresponding resource allocation principles, the algorithm performs in two phases. In the first phase, a traditional mesh sensor...
Advances in sensing and wireless communication technologies have enabled a wide spectrum of Outdoor Wireless Sensor Network (OWSN) applications. Some applications require the existence of a communication backbone federating different OWSN sectors, in order to collaborate in achieving more sophisticated missions. Federating (connecting) these sectors is an intricate task due to the huge distances between...
The ad hoc network is composed of multiple sensor nodes to serve various applications, such as data collection or environmental monitoring. In many applications, the sensor nodes near the boundary of the deployment region provide biased or low-quality information because they have limited number of neighboring nodes and only partial information is available. Hence, the boundary recognition is an important...
Network Coding is a recent technique that has many advantages such as reducing the bandwidth consumption and increasing the throughput. IROCX [1] is a routing algorithm that applies Network Coding while considering the interference impact. However, it assumes a constant transmission power. We extend IROCX by allowing the nodes to transmit with several power levels. Our approach, TC-IROCX (Topology...
Vehicular networks are expected to enable vehicles on the road to exchange safety information; enhancing traffic flow and minimizing accidents. With vehicle positions being the most frequently exchanged information in vehicular networks, it becomes imperative to establish a strong level of trust in the announced positions before a vehicle initiates a response. This paper proposes a position verification...
The performance of a wireless local area network depends on the channel assignments among neighboring access points (APs). The limited number of non-overlapping channels may lead to severe interference scenarios if no appropriated spectrum planning is employed. Additionally, in dense urban areas it is usual to find wireless networks scenarios with interfering APs belonging to different administrative...
Without the assumption of contemporaneous end to end connectivity in challenged wireless networks, Delay Tolerant Networking (DTN) routing is an important research area. The contribution in this paper is to take advantage of the proposed DTN geographic replication to overcome the limitation of topology based utility replication, since message replication is prevented due to the local maximum problem...
Underwater acoustic channel imposes many challenges into underwater networks communication, such as high bit error, temporary losses of connectivity due to shadow zones, limited bandwidth capacity and communication signal spreading over large areas. Opportunistic routing is a new routing paradigm that allows more than one node to forward a packet by taking advantage of the broadcast medium and overhearing...
Route and service discovery in wireless multi-hop networks applies flooding or gossip routing to disseminate and gather information. Since packets may get lost, retransmissions of lost packets are required. In many protocols the retransmission timeout is fixed in the protocol specification. In this paper we demonstrate that optimization of the timeout is required in order to ensure proper functioning...
This paper proposes cooperative opportunistic routing (COR), a throughput improvement scheme for the cooperative opportunistic routing in multi-hop wireless mesh networks (WMNs). We investigate the two major issues in opportunistic routing, the selection and the prioritization metric for the candidate set. The COR is presented to select and prioritize the candidate node with minimum expected cost...
Body Area Networks (BANs), targeting everywhere anytime health monitoring, operate in license-exempt frequency bands. They require a cross layer design that jointly considers the requirements of (1) access delay to the medium and (2) packet delivery ratio (PDR). In this paper, we experimentally evaluate the PDR of a BAN under static and dynamic scheduling schemes. Investigations show that static multi-hop...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.