Sah, Dinesh KumarCengiz, KorhanDonta, Praveen KumarInukollu, Venkata N.Amgoth, Tarachand2024-06-122024-06-1220210140-36641873-703Xhttps://doi.org/10.1016/j.comcom.2021.08.017https://hdl.handle.net/20.500.14551/20342In wireless sensor networks (WSNs), simulation practices, system models, algorithms, and protocols have been published worldwide based on the assumption of randomness. The applied statistics used for randomness in WSNs are broad, e.g., random deployment, activity tracking, packet generation, etc. Even though authors' adequate formal and informal information and pledge validation of the proposal became challenging, the minuscule information alteration in implementation and validation can reflect the enormous effect on eventual results. In this proposal, we show how the results are affected by the generalized assumption made on randomness. In sensor node deployment, ambiguity arises due to node error-value (epsilon), and its upper bound in the relative position is estimated to understand the delicacy of diminutives changes. Besides, the effect of uniformity in the traffic and participation of scheduling position of nodes is also generalized. We propose an algorithm to generate the unified dataset for the general and some specific applications system models in WSNs. The results produced by our algorithm reflect the pseudo-randomness and can efficiently regenerate through seed value for validation.en10.1016/j.comcom.2021.08.017info:eu-repo/semantics/openAccessDataset GenerationRandom DeploymentWireless Sensor NetworkClusteringTraffic DataSteiner TreeAlgorithmProtocolMacArticle1804856Q1WOS:0007040543000042-s2.0-85114999931Q1