Arvind Sankar, Age 4720 River Ct, Jersey City, NJ 07310

Arvind Sankar Phones & Addresses

20 River Ct, Jersey City, NJ 07310 (201) 653-4793

Newton, MA

156 School St, Somerville, MA 02143 (617) 776-5083

West Somerville, MA

Boston, MA

Cambridge, MA

20 River Ct APT 3404, Jersey City, NJ 07310 (201) 653-4793

Show more

Social networks

Arvind Sankar

Linkedin

Work

Company: Goldman sachs Dec 2004 to Nov 2018 Position: Strategist

Education

Degree: Doctorates, Doctor of Philosophy School / High School: Massachusetts Institute of Technology 1998 to 2004 Specialities: Applied Mathematics, Philosophy

Skills

Valuation • Financial Modeling • Fixed Income • Derivatives • Hedge Funds • Trading Systems • Commodity Markets • Mathematics

Industries

Investment Banking

Mentions for Arvind Sankar

Arvind Sankar resumes & CV records

Resumes

Arvind Sankar Photo 23

Arvind Sankar

Location:
Jersey City, NJ
Industry:
Investment Banking
Work:
Goldman Sachs Dec 2004 - Nov 2018
Strategist
Education:
Massachusetts Institute of Technology 1998 - 2004
Doctorates, Doctor of Philosophy, Applied Mathematics, Philosophy
Indian Institute of Technology, Bombay 1994 - 1998
Bachelors, Bachelor of Technology, Computer Science, Engineering, Computer Science and Engineering
Skills:
Valuation, Financial Modeling, Fixed Income, Derivatives, Hedge Funds, Trading Systems, Commodity Markets, Mathematics

Publications & IP owners

Us Patents

Maximum Lifetime Routing In Wireless Ad-Hoc Networks

US Patent:
2006020, Sep 14, 2006
Filed:
Dec 20, 2002
Appl. No.:
10/537590
Inventors:
Zhen Liu - Tarrytown NY, US
Arvind Sankar - Jersey City NJ, US
International Classification:
G06F 9/44
G06F 15/173
G06F 9/45
US Classification:
717104000, 709238000, 717144000
Abstract:
Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect of the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existing between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.

NOTICE: You may not use PeopleBackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. PeopleBackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.