On modeling geometric joint sink mobility with delay-tolerant cluster-less Wireless Sensor Networks

In recent study Moving Sink (MS) in Wireless Sensor Networks (WSNs) appears as a blessing. Because it collects data directly from the nodes and the concept of relay nodes is obsolete in this scheme. There are few challenges to be taken care of, like data delay tolerance and trajectory of MS which is NP-hard. In our proposed scheme, we divide the square field in small squares. Middle point of the partitioned area is the sojourn location of the sink, and nodes around MS are in it transmission range, they send directly the sensed data in a delay-tolerant fashion. Simultaneously two sinks are moving one is inside and having four sojourn locations and other is outer trajectory and have twelve sojourn locations. Introducing joint mobility is enhancing the network life and ultimately throughput. As the MS comes under the NP-hard problem here we convert it into a geometric problem and define it as, Geometric Sink Movement (GSM). Also there is set of linear programming equations supporting the model, and prolonging network life time.