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...
— Wireless sensor networks (WSNs) usually have a regular lattice structure and can be considered as multi-hop multi-route networks. In multi-route transmissions, even if the link...
Tadahiro Wada, Kouji Ohuchi, Abbas Jamalipour, Hir...
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...
Manish Kochhal, Loren Schwiebert, Sandeep K. S. Gu...
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...