Searcharxiv⌕ Search

arXiv subjects

Yatindra Nath Singh

Publications and source records attributed to Yatindra Nath Singh.

38 records · Page 3Linked to original sources

Nonlinear spread of rumor and inoculation strategies in the nodes with degree dependent tie strength in complex networks

In earlier rumor spreading models, at each time step nodes contact all of their neighbors. In more realistic scenario it is possible that a node may contact only some of its neighbors to spread the rumor. Therefore it is must in real world complex networks, the classic rumor spreading model need to be modified to consider the dependence of rumor spread rate on the degree of the spreader and the informed nodes. We have given a modified rumor spreading model to accommodate these facts. This new model, has been studied for rumor spreading in complex networks in this work. Nonlinear rumor spread exponent $α$ and degree dependent tie strength exponent $β$ in any complex network gives rumor threshold as some finite value. In the present work, the modified rumor spreading model has been studied in scale free networks. It is also found that if $ α$ and $ β$ parameters are tuned to appropriate value, the rumor threshold becomes independent of network size. In any social network, rumors can spread may have undesirable effect. One of the possible solutions to control rumor spread, is to inoculate a certain fraction of nodes against rumors. The inoculation can be done randomly or in a targeted fashion. We have used modified rumor spreading model over scale free networks to investigate the efficacy of inoculation. Random and targeted inoculation schemes have been applied. It has been observed that rumor threshold in random inoculation scheme is greater than the rumor threshold in the model without any inoculation scheme. But random inoculation is not that much effective. The rumor threshold in targeted inoculation is very high than the rumor threshold in the random inoculation in suppressing the rumor.

cs.SI↗

Optimizing Channel Access for Event-Driven Wireless Sensor Networks: Analysis and Enhancements

We study the problem of medium access control in domain of event-driven wireless sensor networks (WSNs). In this kind of WSN, sensor nodes send data to sink node only when an event occurs in the monitoring area. The nodes in this kind of WSNs encounter correlated traffic as a subset of nodes start sending data by sensing a common event simultaneously. We wish to rethink of medium access control (MAC) for this type of traffic characteristics. For WSNs, many existing MAC protocols utilize the basic CSMA/CA strategy such as IEEE 802.11 Binary Exponential Backoff (BEB) algorithm to handle the collisions among packets when more than one node need to access the channel. We show that this BEB algorithm does not work well without incurring access delay or performance degradation due to increased number of collisions and retransmissions when nodes encounter correlated traffic. Based on above observations in mind, We present a Adaptive Random Backoff (ARB) algorithm that is capable of mitigating the impact of correlated traffic and capable of minimizing the chance of collisions. ARB is based on minor modifications of BEB. We show using numerical analysis that our proposals improve the channel access in terms of latency, throughput, and frame dropping probability as compared with IEEE 802.11 DCF. Simulations using NS-2 network simulator are conducted to validate the analytical results.

cs.NI↗