• Login
    View Item 
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Electronic Systems Engineering (ESE)
    • View Item
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Electronic Systems Engineering (ESE)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Wireless Sensor Networks : Bit Transport Maximization and Delay Efficient Function Computation

    View/Open
    G25680.pdf (1.260Mb)
    Date
    2018-04-02
    Author
    Shukla, Samta
    Metadata
    Show full item record
    Abstract
    We consider a wireless sensor network, in which end users are interested in maximizing the useful information supplied by the network till network partition due to inevitable node deaths. Neither throughput maximization nor network lifetime maximization achieves the objective: A network with high throughput provides information at a high rate, but can exhaust the nodes of their energies quickly; similarly, a network can achieve a long lifetime by remaining idle for most of the time. We propose and seek to maximize a new metric: “Aggregate bit transported before network partition” (a product of throughput and lifetime), which precisely captures the usefulness of sensor networks. We model the links in the wireless sensor network as wired links with reduced equivalent capacities, formulate and solve the problem of maximizing bits transported before network partition on arbitrary networks. To assess the benefits that network coding can yield for the same objective, we study a scenario where the coding-capable nodes are placed on a regular grid. We propose an optimal algorithm to choose the minimum number of coding points in the grid to ensure energy efficiency. Our results show that, even with simple XOR coding, the bits transported can increase up to 83 % of that without coding. Further, we study the problem of in-network data aggregation in a wireless sensor network to achieve minimum delay. The nodes in the network compute and forward data as per a query graph, which allows operations belonging to a general class of functions. We aim to extract the best sub-network that achieves the minimum delay. We design an algorithm to schedule the sub-network such that the computed data reaches sink at the earliest. We consider directed acyclic query graphs as opposed to the existing work which considers tree query graphs only.
    URI
    https://etd.iisc.ac.in/handle/2005/3314
    Collections
    • Electronic Systems Engineering (ESE) [166]

    Related items

    Showing items related by title, author, creator and subject.

    • Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks 

      Naveen, K P (2018-04-11)
      Advances in wireless communication and microelectronics have led to the development of low-power compact sensor nodes (popularly called motes) that are capable of sensing, computing, and communication. A large number of ...
    • Energy Harvesting Wireless Sensor Networks : Performance Evaluation And Trade-offs 

      Rao, Shilpa Dinkar (2017-09-23)
      Wireless sensor networks(WSNs) have a diverse set of applications such as military surveillance, health and environmental monitoring, and home automation. Sensor nodes are equipped with pre-charged batteries, which drain ...
    • Optimum Event Detection In Wireless Sensor Networks 

      Karumbu, Premkumar (2013-06-12)
      We investigate sequential event detection problems arising in Wireless Sensor Networks (WSNs). A number of battery–powered sensor nodes of the same sensing modality are deployed in a region of interest(ROI). By an event ...

    etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
    Contact Us | Send Feedback | Thesis Templates
    Theme by 
    Atmire NV
     

     

    Browse

    All of etd@IIScCommunities & CollectionsTitlesAuthorsAdvisorsSubjectsBy Thesis Submission DateThis CollectionTitlesAuthorsAdvisorsSubjectsBy Thesis Submission Date

    My Account

    LoginRegister

    etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
    Contact Us | Send Feedback | Thesis Templates
    Theme by 
    Atmire NV