Motivated by the benefits of small world networks, we propose a self-organization framework for wireless ad hoc networks. We investigate the use of directional beamforming for creating long-range short cuts between nodes. Using simulation results for randomized beamforming as a guideline, we identify crucial design issues for algorithm design. Our results… (More)
—In an autonomous wireless sensor network, self-organization of the nodes is essential to achieve network wide characteristics. We believe that connectivity in wireless autonomous networks can be increased and overall average path length can be reduced by using beamforming and bio-inspired algorithms. Recent works on the use of beamforming in wireless… (More)
—It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics. Studies have shown that Small World properties, primarily low average path length and high clustering coefficient, are desired properties for networks in general. However, due to the spatial nature of… (More)
— We study how long range directional beams can be used for self-organization of a wireless network to exhibit small world properties. Using simulation results for randomized beamforming as a guideline, we identify crucial design issues for algorithm design. Subsequently, we propose an algorithm for deterministic creation of small worlds. We define a new… (More)
Mobility causes network structures to change. In P SN s where underlying network structure is changing rapidly, we are interested in studying how information dissemination can be enhanced in a sparse disconnected network where nodes lack the global knowledge about the network. We use beamforming to study the enhancement in the information dissemination… (More)
—In communication network based on device to device interactions, dissemination of the information has lately picked up lot of interest. In this paper we would like to propose a mechanism for studying and enhancing the dissemination of information as in the use case proposed for the future device to device communication protocol. We use the concept of… (More)
Today's ever-growing networks call for routing schemes with sound theoretical scalability guarantees. In this context, a routing scheme is scalable if the amount of memory needed to implement it grows significantly slower than the network size. Unfortunately, theoretical scalability characterizations only exist for shortest path routing, but for general… (More)
We present polynomial time algorithms that maximize the aggregate throughput in single-source multicast networks that employ random network coding and are subject to Byzantine attacks. Our results are applicable to wireline and wireless networks, assume no restrictions on size of min-cut from the source to the receivers and are provably optimal.