Network-Coded Broadcast Incremental Power Algorithm for Energy-Efficient Broadcasting in Wireless Ad-Hoc Network Sauradyuti Coondu, Anasua Mitra, Samiran Chattopadhyay, Matangini Chattopadhyay * , Munmun Bhattacharya Department of Information Technology * School of Education Technology Jadavpur University Kolkata, India Email: {sauradyuti, anasuamitra2005, samirancju, matanginic, munmunds}@gmail.com Abstract—An important operation in multi-hop wireless ad- hoc networks is broadcasting, which propagates information throughout the network. We are interested to explore the issue of broadcasting, where all nodes of the network are sources that want to transmit information to all other nodes, in an ad-hoc wireless network. Our performance metric is energy efficiency, a vital defining factor for wireless networks as it directly concerns the battery life and thus network longevity. We show the benefits network coding has to offer in a wireless ad-hoc network as far as energy-savings is concerned, compared to the store-and-forward strategy. Network coded broadcasting concentrates on reducing the number of transmissions performed by each forwarding node in the all-to-all broadcast application, where each forwarding node combines the incoming messages for transmission. The total number of transmissions can be reduced using network coding, compared to broadcasting using the same forwarding nodes without coding. In this paper, we present the performance of a network coding-based Broadcast Incremental Power (BIP) algorithm for all-to-all broadcast. Simulation results show that optimisation using network coding method lead to substantial improvement in the cost associated with BIP. Keywords—Broadcast Incremental Power, Energy-Efficiency, Minimum Power Broadcast Problem, Network Coding, Wireless Ad- Hoc Network, Wireless Multicast Advantage I. I NTRODUCTION The new breakthroughs in micro-mechano-electrical sys- tems, digital technology and wireless communications have led to the advent of wireless ad-hoc networks. A popular operation in wireless ad-hoc networks, is to send one data from an iden- tified source node to all other nodes. This operation is widely known as broadcasting, and is useful in various contexts, i.e., routing processes, network configuration processes, network topology discovery processes, and so on [1]. One of the most important issues in the wireless ad-hoc networks is energy efficiency, because in many application scenarios, nodes in wireless ad-hoc networks operate on battery power and sometimes it is quite difficult or even impossible to replace/recharge the batteries, when large number of wireless nodes are located in averse or remote limited-energy environ- ments. The main source of energy consumption in wireless ad-hoc networks is radio, which is usually comprised of three parts, i.e., transmission power, reception power and idle power, and the idle power is insignificant compared to the other two [2]. Since in broadcast operation, all the nodes in the network must receive messages, therefore, the reception power is also not considered for determining energy consumption. That leaves us with only the transmission power as the energy cost. It is very energy-consuming to transmit a signal to a longer range because of the non-linear attenuation properties of radio signals. Long distance transmissions also result in widespread interference across the network and hence they should be avoided. A. Wireless Multicast Advantage The issues discussed above can be seen as correlated, and they can be handled together by taking advantage of the so-called wireless multicast advantage property [3]. This property is based on the observation that, in wireless networks, devices are usually equipped with omnidirectional antennae, and for this reason multiple nodes can be reached by a single transmission, without the sender suffering from additional energy costs. B. Minimum Power Broadcast (MPB) Problem Given a network with an identified source node, the min- imum power broadcst (MPB) problem is to allocate trans- mission powers to the nodes such that the total power con- sumed is minimized and the network is connected [4]. The MPB problem in wireless ad-hoc networks has been proved to be NP-complete in [5], implying that polynomial time algorithms are not known to exist. An important issue in wireless ad-hoc networks is to provide an energy-efficient solution to the MPB problem given that wireless nodes have limited energy budget. In the case that transmission power is similar for nodes in the network, the minimum-power broadcast problem is transformed to the problem of finding a spanning tree with a minimized number of intermediate nodes. Generally, a broadcast tree can be described as the source node being the tree root and the intermediate nodes shall relay and retransmit the message to their children after reception. C. Broadcast Incremental Power In numerous works, the minimum power broadcast problem is transformed to the problem of finding a spanning tree. One noteworthy paper in this regard was proposed by Wieselthier   