The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up a...
Sensor nodes report the sensed data packets to the sink and depending on the application these packets may have diverse attributes: time-critical (TC) and non time-critical (NTC). ...
Md. Abdur Razzaque, Muhammad Mahbub Alam, Md. Mamu...
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...