相关论文: Randomized Initialization of a Wireless Multihop N…

The number of contending neighbors of a node in a multihop ad hoc network has to be adjusted while analyzing the performance of the network such as computing the end-to-end delays along a path from a given source to a destination. In this…

We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…

We consider distributed average consensus in a wireless network with partial communication to reduce the number of transmissions in every iteration/round. Considering the broadcast nature of wireless channels, we propose a probabilistic…

Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem.…

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited…

In IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention…

In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…

In time-varying wireless networks, the states of the communication channels are subject to random variations, and hence need to be estimated for efficient rate adaptation and scheduling. The estimation mechanism possesses inaccuracies that…

Network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking…

A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configuration, the positions of the nodes may be computed uniquely in…

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

We consider leader election in anonymous radio networks modeled as simple undirected connected graphs. Nodes communicate in synchronous rounds. Nodes are anonymous and execute the same deterministic algorithm, so symmetry can be broken only…

In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for…

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

We address the joint problem of learning and scheduling in multi-hop wireless network without a prior knowledge on link rates. Previous scheduling algorithms need the link rate information, and learning algorithms often require a…

We study the problem of efficiently broadcasting packets in multi-hop wireless networks. At each time slot the network controller activates a set of non-interfering links and forwards selected copies of packets on each activated link. A…

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes…

Ad-hoc networks, a promising trend in wireless technology, fail to work properly in a global setting. In most cases, self-organization and cost-free local communication cannot compensate the need for being connected, gathering urgent…

In this paper, we present two randomized distributed algorithms in wireless ad hoc networks. We consider that the network is structured into pairs of nodes (sender, receiver) in a decay space. We take into account the following: Each node…