In this paper we consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected and the total power consumption is minimized. The problem, which in the literature is referred to as the minimum-power symmetric connectivity problem, can be used to implement the broadcasting structure with minimum power consump...

Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristics for constructing minimum power trees in wireless networks have been proposed by Wieselthier et al [1] and Stojmenovic et al [2]. In this paper, we present an Ant Colony Syste...

In this project, we investigate the performance of routing protocols employed for data transmission using real life protocols like “TCP/IP” in wireless adhoc networks. We come up with simple metrics to measure the efficiency of routing protocols. We study the behavior of TCP on multiple wireless hops and suggest design guidelines for increasing the “overall efficiency” of a routing protocol. We...

To improve the localization precision of nodes in Wireless sensor network (WSN), this paper analyses the source of the localization error in the least square localization algorithm (LSL), and it can be concluded that the minimum cumulative relative distance error of the benchmark anchor node directly influence the localization precision. Based on the analyses, this paper proposes an improved le...

In distributed computing systems, if an elected leader node fails, the other nodes of the system need to elect another leader. The bully algorithm is a classical approach for electing a leader in a synchronous distributed computing system. This paper presents an enhancement of the bully algorithm, requiring less time complexity and minimum message passing. This significant gain has been achieve...

The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...

This note extends the results of Frank, Jordán, and Szigeti [1] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p. It is shown that the mini...