This paper deals with simulation of the broadcast authentication protocols using Colored Petri Nets and further optimizations in Matlab environment. Typical application of broadcast authentication protocols can be configurations where only one transmitter with multiple recipients exists (such as message exchange in sensor networks routing protocols, or the leader election process in sensors net...

There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters persistent storage communicate nodes that lack continuous end-to...

We consider the benefits of coding in wireless networks, specifically its role in exploiting the local broadcast property of the wireless medium. We first argue that for unicast, the throughput achievedwith network coding is the same as that achievedwithout any coding. This argument highlights the role of a general max-flow min-cut duality and is more explicit than previous proofs. The maximum ...

A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solutions provided by the ad hoc routing protocols range from flooding the entire network with route requests, to deploying a separate location management scheme to maintain a device location database. Many applications a...

Link estimation is a basic element of routing in low-power wireless networks, and several approaches using broadcast beacons and/or unicast MAC feedback have been proposed in the past years. Nonetheless, there has been no systematic study on the inherent drawbacks of beacon-based link estimation and the subtleties of data-driven link estimation. Using a testbed of 98 XSM motes (an enhanced vers...

We present and analyze a reactive location service (RLS) for mobile ad hoc networks. RLS provides a mobile node in a wireless ad-hoc network with the means to inquire the current geographical position of another node on-demand and can be used as a building block for location-based routing. We provide a comparison of RLS to an ideal omniscient location service as well as to the complex Grid Loca...

There have been many advances in the area of routing in wireless mesh networks and a multitude of routing algorithms have been proposed. In the recent past, a class of routing protocols called multipath routing has gained favour amongst researchers. As opposed to uni path routing where one single path is used to send data from a source to a destination, in multipath routing, multiple paths are ...

We examine the sensitivity of optimal routing policies in ad hoc wireless networks with respect to estimation errors in channel quality. We consider an ad hoc wireless network where the wireless links from each node to its neighbors are modeled by a probability distribution describing the local broadcast nature of wireless transmissions. These probability distributions are estimated in real-tim...

Abstract. The chapter introduces the applications of linear programming to optimization problems of energy efficiency in wireless ad hoc networks. According to the nature of applications, we classify them into four major categories: energy efficiency routing problems, broadcast/multicast routing problems, data extraction and gathering problems and QoS topology control problems. We focus on how ...

Broadcast has been widely used in mobile ad hoc networks (MANETs) as a communication means to disseminate information to all reachable nodes. However, the conventional broadcast scheme that broadcast packets omni directionally suffers from several drawbacks: excessive amount of redundant traffic, exaggerated interference/contention among neighboring nodes, and limited coverage (as a result of c...