Azade Nazi, Saravanan Thirumuruganathan, Vagelis Hristidis, Nan Zhang, Gautam Das
An online community network such as Twitter, Yelp or amazon.com links entities (e.g., Users, products) with various relationships (e.g., Friendship, co-purchase, co-review) and make such information available for access through a web interface. Often, these community networks act as "social sensors" in which users sense information in the real world and mention them online. The web interfaces of these networks often support features such as keyword search that allow an user to quickly find entities of interest. While these interfaces are adequate for regular users, they are often too restrictive to answer complex queries such as (1) find 100 Twitter users from California with at least 100 followers who talked about earthquakes last year or (2) find 25 restaurants in Yelp with at least 10 5-star reviews with 10 or more 'useful' points. In this paper, we investigate the problem of answering complex queries that involve non-searchable attributes through the web interface of an online community network. We model such a network as a heterogeneous graph with two access channels, Content Search and Local Search. We propose a number of efficient algorithms that leverage properties of the heterogeneous graph and also propose a strategy selection algorithm based on the concept of multi-armed bandits. We conduct comprehensive experiments over popular social sensing websites such as Twitter and amazon.com which demonstrate the efficacy of our proposed algorithms.
{"title":"Querying Hidden Attributes in an Online Community Network","authors":"Azade Nazi, Saravanan Thirumuruganathan, Vagelis Hristidis, Nan Zhang, Gautam Das","doi":"10.1109/MASS.2015.74","DOIUrl":"https://doi.org/10.1109/MASS.2015.74","url":null,"abstract":"An online community network such as Twitter, Yelp or amazon.com links entities (e.g., Users, products) with various relationships (e.g., Friendship, co-purchase, co-review) and make such information available for access through a web interface. Often, these community networks act as \"social sensors\" in which users sense information in the real world and mention them online. The web interfaces of these networks often support features such as keyword search that allow an user to quickly find entities of interest. While these interfaces are adequate for regular users, they are often too restrictive to answer complex queries such as (1) find 100 Twitter users from California with at least 100 followers who talked about earthquakes last year or (2) find 25 restaurants in Yelp with at least 10 5-star reviews with 10 or more 'useful' points. In this paper, we investigate the problem of answering complex queries that involve non-searchable attributes through the web interface of an online community network. We model such a network as a heterogeneous graph with two access channels, Content Search and Local Search. We propose a number of efficient algorithms that leverage properties of the heterogeneous graph and also propose a strategy selection algorithm based on the concept of multi-armed bandits. We conduct comprehensive experiments over popular social sensing websites such as Twitter and amazon.com which demonstrate the efficacy of our proposed algorithms.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131065591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory. Since finding the optimal solution for minimum vertex cover problem is NP-complete and the well-known approximation algorithms do not perform well with under crowd-sensing scenario, we propose the notions of node observability and coverage utility score and design a new context-aware approximation algorithm to find vertex cover that is tailored for crowd-sensing task. In addition, we design human-centric bootstrapping strategies to make initial assignment of sensing devices in the physical crowd based on social information about the users (e.g., Interests, friendship). Our experiments on real-world data traces show that the proposed approach significantly outperforms the baseline approximation algorithms in terms of sensing coverage.
{"title":"Context-Aware Crowd-Sensing in Opportunistic Mobile Social Networks","authors":"Phuong Nguyen, K. Nahrstedt","doi":"10.1109/MASS.2015.80","DOIUrl":"https://doi.org/10.1109/MASS.2015.80","url":null,"abstract":"In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory. Since finding the optimal solution for minimum vertex cover problem is NP-complete and the well-known approximation algorithms do not perform well with under crowd-sensing scenario, we propose the notions of node observability and coverage utility score and design a new context-aware approximation algorithm to find vertex cover that is tailored for crowd-sensing task. In addition, we design human-centric bootstrapping strategies to make initial assignment of sensing devices in the physical crowd based on social information about the users (e.g., Interests, friendship). Our experiments on real-world data traces show that the proposed approach significantly outperforms the baseline approximation algorithms in terms of sensing coverage.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114414901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lei Deng, Ying Zhang, Minghua Chen, Zongpeng Li, Jack Y. B. Lee, Y. Zhang, Lingyang Song
Small-cell architecture is widely adopted by cellular network operators to increase network capacity. By reducing the size of cells, operators can pack more (low-power) base stations in an area to better serve the growing demands, without causing extra interference. However, this approach suffers from low spectrum temporal efficiency. When a cell becomes smaller and covers fewer users, its total traffic fluctuates significantly due to insufficient traffic aggregation and exhibiting a large "peak to-mean" ratio. As operators customarily provision spectrum for peak traffic, large traffic temporal fluctuation inevitably leads to low spectrum temporal efficiency. In this work, we first carryout a case-study based on real-world 3G data traffic traces and confirm that 90% of the cells in a metropolitan district are less than 40% utilized. Our study also reveals that peak traffic of adjacent cells are highly asynchronous. Motivated by these observations, we advocate device-to-device (D2D) load-balancing as a useful mechanism to address the fundamental drawback of small-cell architecture. The idea is to shift traffic from a congested cell to its adjacent under-utilized cells by leveraging inter-cell D2D communication, so that the traffic can be served without using extra spectrum, effectively improving the spectrum temporal efficiency. We provide theoretical modeling and analysis to characterize the benefit of D2D load balancing, in terms of sum peak traffic reduction of individual cells. We also derive the corresponding cost, in terms of incurred D2D traffic overhead. We carry out empirical evaluations based on real-world 3G data traces to gauge the benefit and cost of D2D load balancing under practical settings. The results show that D2D load balancing can reduce the sum peak traffic of individual cells by 35% as compared to the standard scenario without D2D load balancing, at the expense of 45% D2D traffic overhead.
{"title":"Device-to-Device Load Balancing for Cellular Networks","authors":"Lei Deng, Ying Zhang, Minghua Chen, Zongpeng Li, Jack Y. B. Lee, Y. Zhang, Lingyang Song","doi":"10.1109/MASS.2015.25","DOIUrl":"https://doi.org/10.1109/MASS.2015.25","url":null,"abstract":"Small-cell architecture is widely adopted by cellular network operators to increase network capacity. By reducing the size of cells, operators can pack more (low-power) base stations in an area to better serve the growing demands, without causing extra interference. However, this approach suffers from low spectrum temporal efficiency. When a cell becomes smaller and covers fewer users, its total traffic fluctuates significantly due to insufficient traffic aggregation and exhibiting a large \"peak to-mean\" ratio. As operators customarily provision spectrum for peak traffic, large traffic temporal fluctuation inevitably leads to low spectrum temporal efficiency. In this work, we first carryout a case-study based on real-world 3G data traffic traces and confirm that 90% of the cells in a metropolitan district are less than 40% utilized. Our study also reveals that peak traffic of adjacent cells are highly asynchronous. Motivated by these observations, we advocate device-to-device (D2D) load-balancing as a useful mechanism to address the fundamental drawback of small-cell architecture. The idea is to shift traffic from a congested cell to its adjacent under-utilized cells by leveraging inter-cell D2D communication, so that the traffic can be served without using extra spectrum, effectively improving the spectrum temporal efficiency. We provide theoretical modeling and analysis to characterize the benefit of D2D load balancing, in terms of sum peak traffic reduction of individual cells. We also derive the corresponding cost, in terms of incurred D2D traffic overhead. We carry out empirical evaluations based on real-world 3G data traces to gauge the benefit and cost of D2D load balancing under practical settings. The results show that D2D load balancing can reduce the sum peak traffic of individual cells by 35% as compared to the standard scenario without D2D load balancing, at the expense of 45% D2D traffic overhead.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131838335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Police departments and other law enforcement agencies have integrated a greater number of video cameras into their daily routines. This has introduced with it the problem of moving and processing vast amounts of video data. In this work, we take a look at some of the associated problems and our own attempts to address them. We first analyze the physical network and infrastructure at Temple University's main campus to determine the limitations we will meet in the real world. We investigate and implement a simple technique to transfer data across multiple wireless networks. Finally we look at different techniques of limiting the video we will transfer in the network switches to ensure that a video we want to prioritize reaches its intended destination in real time.
{"title":"WeSeeYou: Adapting Video Streaming for Surveillance Applications","authors":"J. Lloret, Robyn McCue, Jie Wu","doi":"10.1109/MASS.2015.65","DOIUrl":"https://doi.org/10.1109/MASS.2015.65","url":null,"abstract":"Police departments and other law enforcement agencies have integrated a greater number of video cameras into their daily routines. This has introduced with it the problem of moving and processing vast amounts of video data. In this work, we take a look at some of the associated problems and our own attempts to address them. We first analyze the physical network and infrastructure at Temple University's main campus to determine the limitations we will meet in the real world. We investigate and implement a simple technique to transfer data across multiple wireless networks. Finally we look at different techniques of limiting the video we will transfer in the network switches to ensure that a video we want to prioritize reaches its intended destination in real time.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129333700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The purpose of this study is to determine if it is possible to use LIDAR (light detection and ranging) point cloud data collected using a FARO Focus3D laser scanner to: 1) generate a high quality 3D virtual representation of a scanned tree and reduce noise due to environmental variability, 2) develop an algorithm to differentiate between different sections of trees based on RGB values associated with these point clouds and calculate the respective volumes of these sections, and 3) project leaf color change dynamics over time. The visualization tools used are Matlab and R. Additional analysis was done with a high performance computing cluster (Clemson University's Palmetto cluster). The data is of an American Sycamore Platanus occidentalis over a period of eight weeks as the tree transitions from fall into winter. The conclusions of this study have implications in outlining innovative approaches to three-dimensional tree dynamic measurement using advanced technology and tools. These approaches can provide the baseline information of a forest structure for greater understanding of how a tree changes seasonally, as well as the establishment of methodology for making laser scanning software and Matlab's Image Processing Toolbox more flexible to use. The visualization aids in this study can inform and be used to estimate with greater precision the effects that disturbances, such as fires and hurricanes, have on forest structures.
{"title":"Colorful Math: Developing Algorithmic Methodology to Visualize and Analyze the Dynamics of a Deciduous Tree","authors":"Shayne T. O'Brien, B. Song, B. Williams, S. Bao","doi":"10.1109/MASS.2015.64","DOIUrl":"https://doi.org/10.1109/MASS.2015.64","url":null,"abstract":"The purpose of this study is to determine if it is possible to use LIDAR (light detection and ranging) point cloud data collected using a FARO Focus3D laser scanner to: 1) generate a high quality 3D virtual representation of a scanned tree and reduce noise due to environmental variability, 2) develop an algorithm to differentiate between different sections of trees based on RGB values associated with these point clouds and calculate the respective volumes of these sections, and 3) project leaf color change dynamics over time. The visualization tools used are Matlab and R. Additional analysis was done with a high performance computing cluster (Clemson University's Palmetto cluster). The data is of an American Sycamore Platanus occidentalis over a period of eight weeks as the tree transitions from fall into winter. The conclusions of this study have implications in outlining innovative approaches to three-dimensional tree dynamic measurement using advanced technology and tools. These approaches can provide the baseline information of a forest structure for greater understanding of how a tree changes seasonally, as well as the establishment of methodology for making laser scanning software and Matlab's Image Processing Toolbox more flexible to use. The visualization aids in this study can inform and be used to estimate with greater precision the effects that disturbances, such as fires and hurricanes, have on forest structures.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"341 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116551092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Combating interference is an important yet challenging issue for multiuser communications especially in the harsh underwater acoustic environment. In this paper, a novel Angle-Of-Departure (AOD)-based technique is proposed, which accounts for the inherent position uncertainty of underwater propeller-driven Autonomous Underwater Vehicles (AUVs) or buoyancy-driven gliders. A new probabilistic Space Division Multiple Access (SDMA) technique is studied using confidence interval estimation, and an effective approach to manage interference statistically is discussed. Also, an optimization problem is proposed to mitigate multiuser interference while keeping the transmitter antennae beam width at a desirable value so to find a trade off among (i) spreading the beam towards the receiver to combat position uncertainty, (ii) focusing such beam to minimize dispersion, and (iii) minimizing interference to other vehicles in the surrounding. Solutions and algorithms are proposed to overcome the multiuser interference via a hybrid SDMA-Time Division Multiple Access (TDMA) method. Simulation results show that the solution mitigates statistical interference, lessens packet retransmission rate, and obtains Signal-to-Interference-plus-Noise Ratio (SINR) gain and rate efficiency over conventional TDMA and SDMA methods.
{"title":"Interference Cancellation in Multiuser Acoustic Underwater Networks Using Probabilistic SDMA","authors":"M. Rahmati, D. Pompili","doi":"10.1109/MASS.2015.101","DOIUrl":"https://doi.org/10.1109/MASS.2015.101","url":null,"abstract":"Combating interference is an important yet challenging issue for multiuser communications especially in the harsh underwater acoustic environment. In this paper, a novel Angle-Of-Departure (AOD)-based technique is proposed, which accounts for the inherent position uncertainty of underwater propeller-driven Autonomous Underwater Vehicles (AUVs) or buoyancy-driven gliders. A new probabilistic Space Division Multiple Access (SDMA) technique is studied using confidence interval estimation, and an effective approach to manage interference statistically is discussed. Also, an optimization problem is proposed to mitigate multiuser interference while keeping the transmitter antennae beam width at a desirable value so to find a trade off among (i) spreading the beam towards the receiver to combat position uncertainty, (ii) focusing such beam to minimize dispersion, and (iii) minimizing interference to other vehicles in the surrounding. Solutions and algorithms are proposed to overcome the multiuser interference via a hybrid SDMA-Time Division Multiple Access (TDMA) method. Simulation results show that the solution mitigates statistical interference, lessens packet retransmission rate, and obtains Signal-to-Interference-plus-Noise Ratio (SINR) gain and rate efficiency over conventional TDMA and SDMA methods.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126074163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fractional Frequency Reuse (FFR) and Coordinated Multi Point (CoMP) processing are two of the conventional methods to mitigate the Inter-Cell Interference (ICI) and to improve the average Signal-to-Interference-plus-Noise Ratio (SINR). However, FFR is associated with low system spectral efficiency and CoMP does not take any action to mitigate the inter-cluster interference. In the context of Cloud Radio Access Network (C-RAN) -- a new centralized paradigm for broadband wireless access that addresses efficiently the fluctuation in capacity demand through real-time Virtual Base Station (VBS) cooperation in the Cloud -- in this paper an innovative uplink solution, called Cloud-CFFR, is proposed to address the aforementioned problems. With respect to both FFR and CoMP, Cloud-CFFR decreases the complexity, delay, and ICI while increasing the system spectral efficiency. Since the system performance in cell-edge regions relies on the cooperation of different VBSs, there is no service interruption in handling handovers, moreover, in order to address the unanticipated change in capacity demand, Cloud-CFFR dynamically changes the sub-band boundaries based on the number of active users in the clusters. Simulation results confirm the validity of our analysis and show the benefits of this novel uplink solution.
{"title":"Cloud-CFFR: Coordinated Fractional Frequency Reuse in Cloud Radio Access Network (C-RAN)","authors":"Abolfazl Hajisami, D. Pompili","doi":"10.1109/MASS.2015.70","DOIUrl":"https://doi.org/10.1109/MASS.2015.70","url":null,"abstract":"Fractional Frequency Reuse (FFR) and Coordinated Multi Point (CoMP) processing are two of the conventional methods to mitigate the Inter-Cell Interference (ICI) and to improve the average Signal-to-Interference-plus-Noise Ratio (SINR). However, FFR is associated with low system spectral efficiency and CoMP does not take any action to mitigate the inter-cluster interference. In the context of Cloud Radio Access Network (C-RAN) -- a new centralized paradigm for broadband wireless access that addresses efficiently the fluctuation in capacity demand through real-time Virtual Base Station (VBS) cooperation in the Cloud -- in this paper an innovative uplink solution, called Cloud-CFFR, is proposed to address the aforementioned problems. With respect to both FFR and CoMP, Cloud-CFFR decreases the complexity, delay, and ICI while increasing the system spectral efficiency. Since the system performance in cell-edge regions relies on the cooperation of different VBSs, there is no service interruption in handling handovers, moreover, in order to address the unanticipated change in capacity demand, Cloud-CFFR dynamically changes the sub-band boundaries based on the number of active users in the clusters. Simulation results confirm the validity of our analysis and show the benefits of this novel uplink solution.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125071099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless sensor networks (WSNs) is an area of research that has been getting a lot of attention lately. This is due to the rapid advancements in the design of wireless devices which have increasingly more processing, storage, memory, and networking capabilities. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care, and other fields. In order to monitor certain types of infrastructures, many of these applications involve lining up the sensors in a linear form, making a special class of these networks which are defined in this work as Linear Sensor Networks (LSNs). In a previous paper, we introduced the concept of LSNs along with a classification of the different types of LSNs, a sample of their applications and the motivation for designing specialized protocols that take advantage of the linearity of the network to enhance their communication efficiency, reliability, fault tolerance, energy savings, and network lifetime. This paper presents a graph-search-based topology discovery algorithm for LSNs. New definitions for important structure and design parameters are introduced. The proposed protocol allows the nodes to identify some nodes to be included in a backbone, which can be used by the other nodes to send data to the sink at the end of the LSN or LSN segment. This backbone discovery increases the efficiency, and robustness of the network. It also allows for significant improvement in the scalability of the communication process in the LSN which can contain a very large number of nodes (e.g. Hundreds or thousands). In addition, the linearity of the structure and the discovered backbone can enhance the routing reliability by "jumping" over failed nodes by increasing the range. Furthermore, the protocol does not require the nodes to have location detection capabilities such as GPS, which would lead to a more complex design and higher cost of the sensor nodes.
{"title":"An Efficient Graph Search Algorithm for Backbone Discovery in Wireless Linear Sensor Networks","authors":"I. Jawhar, Jie Wu, N. Mohamed, S. Zhang","doi":"10.1109/MASS.2015.104","DOIUrl":"https://doi.org/10.1109/MASS.2015.104","url":null,"abstract":"Wireless sensor networks (WSNs) is an area of research that has been getting a lot of attention lately. This is due to the rapid advancements in the design of wireless devices which have increasingly more processing, storage, memory, and networking capabilities. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care, and other fields. In order to monitor certain types of infrastructures, many of these applications involve lining up the sensors in a linear form, making a special class of these networks which are defined in this work as Linear Sensor Networks (LSNs). In a previous paper, we introduced the concept of LSNs along with a classification of the different types of LSNs, a sample of their applications and the motivation for designing specialized protocols that take advantage of the linearity of the network to enhance their communication efficiency, reliability, fault tolerance, energy savings, and network lifetime. This paper presents a graph-search-based topology discovery algorithm for LSNs. New definitions for important structure and design parameters are introduced. The proposed protocol allows the nodes to identify some nodes to be included in a backbone, which can be used by the other nodes to send data to the sink at the end of the LSN or LSN segment. This backbone discovery increases the efficiency, and robustness of the network. It also allows for significant improvement in the scalability of the communication process in the LSN which can contain a very large number of nodes (e.g. Hundreds or thousands). In addition, the linearity of the structure and the discovered backbone can enhance the routing reliability by \"jumping\" over failed nodes by increasing the range. Furthermore, the protocol does not require the nodes to have location detection capabilities such as GPS, which would lead to a more complex design and higher cost of the sensor nodes.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125075324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Jalaeian, Yi Shi, Xu Yuan, Yiwei Thomas Hou, W. Lou, S. Midkiff
Recent advances in MIMO degree-of-freedom (DoF)models allow us to study MIMO in a multi-hop network environment. On the other hand, successive interference cancellation (SIC) is a powerful physical layer technique used in multi-user detection. Based on the strengths and weaknesses of MIMO DoF and SIC, we propose a marriage between these two techniques so that DoF-based interference cancellation (IC) and SIC can help each other as follows: (i) SIC is exploited to decode multiple received signals to conserve DoF resources in IC, and (ii) DoFIC resolves the potential SINR barrier that SIC may encounter. In this paper, we develop the necessary mathematical models to realize the two ideas in a multi-hop wireless network. Together with scheduling and routing constraints, we develop a cross-layer optimization framework with joint DoF IC and SIC. By applying the framework on a throughput maximization problem, we find that SIC and DoF IC can indeed offer significant performance improvement by addressing each other's limitation.
{"title":"Harmonizing SIC and MIMO DoF Interference Cancellation for Efficient Network-Wide Resource Allocation","authors":"B. Jalaeian, Yi Shi, Xu Yuan, Yiwei Thomas Hou, W. Lou, S. Midkiff","doi":"10.1109/MASS.2015.95","DOIUrl":"https://doi.org/10.1109/MASS.2015.95","url":null,"abstract":"Recent advances in MIMO degree-of-freedom (DoF)models allow us to study MIMO in a multi-hop network environment. On the other hand, successive interference cancellation (SIC) is a powerful physical layer technique used in multi-user detection. Based on the strengths and weaknesses of MIMO DoF and SIC, we propose a marriage between these two techniques so that DoF-based interference cancellation (IC) and SIC can help each other as follows: (i) SIC is exploited to decode multiple received signals to conserve DoF resources in IC, and (ii) DoFIC resolves the potential SINR barrier that SIC may encounter. In this paper, we develop the necessary mathematical models to realize the two ideas in a multi-hop wireless network. Together with scheduling and routing constraints, we develop a cross-layer optimization framework with joint DoF IC and SIC. By applying the framework on a throughput maximization problem, we find that SIC and DoF IC can indeed offer significant performance improvement by addressing each other's limitation.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130403757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Junji Takemasa, Y. Koizumi, T. Hasegawa, I. Psaras
In-network caching in information centric networking (ICN) is considered as a promising approach to reducing energy consumption of an entire network. However, it is also considered as an energy consuming technique. These contradictory claims lead to one research question: Does caching really reduce the energy consumption of the entire network? To answer the question, we formulate an ICN network as an optimization problem with a realistic energy consumption model for an ICN router. By solving the formulation assuming that ICN forwarding software currently under development is used as a forwarding engine of an ICN router, we reveal that in-network caching alone does not reduce much energy but it enhances a currently developed green networking technique even though the forwarding engine is not fully optimized.
{"title":"On Energy Reduction and Green Networking Enhancement Due to In-Network Caching","authors":"Junji Takemasa, Y. Koizumi, T. Hasegawa, I. Psaras","doi":"10.1109/MASS.2015.55","DOIUrl":"https://doi.org/10.1109/MASS.2015.55","url":null,"abstract":"In-network caching in information centric networking (ICN) is considered as a promising approach to reducing energy consumption of an entire network. However, it is also considered as an energy consuming technique. These contradictory claims lead to one research question: Does caching really reduce the energy consumption of the entire network? To answer the question, we formulate an ICN network as an optimization problem with a realistic energy consumption model for an ICN router. By solving the formulation assuming that ICN forwarding software currently under development is used as a forwarding engine of an ICN router, we reveal that in-network caching alone does not reduce much energy but it enhances a currently developed green networking technique even though the forwarding engine is not fully optimized.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：